diff options
author | Dave Chinner <david@fromorbit.com> | 2010-01-11 06:47:44 -0500 |
---|---|---|
committer | Alex Elder <aelder@sgi.com> | 2010-01-15 16:33:52 -0500 |
commit | 1c1c6ebcf5284aee4910f3b906ac90c20e510c82 (patch) | |
tree | bbcf74752bf7bc058a5c5bdd6bd03090c845b041 /fs/xfs/xfs_bmap.c | |
parent | 44b56e0a1aed522a10051645e85d300e10926fd3 (diff) |
xfs: Replace per-ag array with a radix tree
The use of an array for the per-ag structures requires reallocation
of the array when growing the filesystem. This requires locking
access to the array to avoid use after free situations, and the
locking is difficult to get right. To avoid needing to reallocate an
array, change the per-ag structures to an allocated object per ag
and index them using a tree structure.
The AGs are always densely indexed (hence the use of an array), but
the number supported is 2^32 and lookups tend to be random and hence
indexing needs to scale. A simple choice is a radix tree - it works
well with this sort of index. This change also removes another
large contiguous allocation from the mount/growfs path in XFS.
The growing process now needs to change to only initialise the new
AGs required for the extra space, and as such only needs to
exclusively lock the tree for inserts. The rest of the code only
needs to lock the tree while doing lookups, and hence this will
remove all the deadlocks that currently occur on the m_perag_lock as
it is now an innermost lock. The lock is also changed to a spinlock
from a read/write lock as the hold time is now extremely short.
To complete the picture, the per-ag structures will need to be
reference counted to ensure that we don't free/modify them while
they are still in use. This will be done in subsequent patch.
Signed-off-by: Dave Chinner <david@fromorbit.com>
Reviewed-by: Christoph Hellwig <hch@lst.de>
Signed-off-by: Alex Elder <aelder@sgi.com>
Diffstat (limited to 'fs/xfs/xfs_bmap.c')
-rw-r--r-- | fs/xfs/xfs_bmap.c | 7 |
1 files changed, 1 insertions, 6 deletions
diff --git a/fs/xfs/xfs_bmap.c b/fs/xfs/xfs_bmap.c index a9b95d9cf2ad..7c6d9acd7154 100644 --- a/fs/xfs/xfs_bmap.c +++ b/fs/xfs/xfs_bmap.c | |||
@@ -2629,14 +2629,12 @@ xfs_bmap_btalloc( | |||
2629 | if (startag == NULLAGNUMBER) | 2629 | if (startag == NULLAGNUMBER) |
2630 | startag = ag = 0; | 2630 | startag = ag = 0; |
2631 | notinit = 0; | 2631 | notinit = 0; |
2632 | down_read(&mp->m_peraglock); | ||
2633 | pag = xfs_perag_get(mp, ag); | 2632 | pag = xfs_perag_get(mp, ag); |
2634 | while (blen < ap->alen) { | 2633 | while (blen < ap->alen) { |
2635 | if (!pag->pagf_init && | 2634 | if (!pag->pagf_init && |
2636 | (error = xfs_alloc_pagf_init(mp, args.tp, | 2635 | (error = xfs_alloc_pagf_init(mp, args.tp, |
2637 | ag, XFS_ALLOC_FLAG_TRYLOCK))) { | 2636 | ag, XFS_ALLOC_FLAG_TRYLOCK))) { |
2638 | xfs_perag_put(pag); | 2637 | xfs_perag_put(pag); |
2639 | up_read(&mp->m_peraglock); | ||
2640 | return error; | 2638 | return error; |
2641 | } | 2639 | } |
2642 | /* | 2640 | /* |
@@ -2669,10 +2667,8 @@ xfs_bmap_btalloc( | |||
2669 | 2667 | ||
2670 | error = xfs_filestream_new_ag(ap, &ag); | 2668 | error = xfs_filestream_new_ag(ap, &ag); |
2671 | xfs_perag_put(pag); | 2669 | xfs_perag_put(pag); |
2672 | if (error) { | 2670 | if (error) |
2673 | up_read(&mp->m_peraglock); | ||
2674 | return error; | 2671 | return error; |
2675 | } | ||
2676 | 2672 | ||
2677 | /* loop again to set 'blen'*/ | 2673 | /* loop again to set 'blen'*/ |
2678 | startag = NULLAGNUMBER; | 2674 | startag = NULLAGNUMBER; |
@@ -2688,7 +2684,6 @@ xfs_bmap_btalloc( | |||
2688 | pag = xfs_perag_get(mp, ag); | 2684 | pag = xfs_perag_get(mp, ag); |
2689 | } | 2685 | } |
2690 | xfs_perag_put(pag); | 2686 | xfs_perag_put(pag); |
2691 | up_read(&mp->m_peraglock); | ||
2692 | /* | 2687 | /* |
2693 | * Since the above loop did a BUF_TRYLOCK, it is | 2688 | * Since the above loop did a BUF_TRYLOCK, it is |
2694 | * possible that there is space for this request. | 2689 | * possible that there is space for this request. |