2 * Copyright (c) 2000-2005 Silicon Graphics, Inc.
5 * This program is free software; you can redistribute it and/or
6 * modify it under the terms of the GNU General Public License as
7 * published by the Free Software Foundation.
9 * This program is distributed in the hope that it would be useful,
10 * but WITHOUT ANY WARRANTY; without even the implied warranty of
11 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
12 * GNU General Public License for more details.
14 * You should have received a copy of the GNU General Public License
15 * along with this program; if not, write the Free Software Foundation,
16 * Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 #include "xfs_types.h"
22 #include "xfs_log_priv.h"
24 #include "xfs_trans.h"
25 #include "xfs_trans_priv.h"
28 #include "xfs_mount.h"
29 #include "xfs_bmap_btree.h"
30 #include "xfs_inode.h"
31 #include "xfs_dinode.h"
32 #include "xfs_error.h"
33 #include "xfs_filestream.h"
34 #include "xfs_vnodeops.h"
35 #include "xfs_inode_item.h"
36 #include "xfs_quota.h"
37 #include "xfs_trace.h"
38 #include "xfs_fsops.h"
39 #include "xfs_icache.h"
41 #include <linux/kthread.h>
42 #include <linux/freezer.h>
44 STATIC
void __xfs_inode_clear_reclaim_tag(struct xfs_mount
*mp
,
45 struct xfs_perag
*pag
, struct xfs_inode
*ip
);
48 * Allocate and initialise an xfs_inode.
50 STATIC
struct xfs_inode
*
58 * if this didn't occur in transactions, we could use
59 * KM_MAYFAIL and return NULL here on ENOMEM. Set the
60 * code up to do this anyway.
62 ip
= kmem_zone_alloc(xfs_inode_zone
, KM_SLEEP
);
65 if (inode_init_always(mp
->m_super
, VFS_I(ip
))) {
66 kmem_zone_free(xfs_inode_zone
, ip
);
70 ASSERT(atomic_read(&ip
->i_pincount
) == 0);
71 ASSERT(!spin_is_locked(&ip
->i_flags_lock
));
72 ASSERT(!xfs_isiflocked(ip
));
73 ASSERT(ip
->i_ino
== 0);
75 mrlock_init(&ip
->i_iolock
, MRLOCK_BARRIER
, "xfsio", ip
->i_ino
);
77 /* initialise the xfs inode */
80 memset(&ip
->i_imap
, 0, sizeof(struct xfs_imap
));
82 memset(&ip
->i_df
, 0, sizeof(xfs_ifork_t
));
84 ip
->i_delayed_blks
= 0;
85 memset(&ip
->i_d
, 0, sizeof(xfs_icdinode_t
));
91 xfs_inode_free_callback(
92 struct rcu_head
*head
)
94 struct inode
*inode
= container_of(head
, struct inode
, i_rcu
);
95 struct xfs_inode
*ip
= XFS_I(inode
);
97 kmem_zone_free(xfs_inode_zone
, ip
);
102 struct xfs_inode
*ip
)
104 switch (ip
->i_d
.di_mode
& S_IFMT
) {
108 xfs_idestroy_fork(ip
, XFS_DATA_FORK
);
113 xfs_idestroy_fork(ip
, XFS_ATTR_FORK
);
116 ASSERT(!(ip
->i_itemp
->ili_item
.li_flags
& XFS_LI_IN_AIL
));
117 xfs_inode_item_destroy(ip
);
121 /* asserts to verify all state is correct here */
122 ASSERT(atomic_read(&ip
->i_pincount
) == 0);
123 ASSERT(!spin_is_locked(&ip
->i_flags_lock
));
124 ASSERT(!xfs_isiflocked(ip
));
127 * Because we use RCU freeing we need to ensure the inode always
128 * appears to be reclaimed with an invalid inode number when in the
129 * free state. The ip->i_flags_lock provides the barrier against lookup
132 spin_lock(&ip
->i_flags_lock
);
133 ip
->i_flags
= XFS_IRECLAIM
;
135 spin_unlock(&ip
->i_flags_lock
);
137 call_rcu(&VFS_I(ip
)->i_rcu
, xfs_inode_free_callback
);
141 * Check the validity of the inode we just found it the cache
145 struct xfs_perag
*pag
,
146 struct xfs_inode
*ip
,
149 int lock_flags
) __releases(RCU
)
151 struct inode
*inode
= VFS_I(ip
);
152 struct xfs_mount
*mp
= ip
->i_mount
;
156 * check for re-use of an inode within an RCU grace period due to the
157 * radix tree nodes not being updated yet. We monitor for this by
158 * setting the inode number to zero before freeing the inode structure.
159 * If the inode has been reallocated and set up, then the inode number
160 * will not match, so check for that, too.
162 spin_lock(&ip
->i_flags_lock
);
163 if (ip
->i_ino
!= ino
) {
164 trace_xfs_iget_skip(ip
);
165 XFS_STATS_INC(xs_ig_frecycle
);
172 * If we are racing with another cache hit that is currently
173 * instantiating this inode or currently recycling it out of
174 * reclaimabe state, wait for the initialisation to complete
177 * XXX(hch): eventually we should do something equivalent to
178 * wait_on_inode to wait for these flags to be cleared
179 * instead of polling for it.
181 if (ip
->i_flags
& (XFS_INEW
|XFS_IRECLAIM
)) {
182 trace_xfs_iget_skip(ip
);
183 XFS_STATS_INC(xs_ig_frecycle
);
189 * If lookup is racing with unlink return an error immediately.
191 if (ip
->i_d
.di_mode
== 0 && !(flags
& XFS_IGET_CREATE
)) {
197 * If IRECLAIMABLE is set, we've torn down the VFS inode already.
198 * Need to carefully get it back into useable state.
200 if (ip
->i_flags
& XFS_IRECLAIMABLE
) {
201 trace_xfs_iget_reclaim(ip
);
204 * We need to set XFS_IRECLAIM to prevent xfs_reclaim_inode
205 * from stomping over us while we recycle the inode. We can't
206 * clear the radix tree reclaimable tag yet as it requires
207 * pag_ici_lock to be held exclusive.
209 ip
->i_flags
|= XFS_IRECLAIM
;
211 spin_unlock(&ip
->i_flags_lock
);
214 error
= -inode_init_always(mp
->m_super
, inode
);
217 * Re-initializing the inode failed, and we are in deep
218 * trouble. Try to re-add it to the reclaim list.
221 spin_lock(&ip
->i_flags_lock
);
223 ip
->i_flags
&= ~(XFS_INEW
| XFS_IRECLAIM
);
224 ASSERT(ip
->i_flags
& XFS_IRECLAIMABLE
);
225 trace_xfs_iget_reclaim_fail(ip
);
229 spin_lock(&pag
->pag_ici_lock
);
230 spin_lock(&ip
->i_flags_lock
);
233 * Clear the per-lifetime state in the inode as we are now
234 * effectively a new inode and need to return to the initial
235 * state before reuse occurs.
237 ip
->i_flags
&= ~XFS_IRECLAIM_RESET_FLAGS
;
238 ip
->i_flags
|= XFS_INEW
;
239 __xfs_inode_clear_reclaim_tag(mp
, pag
, ip
);
240 inode
->i_state
= I_NEW
;
242 ASSERT(!rwsem_is_locked(&ip
->i_iolock
.mr_lock
));
243 mrlock_init(&ip
->i_iolock
, MRLOCK_BARRIER
, "xfsio", ip
->i_ino
);
245 spin_unlock(&ip
->i_flags_lock
);
246 spin_unlock(&pag
->pag_ici_lock
);
248 /* If the VFS inode is being torn down, pause and try again. */
250 trace_xfs_iget_skip(ip
);
255 /* We've got a live one. */
256 spin_unlock(&ip
->i_flags_lock
);
258 trace_xfs_iget_hit(ip
);
262 xfs_ilock(ip
, lock_flags
);
264 xfs_iflags_clear(ip
, XFS_ISTALE
| XFS_IDONTCACHE
);
265 XFS_STATS_INC(xs_ig_found
);
270 spin_unlock(&ip
->i_flags_lock
);
278 struct xfs_mount
*mp
,
279 struct xfs_perag
*pag
,
282 struct xfs_inode
**ipp
,
286 struct xfs_inode
*ip
;
288 xfs_agino_t agino
= XFS_INO_TO_AGINO(mp
, ino
);
291 ip
= xfs_inode_alloc(mp
, ino
);
295 error
= xfs_iread(mp
, tp
, ip
, flags
);
299 trace_xfs_iget_miss(ip
);
301 if ((ip
->i_d
.di_mode
== 0) && !(flags
& XFS_IGET_CREATE
)) {
307 * Preload the radix tree so we can insert safely under the
308 * write spinlock. Note that we cannot sleep inside the preload
309 * region. Since we can be called from transaction context, don't
310 * recurse into the file system.
312 if (radix_tree_preload(GFP_NOFS
)) {
318 * Because the inode hasn't been added to the radix-tree yet it can't
319 * be found by another thread, so we can do the non-sleeping lock here.
322 if (!xfs_ilock_nowait(ip
, lock_flags
))
327 * These values must be set before inserting the inode into the radix
328 * tree as the moment it is inserted a concurrent lookup (allowed by the
329 * RCU locking mechanism) can find it and that lookup must see that this
330 * is an inode currently under construction (i.e. that XFS_INEW is set).
331 * The ip->i_flags_lock that protects the XFS_INEW flag forms the
332 * memory barrier that ensures this detection works correctly at lookup
336 if (flags
& XFS_IGET_DONTCACHE
)
337 iflags
|= XFS_IDONTCACHE
;
340 xfs_iflags_set(ip
, iflags
);
342 /* insert the new inode */
343 spin_lock(&pag
->pag_ici_lock
);
344 error
= radix_tree_insert(&pag
->pag_ici_root
, agino
, ip
);
345 if (unlikely(error
)) {
346 WARN_ON(error
!= -EEXIST
);
347 XFS_STATS_INC(xs_ig_dup
);
349 goto out_preload_end
;
351 spin_unlock(&pag
->pag_ici_lock
);
352 radix_tree_preload_end();
358 spin_unlock(&pag
->pag_ici_lock
);
359 radix_tree_preload_end();
361 xfs_iunlock(ip
, lock_flags
);
363 __destroy_inode(VFS_I(ip
));
369 * Look up an inode by number in the given file system.
370 * The inode is looked up in the cache held in each AG.
371 * If the inode is found in the cache, initialise the vfs inode
374 * If it is not in core, read it in from the file system's device,
375 * add it to the cache and initialise the vfs inode.
377 * The inode is locked according to the value of the lock_flags parameter.
378 * This flag parameter indicates how and if the inode's IO lock and inode lock
381 * mp -- the mount point structure for the current file system. It points
382 * to the inode hash table.
383 * tp -- a pointer to the current transaction if there is one. This is
384 * simply passed through to the xfs_iread() call.
385 * ino -- the number of the inode desired. This is the unique identifier
386 * within the file system for the inode being requested.
387 * lock_flags -- flags indicating how to lock the inode. See the comment
388 * for xfs_ilock() for a list of valid values.
405 * xfs_reclaim_inode() uses the ILOCK to ensure an inode
406 * doesn't get freed while it's being referenced during a
407 * radix tree traversal here. It assumes this function
408 * aqcuires only the ILOCK (and therefore it has no need to
409 * involve the IOLOCK in this synchronization).
411 ASSERT((lock_flags
& (XFS_IOLOCK_EXCL
| XFS_IOLOCK_SHARED
)) == 0);
413 /* reject inode numbers outside existing AGs */
414 if (!ino
|| XFS_INO_TO_AGNO(mp
, ino
) >= mp
->m_sb
.sb_agcount
)
417 /* get the perag structure and ensure that it's inode capable */
418 pag
= xfs_perag_get(mp
, XFS_INO_TO_AGNO(mp
, ino
));
419 agino
= XFS_INO_TO_AGINO(mp
, ino
);
424 ip
= radix_tree_lookup(&pag
->pag_ici_root
, agino
);
427 error
= xfs_iget_cache_hit(pag
, ip
, ino
, flags
, lock_flags
);
429 goto out_error_or_again
;
432 XFS_STATS_INC(xs_ig_missed
);
434 error
= xfs_iget_cache_miss(mp
, pag
, tp
, ino
, &ip
,
437 goto out_error_or_again
;
444 * If we have a real type for an on-disk inode, we can set ops(&unlock)
445 * now. If it's a new inode being created, xfs_ialloc will handle it.
447 if (xfs_iflags_test(ip
, XFS_INEW
) && ip
->i_d
.di_mode
!= 0)
452 if (error
== EAGAIN
) {
461 * The inode lookup is done in batches to keep the amount of lock traffic and
462 * radix tree lookups to a minimum. The batch size is a trade off between
463 * lookup reduction and stack usage. This is in the reclaim path, so we can't
466 #define XFS_LOOKUP_BATCH 32
469 xfs_inode_ag_walk_grab(
470 struct xfs_inode
*ip
)
472 struct inode
*inode
= VFS_I(ip
);
474 ASSERT(rcu_read_lock_held());
477 * check for stale RCU freed inode
479 * If the inode has been reallocated, it doesn't matter if it's not in
480 * the AG we are walking - we are walking for writeback, so if it
481 * passes all the "valid inode" checks and is dirty, then we'll write
482 * it back anyway. If it has been reallocated and still being
483 * initialised, the XFS_INEW check below will catch it.
485 spin_lock(&ip
->i_flags_lock
);
487 goto out_unlock_noent
;
489 /* avoid new or reclaimable inodes. Leave for reclaim code to flush */
490 if (__xfs_iflags_test(ip
, XFS_INEW
| XFS_IRECLAIMABLE
| XFS_IRECLAIM
))
491 goto out_unlock_noent
;
492 spin_unlock(&ip
->i_flags_lock
);
494 /* nothing to sync during shutdown */
495 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
))
498 /* If we can't grab the inode, it must on it's way to reclaim. */
502 if (is_bad_inode(inode
)) {
511 spin_unlock(&ip
->i_flags_lock
);
517 struct xfs_mount
*mp
,
518 struct xfs_perag
*pag
,
519 int (*execute
)(struct xfs_inode
*ip
,
520 struct xfs_perag
*pag
, int flags
,
526 uint32_t first_index
;
538 struct xfs_inode
*batch
[XFS_LOOKUP_BATCH
];
545 nr_found
= radix_tree_gang_lookup(&pag
->pag_ici_root
,
546 (void **)batch
, first_index
,
549 nr_found
= radix_tree_gang_lookup_tag(
551 (void **) batch
, first_index
,
552 XFS_LOOKUP_BATCH
, tag
);
560 * Grab the inodes before we drop the lock. if we found
561 * nothing, nr == 0 and the loop will be skipped.
563 for (i
= 0; i
< nr_found
; i
++) {
564 struct xfs_inode
*ip
= batch
[i
];
566 if (done
|| xfs_inode_ag_walk_grab(ip
))
570 * Update the index for the next lookup. Catch
571 * overflows into the next AG range which can occur if
572 * we have inodes in the last block of the AG and we
573 * are currently pointing to the last inode.
575 * Because we may see inodes that are from the wrong AG
576 * due to RCU freeing and reallocation, only update the
577 * index if it lies in this AG. It was a race that lead
578 * us to see this inode, so another lookup from the
579 * same index will not find it again.
581 if (XFS_INO_TO_AGNO(mp
, ip
->i_ino
) != pag
->pag_agno
)
583 first_index
= XFS_INO_TO_AGINO(mp
, ip
->i_ino
+ 1);
584 if (first_index
< XFS_INO_TO_AGINO(mp
, ip
->i_ino
))
588 /* unlock now we've grabbed the inodes. */
591 for (i
= 0; i
< nr_found
; i
++) {
594 error
= execute(batch
[i
], pag
, flags
, args
);
596 if (error
== EAGAIN
) {
600 if (error
&& last_error
!= EFSCORRUPTED
)
604 /* bail out if the filesystem is corrupted. */
605 if (error
== EFSCORRUPTED
)
610 } while (nr_found
&& !done
);
620 * Background scanning to trim post-EOF preallocated space. This is queued
621 * based on the 'background_prealloc_discard_period' tunable (5m by default).
625 struct xfs_mount
*mp
)
628 if (radix_tree_tagged(&mp
->m_perag_tree
, XFS_ICI_EOFBLOCKS_TAG
))
629 queue_delayed_work(mp
->m_eofblocks_workqueue
,
630 &mp
->m_eofblocks_work
,
631 msecs_to_jiffies(xfs_eofb_secs
* 1000));
636 xfs_eofblocks_worker(
637 struct work_struct
*work
)
639 struct xfs_mount
*mp
= container_of(to_delayed_work(work
),
640 struct xfs_mount
, m_eofblocks_work
);
641 xfs_icache_free_eofblocks(mp
, NULL
);
642 xfs_queue_eofblocks(mp
);
646 xfs_inode_ag_iterator(
647 struct xfs_mount
*mp
,
648 int (*execute
)(struct xfs_inode
*ip
,
649 struct xfs_perag
*pag
, int flags
,
654 struct xfs_perag
*pag
;
660 while ((pag
= xfs_perag_get(mp
, ag
))) {
661 ag
= pag
->pag_agno
+ 1;
662 error
= xfs_inode_ag_walk(mp
, pag
, execute
, flags
, args
, -1);
666 if (error
== EFSCORRUPTED
)
670 return XFS_ERROR(last_error
);
674 xfs_inode_ag_iterator_tag(
675 struct xfs_mount
*mp
,
676 int (*execute
)(struct xfs_inode
*ip
,
677 struct xfs_perag
*pag
, int flags
,
683 struct xfs_perag
*pag
;
689 while ((pag
= xfs_perag_get_tag(mp
, ag
, tag
))) {
690 ag
= pag
->pag_agno
+ 1;
691 error
= xfs_inode_ag_walk(mp
, pag
, execute
, flags
, args
, tag
);
695 if (error
== EFSCORRUPTED
)
699 return XFS_ERROR(last_error
);
703 * Queue a new inode reclaim pass if there are reclaimable inodes and there
704 * isn't a reclaim pass already in progress. By default it runs every 5s based
705 * on the xfs periodic sync default of 30s. Perhaps this should have it's own
706 * tunable, but that can be done if this method proves to be ineffective or too
710 xfs_reclaim_work_queue(
711 struct xfs_mount
*mp
)
715 if (radix_tree_tagged(&mp
->m_perag_tree
, XFS_ICI_RECLAIM_TAG
)) {
716 queue_delayed_work(mp
->m_reclaim_workqueue
, &mp
->m_reclaim_work
,
717 msecs_to_jiffies(xfs_syncd_centisecs
/ 6 * 10));
723 * This is a fast pass over the inode cache to try to get reclaim moving on as
724 * many inodes as possible in a short period of time. It kicks itself every few
725 * seconds, as well as being kicked by the inode cache shrinker when memory
726 * goes low. It scans as quickly as possible avoiding locked inodes or those
727 * already being flushed, and once done schedules a future pass.
731 struct work_struct
*work
)
733 struct xfs_mount
*mp
= container_of(to_delayed_work(work
),
734 struct xfs_mount
, m_reclaim_work
);
736 xfs_reclaim_inodes(mp
, SYNC_TRYLOCK
);
737 xfs_reclaim_work_queue(mp
);
741 __xfs_inode_set_reclaim_tag(
742 struct xfs_perag
*pag
,
743 struct xfs_inode
*ip
)
745 radix_tree_tag_set(&pag
->pag_ici_root
,
746 XFS_INO_TO_AGINO(ip
->i_mount
, ip
->i_ino
),
747 XFS_ICI_RECLAIM_TAG
);
749 if (!pag
->pag_ici_reclaimable
) {
750 /* propagate the reclaim tag up into the perag radix tree */
751 spin_lock(&ip
->i_mount
->m_perag_lock
);
752 radix_tree_tag_set(&ip
->i_mount
->m_perag_tree
,
753 XFS_INO_TO_AGNO(ip
->i_mount
, ip
->i_ino
),
754 XFS_ICI_RECLAIM_TAG
);
755 spin_unlock(&ip
->i_mount
->m_perag_lock
);
757 /* schedule periodic background inode reclaim */
758 xfs_reclaim_work_queue(ip
->i_mount
);
760 trace_xfs_perag_set_reclaim(ip
->i_mount
, pag
->pag_agno
,
763 pag
->pag_ici_reclaimable
++;
767 * We set the inode flag atomically with the radix tree tag.
768 * Once we get tag lookups on the radix tree, this inode flag
772 xfs_inode_set_reclaim_tag(
775 struct xfs_mount
*mp
= ip
->i_mount
;
776 struct xfs_perag
*pag
;
778 pag
= xfs_perag_get(mp
, XFS_INO_TO_AGNO(mp
, ip
->i_ino
));
779 spin_lock(&pag
->pag_ici_lock
);
780 spin_lock(&ip
->i_flags_lock
);
781 __xfs_inode_set_reclaim_tag(pag
, ip
);
782 __xfs_iflags_set(ip
, XFS_IRECLAIMABLE
);
783 spin_unlock(&ip
->i_flags_lock
);
784 spin_unlock(&pag
->pag_ici_lock
);
789 __xfs_inode_clear_reclaim(
793 pag
->pag_ici_reclaimable
--;
794 if (!pag
->pag_ici_reclaimable
) {
795 /* clear the reclaim tag from the perag radix tree */
796 spin_lock(&ip
->i_mount
->m_perag_lock
);
797 radix_tree_tag_clear(&ip
->i_mount
->m_perag_tree
,
798 XFS_INO_TO_AGNO(ip
->i_mount
, ip
->i_ino
),
799 XFS_ICI_RECLAIM_TAG
);
800 spin_unlock(&ip
->i_mount
->m_perag_lock
);
801 trace_xfs_perag_clear_reclaim(ip
->i_mount
, pag
->pag_agno
,
807 __xfs_inode_clear_reclaim_tag(
812 radix_tree_tag_clear(&pag
->pag_ici_root
,
813 XFS_INO_TO_AGINO(mp
, ip
->i_ino
), XFS_ICI_RECLAIM_TAG
);
814 __xfs_inode_clear_reclaim(pag
, ip
);
818 * Grab the inode for reclaim exclusively.
819 * Return 0 if we grabbed it, non-zero otherwise.
822 xfs_reclaim_inode_grab(
823 struct xfs_inode
*ip
,
826 ASSERT(rcu_read_lock_held());
828 /* quick check for stale RCU freed inode */
833 * If we are asked for non-blocking operation, do unlocked checks to
834 * see if the inode already is being flushed or in reclaim to avoid
837 if ((flags
& SYNC_TRYLOCK
) &&
838 __xfs_iflags_test(ip
, XFS_IFLOCK
| XFS_IRECLAIM
))
842 * The radix tree lock here protects a thread in xfs_iget from racing
843 * with us starting reclaim on the inode. Once we have the
844 * XFS_IRECLAIM flag set it will not touch us.
846 * Due to RCU lookup, we may find inodes that have been freed and only
847 * have XFS_IRECLAIM set. Indeed, we may see reallocated inodes that
848 * aren't candidates for reclaim at all, so we must check the
849 * XFS_IRECLAIMABLE is set first before proceeding to reclaim.
851 spin_lock(&ip
->i_flags_lock
);
852 if (!__xfs_iflags_test(ip
, XFS_IRECLAIMABLE
) ||
853 __xfs_iflags_test(ip
, XFS_IRECLAIM
)) {
854 /* not a reclaim candidate. */
855 spin_unlock(&ip
->i_flags_lock
);
858 __xfs_iflags_set(ip
, XFS_IRECLAIM
);
859 spin_unlock(&ip
->i_flags_lock
);
864 * Inodes in different states need to be treated differently. The following
865 * table lists the inode states and the reclaim actions necessary:
867 * inode state iflush ret required action
868 * --------------- ---------- ---------------
870 * shutdown EIO unpin and reclaim
871 * clean, unpinned 0 reclaim
872 * stale, unpinned 0 reclaim
873 * clean, pinned(*) 0 requeue
874 * stale, pinned EAGAIN requeue
875 * dirty, async - requeue
876 * dirty, sync 0 reclaim
878 * (*) dgc: I don't think the clean, pinned state is possible but it gets
879 * handled anyway given the order of checks implemented.
881 * Also, because we get the flush lock first, we know that any inode that has
882 * been flushed delwri has had the flush completed by the time we check that
883 * the inode is clean.
885 * Note that because the inode is flushed delayed write by AIL pushing, the
886 * flush lock may already be held here and waiting on it can result in very
887 * long latencies. Hence for sync reclaims, where we wait on the flush lock,
888 * the caller should push the AIL first before trying to reclaim inodes to
889 * minimise the amount of time spent waiting. For background relaim, we only
890 * bother to reclaim clean inodes anyway.
892 * Hence the order of actions after gaining the locks should be:
894 * shutdown => unpin and reclaim
895 * pinned, async => requeue
896 * pinned, sync => unpin
899 * dirty, async => requeue
900 * dirty, sync => flush, wait and reclaim
904 struct xfs_inode
*ip
,
905 struct xfs_perag
*pag
,
908 struct xfs_buf
*bp
= NULL
;
913 xfs_ilock(ip
, XFS_ILOCK_EXCL
);
914 if (!xfs_iflock_nowait(ip
)) {
915 if (!(sync_mode
& SYNC_WAIT
))
920 if (is_bad_inode(VFS_I(ip
)))
922 if (XFS_FORCED_SHUTDOWN(ip
->i_mount
)) {
924 xfs_iflush_abort(ip
, false);
927 if (xfs_ipincount(ip
)) {
928 if (!(sync_mode
& SYNC_WAIT
))
932 if (xfs_iflags_test(ip
, XFS_ISTALE
))
934 if (xfs_inode_clean(ip
))
938 * Never flush out dirty data during non-blocking reclaim, as it would
939 * just contend with AIL pushing trying to do the same job.
941 if (!(sync_mode
& SYNC_WAIT
))
945 * Now we have an inode that needs flushing.
947 * Note that xfs_iflush will never block on the inode buffer lock, as
948 * xfs_ifree_cluster() can lock the inode buffer before it locks the
949 * ip->i_lock, and we are doing the exact opposite here. As a result,
950 * doing a blocking xfs_imap_to_bp() to get the cluster buffer would
951 * result in an ABBA deadlock with xfs_ifree_cluster().
953 * As xfs_ifree_cluser() must gather all inodes that are active in the
954 * cache to mark them stale, if we hit this case we don't actually want
955 * to do IO here - we want the inode marked stale so we can simply
956 * reclaim it. Hence if we get an EAGAIN error here, just unlock the
957 * inode, back off and try again. Hopefully the next pass through will
958 * see the stale flag set on the inode.
960 error
= xfs_iflush(ip
, &bp
);
961 if (error
== EAGAIN
) {
962 xfs_iunlock(ip
, XFS_ILOCK_EXCL
);
963 /* backoff longer than in xfs_ifree_cluster */
969 error
= xfs_bwrite(bp
);
976 xfs_iunlock(ip
, XFS_ILOCK_EXCL
);
978 XFS_STATS_INC(xs_ig_reclaims
);
980 * Remove the inode from the per-AG radix tree.
982 * Because radix_tree_delete won't complain even if the item was never
983 * added to the tree assert that it's been there before to catch
984 * problems with the inode life time early on.
986 spin_lock(&pag
->pag_ici_lock
);
987 if (!radix_tree_delete(&pag
->pag_ici_root
,
988 XFS_INO_TO_AGINO(ip
->i_mount
, ip
->i_ino
)))
990 __xfs_inode_clear_reclaim(pag
, ip
);
991 spin_unlock(&pag
->pag_ici_lock
);
994 * Here we do an (almost) spurious inode lock in order to coordinate
995 * with inode cache radix tree lookups. This is because the lookup
996 * can reference the inodes in the cache without taking references.
998 * We make that OK here by ensuring that we wait until the inode is
999 * unlocked after the lookup before we go ahead and free it.
1001 xfs_ilock(ip
, XFS_ILOCK_EXCL
);
1002 xfs_qm_dqdetach(ip
);
1003 xfs_iunlock(ip
, XFS_ILOCK_EXCL
);
1011 xfs_iflags_clear(ip
, XFS_IRECLAIM
);
1012 xfs_iunlock(ip
, XFS_ILOCK_EXCL
);
1014 * We could return EAGAIN here to make reclaim rescan the inode tree in
1015 * a short while. However, this just burns CPU time scanning the tree
1016 * waiting for IO to complete and the reclaim work never goes back to
1017 * the idle state. Instead, return 0 to let the next scheduled
1018 * background reclaim attempt to reclaim the inode again.
1024 * Walk the AGs and reclaim the inodes in them. Even if the filesystem is
1025 * corrupted, we still want to try to reclaim all the inodes. If we don't,
1026 * then a shut down during filesystem unmount reclaim walk leak all the
1027 * unreclaimed inodes.
1030 xfs_reclaim_inodes_ag(
1031 struct xfs_mount
*mp
,
1035 struct xfs_perag
*pag
;
1039 int trylock
= flags
& SYNC_TRYLOCK
;
1045 while ((pag
= xfs_perag_get_tag(mp
, ag
, XFS_ICI_RECLAIM_TAG
))) {
1046 unsigned long first_index
= 0;
1050 ag
= pag
->pag_agno
+ 1;
1053 if (!mutex_trylock(&pag
->pag_ici_reclaim_lock
)) {
1058 first_index
= pag
->pag_ici_reclaim_cursor
;
1060 mutex_lock(&pag
->pag_ici_reclaim_lock
);
1063 struct xfs_inode
*batch
[XFS_LOOKUP_BATCH
];
1067 nr_found
= radix_tree_gang_lookup_tag(
1069 (void **)batch
, first_index
,
1071 XFS_ICI_RECLAIM_TAG
);
1079 * Grab the inodes before we drop the lock. if we found
1080 * nothing, nr == 0 and the loop will be skipped.
1082 for (i
= 0; i
< nr_found
; i
++) {
1083 struct xfs_inode
*ip
= batch
[i
];
1085 if (done
|| xfs_reclaim_inode_grab(ip
, flags
))
1089 * Update the index for the next lookup. Catch
1090 * overflows into the next AG range which can
1091 * occur if we have inodes in the last block of
1092 * the AG and we are currently pointing to the
1095 * Because we may see inodes that are from the
1096 * wrong AG due to RCU freeing and
1097 * reallocation, only update the index if it
1098 * lies in this AG. It was a race that lead us
1099 * to see this inode, so another lookup from
1100 * the same index will not find it again.
1102 if (XFS_INO_TO_AGNO(mp
, ip
->i_ino
) !=
1105 first_index
= XFS_INO_TO_AGINO(mp
, ip
->i_ino
+ 1);
1106 if (first_index
< XFS_INO_TO_AGINO(mp
, ip
->i_ino
))
1110 /* unlock now we've grabbed the inodes. */
1113 for (i
= 0; i
< nr_found
; i
++) {
1116 error
= xfs_reclaim_inode(batch
[i
], pag
, flags
);
1117 if (error
&& last_error
!= EFSCORRUPTED
)
1121 *nr_to_scan
-= XFS_LOOKUP_BATCH
;
1125 } while (nr_found
&& !done
&& *nr_to_scan
> 0);
1127 if (trylock
&& !done
)
1128 pag
->pag_ici_reclaim_cursor
= first_index
;
1130 pag
->pag_ici_reclaim_cursor
= 0;
1131 mutex_unlock(&pag
->pag_ici_reclaim_lock
);
1136 * if we skipped any AG, and we still have scan count remaining, do
1137 * another pass this time using blocking reclaim semantics (i.e
1138 * waiting on the reclaim locks and ignoring the reclaim cursors). This
1139 * ensure that when we get more reclaimers than AGs we block rather
1140 * than spin trying to execute reclaim.
1142 if (skipped
&& (flags
& SYNC_WAIT
) && *nr_to_scan
> 0) {
1146 return XFS_ERROR(last_error
);
1154 int nr_to_scan
= INT_MAX
;
1156 return xfs_reclaim_inodes_ag(mp
, mode
, &nr_to_scan
);
1160 * Scan a certain number of inodes for reclaim.
1162 * When called we make sure that there is a background (fast) inode reclaim in
1163 * progress, while we will throttle the speed of reclaim via doing synchronous
1164 * reclaim of inodes. That means if we come across dirty inodes, we wait for
1165 * them to be cleaned, which we hope will not be very long due to the
1166 * background walker having already kicked the IO off on those dirty inodes.
1169 xfs_reclaim_inodes_nr(
1170 struct xfs_mount
*mp
,
1173 /* kick background reclaimer and push the AIL */
1174 xfs_reclaim_work_queue(mp
);
1175 xfs_ail_push_all(mp
->m_ail
);
1177 xfs_reclaim_inodes_ag(mp
, SYNC_TRYLOCK
| SYNC_WAIT
, &nr_to_scan
);
1181 * Return the number of reclaimable inodes in the filesystem for
1182 * the shrinker to determine how much to reclaim.
1185 xfs_reclaim_inodes_count(
1186 struct xfs_mount
*mp
)
1188 struct xfs_perag
*pag
;
1189 xfs_agnumber_t ag
= 0;
1190 int reclaimable
= 0;
1192 while ((pag
= xfs_perag_get_tag(mp
, ag
, XFS_ICI_RECLAIM_TAG
))) {
1193 ag
= pag
->pag_agno
+ 1;
1194 reclaimable
+= pag
->pag_ici_reclaimable
;
1202 struct xfs_inode
*ip
,
1203 struct xfs_eofblocks
*eofb
)
1205 if (eofb
->eof_flags
& XFS_EOF_FLAGS_UID
&&
1206 ip
->i_d
.di_uid
!= eofb
->eof_uid
)
1209 if (eofb
->eof_flags
& XFS_EOF_FLAGS_GID
&&
1210 ip
->i_d
.di_gid
!= eofb
->eof_gid
)
1213 if (eofb
->eof_flags
& XFS_EOF_FLAGS_PRID
&&
1214 xfs_get_projid(ip
) != eofb
->eof_prid
)
1221 xfs_inode_free_eofblocks(
1222 struct xfs_inode
*ip
,
1223 struct xfs_perag
*pag
,
1228 struct xfs_eofblocks
*eofb
= args
;
1230 if (!xfs_can_free_eofblocks(ip
, false)) {
1231 /* inode could be preallocated or append-only */
1232 trace_xfs_inode_free_eofblocks_invalid(ip
);
1233 xfs_inode_clear_eofblocks_tag(ip
);
1238 * If the mapping is dirty the operation can block and wait for some
1239 * time. Unless we are waiting, skip it.
1241 if (!(flags
& SYNC_WAIT
) &&
1242 mapping_tagged(VFS_I(ip
)->i_mapping
, PAGECACHE_TAG_DIRTY
))
1246 if (!xfs_inode_match_id(ip
, eofb
))
1249 /* skip the inode if the file size is too small */
1250 if (eofb
->eof_flags
& XFS_EOF_FLAGS_MINFILESIZE
&&
1251 XFS_ISIZE(ip
) < eofb
->eof_min_file_size
)
1255 ret
= xfs_free_eofblocks(ip
->i_mount
, ip
, true);
1257 /* don't revisit the inode if we're not waiting */
1258 if (ret
== EAGAIN
&& !(flags
& SYNC_WAIT
))
1265 xfs_icache_free_eofblocks(
1266 struct xfs_mount
*mp
,
1267 struct xfs_eofblocks
*eofb
)
1269 int flags
= SYNC_TRYLOCK
;
1271 if (eofb
&& (eofb
->eof_flags
& XFS_EOF_FLAGS_SYNC
))
1274 return xfs_inode_ag_iterator_tag(mp
, xfs_inode_free_eofblocks
, flags
,
1275 eofb
, XFS_ICI_EOFBLOCKS_TAG
);
1279 xfs_inode_set_eofblocks_tag(
1282 struct xfs_mount
*mp
= ip
->i_mount
;
1283 struct xfs_perag
*pag
;
1286 pag
= xfs_perag_get(mp
, XFS_INO_TO_AGNO(mp
, ip
->i_ino
));
1287 spin_lock(&pag
->pag_ici_lock
);
1288 trace_xfs_inode_set_eofblocks_tag(ip
);
1290 tagged
= radix_tree_tagged(&pag
->pag_ici_root
,
1291 XFS_ICI_EOFBLOCKS_TAG
);
1292 radix_tree_tag_set(&pag
->pag_ici_root
,
1293 XFS_INO_TO_AGINO(ip
->i_mount
, ip
->i_ino
),
1294 XFS_ICI_EOFBLOCKS_TAG
);
1296 /* propagate the eofblocks tag up into the perag radix tree */
1297 spin_lock(&ip
->i_mount
->m_perag_lock
);
1298 radix_tree_tag_set(&ip
->i_mount
->m_perag_tree
,
1299 XFS_INO_TO_AGNO(ip
->i_mount
, ip
->i_ino
),
1300 XFS_ICI_EOFBLOCKS_TAG
);
1301 spin_unlock(&ip
->i_mount
->m_perag_lock
);
1303 /* kick off background trimming */
1304 xfs_queue_eofblocks(ip
->i_mount
);
1306 trace_xfs_perag_set_eofblocks(ip
->i_mount
, pag
->pag_agno
,
1310 spin_unlock(&pag
->pag_ici_lock
);
1315 xfs_inode_clear_eofblocks_tag(
1318 struct xfs_mount
*mp
= ip
->i_mount
;
1319 struct xfs_perag
*pag
;
1321 pag
= xfs_perag_get(mp
, XFS_INO_TO_AGNO(mp
, ip
->i_ino
));
1322 spin_lock(&pag
->pag_ici_lock
);
1323 trace_xfs_inode_clear_eofblocks_tag(ip
);
1325 radix_tree_tag_clear(&pag
->pag_ici_root
,
1326 XFS_INO_TO_AGINO(ip
->i_mount
, ip
->i_ino
),
1327 XFS_ICI_EOFBLOCKS_TAG
);
1328 if (!radix_tree_tagged(&pag
->pag_ici_root
, XFS_ICI_EOFBLOCKS_TAG
)) {
1329 /* clear the eofblocks tag from the perag radix tree */
1330 spin_lock(&ip
->i_mount
->m_perag_lock
);
1331 radix_tree_tag_clear(&ip
->i_mount
->m_perag_tree
,
1332 XFS_INO_TO_AGNO(ip
->i_mount
, ip
->i_ino
),
1333 XFS_ICI_EOFBLOCKS_TAG
);
1334 spin_unlock(&ip
->i_mount
->m_perag_lock
);
1335 trace_xfs_perag_clear_eofblocks(ip
->i_mount
, pag
->pag_agno
,
1339 spin_unlock(&pag
->pag_ici_lock
);