2 * segment.c - NILFS segment constructor.
4 * Copyright (C) 2005-2008 Nippon Telegraph and Telephone Corporation.
6 * This program is free software; you can redistribute it and/or modify
7 * it under the terms of the GNU General Public License as published by
8 * the Free Software Foundation; either version 2 of the License, or
9 * (at your option) any later version.
11 * This program is distributed in the hope that it will be useful,
12 * but WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
14 * GNU General Public License for more details.
16 * You should have received a copy of the GNU General Public License
17 * along with this program; if not, write to the Free Software
18 * Foundation, Inc., 51 Franklin St, Fifth Floor, Boston, MA 02110-1301 USA
20 * Written by Ryusuke Konishi <ryusuke@osrg.net>
24 #include <linux/pagemap.h>
25 #include <linux/buffer_head.h>
26 #include <linux/writeback.h>
27 #include <linux/bio.h>
28 #include <linux/completion.h>
29 #include <linux/blkdev.h>
30 #include <linux/backing-dev.h>
31 #include <linux/freezer.h>
32 #include <linux/kthread.h>
33 #include <linux/crc32.h>
34 #include <linux/pagevec.h>
35 #include <linux/slab.h>
49 #define SC_N_INODEVEC 16 /* Size of locally allocated inode vector */
51 #define SC_MAX_SEGDELTA 64 /* Upper limit of the number of segments
52 appended in collection retry loop */
54 /* Construction mode */
56 SC_LSEG_SR
= 1, /* Make a logical segment having a super root */
57 SC_LSEG_DSYNC
, /* Flush data blocks of a given file and make
58 a logical segment without a super root */
59 SC_FLUSH_FILE
, /* Flush data files, leads to segment writes without
60 creating a checkpoint */
61 SC_FLUSH_DAT
, /* Flush DAT file. This also creates segments without
65 /* Stage numbers of dirty block collection */
68 NILFS_ST_GC
, /* Collecting dirty blocks for GC */
74 NILFS_ST_SR
, /* Super root */
75 NILFS_ST_DSYNC
, /* Data sync blocks */
79 /* State flags of collection */
80 #define NILFS_CF_NODE 0x0001 /* Collecting node blocks */
81 #define NILFS_CF_IFILE_STARTED 0x0002 /* IFILE stage has started */
82 #define NILFS_CF_SUFREED 0x0004 /* segment usages has been freed */
83 #define NILFS_CF_HISTORY_MASK (NILFS_CF_IFILE_STARTED | NILFS_CF_SUFREED)
85 /* Operations depending on the construction mode and file type */
86 struct nilfs_sc_operations
{
87 int (*collect_data
)(struct nilfs_sc_info
*, struct buffer_head
*,
89 int (*collect_node
)(struct nilfs_sc_info
*, struct buffer_head
*,
91 int (*collect_bmap
)(struct nilfs_sc_info
*, struct buffer_head
*,
93 void (*write_data_binfo
)(struct nilfs_sc_info
*,
94 struct nilfs_segsum_pointer
*,
96 void (*write_node_binfo
)(struct nilfs_sc_info
*,
97 struct nilfs_segsum_pointer
*,
104 static void nilfs_segctor_start_timer(struct nilfs_sc_info
*);
105 static void nilfs_segctor_do_flush(struct nilfs_sc_info
*, int);
106 static void nilfs_segctor_do_immediate_flush(struct nilfs_sc_info
*);
107 static void nilfs_dispose_list(struct the_nilfs
*, struct list_head
*, int);
109 #define nilfs_cnt32_gt(a, b) \
110 (typecheck(__u32, a) && typecheck(__u32, b) && \
111 ((__s32)(b) - (__s32)(a) < 0))
112 #define nilfs_cnt32_ge(a, b) \
113 (typecheck(__u32, a) && typecheck(__u32, b) && \
114 ((__s32)(a) - (__s32)(b) >= 0))
115 #define nilfs_cnt32_lt(a, b) nilfs_cnt32_gt(b, a)
116 #define nilfs_cnt32_le(a, b) nilfs_cnt32_ge(b, a)
118 static int nilfs_prepare_segment_lock(struct nilfs_transaction_info
*ti
)
120 struct nilfs_transaction_info
*cur_ti
= current
->journal_info
;
124 if (cur_ti
->ti_magic
== NILFS_TI_MAGIC
)
125 return ++cur_ti
->ti_count
;
128 * If journal_info field is occupied by other FS,
129 * it is saved and will be restored on
130 * nilfs_transaction_commit().
133 "NILFS warning: journal info from a different "
135 save
= current
->journal_info
;
139 ti
= kmem_cache_alloc(nilfs_transaction_cachep
, GFP_NOFS
);
142 ti
->ti_flags
= NILFS_TI_DYNAMIC_ALLOC
;
148 ti
->ti_magic
= NILFS_TI_MAGIC
;
149 current
->journal_info
= ti
;
154 * nilfs_transaction_begin - start indivisible file operations.
156 * @ti: nilfs_transaction_info
157 * @vacancy_check: flags for vacancy rate checks
159 * nilfs_transaction_begin() acquires a reader/writer semaphore, called
160 * the segment semaphore, to make a segment construction and write tasks
161 * exclusive. The function is used with nilfs_transaction_commit() in pairs.
162 * The region enclosed by these two functions can be nested. To avoid a
163 * deadlock, the semaphore is only acquired or released in the outermost call.
165 * This function allocates a nilfs_transaction_info struct to keep context
166 * information on it. It is initialized and hooked onto the current task in
167 * the outermost call. If a pre-allocated struct is given to @ti, it is used
168 * instead; otherwise a new struct is assigned from a slab.
170 * When @vacancy_check flag is set, this function will check the amount of
171 * free space, and will wait for the GC to reclaim disk space if low capacity.
173 * Return Value: On success, 0 is returned. On error, one of the following
174 * negative error code is returned.
176 * %-ENOMEM - Insufficient memory available.
178 * %-ENOSPC - No space left on device
180 int nilfs_transaction_begin(struct super_block
*sb
,
181 struct nilfs_transaction_info
*ti
,
184 struct the_nilfs
*nilfs
;
185 int ret
= nilfs_prepare_segment_lock(ti
);
187 if (unlikely(ret
< 0))
192 sb_start_intwrite(sb
);
194 nilfs
= sb
->s_fs_info
;
195 down_read(&nilfs
->ns_segctor_sem
);
196 if (vacancy_check
&& nilfs_near_disk_full(nilfs
)) {
197 up_read(&nilfs
->ns_segctor_sem
);
204 ti
= current
->journal_info
;
205 current
->journal_info
= ti
->ti_save
;
206 if (ti
->ti_flags
& NILFS_TI_DYNAMIC_ALLOC
)
207 kmem_cache_free(nilfs_transaction_cachep
, ti
);
213 * nilfs_transaction_commit - commit indivisible file operations.
216 * nilfs_transaction_commit() releases the read semaphore which is
217 * acquired by nilfs_transaction_begin(). This is only performed
218 * in outermost call of this function. If a commit flag is set,
219 * nilfs_transaction_commit() sets a timer to start the segment
220 * constructor. If a sync flag is set, it starts construction
223 int nilfs_transaction_commit(struct super_block
*sb
)
225 struct nilfs_transaction_info
*ti
= current
->journal_info
;
226 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
229 BUG_ON(ti
== NULL
|| ti
->ti_magic
!= NILFS_TI_MAGIC
);
230 ti
->ti_flags
|= NILFS_TI_COMMIT
;
231 if (ti
->ti_count
> 0) {
235 if (nilfs
->ns_writer
) {
236 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
238 if (ti
->ti_flags
& NILFS_TI_COMMIT
)
239 nilfs_segctor_start_timer(sci
);
240 if (atomic_read(&nilfs
->ns_ndirtyblks
) > sci
->sc_watermark
)
241 nilfs_segctor_do_flush(sci
, 0);
243 up_read(&nilfs
->ns_segctor_sem
);
244 current
->journal_info
= ti
->ti_save
;
246 if (ti
->ti_flags
& NILFS_TI_SYNC
)
247 err
= nilfs_construct_segment(sb
);
248 if (ti
->ti_flags
& NILFS_TI_DYNAMIC_ALLOC
)
249 kmem_cache_free(nilfs_transaction_cachep
, ti
);
254 void nilfs_transaction_abort(struct super_block
*sb
)
256 struct nilfs_transaction_info
*ti
= current
->journal_info
;
257 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
259 BUG_ON(ti
== NULL
|| ti
->ti_magic
!= NILFS_TI_MAGIC
);
260 if (ti
->ti_count
> 0) {
264 up_read(&nilfs
->ns_segctor_sem
);
266 current
->journal_info
= ti
->ti_save
;
267 if (ti
->ti_flags
& NILFS_TI_DYNAMIC_ALLOC
)
268 kmem_cache_free(nilfs_transaction_cachep
, ti
);
272 void nilfs_relax_pressure_in_lock(struct super_block
*sb
)
274 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
275 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
277 if (!sci
|| !sci
->sc_flush_request
)
280 set_bit(NILFS_SC_PRIOR_FLUSH
, &sci
->sc_flags
);
281 up_read(&nilfs
->ns_segctor_sem
);
283 down_write(&nilfs
->ns_segctor_sem
);
284 if (sci
->sc_flush_request
&&
285 test_bit(NILFS_SC_PRIOR_FLUSH
, &sci
->sc_flags
)) {
286 struct nilfs_transaction_info
*ti
= current
->journal_info
;
288 ti
->ti_flags
|= NILFS_TI_WRITER
;
289 nilfs_segctor_do_immediate_flush(sci
);
290 ti
->ti_flags
&= ~NILFS_TI_WRITER
;
292 downgrade_write(&nilfs
->ns_segctor_sem
);
295 static void nilfs_transaction_lock(struct super_block
*sb
,
296 struct nilfs_transaction_info
*ti
,
299 struct nilfs_transaction_info
*cur_ti
= current
->journal_info
;
300 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
301 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
304 ti
->ti_flags
= NILFS_TI_WRITER
;
306 ti
->ti_save
= cur_ti
;
307 ti
->ti_magic
= NILFS_TI_MAGIC
;
308 INIT_LIST_HEAD(&ti
->ti_garbage
);
309 current
->journal_info
= ti
;
312 down_write(&nilfs
->ns_segctor_sem
);
313 if (!test_bit(NILFS_SC_PRIOR_FLUSH
, &sci
->sc_flags
))
316 nilfs_segctor_do_immediate_flush(sci
);
318 up_write(&nilfs
->ns_segctor_sem
);
322 ti
->ti_flags
|= NILFS_TI_GC
;
325 static void nilfs_transaction_unlock(struct super_block
*sb
)
327 struct nilfs_transaction_info
*ti
= current
->journal_info
;
328 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
330 BUG_ON(ti
== NULL
|| ti
->ti_magic
!= NILFS_TI_MAGIC
);
331 BUG_ON(ti
->ti_count
> 0);
333 up_write(&nilfs
->ns_segctor_sem
);
334 current
->journal_info
= ti
->ti_save
;
335 if (!list_empty(&ti
->ti_garbage
))
336 nilfs_dispose_list(nilfs
, &ti
->ti_garbage
, 0);
339 static void *nilfs_segctor_map_segsum_entry(struct nilfs_sc_info
*sci
,
340 struct nilfs_segsum_pointer
*ssp
,
343 struct nilfs_segment_buffer
*segbuf
= sci
->sc_curseg
;
344 unsigned blocksize
= sci
->sc_super
->s_blocksize
;
347 if (unlikely(ssp
->offset
+ bytes
> blocksize
)) {
349 BUG_ON(NILFS_SEGBUF_BH_IS_LAST(ssp
->bh
,
350 &segbuf
->sb_segsum_buffers
));
351 ssp
->bh
= NILFS_SEGBUF_NEXT_BH(ssp
->bh
);
353 p
= ssp
->bh
->b_data
+ ssp
->offset
;
354 ssp
->offset
+= bytes
;
359 * nilfs_segctor_reset_segment_buffer - reset the current segment buffer
360 * @sci: nilfs_sc_info
362 static int nilfs_segctor_reset_segment_buffer(struct nilfs_sc_info
*sci
)
364 struct nilfs_segment_buffer
*segbuf
= sci
->sc_curseg
;
365 struct buffer_head
*sumbh
;
370 if (nilfs_doing_gc())
372 err
= nilfs_segbuf_reset(segbuf
, flags
, sci
->sc_seg_ctime
, sci
->sc_cno
);
376 sumbh
= NILFS_SEGBUF_FIRST_BH(&segbuf
->sb_segsum_buffers
);
377 sumbytes
= segbuf
->sb_sum
.sumbytes
;
378 sci
->sc_finfo_ptr
.bh
= sumbh
; sci
->sc_finfo_ptr
.offset
= sumbytes
;
379 sci
->sc_binfo_ptr
.bh
= sumbh
; sci
->sc_binfo_ptr
.offset
= sumbytes
;
380 sci
->sc_blk_cnt
= sci
->sc_datablk_cnt
= 0;
384 static int nilfs_segctor_feed_segment(struct nilfs_sc_info
*sci
)
386 sci
->sc_nblk_this_inc
+= sci
->sc_curseg
->sb_sum
.nblocks
;
387 if (NILFS_SEGBUF_IS_LAST(sci
->sc_curseg
, &sci
->sc_segbufs
))
388 return -E2BIG
; /* The current segment is filled up
390 sci
->sc_curseg
= NILFS_NEXT_SEGBUF(sci
->sc_curseg
);
391 return nilfs_segctor_reset_segment_buffer(sci
);
394 static int nilfs_segctor_add_super_root(struct nilfs_sc_info
*sci
)
396 struct nilfs_segment_buffer
*segbuf
= sci
->sc_curseg
;
399 if (segbuf
->sb_sum
.nblocks
>= segbuf
->sb_rest_blocks
) {
400 err
= nilfs_segctor_feed_segment(sci
);
403 segbuf
= sci
->sc_curseg
;
405 err
= nilfs_segbuf_extend_payload(segbuf
, &segbuf
->sb_super_root
);
407 segbuf
->sb_sum
.flags
|= NILFS_SS_SR
;
412 * Functions for making segment summary and payloads
414 static int nilfs_segctor_segsum_block_required(
415 struct nilfs_sc_info
*sci
, const struct nilfs_segsum_pointer
*ssp
,
418 unsigned blocksize
= sci
->sc_super
->s_blocksize
;
419 /* Size of finfo and binfo is enough small against blocksize */
421 return ssp
->offset
+ binfo_size
+
422 (!sci
->sc_blk_cnt
? sizeof(struct nilfs_finfo
) : 0) >
426 static void nilfs_segctor_begin_finfo(struct nilfs_sc_info
*sci
,
429 sci
->sc_curseg
->sb_sum
.nfinfo
++;
430 sci
->sc_binfo_ptr
= sci
->sc_finfo_ptr
;
431 nilfs_segctor_map_segsum_entry(
432 sci
, &sci
->sc_binfo_ptr
, sizeof(struct nilfs_finfo
));
434 if (NILFS_I(inode
)->i_root
&&
435 !test_bit(NILFS_SC_HAVE_DELTA
, &sci
->sc_flags
))
436 set_bit(NILFS_SC_HAVE_DELTA
, &sci
->sc_flags
);
440 static void nilfs_segctor_end_finfo(struct nilfs_sc_info
*sci
,
443 struct nilfs_finfo
*finfo
;
444 struct nilfs_inode_info
*ii
;
445 struct nilfs_segment_buffer
*segbuf
;
448 if (sci
->sc_blk_cnt
== 0)
453 if (test_bit(NILFS_I_GCINODE
, &ii
->i_state
))
455 else if (NILFS_ROOT_METADATA_FILE(inode
->i_ino
))
460 finfo
= nilfs_segctor_map_segsum_entry(sci
, &sci
->sc_finfo_ptr
,
462 finfo
->fi_ino
= cpu_to_le64(inode
->i_ino
);
463 finfo
->fi_nblocks
= cpu_to_le32(sci
->sc_blk_cnt
);
464 finfo
->fi_ndatablk
= cpu_to_le32(sci
->sc_datablk_cnt
);
465 finfo
->fi_cno
= cpu_to_le64(cno
);
467 segbuf
= sci
->sc_curseg
;
468 segbuf
->sb_sum
.sumbytes
= sci
->sc_binfo_ptr
.offset
+
469 sci
->sc_super
->s_blocksize
* (segbuf
->sb_sum
.nsumblk
- 1);
470 sci
->sc_finfo_ptr
= sci
->sc_binfo_ptr
;
471 sci
->sc_blk_cnt
= sci
->sc_datablk_cnt
= 0;
474 static int nilfs_segctor_add_file_block(struct nilfs_sc_info
*sci
,
475 struct buffer_head
*bh
,
479 struct nilfs_segment_buffer
*segbuf
;
480 int required
, err
= 0;
483 segbuf
= sci
->sc_curseg
;
484 required
= nilfs_segctor_segsum_block_required(
485 sci
, &sci
->sc_binfo_ptr
, binfo_size
);
486 if (segbuf
->sb_sum
.nblocks
+ required
+ 1 > segbuf
->sb_rest_blocks
) {
487 nilfs_segctor_end_finfo(sci
, inode
);
488 err
= nilfs_segctor_feed_segment(sci
);
493 if (unlikely(required
)) {
494 err
= nilfs_segbuf_extend_segsum(segbuf
);
498 if (sci
->sc_blk_cnt
== 0)
499 nilfs_segctor_begin_finfo(sci
, inode
);
501 nilfs_segctor_map_segsum_entry(sci
, &sci
->sc_binfo_ptr
, binfo_size
);
502 /* Substitution to vblocknr is delayed until update_blocknr() */
503 nilfs_segbuf_add_file_buffer(segbuf
, bh
);
510 * Callback functions that enumerate, mark, and collect dirty blocks
512 static int nilfs_collect_file_data(struct nilfs_sc_info
*sci
,
513 struct buffer_head
*bh
, struct inode
*inode
)
517 err
= nilfs_bmap_propagate(NILFS_I(inode
)->i_bmap
, bh
);
521 err
= nilfs_segctor_add_file_block(sci
, bh
, inode
,
522 sizeof(struct nilfs_binfo_v
));
524 sci
->sc_datablk_cnt
++;
528 static int nilfs_collect_file_node(struct nilfs_sc_info
*sci
,
529 struct buffer_head
*bh
,
532 return nilfs_bmap_propagate(NILFS_I(inode
)->i_bmap
, bh
);
535 static int nilfs_collect_file_bmap(struct nilfs_sc_info
*sci
,
536 struct buffer_head
*bh
,
539 WARN_ON(!buffer_dirty(bh
));
540 return nilfs_segctor_add_file_block(sci
, bh
, inode
, sizeof(__le64
));
543 static void nilfs_write_file_data_binfo(struct nilfs_sc_info
*sci
,
544 struct nilfs_segsum_pointer
*ssp
,
545 union nilfs_binfo
*binfo
)
547 struct nilfs_binfo_v
*binfo_v
= nilfs_segctor_map_segsum_entry(
548 sci
, ssp
, sizeof(*binfo_v
));
549 *binfo_v
= binfo
->bi_v
;
552 static void nilfs_write_file_node_binfo(struct nilfs_sc_info
*sci
,
553 struct nilfs_segsum_pointer
*ssp
,
554 union nilfs_binfo
*binfo
)
556 __le64
*vblocknr
= nilfs_segctor_map_segsum_entry(
557 sci
, ssp
, sizeof(*vblocknr
));
558 *vblocknr
= binfo
->bi_v
.bi_vblocknr
;
561 static struct nilfs_sc_operations nilfs_sc_file_ops
= {
562 .collect_data
= nilfs_collect_file_data
,
563 .collect_node
= nilfs_collect_file_node
,
564 .collect_bmap
= nilfs_collect_file_bmap
,
565 .write_data_binfo
= nilfs_write_file_data_binfo
,
566 .write_node_binfo
= nilfs_write_file_node_binfo
,
569 static int nilfs_collect_dat_data(struct nilfs_sc_info
*sci
,
570 struct buffer_head
*bh
, struct inode
*inode
)
574 err
= nilfs_bmap_propagate(NILFS_I(inode
)->i_bmap
, bh
);
578 err
= nilfs_segctor_add_file_block(sci
, bh
, inode
, sizeof(__le64
));
580 sci
->sc_datablk_cnt
++;
584 static int nilfs_collect_dat_bmap(struct nilfs_sc_info
*sci
,
585 struct buffer_head
*bh
, struct inode
*inode
)
587 WARN_ON(!buffer_dirty(bh
));
588 return nilfs_segctor_add_file_block(sci
, bh
, inode
,
589 sizeof(struct nilfs_binfo_dat
));
592 static void nilfs_write_dat_data_binfo(struct nilfs_sc_info
*sci
,
593 struct nilfs_segsum_pointer
*ssp
,
594 union nilfs_binfo
*binfo
)
596 __le64
*blkoff
= nilfs_segctor_map_segsum_entry(sci
, ssp
,
598 *blkoff
= binfo
->bi_dat
.bi_blkoff
;
601 static void nilfs_write_dat_node_binfo(struct nilfs_sc_info
*sci
,
602 struct nilfs_segsum_pointer
*ssp
,
603 union nilfs_binfo
*binfo
)
605 struct nilfs_binfo_dat
*binfo_dat
=
606 nilfs_segctor_map_segsum_entry(sci
, ssp
, sizeof(*binfo_dat
));
607 *binfo_dat
= binfo
->bi_dat
;
610 static struct nilfs_sc_operations nilfs_sc_dat_ops
= {
611 .collect_data
= nilfs_collect_dat_data
,
612 .collect_node
= nilfs_collect_file_node
,
613 .collect_bmap
= nilfs_collect_dat_bmap
,
614 .write_data_binfo
= nilfs_write_dat_data_binfo
,
615 .write_node_binfo
= nilfs_write_dat_node_binfo
,
618 static struct nilfs_sc_operations nilfs_sc_dsync_ops
= {
619 .collect_data
= nilfs_collect_file_data
,
620 .collect_node
= NULL
,
621 .collect_bmap
= NULL
,
622 .write_data_binfo
= nilfs_write_file_data_binfo
,
623 .write_node_binfo
= NULL
,
626 static size_t nilfs_lookup_dirty_data_buffers(struct inode
*inode
,
627 struct list_head
*listp
,
629 loff_t start
, loff_t end
)
631 struct address_space
*mapping
= inode
->i_mapping
;
633 pgoff_t index
= 0, last
= ULONG_MAX
;
637 if (unlikely(start
!= 0 || end
!= LLONG_MAX
)) {
639 * A valid range is given for sync-ing data pages. The
640 * range is rounded to per-page; extra dirty buffers
641 * may be included if blocksize < pagesize.
643 index
= start
>> PAGE_SHIFT
;
644 last
= end
>> PAGE_SHIFT
;
646 pagevec_init(&pvec
, 0);
648 if (unlikely(index
> last
) ||
649 !pagevec_lookup_tag(&pvec
, mapping
, &index
, PAGECACHE_TAG_DIRTY
,
650 min_t(pgoff_t
, last
- index
,
651 PAGEVEC_SIZE
- 1) + 1))
654 for (i
= 0; i
< pagevec_count(&pvec
); i
++) {
655 struct buffer_head
*bh
, *head
;
656 struct page
*page
= pvec
.pages
[i
];
658 if (unlikely(page
->index
> last
))
662 if (!page_has_buffers(page
))
663 create_empty_buffers(page
, 1 << inode
->i_blkbits
, 0);
666 bh
= head
= page_buffers(page
);
668 if (!buffer_dirty(bh
))
671 list_add_tail(&bh
->b_assoc_buffers
, listp
);
673 if (unlikely(ndirties
>= nlimit
)) {
674 pagevec_release(&pvec
);
678 } while (bh
= bh
->b_this_page
, bh
!= head
);
680 pagevec_release(&pvec
);
685 static void nilfs_lookup_dirty_node_buffers(struct inode
*inode
,
686 struct list_head
*listp
)
688 struct nilfs_inode_info
*ii
= NILFS_I(inode
);
689 struct address_space
*mapping
= &ii
->i_btnode_cache
;
691 struct buffer_head
*bh
, *head
;
695 pagevec_init(&pvec
, 0);
697 while (pagevec_lookup_tag(&pvec
, mapping
, &index
, PAGECACHE_TAG_DIRTY
,
699 for (i
= 0; i
< pagevec_count(&pvec
); i
++) {
700 bh
= head
= page_buffers(pvec
.pages
[i
]);
702 if (buffer_dirty(bh
)) {
704 list_add_tail(&bh
->b_assoc_buffers
,
707 bh
= bh
->b_this_page
;
708 } while (bh
!= head
);
710 pagevec_release(&pvec
);
715 static void nilfs_dispose_list(struct the_nilfs
*nilfs
,
716 struct list_head
*head
, int force
)
718 struct nilfs_inode_info
*ii
, *n
;
719 struct nilfs_inode_info
*ivec
[SC_N_INODEVEC
], **pii
;
722 while (!list_empty(head
)) {
723 spin_lock(&nilfs
->ns_inode_lock
);
724 list_for_each_entry_safe(ii
, n
, head
, i_dirty
) {
725 list_del_init(&ii
->i_dirty
);
727 if (unlikely(ii
->i_bh
)) {
731 } else if (test_bit(NILFS_I_DIRTY
, &ii
->i_state
)) {
732 set_bit(NILFS_I_QUEUED
, &ii
->i_state
);
733 list_add_tail(&ii
->i_dirty
,
734 &nilfs
->ns_dirty_files
);
738 if (nv
== SC_N_INODEVEC
)
741 spin_unlock(&nilfs
->ns_inode_lock
);
743 for (pii
= ivec
; nv
> 0; pii
++, nv
--)
744 iput(&(*pii
)->vfs_inode
);
748 static int nilfs_test_metadata_dirty(struct the_nilfs
*nilfs
,
749 struct nilfs_root
*root
)
753 if (nilfs_mdt_fetch_dirty(root
->ifile
))
755 if (nilfs_mdt_fetch_dirty(nilfs
->ns_cpfile
))
757 if (nilfs_mdt_fetch_dirty(nilfs
->ns_sufile
))
759 if ((ret
|| nilfs_doing_gc()) && nilfs_mdt_fetch_dirty(nilfs
->ns_dat
))
764 static int nilfs_segctor_clean(struct nilfs_sc_info
*sci
)
766 return list_empty(&sci
->sc_dirty_files
) &&
767 !test_bit(NILFS_SC_DIRTY
, &sci
->sc_flags
) &&
768 sci
->sc_nfreesegs
== 0 &&
769 (!nilfs_doing_gc() || list_empty(&sci
->sc_gc_inodes
));
772 static int nilfs_segctor_confirm(struct nilfs_sc_info
*sci
)
774 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
777 if (nilfs_test_metadata_dirty(nilfs
, sci
->sc_root
))
778 set_bit(NILFS_SC_DIRTY
, &sci
->sc_flags
);
780 spin_lock(&nilfs
->ns_inode_lock
);
781 if (list_empty(&nilfs
->ns_dirty_files
) && nilfs_segctor_clean(sci
))
784 spin_unlock(&nilfs
->ns_inode_lock
);
788 static void nilfs_segctor_clear_metadata_dirty(struct nilfs_sc_info
*sci
)
790 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
792 nilfs_mdt_clear_dirty(sci
->sc_root
->ifile
);
793 nilfs_mdt_clear_dirty(nilfs
->ns_cpfile
);
794 nilfs_mdt_clear_dirty(nilfs
->ns_sufile
);
795 nilfs_mdt_clear_dirty(nilfs
->ns_dat
);
798 static int nilfs_segctor_create_checkpoint(struct nilfs_sc_info
*sci
)
800 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
801 struct buffer_head
*bh_cp
;
802 struct nilfs_checkpoint
*raw_cp
;
805 /* XXX: this interface will be changed */
806 err
= nilfs_cpfile_get_checkpoint(nilfs
->ns_cpfile
, nilfs
->ns_cno
, 1,
809 /* The following code is duplicated with cpfile. But, it is
810 needed to collect the checkpoint even if it was not newly
812 mark_buffer_dirty(bh_cp
);
813 nilfs_mdt_mark_dirty(nilfs
->ns_cpfile
);
814 nilfs_cpfile_put_checkpoint(
815 nilfs
->ns_cpfile
, nilfs
->ns_cno
, bh_cp
);
817 WARN_ON(err
== -EINVAL
|| err
== -ENOENT
);
822 static int nilfs_segctor_fill_in_checkpoint(struct nilfs_sc_info
*sci
)
824 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
825 struct buffer_head
*bh_cp
;
826 struct nilfs_checkpoint
*raw_cp
;
829 err
= nilfs_cpfile_get_checkpoint(nilfs
->ns_cpfile
, nilfs
->ns_cno
, 0,
832 WARN_ON(err
== -EINVAL
|| err
== -ENOENT
);
835 raw_cp
->cp_snapshot_list
.ssl_next
= 0;
836 raw_cp
->cp_snapshot_list
.ssl_prev
= 0;
837 raw_cp
->cp_inodes_count
=
838 cpu_to_le64(atomic_read(&sci
->sc_root
->inodes_count
));
839 raw_cp
->cp_blocks_count
=
840 cpu_to_le64(atomic_read(&sci
->sc_root
->blocks_count
));
841 raw_cp
->cp_nblk_inc
=
842 cpu_to_le64(sci
->sc_nblk_inc
+ sci
->sc_nblk_this_inc
);
843 raw_cp
->cp_create
= cpu_to_le64(sci
->sc_seg_ctime
);
844 raw_cp
->cp_cno
= cpu_to_le64(nilfs
->ns_cno
);
846 if (test_bit(NILFS_SC_HAVE_DELTA
, &sci
->sc_flags
))
847 nilfs_checkpoint_clear_minor(raw_cp
);
849 nilfs_checkpoint_set_minor(raw_cp
);
851 nilfs_write_inode_common(sci
->sc_root
->ifile
,
852 &raw_cp
->cp_ifile_inode
, 1);
853 nilfs_cpfile_put_checkpoint(nilfs
->ns_cpfile
, nilfs
->ns_cno
, bh_cp
);
860 static void nilfs_fill_in_file_bmap(struct inode
*ifile
,
861 struct nilfs_inode_info
*ii
)
864 struct buffer_head
*ibh
;
865 struct nilfs_inode
*raw_inode
;
867 if (test_bit(NILFS_I_BMAP
, &ii
->i_state
)) {
870 raw_inode
= nilfs_ifile_map_inode(ifile
, ii
->vfs_inode
.i_ino
,
872 nilfs_bmap_write(ii
->i_bmap
, raw_inode
);
873 nilfs_ifile_unmap_inode(ifile
, ii
->vfs_inode
.i_ino
, ibh
);
877 static void nilfs_segctor_fill_in_file_bmap(struct nilfs_sc_info
*sci
)
879 struct nilfs_inode_info
*ii
;
881 list_for_each_entry(ii
, &sci
->sc_dirty_files
, i_dirty
) {
882 nilfs_fill_in_file_bmap(sci
->sc_root
->ifile
, ii
);
883 set_bit(NILFS_I_COLLECTED
, &ii
->i_state
);
887 static void nilfs_segctor_fill_in_super_root(struct nilfs_sc_info
*sci
,
888 struct the_nilfs
*nilfs
)
890 struct buffer_head
*bh_sr
;
891 struct nilfs_super_root
*raw_sr
;
894 bh_sr
= NILFS_LAST_SEGBUF(&sci
->sc_segbufs
)->sb_super_root
;
895 raw_sr
= (struct nilfs_super_root
*)bh_sr
->b_data
;
896 isz
= nilfs
->ns_inode_size
;
897 srsz
= NILFS_SR_BYTES(isz
);
899 raw_sr
->sr_bytes
= cpu_to_le16(srsz
);
900 raw_sr
->sr_nongc_ctime
901 = cpu_to_le64(nilfs_doing_gc() ?
902 nilfs
->ns_nongc_ctime
: sci
->sc_seg_ctime
);
903 raw_sr
->sr_flags
= 0;
905 nilfs_write_inode_common(nilfs
->ns_dat
, (void *)raw_sr
+
906 NILFS_SR_DAT_OFFSET(isz
), 1);
907 nilfs_write_inode_common(nilfs
->ns_cpfile
, (void *)raw_sr
+
908 NILFS_SR_CPFILE_OFFSET(isz
), 1);
909 nilfs_write_inode_common(nilfs
->ns_sufile
, (void *)raw_sr
+
910 NILFS_SR_SUFILE_OFFSET(isz
), 1);
911 memset((void *)raw_sr
+ srsz
, 0, nilfs
->ns_blocksize
- srsz
);
914 static void nilfs_redirty_inodes(struct list_head
*head
)
916 struct nilfs_inode_info
*ii
;
918 list_for_each_entry(ii
, head
, i_dirty
) {
919 if (test_bit(NILFS_I_COLLECTED
, &ii
->i_state
))
920 clear_bit(NILFS_I_COLLECTED
, &ii
->i_state
);
924 static void nilfs_drop_collected_inodes(struct list_head
*head
)
926 struct nilfs_inode_info
*ii
;
928 list_for_each_entry(ii
, head
, i_dirty
) {
929 if (!test_and_clear_bit(NILFS_I_COLLECTED
, &ii
->i_state
))
932 clear_bit(NILFS_I_INODE_DIRTY
, &ii
->i_state
);
933 set_bit(NILFS_I_UPDATED
, &ii
->i_state
);
937 static int nilfs_segctor_apply_buffers(struct nilfs_sc_info
*sci
,
939 struct list_head
*listp
,
940 int (*collect
)(struct nilfs_sc_info
*,
941 struct buffer_head
*,
944 struct buffer_head
*bh
, *n
;
948 list_for_each_entry_safe(bh
, n
, listp
, b_assoc_buffers
) {
949 list_del_init(&bh
->b_assoc_buffers
);
950 err
= collect(sci
, bh
, inode
);
953 goto dispose_buffers
;
959 while (!list_empty(listp
)) {
960 bh
= list_first_entry(listp
, struct buffer_head
,
962 list_del_init(&bh
->b_assoc_buffers
);
968 static size_t nilfs_segctor_buffer_rest(struct nilfs_sc_info
*sci
)
970 /* Remaining number of blocks within segment buffer */
971 return sci
->sc_segbuf_nblocks
-
972 (sci
->sc_nblk_this_inc
+ sci
->sc_curseg
->sb_sum
.nblocks
);
975 static int nilfs_segctor_scan_file(struct nilfs_sc_info
*sci
,
977 struct nilfs_sc_operations
*sc_ops
)
979 LIST_HEAD(data_buffers
);
980 LIST_HEAD(node_buffers
);
983 if (!(sci
->sc_stage
.flags
& NILFS_CF_NODE
)) {
984 size_t n
, rest
= nilfs_segctor_buffer_rest(sci
);
986 n
= nilfs_lookup_dirty_data_buffers(
987 inode
, &data_buffers
, rest
+ 1, 0, LLONG_MAX
);
989 err
= nilfs_segctor_apply_buffers(
990 sci
, inode
, &data_buffers
,
991 sc_ops
->collect_data
);
992 BUG_ON(!err
); /* always receive -E2BIG or true error */
996 nilfs_lookup_dirty_node_buffers(inode
, &node_buffers
);
998 if (!(sci
->sc_stage
.flags
& NILFS_CF_NODE
)) {
999 err
= nilfs_segctor_apply_buffers(
1000 sci
, inode
, &data_buffers
, sc_ops
->collect_data
);
1001 if (unlikely(err
)) {
1002 /* dispose node list */
1003 nilfs_segctor_apply_buffers(
1004 sci
, inode
, &node_buffers
, NULL
);
1007 sci
->sc_stage
.flags
|= NILFS_CF_NODE
;
1010 err
= nilfs_segctor_apply_buffers(
1011 sci
, inode
, &node_buffers
, sc_ops
->collect_node
);
1015 nilfs_bmap_lookup_dirty_buffers(NILFS_I(inode
)->i_bmap
, &node_buffers
);
1016 err
= nilfs_segctor_apply_buffers(
1017 sci
, inode
, &node_buffers
, sc_ops
->collect_bmap
);
1021 nilfs_segctor_end_finfo(sci
, inode
);
1022 sci
->sc_stage
.flags
&= ~NILFS_CF_NODE
;
1028 static int nilfs_segctor_scan_file_dsync(struct nilfs_sc_info
*sci
,
1029 struct inode
*inode
)
1031 LIST_HEAD(data_buffers
);
1032 size_t n
, rest
= nilfs_segctor_buffer_rest(sci
);
1035 n
= nilfs_lookup_dirty_data_buffers(inode
, &data_buffers
, rest
+ 1,
1036 sci
->sc_dsync_start
,
1039 err
= nilfs_segctor_apply_buffers(sci
, inode
, &data_buffers
,
1040 nilfs_collect_file_data
);
1042 nilfs_segctor_end_finfo(sci
, inode
);
1044 /* always receive -E2BIG or true error if n > rest */
1049 static int nilfs_segctor_collect_blocks(struct nilfs_sc_info
*sci
, int mode
)
1051 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
1052 struct list_head
*head
;
1053 struct nilfs_inode_info
*ii
;
1057 switch (sci
->sc_stage
.scnt
) {
1060 sci
->sc_stage
.flags
= 0;
1062 if (!test_bit(NILFS_SC_UNCLOSED
, &sci
->sc_flags
)) {
1063 sci
->sc_nblk_inc
= 0;
1064 sci
->sc_curseg
->sb_sum
.flags
= NILFS_SS_LOGBGN
;
1065 if (mode
== SC_LSEG_DSYNC
) {
1066 sci
->sc_stage
.scnt
= NILFS_ST_DSYNC
;
1071 sci
->sc_stage
.dirty_file_ptr
= NULL
;
1072 sci
->sc_stage
.gc_inode_ptr
= NULL
;
1073 if (mode
== SC_FLUSH_DAT
) {
1074 sci
->sc_stage
.scnt
= NILFS_ST_DAT
;
1077 sci
->sc_stage
.scnt
++; /* Fall through */
1079 if (nilfs_doing_gc()) {
1080 head
= &sci
->sc_gc_inodes
;
1081 ii
= list_prepare_entry(sci
->sc_stage
.gc_inode_ptr
,
1083 list_for_each_entry_continue(ii
, head
, i_dirty
) {
1084 err
= nilfs_segctor_scan_file(
1085 sci
, &ii
->vfs_inode
,
1086 &nilfs_sc_file_ops
);
1087 if (unlikely(err
)) {
1088 sci
->sc_stage
.gc_inode_ptr
= list_entry(
1090 struct nilfs_inode_info
,
1094 set_bit(NILFS_I_COLLECTED
, &ii
->i_state
);
1096 sci
->sc_stage
.gc_inode_ptr
= NULL
;
1098 sci
->sc_stage
.scnt
++; /* Fall through */
1100 head
= &sci
->sc_dirty_files
;
1101 ii
= list_prepare_entry(sci
->sc_stage
.dirty_file_ptr
, head
,
1103 list_for_each_entry_continue(ii
, head
, i_dirty
) {
1104 clear_bit(NILFS_I_DIRTY
, &ii
->i_state
);
1106 err
= nilfs_segctor_scan_file(sci
, &ii
->vfs_inode
,
1107 &nilfs_sc_file_ops
);
1108 if (unlikely(err
)) {
1109 sci
->sc_stage
.dirty_file_ptr
=
1110 list_entry(ii
->i_dirty
.prev
,
1111 struct nilfs_inode_info
,
1115 /* sci->sc_stage.dirty_file_ptr = NILFS_I(inode); */
1116 /* XXX: required ? */
1118 sci
->sc_stage
.dirty_file_ptr
= NULL
;
1119 if (mode
== SC_FLUSH_FILE
) {
1120 sci
->sc_stage
.scnt
= NILFS_ST_DONE
;
1123 sci
->sc_stage
.scnt
++;
1124 sci
->sc_stage
.flags
|= NILFS_CF_IFILE_STARTED
;
1126 case NILFS_ST_IFILE
:
1127 err
= nilfs_segctor_scan_file(sci
, sci
->sc_root
->ifile
,
1128 &nilfs_sc_file_ops
);
1131 sci
->sc_stage
.scnt
++;
1132 /* Creating a checkpoint */
1133 err
= nilfs_segctor_create_checkpoint(sci
);
1137 case NILFS_ST_CPFILE
:
1138 err
= nilfs_segctor_scan_file(sci
, nilfs
->ns_cpfile
,
1139 &nilfs_sc_file_ops
);
1142 sci
->sc_stage
.scnt
++; /* Fall through */
1143 case NILFS_ST_SUFILE
:
1144 err
= nilfs_sufile_freev(nilfs
->ns_sufile
, sci
->sc_freesegs
,
1145 sci
->sc_nfreesegs
, &ndone
);
1146 if (unlikely(err
)) {
1147 nilfs_sufile_cancel_freev(nilfs
->ns_sufile
,
1148 sci
->sc_freesegs
, ndone
,
1152 sci
->sc_stage
.flags
|= NILFS_CF_SUFREED
;
1154 err
= nilfs_segctor_scan_file(sci
, nilfs
->ns_sufile
,
1155 &nilfs_sc_file_ops
);
1158 sci
->sc_stage
.scnt
++; /* Fall through */
1161 err
= nilfs_segctor_scan_file(sci
, nilfs
->ns_dat
,
1165 if (mode
== SC_FLUSH_DAT
) {
1166 sci
->sc_stage
.scnt
= NILFS_ST_DONE
;
1169 sci
->sc_stage
.scnt
++; /* Fall through */
1171 if (mode
== SC_LSEG_SR
) {
1172 /* Appending a super root */
1173 err
= nilfs_segctor_add_super_root(sci
);
1177 /* End of a logical segment */
1178 sci
->sc_curseg
->sb_sum
.flags
|= NILFS_SS_LOGEND
;
1179 sci
->sc_stage
.scnt
= NILFS_ST_DONE
;
1181 case NILFS_ST_DSYNC
:
1183 sci
->sc_curseg
->sb_sum
.flags
|= NILFS_SS_SYNDT
;
1184 ii
= sci
->sc_dsync_inode
;
1185 if (!test_bit(NILFS_I_BUSY
, &ii
->i_state
))
1188 err
= nilfs_segctor_scan_file_dsync(sci
, &ii
->vfs_inode
);
1191 sci
->sc_curseg
->sb_sum
.flags
|= NILFS_SS_LOGEND
;
1192 sci
->sc_stage
.scnt
= NILFS_ST_DONE
;
1205 * nilfs_segctor_begin_construction - setup segment buffer to make a new log
1206 * @sci: nilfs_sc_info
1207 * @nilfs: nilfs object
1209 static int nilfs_segctor_begin_construction(struct nilfs_sc_info
*sci
,
1210 struct the_nilfs
*nilfs
)
1212 struct nilfs_segment_buffer
*segbuf
, *prev
;
1216 segbuf
= nilfs_segbuf_new(sci
->sc_super
);
1217 if (unlikely(!segbuf
))
1220 if (list_empty(&sci
->sc_write_logs
)) {
1221 nilfs_segbuf_map(segbuf
, nilfs
->ns_segnum
,
1222 nilfs
->ns_pseg_offset
, nilfs
);
1223 if (segbuf
->sb_rest_blocks
< NILFS_PSEG_MIN_BLOCKS
) {
1224 nilfs_shift_to_next_segment(nilfs
);
1225 nilfs_segbuf_map(segbuf
, nilfs
->ns_segnum
, 0, nilfs
);
1228 segbuf
->sb_sum
.seg_seq
= nilfs
->ns_seg_seq
;
1229 nextnum
= nilfs
->ns_nextnum
;
1231 if (nilfs
->ns_segnum
== nilfs
->ns_nextnum
)
1232 /* Start from the head of a new full segment */
1236 prev
= NILFS_LAST_SEGBUF(&sci
->sc_write_logs
);
1237 nilfs_segbuf_map_cont(segbuf
, prev
);
1238 segbuf
->sb_sum
.seg_seq
= prev
->sb_sum
.seg_seq
;
1239 nextnum
= prev
->sb_nextnum
;
1241 if (segbuf
->sb_rest_blocks
< NILFS_PSEG_MIN_BLOCKS
) {
1242 nilfs_segbuf_map(segbuf
, prev
->sb_nextnum
, 0, nilfs
);
1243 segbuf
->sb_sum
.seg_seq
++;
1248 err
= nilfs_sufile_mark_dirty(nilfs
->ns_sufile
, segbuf
->sb_segnum
);
1253 err
= nilfs_sufile_alloc(nilfs
->ns_sufile
, &nextnum
);
1257 nilfs_segbuf_set_next_segnum(segbuf
, nextnum
, nilfs
);
1259 BUG_ON(!list_empty(&sci
->sc_segbufs
));
1260 list_add_tail(&segbuf
->sb_list
, &sci
->sc_segbufs
);
1261 sci
->sc_segbuf_nblocks
= segbuf
->sb_rest_blocks
;
1265 nilfs_segbuf_free(segbuf
);
1269 static int nilfs_segctor_extend_segments(struct nilfs_sc_info
*sci
,
1270 struct the_nilfs
*nilfs
, int nadd
)
1272 struct nilfs_segment_buffer
*segbuf
, *prev
;
1273 struct inode
*sufile
= nilfs
->ns_sufile
;
1278 prev
= NILFS_LAST_SEGBUF(&sci
->sc_segbufs
);
1280 * Since the segment specified with nextnum might be allocated during
1281 * the previous construction, the buffer including its segusage may
1282 * not be dirty. The following call ensures that the buffer is dirty
1283 * and will pin the buffer on memory until the sufile is written.
1285 err
= nilfs_sufile_mark_dirty(sufile
, prev
->sb_nextnum
);
1289 for (i
= 0; i
< nadd
; i
++) {
1290 /* extend segment info */
1292 segbuf
= nilfs_segbuf_new(sci
->sc_super
);
1293 if (unlikely(!segbuf
))
1296 /* map this buffer to region of segment on-disk */
1297 nilfs_segbuf_map(segbuf
, prev
->sb_nextnum
, 0, nilfs
);
1298 sci
->sc_segbuf_nblocks
+= segbuf
->sb_rest_blocks
;
1300 /* allocate the next next full segment */
1301 err
= nilfs_sufile_alloc(sufile
, &nextnextnum
);
1305 segbuf
->sb_sum
.seg_seq
= prev
->sb_sum
.seg_seq
+ 1;
1306 nilfs_segbuf_set_next_segnum(segbuf
, nextnextnum
, nilfs
);
1308 list_add_tail(&segbuf
->sb_list
, &list
);
1311 list_splice_tail(&list
, &sci
->sc_segbufs
);
1315 nilfs_segbuf_free(segbuf
);
1317 list_for_each_entry(segbuf
, &list
, sb_list
) {
1318 ret
= nilfs_sufile_free(sufile
, segbuf
->sb_nextnum
);
1319 WARN_ON(ret
); /* never fails */
1321 nilfs_destroy_logs(&list
);
1325 static void nilfs_free_incomplete_logs(struct list_head
*logs
,
1326 struct the_nilfs
*nilfs
)
1328 struct nilfs_segment_buffer
*segbuf
, *prev
;
1329 struct inode
*sufile
= nilfs
->ns_sufile
;
1332 segbuf
= NILFS_FIRST_SEGBUF(logs
);
1333 if (nilfs
->ns_nextnum
!= segbuf
->sb_nextnum
) {
1334 ret
= nilfs_sufile_free(sufile
, segbuf
->sb_nextnum
);
1335 WARN_ON(ret
); /* never fails */
1337 if (atomic_read(&segbuf
->sb_err
)) {
1338 /* Case 1: The first segment failed */
1339 if (segbuf
->sb_pseg_start
!= segbuf
->sb_fseg_start
)
1340 /* Case 1a: Partial segment appended into an existing
1342 nilfs_terminate_segment(nilfs
, segbuf
->sb_fseg_start
,
1343 segbuf
->sb_fseg_end
);
1344 else /* Case 1b: New full segment */
1345 set_nilfs_discontinued(nilfs
);
1349 list_for_each_entry_continue(segbuf
, logs
, sb_list
) {
1350 if (prev
->sb_nextnum
!= segbuf
->sb_nextnum
) {
1351 ret
= nilfs_sufile_free(sufile
, segbuf
->sb_nextnum
);
1352 WARN_ON(ret
); /* never fails */
1354 if (atomic_read(&segbuf
->sb_err
) &&
1355 segbuf
->sb_segnum
!= nilfs
->ns_nextnum
)
1356 /* Case 2: extended segment (!= next) failed */
1357 nilfs_sufile_set_error(sufile
, segbuf
->sb_segnum
);
1362 static void nilfs_segctor_update_segusage(struct nilfs_sc_info
*sci
,
1363 struct inode
*sufile
)
1365 struct nilfs_segment_buffer
*segbuf
;
1366 unsigned long live_blocks
;
1369 list_for_each_entry(segbuf
, &sci
->sc_segbufs
, sb_list
) {
1370 live_blocks
= segbuf
->sb_sum
.nblocks
+
1371 (segbuf
->sb_pseg_start
- segbuf
->sb_fseg_start
);
1372 ret
= nilfs_sufile_set_segment_usage(sufile
, segbuf
->sb_segnum
,
1375 WARN_ON(ret
); /* always succeed because the segusage is dirty */
1379 static void nilfs_cancel_segusage(struct list_head
*logs
, struct inode
*sufile
)
1381 struct nilfs_segment_buffer
*segbuf
;
1384 segbuf
= NILFS_FIRST_SEGBUF(logs
);
1385 ret
= nilfs_sufile_set_segment_usage(sufile
, segbuf
->sb_segnum
,
1386 segbuf
->sb_pseg_start
-
1387 segbuf
->sb_fseg_start
, 0);
1388 WARN_ON(ret
); /* always succeed because the segusage is dirty */
1390 list_for_each_entry_continue(segbuf
, logs
, sb_list
) {
1391 ret
= nilfs_sufile_set_segment_usage(sufile
, segbuf
->sb_segnum
,
1393 WARN_ON(ret
); /* always succeed */
1397 static void nilfs_segctor_truncate_segments(struct nilfs_sc_info
*sci
,
1398 struct nilfs_segment_buffer
*last
,
1399 struct inode
*sufile
)
1401 struct nilfs_segment_buffer
*segbuf
= last
;
1404 list_for_each_entry_continue(segbuf
, &sci
->sc_segbufs
, sb_list
) {
1405 sci
->sc_segbuf_nblocks
-= segbuf
->sb_rest_blocks
;
1406 ret
= nilfs_sufile_free(sufile
, segbuf
->sb_nextnum
);
1409 nilfs_truncate_logs(&sci
->sc_segbufs
, last
);
1413 static int nilfs_segctor_collect(struct nilfs_sc_info
*sci
,
1414 struct the_nilfs
*nilfs
, int mode
)
1416 struct nilfs_cstage prev_stage
= sci
->sc_stage
;
1419 /* Collection retry loop */
1421 sci
->sc_nblk_this_inc
= 0;
1422 sci
->sc_curseg
= NILFS_FIRST_SEGBUF(&sci
->sc_segbufs
);
1424 err
= nilfs_segctor_reset_segment_buffer(sci
);
1428 err
= nilfs_segctor_collect_blocks(sci
, mode
);
1429 sci
->sc_nblk_this_inc
+= sci
->sc_curseg
->sb_sum
.nblocks
;
1433 if (unlikely(err
!= -E2BIG
))
1436 /* The current segment is filled up */
1437 if (mode
!= SC_LSEG_SR
|| sci
->sc_stage
.scnt
< NILFS_ST_CPFILE
)
1440 nilfs_clear_logs(&sci
->sc_segbufs
);
1442 err
= nilfs_segctor_extend_segments(sci
, nilfs
, nadd
);
1446 if (sci
->sc_stage
.flags
& NILFS_CF_SUFREED
) {
1447 err
= nilfs_sufile_cancel_freev(nilfs
->ns_sufile
,
1451 WARN_ON(err
); /* do not happen */
1453 nadd
= min_t(int, nadd
<< 1, SC_MAX_SEGDELTA
);
1454 sci
->sc_stage
= prev_stage
;
1456 nilfs_segctor_truncate_segments(sci
, sci
->sc_curseg
, nilfs
->ns_sufile
);
1463 static void nilfs_list_replace_buffer(struct buffer_head
*old_bh
,
1464 struct buffer_head
*new_bh
)
1466 BUG_ON(!list_empty(&new_bh
->b_assoc_buffers
));
1468 list_replace_init(&old_bh
->b_assoc_buffers
, &new_bh
->b_assoc_buffers
);
1469 /* The caller must release old_bh */
1473 nilfs_segctor_update_payload_blocknr(struct nilfs_sc_info
*sci
,
1474 struct nilfs_segment_buffer
*segbuf
,
1477 struct inode
*inode
= NULL
;
1479 unsigned long nfinfo
= segbuf
->sb_sum
.nfinfo
;
1480 unsigned long nblocks
= 0, ndatablk
= 0;
1481 struct nilfs_sc_operations
*sc_op
= NULL
;
1482 struct nilfs_segsum_pointer ssp
;
1483 struct nilfs_finfo
*finfo
= NULL
;
1484 union nilfs_binfo binfo
;
1485 struct buffer_head
*bh
, *bh_org
;
1492 blocknr
= segbuf
->sb_pseg_start
+ segbuf
->sb_sum
.nsumblk
;
1493 ssp
.bh
= NILFS_SEGBUF_FIRST_BH(&segbuf
->sb_segsum_buffers
);
1494 ssp
.offset
= sizeof(struct nilfs_segment_summary
);
1496 list_for_each_entry(bh
, &segbuf
->sb_payload_buffers
, b_assoc_buffers
) {
1497 if (bh
== segbuf
->sb_super_root
)
1500 finfo
= nilfs_segctor_map_segsum_entry(
1501 sci
, &ssp
, sizeof(*finfo
));
1502 ino
= le64_to_cpu(finfo
->fi_ino
);
1503 nblocks
= le32_to_cpu(finfo
->fi_nblocks
);
1504 ndatablk
= le32_to_cpu(finfo
->fi_ndatablk
);
1506 inode
= bh
->b_page
->mapping
->host
;
1508 if (mode
== SC_LSEG_DSYNC
)
1509 sc_op
= &nilfs_sc_dsync_ops
;
1510 else if (ino
== NILFS_DAT_INO
)
1511 sc_op
= &nilfs_sc_dat_ops
;
1512 else /* file blocks */
1513 sc_op
= &nilfs_sc_file_ops
;
1517 err
= nilfs_bmap_assign(NILFS_I(inode
)->i_bmap
, &bh
, blocknr
,
1520 nilfs_list_replace_buffer(bh_org
, bh
);
1526 sc_op
->write_data_binfo(sci
, &ssp
, &binfo
);
1528 sc_op
->write_node_binfo(sci
, &ssp
, &binfo
);
1531 if (--nblocks
== 0) {
1535 } else if (ndatablk
> 0)
1545 static int nilfs_segctor_assign(struct nilfs_sc_info
*sci
, int mode
)
1547 struct nilfs_segment_buffer
*segbuf
;
1550 list_for_each_entry(segbuf
, &sci
->sc_segbufs
, sb_list
) {
1551 err
= nilfs_segctor_update_payload_blocknr(sci
, segbuf
, mode
);
1554 nilfs_segbuf_fill_in_segsum(segbuf
);
1559 static void nilfs_begin_page_io(struct page
*page
)
1561 if (!page
|| PageWriteback(page
))
1562 /* For split b-tree node pages, this function may be called
1563 twice. We ignore the 2nd or later calls by this check. */
1567 clear_page_dirty_for_io(page
);
1568 set_page_writeback(page
);
1572 static void nilfs_segctor_prepare_write(struct nilfs_sc_info
*sci
)
1574 struct nilfs_segment_buffer
*segbuf
;
1575 struct page
*bd_page
= NULL
, *fs_page
= NULL
;
1577 list_for_each_entry(segbuf
, &sci
->sc_segbufs
, sb_list
) {
1578 struct buffer_head
*bh
;
1580 list_for_each_entry(bh
, &segbuf
->sb_segsum_buffers
,
1582 if (bh
->b_page
!= bd_page
) {
1585 clear_page_dirty_for_io(bd_page
);
1586 set_page_writeback(bd_page
);
1587 unlock_page(bd_page
);
1589 bd_page
= bh
->b_page
;
1593 list_for_each_entry(bh
, &segbuf
->sb_payload_buffers
,
1595 if (bh
== segbuf
->sb_super_root
) {
1596 if (bh
->b_page
!= bd_page
) {
1598 clear_page_dirty_for_io(bd_page
);
1599 set_page_writeback(bd_page
);
1600 unlock_page(bd_page
);
1601 bd_page
= bh
->b_page
;
1605 if (bh
->b_page
!= fs_page
) {
1606 nilfs_begin_page_io(fs_page
);
1607 fs_page
= bh
->b_page
;
1613 clear_page_dirty_for_io(bd_page
);
1614 set_page_writeback(bd_page
);
1615 unlock_page(bd_page
);
1617 nilfs_begin_page_io(fs_page
);
1620 static int nilfs_segctor_write(struct nilfs_sc_info
*sci
,
1621 struct the_nilfs
*nilfs
)
1625 ret
= nilfs_write_logs(&sci
->sc_segbufs
, nilfs
);
1626 list_splice_tail_init(&sci
->sc_segbufs
, &sci
->sc_write_logs
);
1630 static void nilfs_end_page_io(struct page
*page
, int err
)
1635 if (buffer_nilfs_node(page_buffers(page
)) && !PageWriteback(page
)) {
1637 * For b-tree node pages, this function may be called twice
1638 * or more because they might be split in a segment.
1640 if (PageDirty(page
)) {
1642 * For pages holding split b-tree node buffers, dirty
1643 * flag on the buffers may be cleared discretely.
1644 * In that case, the page is once redirtied for
1645 * remaining buffers, and it must be cancelled if
1646 * all the buffers get cleaned later.
1649 if (nilfs_page_buffers_clean(page
))
1650 __nilfs_clear_page_dirty(page
);
1657 if (!nilfs_page_buffers_clean(page
))
1658 __set_page_dirty_nobuffers(page
);
1659 ClearPageError(page
);
1661 __set_page_dirty_nobuffers(page
);
1665 end_page_writeback(page
);
1668 static void nilfs_abort_logs(struct list_head
*logs
, int err
)
1670 struct nilfs_segment_buffer
*segbuf
;
1671 struct page
*bd_page
= NULL
, *fs_page
= NULL
;
1672 struct buffer_head
*bh
;
1674 if (list_empty(logs
))
1677 list_for_each_entry(segbuf
, logs
, sb_list
) {
1678 list_for_each_entry(bh
, &segbuf
->sb_segsum_buffers
,
1680 if (bh
->b_page
!= bd_page
) {
1682 end_page_writeback(bd_page
);
1683 bd_page
= bh
->b_page
;
1687 list_for_each_entry(bh
, &segbuf
->sb_payload_buffers
,
1689 if (bh
== segbuf
->sb_super_root
) {
1690 if (bh
->b_page
!= bd_page
) {
1691 end_page_writeback(bd_page
);
1692 bd_page
= bh
->b_page
;
1696 if (bh
->b_page
!= fs_page
) {
1697 nilfs_end_page_io(fs_page
, err
);
1698 fs_page
= bh
->b_page
;
1703 end_page_writeback(bd_page
);
1705 nilfs_end_page_io(fs_page
, err
);
1708 static void nilfs_segctor_abort_construction(struct nilfs_sc_info
*sci
,
1709 struct the_nilfs
*nilfs
, int err
)
1714 list_splice_tail_init(&sci
->sc_write_logs
, &logs
);
1715 ret
= nilfs_wait_on_logs(&logs
);
1716 nilfs_abort_logs(&logs
, ret
? : err
);
1718 list_splice_tail_init(&sci
->sc_segbufs
, &logs
);
1719 nilfs_cancel_segusage(&logs
, nilfs
->ns_sufile
);
1720 nilfs_free_incomplete_logs(&logs
, nilfs
);
1722 if (sci
->sc_stage
.flags
& NILFS_CF_SUFREED
) {
1723 ret
= nilfs_sufile_cancel_freev(nilfs
->ns_sufile
,
1727 WARN_ON(ret
); /* do not happen */
1730 nilfs_destroy_logs(&logs
);
1733 static void nilfs_set_next_segment(struct the_nilfs
*nilfs
,
1734 struct nilfs_segment_buffer
*segbuf
)
1736 nilfs
->ns_segnum
= segbuf
->sb_segnum
;
1737 nilfs
->ns_nextnum
= segbuf
->sb_nextnum
;
1738 nilfs
->ns_pseg_offset
= segbuf
->sb_pseg_start
- segbuf
->sb_fseg_start
1739 + segbuf
->sb_sum
.nblocks
;
1740 nilfs
->ns_seg_seq
= segbuf
->sb_sum
.seg_seq
;
1741 nilfs
->ns_ctime
= segbuf
->sb_sum
.ctime
;
1744 static void nilfs_segctor_complete_write(struct nilfs_sc_info
*sci
)
1746 struct nilfs_segment_buffer
*segbuf
;
1747 struct page
*bd_page
= NULL
, *fs_page
= NULL
;
1748 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
1749 int update_sr
= false;
1751 list_for_each_entry(segbuf
, &sci
->sc_write_logs
, sb_list
) {
1752 struct buffer_head
*bh
;
1754 list_for_each_entry(bh
, &segbuf
->sb_segsum_buffers
,
1756 set_buffer_uptodate(bh
);
1757 clear_buffer_dirty(bh
);
1758 if (bh
->b_page
!= bd_page
) {
1760 end_page_writeback(bd_page
);
1761 bd_page
= bh
->b_page
;
1765 * We assume that the buffers which belong to the same page
1766 * continue over the buffer list.
1767 * Under this assumption, the last BHs of pages is
1768 * identifiable by the discontinuity of bh->b_page
1769 * (page != fs_page).
1771 * For B-tree node blocks, however, this assumption is not
1772 * guaranteed. The cleanup code of B-tree node pages needs
1775 list_for_each_entry(bh
, &segbuf
->sb_payload_buffers
,
1777 set_buffer_uptodate(bh
);
1778 clear_buffer_dirty(bh
);
1779 clear_buffer_delay(bh
);
1780 clear_buffer_nilfs_volatile(bh
);
1781 clear_buffer_nilfs_redirected(bh
);
1782 if (bh
== segbuf
->sb_super_root
) {
1783 if (bh
->b_page
!= bd_page
) {
1784 end_page_writeback(bd_page
);
1785 bd_page
= bh
->b_page
;
1790 if (bh
->b_page
!= fs_page
) {
1791 nilfs_end_page_io(fs_page
, 0);
1792 fs_page
= bh
->b_page
;
1796 if (!nilfs_segbuf_simplex(segbuf
)) {
1797 if (segbuf
->sb_sum
.flags
& NILFS_SS_LOGBGN
) {
1798 set_bit(NILFS_SC_UNCLOSED
, &sci
->sc_flags
);
1799 sci
->sc_lseg_stime
= jiffies
;
1801 if (segbuf
->sb_sum
.flags
& NILFS_SS_LOGEND
)
1802 clear_bit(NILFS_SC_UNCLOSED
, &sci
->sc_flags
);
1806 * Since pages may continue over multiple segment buffers,
1807 * end of the last page must be checked outside of the loop.
1810 end_page_writeback(bd_page
);
1812 nilfs_end_page_io(fs_page
, 0);
1814 nilfs_drop_collected_inodes(&sci
->sc_dirty_files
);
1816 if (nilfs_doing_gc())
1817 nilfs_drop_collected_inodes(&sci
->sc_gc_inodes
);
1819 nilfs
->ns_nongc_ctime
= sci
->sc_seg_ctime
;
1821 sci
->sc_nblk_inc
+= sci
->sc_nblk_this_inc
;
1823 segbuf
= NILFS_LAST_SEGBUF(&sci
->sc_write_logs
);
1824 nilfs_set_next_segment(nilfs
, segbuf
);
1827 nilfs_set_last_segment(nilfs
, segbuf
->sb_pseg_start
,
1828 segbuf
->sb_sum
.seg_seq
, nilfs
->ns_cno
++);
1830 clear_bit(NILFS_SC_HAVE_DELTA
, &sci
->sc_flags
);
1831 clear_bit(NILFS_SC_DIRTY
, &sci
->sc_flags
);
1832 set_bit(NILFS_SC_SUPER_ROOT
, &sci
->sc_flags
);
1833 nilfs_segctor_clear_metadata_dirty(sci
);
1835 clear_bit(NILFS_SC_SUPER_ROOT
, &sci
->sc_flags
);
1838 static int nilfs_segctor_wait(struct nilfs_sc_info
*sci
)
1842 ret
= nilfs_wait_on_logs(&sci
->sc_write_logs
);
1844 nilfs_segctor_complete_write(sci
);
1845 nilfs_destroy_logs(&sci
->sc_write_logs
);
1850 static int nilfs_segctor_collect_dirty_files(struct nilfs_sc_info
*sci
,
1851 struct the_nilfs
*nilfs
)
1853 struct nilfs_inode_info
*ii
, *n
;
1854 struct inode
*ifile
= sci
->sc_root
->ifile
;
1856 spin_lock(&nilfs
->ns_inode_lock
);
1858 list_for_each_entry_safe(ii
, n
, &nilfs
->ns_dirty_files
, i_dirty
) {
1860 struct buffer_head
*ibh
;
1863 spin_unlock(&nilfs
->ns_inode_lock
);
1864 err
= nilfs_ifile_get_inode_block(
1865 ifile
, ii
->vfs_inode
.i_ino
, &ibh
);
1866 if (unlikely(err
)) {
1867 nilfs_warning(sci
->sc_super
, __func__
,
1868 "failed to get inode block.\n");
1871 mark_buffer_dirty(ibh
);
1872 nilfs_mdt_mark_dirty(ifile
);
1873 spin_lock(&nilfs
->ns_inode_lock
);
1874 if (likely(!ii
->i_bh
))
1881 clear_bit(NILFS_I_QUEUED
, &ii
->i_state
);
1882 set_bit(NILFS_I_BUSY
, &ii
->i_state
);
1883 list_move_tail(&ii
->i_dirty
, &sci
->sc_dirty_files
);
1885 spin_unlock(&nilfs
->ns_inode_lock
);
1890 static void nilfs_segctor_drop_written_files(struct nilfs_sc_info
*sci
,
1891 struct the_nilfs
*nilfs
)
1893 struct nilfs_transaction_info
*ti
= current
->journal_info
;
1894 struct nilfs_inode_info
*ii
, *n
;
1896 spin_lock(&nilfs
->ns_inode_lock
);
1897 list_for_each_entry_safe(ii
, n
, &sci
->sc_dirty_files
, i_dirty
) {
1898 if (!test_and_clear_bit(NILFS_I_UPDATED
, &ii
->i_state
) ||
1899 test_bit(NILFS_I_DIRTY
, &ii
->i_state
))
1902 clear_bit(NILFS_I_BUSY
, &ii
->i_state
);
1905 list_move_tail(&ii
->i_dirty
, &ti
->ti_garbage
);
1907 spin_unlock(&nilfs
->ns_inode_lock
);
1911 * Main procedure of segment constructor
1913 static int nilfs_segctor_do_construct(struct nilfs_sc_info
*sci
, int mode
)
1915 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
1918 sci
->sc_stage
.scnt
= NILFS_ST_INIT
;
1919 sci
->sc_cno
= nilfs
->ns_cno
;
1921 err
= nilfs_segctor_collect_dirty_files(sci
, nilfs
);
1925 if (nilfs_test_metadata_dirty(nilfs
, sci
->sc_root
))
1926 set_bit(NILFS_SC_DIRTY
, &sci
->sc_flags
);
1928 if (nilfs_segctor_clean(sci
))
1932 sci
->sc_stage
.flags
&= ~NILFS_CF_HISTORY_MASK
;
1934 err
= nilfs_segctor_begin_construction(sci
, nilfs
);
1938 /* Update time stamp */
1939 sci
->sc_seg_ctime
= get_seconds();
1941 err
= nilfs_segctor_collect(sci
, nilfs
, mode
);
1945 /* Avoid empty segment */
1946 if (sci
->sc_stage
.scnt
== NILFS_ST_DONE
&&
1947 nilfs_segbuf_empty(sci
->sc_curseg
)) {
1948 nilfs_segctor_abort_construction(sci
, nilfs
, 1);
1952 err
= nilfs_segctor_assign(sci
, mode
);
1956 if (sci
->sc_stage
.flags
& NILFS_CF_IFILE_STARTED
)
1957 nilfs_segctor_fill_in_file_bmap(sci
);
1959 if (mode
== SC_LSEG_SR
&&
1960 sci
->sc_stage
.scnt
>= NILFS_ST_CPFILE
) {
1961 err
= nilfs_segctor_fill_in_checkpoint(sci
);
1963 goto failed_to_write
;
1965 nilfs_segctor_fill_in_super_root(sci
, nilfs
);
1967 nilfs_segctor_update_segusage(sci
, nilfs
->ns_sufile
);
1969 /* Write partial segments */
1970 nilfs_segctor_prepare_write(sci
);
1972 nilfs_add_checksums_on_logs(&sci
->sc_segbufs
,
1973 nilfs
->ns_crc_seed
);
1975 err
= nilfs_segctor_write(sci
, nilfs
);
1977 goto failed_to_write
;
1979 if (sci
->sc_stage
.scnt
== NILFS_ST_DONE
||
1980 nilfs
->ns_blocksize_bits
!= PAGE_CACHE_SHIFT
) {
1982 * At this point, we avoid double buffering
1983 * for blocksize < pagesize because page dirty
1984 * flag is turned off during write and dirty
1985 * buffers are not properly collected for
1986 * pages crossing over segments.
1988 err
= nilfs_segctor_wait(sci
);
1990 goto failed_to_write
;
1992 } while (sci
->sc_stage
.scnt
!= NILFS_ST_DONE
);
1995 nilfs_segctor_drop_written_files(sci
, nilfs
);
1999 if (sci
->sc_stage
.flags
& NILFS_CF_IFILE_STARTED
)
2000 nilfs_redirty_inodes(&sci
->sc_dirty_files
);
2003 if (nilfs_doing_gc())
2004 nilfs_redirty_inodes(&sci
->sc_gc_inodes
);
2005 nilfs_segctor_abort_construction(sci
, nilfs
, err
);
2010 * nilfs_segctor_start_timer - set timer of background write
2011 * @sci: nilfs_sc_info
2013 * If the timer has already been set, it ignores the new request.
2014 * This function MUST be called within a section locking the segment
2017 static void nilfs_segctor_start_timer(struct nilfs_sc_info
*sci
)
2019 spin_lock(&sci
->sc_state_lock
);
2020 if (!(sci
->sc_state
& NILFS_SEGCTOR_COMMIT
)) {
2021 sci
->sc_timer
.expires
= jiffies
+ sci
->sc_interval
;
2022 add_timer(&sci
->sc_timer
);
2023 sci
->sc_state
|= NILFS_SEGCTOR_COMMIT
;
2025 spin_unlock(&sci
->sc_state_lock
);
2028 static void nilfs_segctor_do_flush(struct nilfs_sc_info
*sci
, int bn
)
2030 spin_lock(&sci
->sc_state_lock
);
2031 if (!(sci
->sc_flush_request
& (1 << bn
))) {
2032 unsigned long prev_req
= sci
->sc_flush_request
;
2034 sci
->sc_flush_request
|= (1 << bn
);
2036 wake_up(&sci
->sc_wait_daemon
);
2038 spin_unlock(&sci
->sc_state_lock
);
2042 * nilfs_flush_segment - trigger a segment construction for resource control
2044 * @ino: inode number of the file to be flushed out.
2046 void nilfs_flush_segment(struct super_block
*sb
, ino_t ino
)
2048 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2049 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
2051 if (!sci
|| nilfs_doing_construction())
2053 nilfs_segctor_do_flush(sci
, NILFS_MDT_INODE(sb
, ino
) ? ino
: 0);
2054 /* assign bit 0 to data files */
2057 struct nilfs_segctor_wait_request
{
2064 static int nilfs_segctor_sync(struct nilfs_sc_info
*sci
)
2066 struct nilfs_segctor_wait_request wait_req
;
2069 spin_lock(&sci
->sc_state_lock
);
2070 init_wait(&wait_req
.wq
);
2072 atomic_set(&wait_req
.done
, 0);
2073 wait_req
.seq
= ++sci
->sc_seq_request
;
2074 spin_unlock(&sci
->sc_state_lock
);
2076 init_waitqueue_entry(&wait_req
.wq
, current
);
2077 add_wait_queue(&sci
->sc_wait_request
, &wait_req
.wq
);
2078 set_current_state(TASK_INTERRUPTIBLE
);
2079 wake_up(&sci
->sc_wait_daemon
);
2082 if (atomic_read(&wait_req
.done
)) {
2086 if (!signal_pending(current
)) {
2093 finish_wait(&sci
->sc_wait_request
, &wait_req
.wq
);
2097 static void nilfs_segctor_wakeup(struct nilfs_sc_info
*sci
, int err
)
2099 struct nilfs_segctor_wait_request
*wrq
, *n
;
2100 unsigned long flags
;
2102 spin_lock_irqsave(&sci
->sc_wait_request
.lock
, flags
);
2103 list_for_each_entry_safe(wrq
, n
, &sci
->sc_wait_request
.task_list
,
2105 if (!atomic_read(&wrq
->done
) &&
2106 nilfs_cnt32_ge(sci
->sc_seq_done
, wrq
->seq
)) {
2108 atomic_set(&wrq
->done
, 1);
2110 if (atomic_read(&wrq
->done
)) {
2111 wrq
->wq
.func(&wrq
->wq
,
2112 TASK_UNINTERRUPTIBLE
| TASK_INTERRUPTIBLE
,
2116 spin_unlock_irqrestore(&sci
->sc_wait_request
.lock
, flags
);
2120 * nilfs_construct_segment - construct a logical segment
2123 * Return Value: On success, 0 is retured. On errors, one of the following
2124 * negative error code is returned.
2126 * %-EROFS - Read only filesystem.
2130 * %-ENOSPC - No space left on device (only in a panic state).
2132 * %-ERESTARTSYS - Interrupted.
2134 * %-ENOMEM - Insufficient memory available.
2136 int nilfs_construct_segment(struct super_block
*sb
)
2138 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2139 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
2140 struct nilfs_transaction_info
*ti
;
2146 /* A call inside transactions causes a deadlock. */
2147 BUG_ON((ti
= current
->journal_info
) && ti
->ti_magic
== NILFS_TI_MAGIC
);
2149 err
= nilfs_segctor_sync(sci
);
2154 * nilfs_construct_dsync_segment - construct a data-only logical segment
2156 * @inode: inode whose data blocks should be written out
2157 * @start: start byte offset
2158 * @end: end byte offset (inclusive)
2160 * Return Value: On success, 0 is retured. On errors, one of the following
2161 * negative error code is returned.
2163 * %-EROFS - Read only filesystem.
2167 * %-ENOSPC - No space left on device (only in a panic state).
2169 * %-ERESTARTSYS - Interrupted.
2171 * %-ENOMEM - Insufficient memory available.
2173 int nilfs_construct_dsync_segment(struct super_block
*sb
, struct inode
*inode
,
2174 loff_t start
, loff_t end
)
2176 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2177 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
2178 struct nilfs_inode_info
*ii
;
2179 struct nilfs_transaction_info ti
;
2185 nilfs_transaction_lock(sb
, &ti
, 0);
2187 ii
= NILFS_I(inode
);
2188 if (test_bit(NILFS_I_INODE_DIRTY
, &ii
->i_state
) ||
2189 nilfs_test_opt(nilfs
, STRICT_ORDER
) ||
2190 test_bit(NILFS_SC_UNCLOSED
, &sci
->sc_flags
) ||
2191 nilfs_discontinued(nilfs
)) {
2192 nilfs_transaction_unlock(sb
);
2193 err
= nilfs_segctor_sync(sci
);
2197 spin_lock(&nilfs
->ns_inode_lock
);
2198 if (!test_bit(NILFS_I_QUEUED
, &ii
->i_state
) &&
2199 !test_bit(NILFS_I_BUSY
, &ii
->i_state
)) {
2200 spin_unlock(&nilfs
->ns_inode_lock
);
2201 nilfs_transaction_unlock(sb
);
2204 spin_unlock(&nilfs
->ns_inode_lock
);
2205 sci
->sc_dsync_inode
= ii
;
2206 sci
->sc_dsync_start
= start
;
2207 sci
->sc_dsync_end
= end
;
2209 err
= nilfs_segctor_do_construct(sci
, SC_LSEG_DSYNC
);
2211 nilfs_transaction_unlock(sb
);
2215 #define FLUSH_FILE_BIT (0x1) /* data file only */
2216 #define FLUSH_DAT_BIT (1 << NILFS_DAT_INO) /* DAT only */
2219 * nilfs_segctor_accept - record accepted sequence count of log-write requests
2220 * @sci: segment constructor object
2222 static void nilfs_segctor_accept(struct nilfs_sc_info
*sci
)
2224 spin_lock(&sci
->sc_state_lock
);
2225 sci
->sc_seq_accepted
= sci
->sc_seq_request
;
2226 spin_unlock(&sci
->sc_state_lock
);
2227 del_timer_sync(&sci
->sc_timer
);
2231 * nilfs_segctor_notify - notify the result of request to caller threads
2232 * @sci: segment constructor object
2233 * @mode: mode of log forming
2234 * @err: error code to be notified
2236 static void nilfs_segctor_notify(struct nilfs_sc_info
*sci
, int mode
, int err
)
2238 /* Clear requests (even when the construction failed) */
2239 spin_lock(&sci
->sc_state_lock
);
2241 if (mode
== SC_LSEG_SR
) {
2242 sci
->sc_state
&= ~NILFS_SEGCTOR_COMMIT
;
2243 sci
->sc_seq_done
= sci
->sc_seq_accepted
;
2244 nilfs_segctor_wakeup(sci
, err
);
2245 sci
->sc_flush_request
= 0;
2247 if (mode
== SC_FLUSH_FILE
)
2248 sci
->sc_flush_request
&= ~FLUSH_FILE_BIT
;
2249 else if (mode
== SC_FLUSH_DAT
)
2250 sci
->sc_flush_request
&= ~FLUSH_DAT_BIT
;
2252 /* re-enable timer if checkpoint creation was not done */
2253 if ((sci
->sc_state
& NILFS_SEGCTOR_COMMIT
) &&
2254 time_before(jiffies
, sci
->sc_timer
.expires
))
2255 add_timer(&sci
->sc_timer
);
2257 spin_unlock(&sci
->sc_state_lock
);
2261 * nilfs_segctor_construct - form logs and write them to disk
2262 * @sci: segment constructor object
2263 * @mode: mode of log forming
2265 static int nilfs_segctor_construct(struct nilfs_sc_info
*sci
, int mode
)
2267 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
2268 struct nilfs_super_block
**sbp
;
2271 nilfs_segctor_accept(sci
);
2273 if (nilfs_discontinued(nilfs
))
2275 if (!nilfs_segctor_confirm(sci
))
2276 err
= nilfs_segctor_do_construct(sci
, mode
);
2279 if (mode
!= SC_FLUSH_DAT
)
2280 atomic_set(&nilfs
->ns_ndirtyblks
, 0);
2281 if (test_bit(NILFS_SC_SUPER_ROOT
, &sci
->sc_flags
) &&
2282 nilfs_discontinued(nilfs
)) {
2283 down_write(&nilfs
->ns_sem
);
2285 sbp
= nilfs_prepare_super(sci
->sc_super
,
2286 nilfs_sb_will_flip(nilfs
));
2288 nilfs_set_log_cursor(sbp
[0], nilfs
);
2289 err
= nilfs_commit_super(sci
->sc_super
,
2292 up_write(&nilfs
->ns_sem
);
2296 nilfs_segctor_notify(sci
, mode
, err
);
2300 static void nilfs_construction_timeout(unsigned long data
)
2302 struct task_struct
*p
= (struct task_struct
*)data
;
2307 nilfs_remove_written_gcinodes(struct the_nilfs
*nilfs
, struct list_head
*head
)
2309 struct nilfs_inode_info
*ii
, *n
;
2311 list_for_each_entry_safe(ii
, n
, head
, i_dirty
) {
2312 if (!test_bit(NILFS_I_UPDATED
, &ii
->i_state
))
2314 list_del_init(&ii
->i_dirty
);
2315 truncate_inode_pages(&ii
->vfs_inode
.i_data
, 0);
2316 nilfs_btnode_cache_clear(&ii
->i_btnode_cache
);
2317 iput(&ii
->vfs_inode
);
2321 int nilfs_clean_segments(struct super_block
*sb
, struct nilfs_argv
*argv
,
2324 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2325 struct nilfs_sc_info
*sci
= nilfs
->ns_writer
;
2326 struct nilfs_transaction_info ti
;
2332 nilfs_transaction_lock(sb
, &ti
, 1);
2334 err
= nilfs_mdt_save_to_shadow_map(nilfs
->ns_dat
);
2338 err
= nilfs_ioctl_prepare_clean_segments(nilfs
, argv
, kbufs
);
2339 if (unlikely(err
)) {
2340 nilfs_mdt_restore_from_shadow_map(nilfs
->ns_dat
);
2344 sci
->sc_freesegs
= kbufs
[4];
2345 sci
->sc_nfreesegs
= argv
[4].v_nmembs
;
2346 list_splice_tail_init(&nilfs
->ns_gc_inodes
, &sci
->sc_gc_inodes
);
2349 err
= nilfs_segctor_construct(sci
, SC_LSEG_SR
);
2350 nilfs_remove_written_gcinodes(nilfs
, &sci
->sc_gc_inodes
);
2355 nilfs_warning(sb
, __func__
,
2356 "segment construction failed. (err=%d)", err
);
2357 set_current_state(TASK_INTERRUPTIBLE
);
2358 schedule_timeout(sci
->sc_interval
);
2360 if (nilfs_test_opt(nilfs
, DISCARD
)) {
2361 int ret
= nilfs_discard_segments(nilfs
, sci
->sc_freesegs
,
2365 "NILFS warning: error %d on discard request, "
2366 "turning discards off for the device\n", ret
);
2367 nilfs_clear_opt(nilfs
, DISCARD
);
2372 sci
->sc_freesegs
= NULL
;
2373 sci
->sc_nfreesegs
= 0;
2374 nilfs_mdt_clear_shadow_map(nilfs
->ns_dat
);
2375 nilfs_transaction_unlock(sb
);
2379 static void nilfs_segctor_thread_construct(struct nilfs_sc_info
*sci
, int mode
)
2381 struct nilfs_transaction_info ti
;
2383 nilfs_transaction_lock(sci
->sc_super
, &ti
, 0);
2384 nilfs_segctor_construct(sci
, mode
);
2387 * Unclosed segment should be retried. We do this using sc_timer.
2388 * Timeout of sc_timer will invoke complete construction which leads
2389 * to close the current logical segment.
2391 if (test_bit(NILFS_SC_UNCLOSED
, &sci
->sc_flags
))
2392 nilfs_segctor_start_timer(sci
);
2394 nilfs_transaction_unlock(sci
->sc_super
);
2397 static void nilfs_segctor_do_immediate_flush(struct nilfs_sc_info
*sci
)
2402 spin_lock(&sci
->sc_state_lock
);
2403 mode
= (sci
->sc_flush_request
& FLUSH_DAT_BIT
) ?
2404 SC_FLUSH_DAT
: SC_FLUSH_FILE
;
2405 spin_unlock(&sci
->sc_state_lock
);
2408 err
= nilfs_segctor_do_construct(sci
, mode
);
2410 spin_lock(&sci
->sc_state_lock
);
2411 sci
->sc_flush_request
&= (mode
== SC_FLUSH_FILE
) ?
2412 ~FLUSH_FILE_BIT
: ~FLUSH_DAT_BIT
;
2413 spin_unlock(&sci
->sc_state_lock
);
2415 clear_bit(NILFS_SC_PRIOR_FLUSH
, &sci
->sc_flags
);
2418 static int nilfs_segctor_flush_mode(struct nilfs_sc_info
*sci
)
2420 if (!test_bit(NILFS_SC_UNCLOSED
, &sci
->sc_flags
) ||
2421 time_before(jiffies
, sci
->sc_lseg_stime
+ sci
->sc_mjcp_freq
)) {
2422 if (!(sci
->sc_flush_request
& ~FLUSH_FILE_BIT
))
2423 return SC_FLUSH_FILE
;
2424 else if (!(sci
->sc_flush_request
& ~FLUSH_DAT_BIT
))
2425 return SC_FLUSH_DAT
;
2431 * nilfs_segctor_thread - main loop of the segment constructor thread.
2432 * @arg: pointer to a struct nilfs_sc_info.
2434 * nilfs_segctor_thread() initializes a timer and serves as a daemon
2435 * to execute segment constructions.
2437 static int nilfs_segctor_thread(void *arg
)
2439 struct nilfs_sc_info
*sci
= (struct nilfs_sc_info
*)arg
;
2440 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
2443 sci
->sc_timer
.data
= (unsigned long)current
;
2444 sci
->sc_timer
.function
= nilfs_construction_timeout
;
2447 sci
->sc_task
= current
;
2448 wake_up(&sci
->sc_wait_task
); /* for nilfs_segctor_start_thread() */
2450 "segctord starting. Construction interval = %lu seconds, "
2451 "CP frequency < %lu seconds\n",
2452 sci
->sc_interval
/ HZ
, sci
->sc_mjcp_freq
/ HZ
);
2454 spin_lock(&sci
->sc_state_lock
);
2459 if (sci
->sc_state
& NILFS_SEGCTOR_QUIT
)
2462 if (timeout
|| sci
->sc_seq_request
!= sci
->sc_seq_done
)
2464 else if (!sci
->sc_flush_request
)
2467 mode
= nilfs_segctor_flush_mode(sci
);
2469 spin_unlock(&sci
->sc_state_lock
);
2470 nilfs_segctor_thread_construct(sci
, mode
);
2471 spin_lock(&sci
->sc_state_lock
);
2476 if (freezing(current
)) {
2477 spin_unlock(&sci
->sc_state_lock
);
2479 spin_lock(&sci
->sc_state_lock
);
2482 int should_sleep
= 1;
2484 prepare_to_wait(&sci
->sc_wait_daemon
, &wait
,
2485 TASK_INTERRUPTIBLE
);
2487 if (sci
->sc_seq_request
!= sci
->sc_seq_done
)
2489 else if (sci
->sc_flush_request
)
2491 else if (sci
->sc_state
& NILFS_SEGCTOR_COMMIT
)
2492 should_sleep
= time_before(jiffies
,
2493 sci
->sc_timer
.expires
);
2496 spin_unlock(&sci
->sc_state_lock
);
2498 spin_lock(&sci
->sc_state_lock
);
2500 finish_wait(&sci
->sc_wait_daemon
, &wait
);
2501 timeout
= ((sci
->sc_state
& NILFS_SEGCTOR_COMMIT
) &&
2502 time_after_eq(jiffies
, sci
->sc_timer
.expires
));
2504 if (nilfs_sb_dirty(nilfs
) && nilfs_sb_need_update(nilfs
))
2505 set_nilfs_discontinued(nilfs
);
2510 spin_unlock(&sci
->sc_state_lock
);
2513 sci
->sc_task
= NULL
;
2514 wake_up(&sci
->sc_wait_task
); /* for nilfs_segctor_kill_thread() */
2518 static int nilfs_segctor_start_thread(struct nilfs_sc_info
*sci
)
2520 struct task_struct
*t
;
2522 t
= kthread_run(nilfs_segctor_thread
, sci
, "segctord");
2524 int err
= PTR_ERR(t
);
2526 printk(KERN_ERR
"NILFS: error %d creating segctord thread\n",
2530 wait_event(sci
->sc_wait_task
, sci
->sc_task
!= NULL
);
2534 static void nilfs_segctor_kill_thread(struct nilfs_sc_info
*sci
)
2535 __acquires(&sci
->sc_state_lock
)
2536 __releases(&sci
->sc_state_lock
)
2538 sci
->sc_state
|= NILFS_SEGCTOR_QUIT
;
2540 while (sci
->sc_task
) {
2541 wake_up(&sci
->sc_wait_daemon
);
2542 spin_unlock(&sci
->sc_state_lock
);
2543 wait_event(sci
->sc_wait_task
, sci
->sc_task
== NULL
);
2544 spin_lock(&sci
->sc_state_lock
);
2549 * Setup & clean-up functions
2551 static struct nilfs_sc_info
*nilfs_segctor_new(struct super_block
*sb
,
2552 struct nilfs_root
*root
)
2554 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2555 struct nilfs_sc_info
*sci
;
2557 sci
= kzalloc(sizeof(*sci
), GFP_KERNEL
);
2563 nilfs_get_root(root
);
2564 sci
->sc_root
= root
;
2566 init_waitqueue_head(&sci
->sc_wait_request
);
2567 init_waitqueue_head(&sci
->sc_wait_daemon
);
2568 init_waitqueue_head(&sci
->sc_wait_task
);
2569 spin_lock_init(&sci
->sc_state_lock
);
2570 INIT_LIST_HEAD(&sci
->sc_dirty_files
);
2571 INIT_LIST_HEAD(&sci
->sc_segbufs
);
2572 INIT_LIST_HEAD(&sci
->sc_write_logs
);
2573 INIT_LIST_HEAD(&sci
->sc_gc_inodes
);
2574 init_timer(&sci
->sc_timer
);
2576 sci
->sc_interval
= HZ
* NILFS_SC_DEFAULT_TIMEOUT
;
2577 sci
->sc_mjcp_freq
= HZ
* NILFS_SC_DEFAULT_SR_FREQ
;
2578 sci
->sc_watermark
= NILFS_SC_DEFAULT_WATERMARK
;
2580 if (nilfs
->ns_interval
)
2581 sci
->sc_interval
= HZ
* nilfs
->ns_interval
;
2582 if (nilfs
->ns_watermark
)
2583 sci
->sc_watermark
= nilfs
->ns_watermark
;
2587 static void nilfs_segctor_write_out(struct nilfs_sc_info
*sci
)
2589 int ret
, retrycount
= NILFS_SC_CLEANUP_RETRY
;
2591 /* The segctord thread was stopped and its timer was removed.
2592 But some tasks remain. */
2594 struct nilfs_transaction_info ti
;
2596 nilfs_transaction_lock(sci
->sc_super
, &ti
, 0);
2597 ret
= nilfs_segctor_construct(sci
, SC_LSEG_SR
);
2598 nilfs_transaction_unlock(sci
->sc_super
);
2600 } while (ret
&& retrycount
-- > 0);
2604 * nilfs_segctor_destroy - destroy the segment constructor.
2605 * @sci: nilfs_sc_info
2607 * nilfs_segctor_destroy() kills the segctord thread and frees
2608 * the nilfs_sc_info struct.
2609 * Caller must hold the segment semaphore.
2611 static void nilfs_segctor_destroy(struct nilfs_sc_info
*sci
)
2613 struct the_nilfs
*nilfs
= sci
->sc_super
->s_fs_info
;
2616 up_write(&nilfs
->ns_segctor_sem
);
2618 spin_lock(&sci
->sc_state_lock
);
2619 nilfs_segctor_kill_thread(sci
);
2620 flag
= ((sci
->sc_state
& NILFS_SEGCTOR_COMMIT
) || sci
->sc_flush_request
2621 || sci
->sc_seq_request
!= sci
->sc_seq_done
);
2622 spin_unlock(&sci
->sc_state_lock
);
2624 if (flag
|| !nilfs_segctor_confirm(sci
))
2625 nilfs_segctor_write_out(sci
);
2627 if (!list_empty(&sci
->sc_dirty_files
)) {
2628 nilfs_warning(sci
->sc_super
, __func__
,
2629 "dirty file(s) after the final construction\n");
2630 nilfs_dispose_list(nilfs
, &sci
->sc_dirty_files
, 1);
2633 WARN_ON(!list_empty(&sci
->sc_segbufs
));
2634 WARN_ON(!list_empty(&sci
->sc_write_logs
));
2636 nilfs_put_root(sci
->sc_root
);
2638 down_write(&nilfs
->ns_segctor_sem
);
2640 del_timer_sync(&sci
->sc_timer
);
2645 * nilfs_attach_log_writer - attach log writer
2646 * @sb: super block instance
2647 * @root: root object of the current filesystem tree
2649 * This allocates a log writer object, initializes it, and starts the
2652 * Return Value: On success, 0 is returned. On error, one of the following
2653 * negative error code is returned.
2655 * %-ENOMEM - Insufficient memory available.
2657 int nilfs_attach_log_writer(struct super_block
*sb
, struct nilfs_root
*root
)
2659 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2662 if (nilfs
->ns_writer
) {
2664 * This happens if the filesystem was remounted
2665 * read/write after nilfs_error degenerated it into a
2668 nilfs_detach_log_writer(sb
);
2671 nilfs
->ns_writer
= nilfs_segctor_new(sb
, root
);
2672 if (!nilfs
->ns_writer
)
2675 err
= nilfs_segctor_start_thread(nilfs
->ns_writer
);
2677 kfree(nilfs
->ns_writer
);
2678 nilfs
->ns_writer
= NULL
;
2684 * nilfs_detach_log_writer - destroy log writer
2685 * @sb: super block instance
2687 * This kills log writer daemon, frees the log writer object, and
2688 * destroys list of dirty files.
2690 void nilfs_detach_log_writer(struct super_block
*sb
)
2692 struct the_nilfs
*nilfs
= sb
->s_fs_info
;
2693 LIST_HEAD(garbage_list
);
2695 down_write(&nilfs
->ns_segctor_sem
);
2696 if (nilfs
->ns_writer
) {
2697 nilfs_segctor_destroy(nilfs
->ns_writer
);
2698 nilfs
->ns_writer
= NULL
;
2701 /* Force to free the list of dirty files */
2702 spin_lock(&nilfs
->ns_inode_lock
);
2703 if (!list_empty(&nilfs
->ns_dirty_files
)) {
2704 list_splice_init(&nilfs
->ns_dirty_files
, &garbage_list
);
2705 nilfs_warning(sb
, __func__
,
2706 "Hit dirty file after stopped log writer\n");
2708 spin_unlock(&nilfs
->ns_inode_lock
);
2709 up_write(&nilfs
->ns_segctor_sem
);
2711 nilfs_dispose_list(nilfs
, &garbage_list
, 1);