From: "Darrick J. Wong" <darrick.wong@oracle.com> To: david@fromorbit.com, darrick.wong@oracle.com Cc: linux-fsdevel@vger.kernel.org, vishal.l.verma@intel.com, xfs@oss.sgi.com Subject: [PATCH 014/119] xfs: introduce interval queries on btrees Date: Thu, 16 Jun 2016 18:19:21 -0700 [thread overview] Message-ID: <146612636170.12839.675596870201079078.stgit@birch.djwong.org> (raw) In-Reply-To: <146612627129.12839.3827886950949809165.stgit@birch.djwong.org> Create a function to enable querying of btree records mapping to a range of keys. This will be used in subsequent patches to allow querying the reverse mapping btree to find the extents mapped to a range of physical blocks, though the generic code can be used for any range query. v2: add some shortcuts so that we can jump out of processing once we know there won't be any more records to find. Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> --- fs/xfs/libxfs/xfs_btree.c | 249 +++++++++++++++++++++++++++++++++++++++++++++ fs/xfs/libxfs/xfs_btree.h | 22 +++- fs/xfs/xfs_trace.h | 1 3 files changed, 267 insertions(+), 5 deletions(-) diff --git a/fs/xfs/libxfs/xfs_btree.c b/fs/xfs/libxfs/xfs_btree.c index afcafd6..5f5cf23 100644 --- a/fs/xfs/libxfs/xfs_btree.c +++ b/fs/xfs/libxfs/xfs_btree.c @@ -4509,3 +4509,252 @@ xfs_btree_calc_size( } return rval; } + +/* Query a regular btree for all records overlapping a given interval. */ +STATIC int +xfs_btree_simple_query_range( + struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, + union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, + void *priv) +{ + union xfs_btree_rec *recp; + union xfs_btree_rec rec; + union xfs_btree_key low_key; + union xfs_btree_key high_key; + union xfs_btree_key rec_key; + __int64_t diff; + int stat; + bool firstrec = true; + int error; + + ASSERT(cur->bc_ops->init_high_key_from_rec); + + /* Find the keys of both ends of the interval. */ + cur->bc_rec = *high_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&high_key, &rec); + + cur->bc_rec = *low_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&low_key, &rec); + + /* Find the leftmost record. */ + stat = 0; + error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, &stat); + if (error) + goto out; + + while (stat) { + /* Find the record. */ + error = xfs_btree_get_rec(cur, &recp, &stat); + if (error || !stat) + break; + + /* Can we tell if this record is too low? */ + if (firstrec) { + cur->bc_rec = *low_rec; + cur->bc_ops->init_high_key_from_rec(&rec_key, recp); + diff = cur->bc_ops->key_diff(cur, &rec_key); + if (diff < 0) + goto advloop; + } + firstrec = false; + + /* Have we gone past the end? */ + cur->bc_rec = *high_rec; + cur->bc_ops->init_key_from_rec(&rec_key, recp); + diff = cur->bc_ops->key_diff(cur, &rec_key); + if (diff > 0) + break; + + /* Callback */ + error = fn(cur, recp, priv); + if (error < 0 || error == XFS_BTREE_QUERY_RANGE_ABORT) + break; + +advloop: + /* Move on to the next record. */ + error = xfs_btree_increment(cur, 0, &stat); + if (error) + break; + } + +out: + return error; +} + +/* + * Query an overlapped interval btree for all records overlapping a given + * interval. + */ +STATIC int +xfs_btree_overlapped_query_range( + struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, + union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, + void *priv) +{ + union xfs_btree_ptr ptr; + union xfs_btree_ptr *pp; + union xfs_btree_key rec_key; + union xfs_btree_key low_key; + union xfs_btree_key high_key; + union xfs_btree_key *lkp; + union xfs_btree_key *hkp; + union xfs_btree_rec rec; + union xfs_btree_rec *recp; + struct xfs_btree_block *block; + __int64_t ldiff; + __int64_t hdiff; + int level; + struct xfs_buf *bp; + int i; + int error; + + /* Find the keys of both ends of the interval. */ + cur->bc_rec = *high_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&high_key, &rec); + + cur->bc_rec = *low_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&low_key, &rec); + + /* Load the root of the btree. */ + level = cur->bc_nlevels - 1; + cur->bc_ops->init_ptr_from_cur(cur, &ptr); + error = xfs_btree_lookup_get_block(cur, level, &ptr, &block); + if (error) + return error; + xfs_btree_get_block(cur, level, &bp); + trace_xfs_btree_overlapped_query_range(cur, level, bp); +#ifdef DEBUG + error = xfs_btree_check_block(cur, block, level, bp); + if (error) + goto out; +#endif + cur->bc_ptrs[level] = 1; + + while (level < cur->bc_nlevels) { + block = XFS_BUF_TO_BLOCK(cur->bc_bufs[level]); + + if (level == 0) { + /* End of leaf, pop back towards the root. */ + if (cur->bc_ptrs[level] > + be16_to_cpu(block->bb_numrecs)) { +leaf_pop_up: + if (level < cur->bc_nlevels - 1) + cur->bc_ptrs[level + 1]++; + level++; + continue; + } + + recp = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block); + + cur->bc_ops->init_high_key_from_rec(&rec_key, recp); + ldiff = cur->bc_ops->diff_two_keys(cur, &low_key, + &rec_key); + + cur->bc_ops->init_key_from_rec(&rec_key, recp); + hdiff = cur->bc_ops->diff_two_keys(cur, &rec_key, + &high_key); + + /* If the record matches, callback */ + if (ldiff >= 0 && hdiff >= 0) { + error = fn(cur, recp, priv); + if (error < 0 || + error == XFS_BTREE_QUERY_RANGE_ABORT) + break; + } else if (hdiff < 0) { + /* Record is larger than high key; pop. */ + goto leaf_pop_up; + } + cur->bc_ptrs[level]++; + continue; + } + + /* End of node, pop back towards the root. */ + if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) { +node_pop_up: + if (level < cur->bc_nlevels - 1) + cur->bc_ptrs[level + 1]++; + level++; + continue; + } + + lkp = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block); + hkp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block); + pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block); + + ldiff = cur->bc_ops->diff_two_keys(cur, &low_key, hkp); + hdiff = cur->bc_ops->diff_two_keys(cur, lkp, &high_key); + + /* If the key matches, drill another level deeper. */ + if (ldiff >= 0 && hdiff >= 0) { + level--; + error = xfs_btree_lookup_get_block(cur, level, pp, + &block); + if (error) + goto out; + xfs_btree_get_block(cur, level, &bp); + trace_xfs_btree_overlapped_query_range(cur, level, bp); +#ifdef DEBUG + error = xfs_btree_check_block(cur, block, level, bp); + if (error) + goto out; +#endif + cur->bc_ptrs[level] = 1; + continue; + } else if (hdiff < 0) { + /* The low key is larger than the upper range; pop. */ + goto node_pop_up; + } + cur->bc_ptrs[level]++; + } + +out: + /* + * If we don't end this function with the cursor pointing at a record + * block, a subsequent non-error cursor deletion will not release + * node-level buffers, causing a buffer leak. This is quite possible + * with a zero-results range query, so release the buffers if we + * failed to return any results. + */ + if (cur->bc_bufs[0] == NULL) { + for (i = 0; i < cur->bc_nlevels; i++) { + if (cur->bc_bufs[i]) { + xfs_trans_brelse(cur->bc_tp, cur->bc_bufs[i]); + cur->bc_bufs[i] = NULL; + cur->bc_ptrs[i] = 0; + cur->bc_ra[i] = 0; + } + } + } + + return error; +} + +/* + * Query a btree for all records overlapping a given interval of keys. The + * supplied function will be called with each record found; return one of the + * XFS_BTREE_QUERY_RANGE_{CONTINUE,ABORT} values or the usual negative error + * code. This function returns XFS_BTREE_QUERY_RANGE_ABORT, zero, or a + * negative error code. + */ +int +xfs_btree_query_range( + struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, + union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, + void *priv) +{ + if (!(cur->bc_ops->flags & XFS_BTREE_OPS_OVERLAPPING)) + return xfs_btree_simple_query_range(cur, low_rec, + high_rec, fn, priv); + return xfs_btree_overlapped_query_range(cur, low_rec, high_rec, + fn, priv); +} diff --git a/fs/xfs/libxfs/xfs_btree.h b/fs/xfs/libxfs/xfs_btree.h index a5ec6c7..898fee5 100644 --- a/fs/xfs/libxfs/xfs_btree.h +++ b/fs/xfs/libxfs/xfs_btree.h @@ -206,6 +206,12 @@ struct xfs_btree_ops { #define LASTREC_DELREC 2 +union xfs_btree_irec { + xfs_alloc_rec_incore_t a; + xfs_bmbt_irec_t b; + xfs_inobt_rec_incore_t i; +}; + /* * Btree cursor structure. * This collects all information needed by the btree code in one place. @@ -216,11 +222,7 @@ typedef struct xfs_btree_cur struct xfs_mount *bc_mp; /* file system mount struct */ const struct xfs_btree_ops *bc_ops; uint bc_flags; /* btree features - below */ - union { - xfs_alloc_rec_incore_t a; - xfs_bmbt_irec_t b; - xfs_inobt_rec_incore_t i; - } bc_rec; /* current insert/search record value */ + union xfs_btree_irec bc_rec; /* current insert/search record value */ struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ __uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ @@ -494,4 +496,14 @@ xfs_extlen_t xfs_btree_calc_size(struct xfs_mount *mp, uint *limits, uint xfs_btree_compute_maxlevels(struct xfs_mount *mp, uint *limits, unsigned long len); +/* return codes */ +#define XFS_BTREE_QUERY_RANGE_CONTINUE 0 /* keep iterating */ +#define XFS_BTREE_QUERY_RANGE_ABORT 1 /* stop iterating */ +typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, + union xfs_btree_rec *rec, void *priv); + +int xfs_btree_query_range(struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, void *priv); + #endif /* __XFS_BTREE_H__ */ diff --git a/fs/xfs/xfs_trace.h b/fs/xfs/xfs_trace.h index ffea28c..f0ac9c9 100644 --- a/fs/xfs/xfs_trace.h +++ b/fs/xfs/xfs_trace.h @@ -2218,6 +2218,7 @@ DEFINE_EVENT(xfs_btree_cur_class, name, \ TP_PROTO(struct xfs_btree_cur *cur, int level, struct xfs_buf *bp), \ TP_ARGS(cur, level, bp)) DEFINE_BTREE_CUR_EVENT(xfs_btree_updkeys); +DEFINE_BTREE_CUR_EVENT(xfs_btree_overlapped_query_range); #endif /* _TRACE_XFS_H */
WARNING: multiple messages have this Message-ID (diff)
From: "Darrick J. Wong" <darrick.wong@oracle.com> To: david@fromorbit.com, darrick.wong@oracle.com Cc: linux-fsdevel@vger.kernel.org, vishal.l.verma@intel.com, xfs@oss.sgi.com Subject: [PATCH 014/119] xfs: introduce interval queries on btrees Date: Thu, 16 Jun 2016 18:19:21 -0700 [thread overview] Message-ID: <146612636170.12839.675596870201079078.stgit@birch.djwong.org> (raw) In-Reply-To: <146612627129.12839.3827886950949809165.stgit@birch.djwong.org> Create a function to enable querying of btree records mapping to a range of keys. This will be used in subsequent patches to allow querying the reverse mapping btree to find the extents mapped to a range of physical blocks, though the generic code can be used for any range query. v2: add some shortcuts so that we can jump out of processing once we know there won't be any more records to find. Signed-off-by: Darrick J. Wong <darrick.wong@oracle.com> --- fs/xfs/libxfs/xfs_btree.c | 249 +++++++++++++++++++++++++++++++++++++++++++++ fs/xfs/libxfs/xfs_btree.h | 22 +++- fs/xfs/xfs_trace.h | 1 3 files changed, 267 insertions(+), 5 deletions(-) diff --git a/fs/xfs/libxfs/xfs_btree.c b/fs/xfs/libxfs/xfs_btree.c index afcafd6..5f5cf23 100644 --- a/fs/xfs/libxfs/xfs_btree.c +++ b/fs/xfs/libxfs/xfs_btree.c @@ -4509,3 +4509,252 @@ xfs_btree_calc_size( } return rval; } + +/* Query a regular btree for all records overlapping a given interval. */ +STATIC int +xfs_btree_simple_query_range( + struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, + union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, + void *priv) +{ + union xfs_btree_rec *recp; + union xfs_btree_rec rec; + union xfs_btree_key low_key; + union xfs_btree_key high_key; + union xfs_btree_key rec_key; + __int64_t diff; + int stat; + bool firstrec = true; + int error; + + ASSERT(cur->bc_ops->init_high_key_from_rec); + + /* Find the keys of both ends of the interval. */ + cur->bc_rec = *high_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&high_key, &rec); + + cur->bc_rec = *low_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&low_key, &rec); + + /* Find the leftmost record. */ + stat = 0; + error = xfs_btree_lookup(cur, XFS_LOOKUP_LE, &stat); + if (error) + goto out; + + while (stat) { + /* Find the record. */ + error = xfs_btree_get_rec(cur, &recp, &stat); + if (error || !stat) + break; + + /* Can we tell if this record is too low? */ + if (firstrec) { + cur->bc_rec = *low_rec; + cur->bc_ops->init_high_key_from_rec(&rec_key, recp); + diff = cur->bc_ops->key_diff(cur, &rec_key); + if (diff < 0) + goto advloop; + } + firstrec = false; + + /* Have we gone past the end? */ + cur->bc_rec = *high_rec; + cur->bc_ops->init_key_from_rec(&rec_key, recp); + diff = cur->bc_ops->key_diff(cur, &rec_key); + if (diff > 0) + break; + + /* Callback */ + error = fn(cur, recp, priv); + if (error < 0 || error == XFS_BTREE_QUERY_RANGE_ABORT) + break; + +advloop: + /* Move on to the next record. */ + error = xfs_btree_increment(cur, 0, &stat); + if (error) + break; + } + +out: + return error; +} + +/* + * Query an overlapped interval btree for all records overlapping a given + * interval. + */ +STATIC int +xfs_btree_overlapped_query_range( + struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, + union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, + void *priv) +{ + union xfs_btree_ptr ptr; + union xfs_btree_ptr *pp; + union xfs_btree_key rec_key; + union xfs_btree_key low_key; + union xfs_btree_key high_key; + union xfs_btree_key *lkp; + union xfs_btree_key *hkp; + union xfs_btree_rec rec; + union xfs_btree_rec *recp; + struct xfs_btree_block *block; + __int64_t ldiff; + __int64_t hdiff; + int level; + struct xfs_buf *bp; + int i; + int error; + + /* Find the keys of both ends of the interval. */ + cur->bc_rec = *high_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&high_key, &rec); + + cur->bc_rec = *low_rec; + cur->bc_ops->init_rec_from_cur(cur, &rec); + cur->bc_ops->init_key_from_rec(&low_key, &rec); + + /* Load the root of the btree. */ + level = cur->bc_nlevels - 1; + cur->bc_ops->init_ptr_from_cur(cur, &ptr); + error = xfs_btree_lookup_get_block(cur, level, &ptr, &block); + if (error) + return error; + xfs_btree_get_block(cur, level, &bp); + trace_xfs_btree_overlapped_query_range(cur, level, bp); +#ifdef DEBUG + error = xfs_btree_check_block(cur, block, level, bp); + if (error) + goto out; +#endif + cur->bc_ptrs[level] = 1; + + while (level < cur->bc_nlevels) { + block = XFS_BUF_TO_BLOCK(cur->bc_bufs[level]); + + if (level == 0) { + /* End of leaf, pop back towards the root. */ + if (cur->bc_ptrs[level] > + be16_to_cpu(block->bb_numrecs)) { +leaf_pop_up: + if (level < cur->bc_nlevels - 1) + cur->bc_ptrs[level + 1]++; + level++; + continue; + } + + recp = xfs_btree_rec_addr(cur, cur->bc_ptrs[0], block); + + cur->bc_ops->init_high_key_from_rec(&rec_key, recp); + ldiff = cur->bc_ops->diff_two_keys(cur, &low_key, + &rec_key); + + cur->bc_ops->init_key_from_rec(&rec_key, recp); + hdiff = cur->bc_ops->diff_two_keys(cur, &rec_key, + &high_key); + + /* If the record matches, callback */ + if (ldiff >= 0 && hdiff >= 0) { + error = fn(cur, recp, priv); + if (error < 0 || + error == XFS_BTREE_QUERY_RANGE_ABORT) + break; + } else if (hdiff < 0) { + /* Record is larger than high key; pop. */ + goto leaf_pop_up; + } + cur->bc_ptrs[level]++; + continue; + } + + /* End of node, pop back towards the root. */ + if (cur->bc_ptrs[level] > be16_to_cpu(block->bb_numrecs)) { +node_pop_up: + if (level < cur->bc_nlevels - 1) + cur->bc_ptrs[level + 1]++; + level++; + continue; + } + + lkp = xfs_btree_key_addr(cur, cur->bc_ptrs[level], block); + hkp = xfs_btree_high_key_addr(cur, cur->bc_ptrs[level], block); + pp = xfs_btree_ptr_addr(cur, cur->bc_ptrs[level], block); + + ldiff = cur->bc_ops->diff_two_keys(cur, &low_key, hkp); + hdiff = cur->bc_ops->diff_two_keys(cur, lkp, &high_key); + + /* If the key matches, drill another level deeper. */ + if (ldiff >= 0 && hdiff >= 0) { + level--; + error = xfs_btree_lookup_get_block(cur, level, pp, + &block); + if (error) + goto out; + xfs_btree_get_block(cur, level, &bp); + trace_xfs_btree_overlapped_query_range(cur, level, bp); +#ifdef DEBUG + error = xfs_btree_check_block(cur, block, level, bp); + if (error) + goto out; +#endif + cur->bc_ptrs[level] = 1; + continue; + } else if (hdiff < 0) { + /* The low key is larger than the upper range; pop. */ + goto node_pop_up; + } + cur->bc_ptrs[level]++; + } + +out: + /* + * If we don't end this function with the cursor pointing at a record + * block, a subsequent non-error cursor deletion will not release + * node-level buffers, causing a buffer leak. This is quite possible + * with a zero-results range query, so release the buffers if we + * failed to return any results. + */ + if (cur->bc_bufs[0] == NULL) { + for (i = 0; i < cur->bc_nlevels; i++) { + if (cur->bc_bufs[i]) { + xfs_trans_brelse(cur->bc_tp, cur->bc_bufs[i]); + cur->bc_bufs[i] = NULL; + cur->bc_ptrs[i] = 0; + cur->bc_ra[i] = 0; + } + } + } + + return error; +} + +/* + * Query a btree for all records overlapping a given interval of keys. The + * supplied function will be called with each record found; return one of the + * XFS_BTREE_QUERY_RANGE_{CONTINUE,ABORT} values or the usual negative error + * code. This function returns XFS_BTREE_QUERY_RANGE_ABORT, zero, or a + * negative error code. + */ +int +xfs_btree_query_range( + struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, + union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, + void *priv) +{ + if (!(cur->bc_ops->flags & XFS_BTREE_OPS_OVERLAPPING)) + return xfs_btree_simple_query_range(cur, low_rec, + high_rec, fn, priv); + return xfs_btree_overlapped_query_range(cur, low_rec, high_rec, + fn, priv); +} diff --git a/fs/xfs/libxfs/xfs_btree.h b/fs/xfs/libxfs/xfs_btree.h index a5ec6c7..898fee5 100644 --- a/fs/xfs/libxfs/xfs_btree.h +++ b/fs/xfs/libxfs/xfs_btree.h @@ -206,6 +206,12 @@ struct xfs_btree_ops { #define LASTREC_DELREC 2 +union xfs_btree_irec { + xfs_alloc_rec_incore_t a; + xfs_bmbt_irec_t b; + xfs_inobt_rec_incore_t i; +}; + /* * Btree cursor structure. * This collects all information needed by the btree code in one place. @@ -216,11 +222,7 @@ typedef struct xfs_btree_cur struct xfs_mount *bc_mp; /* file system mount struct */ const struct xfs_btree_ops *bc_ops; uint bc_flags; /* btree features - below */ - union { - xfs_alloc_rec_incore_t a; - xfs_bmbt_irec_t b; - xfs_inobt_rec_incore_t i; - } bc_rec; /* current insert/search record value */ + union xfs_btree_irec bc_rec; /* current insert/search record value */ struct xfs_buf *bc_bufs[XFS_BTREE_MAXLEVELS]; /* buf ptr per level */ int bc_ptrs[XFS_BTREE_MAXLEVELS]; /* key/record # */ __uint8_t bc_ra[XFS_BTREE_MAXLEVELS]; /* readahead bits */ @@ -494,4 +496,14 @@ xfs_extlen_t xfs_btree_calc_size(struct xfs_mount *mp, uint *limits, uint xfs_btree_compute_maxlevels(struct xfs_mount *mp, uint *limits, unsigned long len); +/* return codes */ +#define XFS_BTREE_QUERY_RANGE_CONTINUE 0 /* keep iterating */ +#define XFS_BTREE_QUERY_RANGE_ABORT 1 /* stop iterating */ +typedef int (*xfs_btree_query_range_fn)(struct xfs_btree_cur *cur, + union xfs_btree_rec *rec, void *priv); + +int xfs_btree_query_range(struct xfs_btree_cur *cur, + union xfs_btree_irec *low_rec, union xfs_btree_irec *high_rec, + xfs_btree_query_range_fn fn, void *priv); + #endif /* __XFS_BTREE_H__ */ diff --git a/fs/xfs/xfs_trace.h b/fs/xfs/xfs_trace.h index ffea28c..f0ac9c9 100644 --- a/fs/xfs/xfs_trace.h +++ b/fs/xfs/xfs_trace.h @@ -2218,6 +2218,7 @@ DEFINE_EVENT(xfs_btree_cur_class, name, \ TP_PROTO(struct xfs_btree_cur *cur, int level, struct xfs_buf *bp), \ TP_ARGS(cur, level, bp)) DEFINE_BTREE_CUR_EVENT(xfs_btree_updkeys); +DEFINE_BTREE_CUR_EVENT(xfs_btree_overlapped_query_range); #endif /* _TRACE_XFS_H */ _______________________________________________ xfs mailing list xfs@oss.sgi.com http://oss.sgi.com/mailman/listinfo/xfs
next prev parent reply other threads:[~2016-06-17 1:19 UTC|newest] Thread overview: 472+ messages / expand[flat|nested] mbox.gz Atom feed top 2016-06-17 1:17 [PATCH v6 000/119] xfs: add reverse mapping, reflink, dedupe, and online scrub support Darrick J. Wong 2016-06-17 1:17 ` Darrick J. Wong 2016-06-17 1:17 ` [PATCH 001/119] vfs: fix return type of ioctl_file_dedupe_range Darrick J. Wong 2016-06-17 1:17 ` Darrick J. Wong 2016-06-17 11:32 ` Christoph Hellwig 2016-06-17 11:32 ` Christoph Hellwig 2016-06-28 19:19 ` Darrick J. Wong 2016-06-28 19:19 ` Darrick J. Wong 2016-06-17 1:18 ` [PATCH 002/119] vfs: support FS_XFLAG_REFLINK and FS_XFLAG_COWEXTSIZE Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:41 ` Christoph Hellwig 2016-06-17 11:41 ` Christoph Hellwig 2016-06-17 12:16 ` Brian Foster 2016-06-17 12:16 ` Brian Foster 2016-06-17 15:06 ` Christoph Hellwig 2016-06-17 15:06 ` Christoph Hellwig 2016-06-17 16:54 ` Darrick J. Wong 2016-06-17 16:54 ` Darrick J. Wong 2016-06-17 17:38 ` Brian Foster 2016-06-17 17:38 ` Brian Foster 2016-06-17 1:18 ` [PATCH 003/119] xfs: check offsets of variable length structures Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:33 ` Christoph Hellwig 2016-06-17 11:33 ` Christoph Hellwig 2016-06-17 17:34 ` Brian Foster 2016-06-17 17:34 ` Brian Foster 2016-06-18 18:01 ` Darrick J. Wong 2016-06-18 18:01 ` Darrick J. Wong 2016-06-20 12:38 ` Brian Foster 2016-06-20 12:38 ` Brian Foster 2016-06-17 1:18 ` [PATCH 004/119] xfs: enable buffer deadlock postmortem diagnosis via ftrace Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:34 ` Christoph Hellwig 2016-06-17 11:34 ` Christoph Hellwig 2016-06-21 0:47 ` Dave Chinner 2016-06-21 0:47 ` Dave Chinner 2016-06-17 1:18 ` [PATCH 005/119] xfs: check for a valid error_tag in errortag_add Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:34 ` Christoph Hellwig 2016-06-17 11:34 ` Christoph Hellwig 2016-06-17 1:18 ` [PATCH 006/119] xfs: port differences from xfsprogs libxfs Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 15:06 ` Christoph Hellwig 2016-06-20 0:21 ` Dave Chinner 2016-06-20 0:21 ` Dave Chinner 2016-07-13 23:39 ` Darrick J. Wong 2016-07-13 23:39 ` Darrick J. Wong 2016-06-17 1:18 ` [PATCH 007/119] xfs: rearrange xfs_bmap_add_free parameters Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:39 ` Christoph Hellwig 2016-06-17 11:39 ` Christoph Hellwig 2016-06-17 1:18 ` [PATCH 008/119] xfs: separate freelist fixing into a separate helper Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:52 ` Christoph Hellwig 2016-06-17 11:52 ` Christoph Hellwig 2016-06-21 0:48 ` Dave Chinner 2016-06-21 0:48 ` Dave Chinner 2016-06-21 1:40 ` Dave Chinner 2016-06-21 1:40 ` Dave Chinner 2016-06-17 1:18 ` [PATCH 009/119] xfs: convert list of extents to free into a regular list Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-17 11:59 ` Christoph Hellwig 2016-06-17 11:59 ` Christoph Hellwig 2016-06-18 20:15 ` Darrick J. Wong 2016-06-18 20:15 ` Darrick J. Wong 2016-06-21 0:57 ` Dave Chinner 2016-06-21 0:57 ` Dave Chinner 2016-07-18 3:30 ` Eric Sandeen 2016-06-17 1:18 ` [PATCH 010/119] xfs: create a standard btree size calculator code Darrick J. Wong 2016-06-17 1:18 ` Darrick J. Wong 2016-06-20 14:31 ` Brian Foster 2016-06-20 14:31 ` Brian Foster 2016-06-20 19:34 ` Darrick J. Wong 2016-06-20 19:34 ` Darrick J. Wong 2016-06-17 1:19 ` [PATCH 011/119] xfs: refactor btree maxlevels computation Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-20 14:31 ` Brian Foster 2016-06-20 14:31 ` Brian Foster 2016-06-20 18:23 ` Darrick J. Wong 2016-06-20 18:23 ` Darrick J. Wong 2016-06-17 1:19 ` [PATCH 012/119] xfs: during btree split, save new block key & ptr for future insertion Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-21 13:00 ` Brian Foster 2016-06-21 13:00 ` Brian Foster 2016-06-27 22:30 ` Darrick J. Wong 2016-06-27 22:30 ` Darrick J. Wong 2016-06-28 12:31 ` Brian Foster 2016-06-28 12:31 ` Brian Foster 2016-06-17 1:19 ` [PATCH 013/119] xfs: support btrees with overlapping intervals for keys Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-22 15:17 ` Brian Foster 2016-06-22 15:17 ` Brian Foster 2016-06-28 3:26 ` Darrick J. Wong 2016-06-28 3:26 ` Darrick J. Wong 2016-06-28 12:32 ` Brian Foster 2016-06-28 12:32 ` Brian Foster 2016-06-28 17:36 ` Darrick J. Wong 2016-06-28 17:36 ` Darrick J. Wong 2016-07-06 4:59 ` Dave Chinner 2016-07-06 4:59 ` Dave Chinner 2016-07-06 8:09 ` Darrick J. Wong 2016-07-06 8:09 ` Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong [this message] 2016-06-17 1:19 ` [PATCH 014/119] xfs: introduce interval queries on btrees Darrick J. Wong 2016-06-22 15:18 ` Brian Foster 2016-06-22 15:18 ` Brian Foster 2016-06-27 21:07 ` Darrick J. Wong 2016-06-27 21:07 ` Darrick J. Wong 2016-06-28 12:32 ` Brian Foster 2016-06-28 12:32 ` Brian Foster 2016-06-28 16:29 ` Darrick J. Wong 2016-06-28 16:29 ` Darrick J. Wong 2016-06-17 1:19 ` [PATCH 015/119] xfs: refactor btree owner change into a separate visit-blocks function Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-23 17:19 ` Brian Foster 2016-06-23 17:19 ` Brian Foster 2016-06-17 1:19 ` [PATCH 016/119] xfs: move deferred operations into a separate file Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-27 13:14 ` Brian Foster 2016-06-27 13:14 ` Brian Foster 2016-06-27 19:14 ` Darrick J. Wong 2016-06-27 19:14 ` Darrick J. Wong 2016-06-28 12:32 ` Brian Foster 2016-06-28 12:32 ` Brian Foster 2016-06-28 18:51 ` Darrick J. Wong 2016-06-28 18:51 ` Darrick J. Wong 2016-06-17 1:19 ` [PATCH 017/119] xfs: add tracepoints for the deferred ops mechanism Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-27 13:15 ` Brian Foster 2016-06-27 13:15 ` Brian Foster 2016-06-17 1:19 ` [PATCH 018/119] xfs: enable the xfs_defer mechanism to process extents to free Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-27 13:15 ` Brian Foster 2016-06-27 13:15 ` Brian Foster 2016-06-27 21:41 ` Darrick J. Wong 2016-06-27 21:41 ` Darrick J. Wong 2016-06-27 22:00 ` Darrick J. Wong 2016-06-27 22:00 ` Darrick J. Wong 2016-06-28 12:32 ` Brian Foster 2016-06-28 12:32 ` Brian Foster 2016-06-28 16:33 ` Darrick J. Wong 2016-06-28 16:33 ` Darrick J. Wong 2016-06-17 1:19 ` [PATCH 019/119] xfs: rework xfs_bmap_free callers to use xfs_defer_ops Darrick J. Wong 2016-06-17 1:19 ` Darrick J. Wong 2016-06-17 1:20 ` [PATCH 020/119] xfs: change xfs_bmap_{finish, cancel, init, free} -> xfs_defer_* Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-30 0:11 ` Darrick J. Wong 2016-06-30 0:11 ` Darrick J. Wong 2016-06-17 1:20 ` [PATCH 021/119] xfs: rename flist/free_list to dfops Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-17 1:20 ` [PATCH 022/119] xfs: add tracepoints and error injection for deferred extent freeing Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-17 1:20 ` [PATCH 023/119] xfs: introduce rmap btree definitions Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-30 17:32 ` Brian Foster 2016-06-30 17:32 ` Brian Foster 2016-06-17 1:20 ` [PATCH 024/119] xfs: add rmap btree stats infrastructure Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-30 17:32 ` Brian Foster 2016-06-30 17:32 ` Brian Foster 2016-06-17 1:20 ` [PATCH 025/119] xfs: rmap btree add more reserved blocks Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-30 17:32 ` Brian Foster 2016-06-30 17:32 ` Brian Foster 2016-06-17 1:20 ` [PATCH 026/119] xfs: add owner field to extent allocation and freeing Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-07-06 4:01 ` Dave Chinner 2016-07-06 4:01 ` Dave Chinner 2016-07-06 6:44 ` Darrick J. Wong 2016-07-06 6:44 ` Darrick J. Wong 2016-07-07 15:12 ` Brian Foster 2016-07-07 15:12 ` Brian Foster 2016-07-07 19:09 ` Darrick J. Wong 2016-07-07 19:09 ` Darrick J. Wong 2016-07-07 22:55 ` Dave Chinner 2016-07-07 22:55 ` Dave Chinner 2016-07-08 11:37 ` Brian Foster 2016-07-08 11:37 ` Brian Foster 2016-06-17 1:20 ` [PATCH 027/119] xfs: introduce rmap extent operation stubs Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-17 1:20 ` [PATCH 028/119] xfs: define the on-disk rmap btree format Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-07-06 4:05 ` Dave Chinner 2016-07-06 4:05 ` Dave Chinner 2016-07-06 6:44 ` Darrick J. Wong 2016-07-06 6:44 ` Darrick J. Wong 2016-07-07 18:41 ` Brian Foster 2016-07-07 18:41 ` Brian Foster 2016-07-07 19:18 ` Darrick J. Wong 2016-07-07 19:18 ` Darrick J. Wong 2016-07-07 23:14 ` Dave Chinner 2016-07-07 23:14 ` Dave Chinner 2016-07-07 23:58 ` Darrick J. Wong 2016-07-07 23:58 ` Darrick J. Wong 2016-06-17 1:20 ` [PATCH 029/119] xfs: add rmap btree growfs support Darrick J. Wong 2016-06-17 1:20 ` Darrick J. Wong 2016-06-17 1:21 ` [PATCH 030/119] xfs: rmap btree transaction reservations Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-08 13:21 ` Brian Foster 2016-07-08 13:21 ` Brian Foster 2016-06-17 1:21 ` [PATCH 031/119] xfs: rmap btree requires more reserved free space Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-08 13:21 ` Brian Foster 2016-07-08 13:21 ` Brian Foster 2016-07-13 16:50 ` Darrick J. Wong 2016-07-13 16:50 ` Darrick J. Wong 2016-07-13 18:32 ` Brian Foster 2016-07-13 18:32 ` Brian Foster 2016-07-13 23:50 ` Dave Chinner 2016-07-13 23:50 ` Dave Chinner 2016-06-17 1:21 ` [PATCH 032/119] xfs: add rmap btree operations Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-08 18:33 ` Brian Foster 2016-07-08 18:33 ` Brian Foster 2016-07-08 23:53 ` Darrick J. Wong 2016-07-08 23:53 ` Darrick J. Wong 2016-06-17 1:21 ` [PATCH 033/119] xfs: support overlapping intervals in the rmap btree Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-08 18:33 ` Brian Foster 2016-07-08 18:33 ` Brian Foster 2016-07-09 0:14 ` Darrick J. Wong 2016-07-09 0:14 ` Darrick J. Wong 2016-07-09 13:25 ` Brian Foster 2016-07-09 13:25 ` Brian Foster 2016-06-17 1:21 ` [PATCH 034/119] xfs: teach rmapbt to support interval queries Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-08 18:34 ` Brian Foster 2016-07-08 18:34 ` Brian Foster 2016-07-09 0:16 ` Darrick J. Wong 2016-07-09 0:16 ` Darrick J. Wong 2016-07-09 13:25 ` Brian Foster 2016-07-09 13:25 ` Brian Foster 2016-06-17 1:21 ` [PATCH 035/119] xfs: add tracepoints for the rmap functions Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-08 18:34 ` Brian Foster 2016-07-08 18:34 ` Brian Foster 2016-06-17 1:21 ` [PATCH 036/119] xfs: add an extent to the rmap btree Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-11 18:49 ` Brian Foster 2016-07-11 18:49 ` Brian Foster 2016-07-11 23:01 ` Darrick J. Wong 2016-07-11 23:01 ` Darrick J. Wong 2016-06-17 1:21 ` [PATCH 037/119] xfs: remove an extent from " Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-07-11 18:49 ` Brian Foster 2016-07-11 18:49 ` Brian Foster 2016-06-17 1:21 ` [PATCH 038/119] xfs: convert unwritten status of reverse mappings Darrick J. Wong 2016-06-17 1:21 ` Darrick J. Wong 2016-06-30 0:15 ` Darrick J. Wong 2016-06-30 0:15 ` Darrick J. Wong 2016-07-13 18:27 ` Brian Foster 2016-07-13 18:27 ` Brian Foster 2016-07-13 20:43 ` Darrick J. Wong 2016-07-13 20:43 ` Darrick J. Wong 2016-06-17 1:22 ` [PATCH 039/119] xfs: add rmap btree insert and delete helpers Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-13 18:28 ` Brian Foster 2016-07-13 18:28 ` Brian Foster 2016-07-13 18:37 ` Darrick J. Wong 2016-07-13 18:37 ` Darrick J. Wong 2016-07-13 18:42 ` Brian Foster 2016-07-13 18:42 ` Brian Foster 2016-06-17 1:22 ` [PATCH 040/119] xfs: create helpers for mapping, unmapping, and converting file fork extents Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-13 18:28 ` Brian Foster 2016-07-13 18:28 ` Brian Foster 2016-07-13 18:47 ` Darrick J. Wong 2016-07-13 18:47 ` Darrick J. Wong 2016-07-13 23:54 ` Dave Chinner 2016-07-13 23:54 ` Dave Chinner 2016-07-13 23:55 ` Darrick J. Wong 2016-07-13 23:55 ` Darrick J. Wong 2016-06-17 1:22 ` [PATCH 041/119] xfs: create rmap update intent log items Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-15 18:33 ` Brian Foster 2016-07-15 18:33 ` Brian Foster 2016-07-16 7:10 ` Darrick J. Wong 2016-07-16 7:10 ` Darrick J. Wong 2016-06-17 1:22 ` [PATCH 042/119] xfs: log rmap intent items Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-15 18:33 ` Brian Foster 2016-07-15 18:33 ` Brian Foster 2016-07-16 7:34 ` Darrick J. Wong 2016-07-16 7:34 ` Darrick J. Wong 2016-07-18 12:55 ` Brian Foster 2016-07-18 12:55 ` Brian Foster 2016-07-19 17:10 ` Darrick J. Wong 2016-07-19 17:10 ` Darrick J. Wong 2016-06-17 1:22 ` [PATCH 043/119] xfs: enable the xfs_defer mechanism to process rmaps to update Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-15 18:33 ` Brian Foster 2016-07-15 18:33 ` Brian Foster 2016-06-17 1:22 ` [PATCH 044/119] xfs: propagate bmap updates to rmapbt Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-15 18:33 ` Brian Foster 2016-07-15 18:33 ` Brian Foster 2016-07-16 7:26 ` Darrick J. Wong 2016-07-16 7:26 ` Darrick J. Wong 2016-07-18 1:21 ` Dave Chinner 2016-07-18 1:21 ` Dave Chinner 2016-07-18 12:56 ` Brian Foster 2016-07-18 12:56 ` Brian Foster 2016-07-18 12:55 ` Brian Foster 2016-07-18 12:55 ` Brian Foster 2016-07-19 1:53 ` Darrick J. Wong 2016-07-19 1:53 ` Darrick J. Wong 2016-07-19 11:37 ` Brian Foster 2016-07-19 11:37 ` Brian Foster 2016-06-17 1:22 ` [PATCH 045/119] xfs: add rmap btree geometry feature flag Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-18 13:34 ` Brian Foster 2016-07-18 13:34 ` Brian Foster 2016-06-17 1:22 ` [PATCH 046/119] xfs: add rmap btree block detection to log recovery Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-18 13:34 ` Brian Foster 2016-07-18 13:34 ` Brian Foster 2016-06-17 1:22 ` [PATCH 047/119] xfs: disable XFS_IOC_SWAPEXT when rmap btree is enabled Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-18 13:34 ` Brian Foster 2016-07-18 13:34 ` Brian Foster 2016-07-18 16:18 ` Darrick J. Wong 2016-07-18 16:18 ` Darrick J. Wong 2016-06-17 1:22 ` [PATCH 048/119] xfs: don't update rmapbt when fixing agfl Darrick J. Wong 2016-06-17 1:22 ` Darrick J. Wong 2016-07-18 13:34 ` Brian Foster 2016-07-18 13:34 ` Brian Foster 2016-07-18 15:53 ` Darrick J. Wong 2016-07-18 15:53 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 049/119] xfs: enable the rmap btree functionality Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-07-18 13:34 ` Brian Foster 2016-07-18 13:34 ` Brian Foster 2016-06-17 1:23 ` [PATCH 050/119] xfs: count the blocks in a btree Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 051/119] xfs: introduce tracepoints for AG reservation code Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 052/119] xfs: set up per-AG free space reservations Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 053/119] xfs: define tracepoints for refcount btree activities Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 054/119] xfs: introduce refcount btree definitions Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 055/119] xfs: add refcount btree stats infrastructure Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 056/119] xfs: refcount btree add more reserved blocks Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:23 ` [PATCH 057/119] xfs: define the on-disk refcount btree format Darrick J. Wong 2016-06-17 1:23 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 058/119] xfs: add refcount btree support to growfs Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 059/119] xfs: account for the refcount btree in the alloc/free log reservation Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 060/119] xfs: add refcount btree operations Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 061/119] xfs: create refcount update intent log items Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 062/119] xfs: log refcount intent items Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 063/119] xfs: adjust refcount of an extent of blocks in refcount btree Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 064/119] xfs: connect refcount adjust functions to upper layers Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 065/119] xfs: adjust refcount when unmapping file blocks Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:24 ` [PATCH 066/119] xfs: add refcount btree block detection to log recovery Darrick J. Wong 2016-06-17 1:24 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 067/119] xfs: refcount btree requires more reserved space Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 068/119] xfs: introduce reflink utility functions Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 069/119] xfs: create bmbt update intent log items Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 070/119] xfs: log bmap intent items Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 071/119] xfs: map an inode's offset to an exact physical block Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 072/119] xfs: implement deferred bmbt map/unmap operations Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 073/119] xfs: return work remaining at the end of a bunmapi operation Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 074/119] xfs: define tracepoints for reflink activities Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 075/119] xfs: add reflink feature flag to geometry Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:25 ` [PATCH 076/119] xfs: don't allow reflinked dir/dev/fifo/socket/pipe files Darrick J. Wong 2016-06-17 1:25 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 077/119] xfs: introduce the CoW fork Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 078/119] xfs: support bmapping delalloc extents in " Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 079/119] xfs: create delalloc extents in " Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 080/119] xfs: support allocating delayed " Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 081/119] xfs: allocate " Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 082/119] xfs: support removing extents from " Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 083/119] xfs: move mappings from cow fork to data fork after copy-write Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 084/119] xfs: implement CoW for directio writes Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:26 ` [PATCH 085/119] xfs: copy-on-write reflinked blocks when zeroing ranges of blocks Darrick J. Wong 2016-06-17 1:26 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 086/119] xfs: cancel CoW reservations and clear inode reflink flag when freeing blocks Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 087/119] xfs: cancel pending CoW reservations when destroying inodes Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 088/119] xfs: store in-progress CoW allocations in the refcount btree Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 089/119] xfs: reflink extents from one file to another Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 090/119] xfs: add clone file and clone range vfs functions Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 091/119] xfs: add dedupe range vfs function Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 092/119] xfs: teach get_bmapx and fiemap about shared extents and the CoW fork Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 093/119] xfs: swap inode reflink flags when swapping inode extents Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:27 ` [PATCH 094/119] xfs: unshare a range of blocks via fallocate Darrick J. Wong 2016-06-17 1:27 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 095/119] xfs: CoW shared EOF block when truncating file Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 096/119] xfs: support FS_XFLAG_REFLINK on reflink filesystems Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 097/119] xfs: create a separate cow extent size hint for the allocator Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 098/119] xfs: preallocate blocks for worst-case btree expansion Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 099/119] xfs: don't allow reflink when the AG is low on space Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 100/119] xfs: try other AGs to allocate a BMBT block Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 101/119] xfs: promote buffered writes to CoW when cowextsz is set Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 102/119] xfs: garbage collect old cowextsz reservations Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:28 ` [PATCH 103/119] xfs: provide switch to force filesystem to copy-on-write all the time Darrick J. Wong 2016-06-17 1:28 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 104/119] xfs: increase log reservations for reflink Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 105/119] xfs: use interval query for rmap alloc operations on shared files Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 106/119] xfs: convert unwritten status of reverse mappings for " Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 107/119] xfs: set a default CoW extent size of 32 blocks Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 108/119] xfs: don't allow realtime and reflinked files to mix Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 109/119] xfs: don't mix reflink and DAX mode for now Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 110/119] xfs: fail ->bmap for reflink inodes Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 111/119] xfs: recognize the reflink feature bit Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:29 ` [PATCH 112/119] xfs: introduce the XFS_IOC_GETFSMAPX ioctl Darrick J. Wong 2016-06-17 1:29 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 113/119] xfs: scrub btree records and pointers while querying Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 114/119] xfs: create sysfs hooks to scrub various files Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 115/119] xfs: support scrubbing free space btrees Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 116/119] xfs: support scrubbing inode btrees Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 117/119] xfs: support scrubbing rmap btree Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 118/119] xfs: support scrubbing refcount btree Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong 2016-06-17 1:30 ` [PATCH 119/119] xfs: add btree scrub tracepoints Darrick J. Wong 2016-06-17 1:30 ` Darrick J. Wong
Reply instructions: You may reply publicly to this message via plain-text email using any one of the following methods: * Save the following mbox file, import it into your mail client, and reply-to-all from there: mbox Avoid top-posting and favor interleaved quoting: https://en.wikipedia.org/wiki/Posting_style#Interleaved_style * Reply using the --to, --cc, and --in-reply-to switches of git-send-email(1): git send-email \ --in-reply-to=146612636170.12839.675596870201079078.stgit@birch.djwong.org \ --to=darrick.wong@oracle.com \ --cc=david@fromorbit.com \ --cc=linux-fsdevel@vger.kernel.org \ --cc=vishal.l.verma@intel.com \ --cc=xfs@oss.sgi.com \ /path/to/YOUR_REPLY https://kernel.org/pub/software/scm/git/docs/git-send-email.html * If your mail client supports setting the In-Reply-To header via mailto: links, try the mailto: linkBe sure your reply has a Subject: header at the top and a blank line before the message body.
This is an external index of several public inboxes, see mirroring instructions on how to clone and mirror all data and code used by this external index.