diff options
author | Ryusuke Konishi <konishi.ryusuke@lab.ntt.co.jp> | 2009-11-28 12:39:11 -0500 |
---|---|---|
committer | Ryusuke Konishi <konishi.ryusuke@lab.ntt.co.jp> | 2009-11-28 12:50:46 -0500 |
commit | 0935db747739782fc779eb58529610c12db88ea2 (patch) | |
tree | 27df2a16a8eb06c0548ea8fd4feb28aa1cbc5e1b | |
parent | abdb318b79d387a723af5db2aa79f812cefd0797 (diff) |
nilfs2: use list_splice_tail or list_splice_tail_init
This applies list_splice_tail (or list_splice_tail_init) operation
instead of list_splice (or list_splice_init, respectively) to append a
new list to tail of an existing list.
Signed-off-by: Ryusuke Konishi <konishi.ryusuke@lab.ntt.co.jp>
-rw-r--r-- | fs/nilfs2/btree.c | 2 | ||||
-rw-r--r-- | fs/nilfs2/recovery.c | 2 | ||||
-rw-r--r-- | fs/nilfs2/segment.c | 4 |
3 files changed, 4 insertions, 4 deletions
diff --git a/fs/nilfs2/btree.c b/fs/nilfs2/btree.c index 139b113e8338..7cdd98b8d514 100644 --- a/fs/nilfs2/btree.c +++ b/fs/nilfs2/btree.c | |||
@@ -2018,7 +2018,7 @@ static void nilfs_btree_lookup_dirty_buffers(struct nilfs_bmap *bmap, | |||
2018 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; | 2018 | for (level = NILFS_BTREE_LEVEL_NODE_MIN; |
2019 | level < NILFS_BTREE_LEVEL_MAX; | 2019 | level < NILFS_BTREE_LEVEL_MAX; |
2020 | level++) | 2020 | level++) |
2021 | list_splice(&lists[level], listp->prev); | 2021 | list_splice_tail(&lists[level], listp); |
2022 | } | 2022 | } |
2023 | 2023 | ||
2024 | static int nilfs_btree_assign_p(struct nilfs_btree *btree, | 2024 | static int nilfs_btree_assign_p(struct nilfs_btree *btree, |
diff --git a/fs/nilfs2/recovery.c b/fs/nilfs2/recovery.c index 6d5412eff28f..c9c96c7825dc 100644 --- a/fs/nilfs2/recovery.c +++ b/fs/nilfs2/recovery.c | |||
@@ -925,7 +925,7 @@ int nilfs_search_super_root(struct the_nilfs *nilfs, struct nilfs_sb_info *sbi, | |||
925 | 925 | ||
926 | super_root_found: | 926 | super_root_found: |
927 | /* Updating pointers relating to the latest checkpoint */ | 927 | /* Updating pointers relating to the latest checkpoint */ |
928 | list_splice(&segments, ri->ri_used_segments.prev); | 928 | list_splice_tail(&segments, &ri->ri_used_segments); |
929 | nilfs->ns_last_pseg = sr_pseg_start; | 929 | nilfs->ns_last_pseg = sr_pseg_start; |
930 | nilfs->ns_last_seq = nilfs->ns_seg_seq; | 930 | nilfs->ns_last_seq = nilfs->ns_seg_seq; |
931 | nilfs->ns_last_cno = ri->ri_cno; | 931 | nilfs->ns_last_cno = ri->ri_cno; |
diff --git a/fs/nilfs2/segment.c b/fs/nilfs2/segment.c index 097f9c467fef..79acf4d66e88 100644 --- a/fs/nilfs2/segment.c +++ b/fs/nilfs2/segment.c | |||
@@ -1363,7 +1363,7 @@ static int nilfs_segctor_extend_segments(struct nilfs_sc_info *sci, | |||
1363 | list_add_tail(&segbuf->sb_list, &list); | 1363 | list_add_tail(&segbuf->sb_list, &list); |
1364 | prev = segbuf; | 1364 | prev = segbuf; |
1365 | } | 1365 | } |
1366 | list_splice(&list, sci->sc_segbufs.prev); | 1366 | list_splice_tail(&list, &sci->sc_segbufs); |
1367 | return 0; | 1367 | return 0; |
1368 | 1368 | ||
1369 | failed_segbuf: | 1369 | failed_segbuf: |
@@ -2532,7 +2532,7 @@ int nilfs_clean_segments(struct super_block *sb, struct nilfs_argv *argv, | |||
2532 | 2532 | ||
2533 | sci->sc_freesegs = kbufs[4]; | 2533 | sci->sc_freesegs = kbufs[4]; |
2534 | sci->sc_nfreesegs = argv[4].v_nmembs; | 2534 | sci->sc_nfreesegs = argv[4].v_nmembs; |
2535 | list_splice_init(&nilfs->ns_gc_inodes, sci->sc_gc_inodes.prev); | 2535 | list_splice_tail_init(&nilfs->ns_gc_inodes, &sci->sc_gc_inodes); |
2536 | 2536 | ||
2537 | for (;;) { | 2537 | for (;;) { |
2538 | nilfs_segctor_accept(sci, &req); | 2538 | nilfs_segctor_accept(sci, &req); |