4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
7 * This program is free software; you can redistribute it and/or modify
8 * it under the terms of the GNU General Public License version 2 as
9 * published by the Free Software Foundation.
11 #include <linux/blkdev.h>
12 #include <linux/backing-dev.h>
15 #define NULL_SEGNO ((unsigned int)(~0))
16 #define NULL_SECNO ((unsigned int)(~0))
18 #define DEF_RECLAIM_PREFREE_SEGMENTS 5 /* 5% over total segments */
20 /* L: Logical segment # in volume, R: Relative segment # in main area */
21 #define GET_L2R_SEGNO(free_i, segno) (segno - free_i->start_segno)
22 #define GET_R2L_SEGNO(free_i, segno) (segno + free_i->start_segno)
24 #define IS_DATASEG(t) (t <= CURSEG_COLD_DATA)
25 #define IS_NODESEG(t) (t >= CURSEG_HOT_NODE)
27 #define IS_CURSEG(sbi, seg) \
28 ((seg == CURSEG_I(sbi, CURSEG_HOT_DATA)->segno) || \
29 (seg == CURSEG_I(sbi, CURSEG_WARM_DATA)->segno) || \
30 (seg == CURSEG_I(sbi, CURSEG_COLD_DATA)->segno) || \
31 (seg == CURSEG_I(sbi, CURSEG_HOT_NODE)->segno) || \
32 (seg == CURSEG_I(sbi, CURSEG_WARM_NODE)->segno) || \
33 (seg == CURSEG_I(sbi, CURSEG_COLD_NODE)->segno))
35 #define IS_CURSEC(sbi, secno) \
36 ((secno == CURSEG_I(sbi, CURSEG_HOT_DATA)->segno / \
37 sbi->segs_per_sec) || \
38 (secno == CURSEG_I(sbi, CURSEG_WARM_DATA)->segno / \
39 sbi->segs_per_sec) || \
40 (secno == CURSEG_I(sbi, CURSEG_COLD_DATA)->segno / \
41 sbi->segs_per_sec) || \
42 (secno == CURSEG_I(sbi, CURSEG_HOT_NODE)->segno / \
43 sbi->segs_per_sec) || \
44 (secno == CURSEG_I(sbi, CURSEG_WARM_NODE)->segno / \
45 sbi->segs_per_sec) || \
46 (secno == CURSEG_I(sbi, CURSEG_COLD_NODE)->segno / \
49 #define MAIN_BLKADDR(sbi) (SM_I(sbi)->main_blkaddr)
50 #define SEG0_BLKADDR(sbi) (SM_I(sbi)->seg0_blkaddr)
52 #define MAIN_SEGS(sbi) (SM_I(sbi)->main_segments)
53 #define MAIN_SECS(sbi) (sbi->total_sections)
55 #define TOTAL_SEGS(sbi) (SM_I(sbi)->segment_count)
56 #define TOTAL_BLKS(sbi) (TOTAL_SEGS(sbi) << sbi->log_blocks_per_seg)
58 #define MAX_BLKADDR(sbi) (SEG0_BLKADDR(sbi) + TOTAL_BLKS(sbi))
59 #define SEGMENT_SIZE(sbi) (1ULL << (sbi->log_blocksize + \
60 sbi->log_blocks_per_seg))
62 #define START_BLOCK(sbi, segno) (SEG0_BLKADDR(sbi) + \
63 (GET_R2L_SEGNO(FREE_I(sbi), segno) << sbi->log_blocks_per_seg))
65 #define NEXT_FREE_BLKADDR(sbi, curseg) \
66 (START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff)
68 #define GET_SEGOFF_FROM_SEG0(sbi, blk_addr) ((blk_addr) - SEG0_BLKADDR(sbi))
69 #define GET_SEGNO_FROM_SEG0(sbi, blk_addr) \
70 (GET_SEGOFF_FROM_SEG0(sbi, blk_addr) >> sbi->log_blocks_per_seg)
71 #define GET_BLKOFF_FROM_SEG0(sbi, blk_addr) \
72 (GET_SEGOFF_FROM_SEG0(sbi, blk_addr) & (sbi->blocks_per_seg - 1))
74 #define GET_SEGNO(sbi, blk_addr) \
75 (((blk_addr == NULL_ADDR) || (blk_addr == NEW_ADDR)) ? \
76 NULL_SEGNO : GET_L2R_SEGNO(FREE_I(sbi), \
77 GET_SEGNO_FROM_SEG0(sbi, blk_addr)))
78 #define GET_SECNO(sbi, segno) \
79 ((segno) / sbi->segs_per_sec)
80 #define GET_ZONENO_FROM_SEGNO(sbi, segno) \
81 ((segno / sbi->segs_per_sec) / sbi->secs_per_zone)
83 #define GET_SUM_BLOCK(sbi, segno) \
84 ((sbi->sm_info->ssa_blkaddr) + segno)
86 #define GET_SUM_TYPE(footer) ((footer)->entry_type)
87 #define SET_SUM_TYPE(footer, type) ((footer)->entry_type = type)
89 #define SIT_ENTRY_OFFSET(sit_i, segno) \
90 (segno % sit_i->sents_per_block)
91 #define SIT_BLOCK_OFFSET(segno) \
92 (segno / SIT_ENTRY_PER_BLOCK)
93 #define START_SEGNO(segno) \
94 (SIT_BLOCK_OFFSET(segno) * SIT_ENTRY_PER_BLOCK)
95 #define SIT_BLK_CNT(sbi) \
96 ((MAIN_SEGS(sbi) + SIT_ENTRY_PER_BLOCK - 1) / SIT_ENTRY_PER_BLOCK)
97 #define f2fs_bitmap_size(nr) \
98 (BITS_TO_LONGS(nr) * sizeof(unsigned long))
100 #define SECTOR_FROM_BLOCK(blk_addr) \
101 (((sector_t)blk_addr) << F2FS_LOG_SECTORS_PER_BLOCK)
102 #define SECTOR_TO_BLOCK(sectors) \
103 (sectors >> F2FS_LOG_SECTORS_PER_BLOCK)
104 #define MAX_BIO_BLOCKS(sbi) \
105 ((int)min((int)max_hw_blocks(sbi), BIO_MAX_PAGES))
108 * indicate a block allocation direction: RIGHT and LEFT.
109 * RIGHT means allocating new sections towards the end of volume.
110 * LEFT means the opposite direction.
118 * In the victim_sel_policy->alloc_mode, there are two block allocation modes.
119 * LFS writes data sequentially with cleaning operations.
120 * SSR (Slack Space Recycle) reuses obsolete space without cleaning operations.
128 * In the victim_sel_policy->gc_mode, there are two gc, aka cleaning, modes.
129 * GC_CB is based on cost-benefit algorithm.
130 * GC_GREEDY is based on greedy algorithm.
138 * BG_GC means the background cleaning job.
139 * FG_GC means the on-demand cleaning job.
140 * FORCE_FG_GC means on-demand cleaning job in background.
148 /* for a function parameter to select a victim segment */
149 struct victim_sel_policy
{
150 int alloc_mode
; /* LFS or SSR */
151 int gc_mode
; /* GC_CB or GC_GREEDY */
152 unsigned long *dirty_segmap
; /* dirty segment bitmap */
153 unsigned int max_search
; /* maximum # of segments to search */
154 unsigned int offset
; /* last scanned bitmap offset */
155 unsigned int ofs_unit
; /* bitmap search unit */
156 unsigned int min_cost
; /* minimum cost */
157 unsigned int min_segno
; /* segment # having min. cost */
161 unsigned int type
:6; /* segment type like CURSEG_XXX_TYPE */
162 unsigned int valid_blocks
:10; /* # of valid blocks */
163 unsigned int ckpt_valid_blocks
:10; /* # of valid blocks last cp */
164 unsigned int padding
:6; /* padding */
165 unsigned char *cur_valid_map
; /* validity bitmap of blocks */
167 * # of valid blocks and the validity bitmap stored in the the last
168 * checkpoint pack. This information is used by the SSR mode.
170 unsigned char *ckpt_valid_map
; /* validity bitmap of blocks last cp */
171 unsigned char *discard_map
;
172 unsigned long long mtime
; /* modification time of the segment */
176 unsigned int valid_blocks
; /* # of valid blocks in a section */
179 struct segment_allocation
{
180 void (*allocate_segment
)(struct f2fs_sb_info
*, int, bool);
184 * this value is set in page as a private data which indicate that
185 * the page is atomically written, and it is in inmem_pages list.
187 #define ATOMIC_WRITTEN_PAGE ((unsigned long)-1)
189 #define IS_ATOMIC_WRITTEN_PAGE(page) \
190 (page_private(page) == (unsigned long)ATOMIC_WRITTEN_PAGE)
193 struct list_head list
;
195 block_t old_addr
; /* for revoking when fail to commit */
199 const struct segment_allocation
*s_ops
;
201 block_t sit_base_addr
; /* start block address of SIT area */
202 block_t sit_blocks
; /* # of blocks used by SIT area */
203 block_t written_valid_blocks
; /* # of valid blocks in main area */
204 char *sit_bitmap
; /* SIT bitmap pointer */
205 unsigned int bitmap_size
; /* SIT bitmap size */
207 unsigned long *tmp_map
; /* bitmap for temporal use */
208 unsigned long *dirty_sentries_bitmap
; /* bitmap for dirty sentries */
209 unsigned int dirty_sentries
; /* # of dirty sentries */
210 unsigned int sents_per_block
; /* # of SIT entries per block */
211 struct mutex sentry_lock
; /* to protect SIT cache */
212 struct seg_entry
*sentries
; /* SIT segment-level cache */
213 struct sec_entry
*sec_entries
; /* SIT section-level cache */
215 /* for cost-benefit algorithm in cleaning procedure */
216 unsigned long long elapsed_time
; /* elapsed time after mount */
217 unsigned long long mounted_time
; /* mount time */
218 unsigned long long min_mtime
; /* min. modification time */
219 unsigned long long max_mtime
; /* max. modification time */
222 struct free_segmap_info
{
223 unsigned int start_segno
; /* start segment number logically */
224 unsigned int free_segments
; /* # of free segments */
225 unsigned int free_sections
; /* # of free sections */
226 spinlock_t segmap_lock
; /* free segmap lock */
227 unsigned long *free_segmap
; /* free segment bitmap */
228 unsigned long *free_secmap
; /* free section bitmap */
231 /* Notice: The order of dirty type is same with CURSEG_XXX in f2fs.h */
233 DIRTY_HOT_DATA
, /* dirty segments assigned as hot data logs */
234 DIRTY_WARM_DATA
, /* dirty segments assigned as warm data logs */
235 DIRTY_COLD_DATA
, /* dirty segments assigned as cold data logs */
236 DIRTY_HOT_NODE
, /* dirty segments assigned as hot node logs */
237 DIRTY_WARM_NODE
, /* dirty segments assigned as warm node logs */
238 DIRTY_COLD_NODE
, /* dirty segments assigned as cold node logs */
239 DIRTY
, /* to count # of dirty segments */
240 PRE
, /* to count # of entirely obsolete segments */
244 struct dirty_seglist_info
{
245 const struct victim_selection
*v_ops
; /* victim selction operation */
246 unsigned long *dirty_segmap
[NR_DIRTY_TYPE
];
247 struct mutex seglist_lock
; /* lock for segment bitmaps */
248 int nr_dirty
[NR_DIRTY_TYPE
]; /* # of dirty segments */
249 unsigned long *victim_secmap
; /* background GC victims */
252 /* victim selection function for cleaning and SSR */
253 struct victim_selection
{
254 int (*get_victim
)(struct f2fs_sb_info
*, unsigned int *,
258 /* for active log information */
260 struct mutex curseg_mutex
; /* lock for consistency */
261 struct f2fs_summary_block
*sum_blk
; /* cached summary block */
262 struct rw_semaphore journal_rwsem
; /* protect journal area */
263 struct f2fs_journal
*journal
; /* cached journal info */
264 unsigned char alloc_type
; /* current allocation type */
265 unsigned int segno
; /* current segment number */
266 unsigned short next_blkoff
; /* next block offset to write */
267 unsigned int zone
; /* current zone number */
268 unsigned int next_segno
; /* preallocated segment */
271 struct sit_entry_set
{
272 struct list_head set_list
; /* link with all sit sets */
273 unsigned int start_segno
; /* start segno of sits in set */
274 unsigned int entry_cnt
; /* the # of sit entries in set */
280 static inline struct curseg_info
*CURSEG_I(struct f2fs_sb_info
*sbi
, int type
)
282 return (struct curseg_info
*)(SM_I(sbi
)->curseg_array
+ type
);
285 static inline struct seg_entry
*get_seg_entry(struct f2fs_sb_info
*sbi
,
288 struct sit_info
*sit_i
= SIT_I(sbi
);
289 return &sit_i
->sentries
[segno
];
292 static inline struct sec_entry
*get_sec_entry(struct f2fs_sb_info
*sbi
,
295 struct sit_info
*sit_i
= SIT_I(sbi
);
296 return &sit_i
->sec_entries
[GET_SECNO(sbi
, segno
)];
299 static inline unsigned int get_valid_blocks(struct f2fs_sb_info
*sbi
,
300 unsigned int segno
, int section
)
303 * In order to get # of valid blocks in a section instantly from many
304 * segments, f2fs manages two counting structures separately.
307 return get_sec_entry(sbi
, segno
)->valid_blocks
;
309 return get_seg_entry(sbi
, segno
)->valid_blocks
;
312 static inline void seg_info_from_raw_sit(struct seg_entry
*se
,
313 struct f2fs_sit_entry
*rs
)
315 se
->valid_blocks
= GET_SIT_VBLOCKS(rs
);
316 se
->ckpt_valid_blocks
= GET_SIT_VBLOCKS(rs
);
317 memcpy(se
->cur_valid_map
, rs
->valid_map
, SIT_VBLOCK_MAP_SIZE
);
318 memcpy(se
->ckpt_valid_map
, rs
->valid_map
, SIT_VBLOCK_MAP_SIZE
);
319 se
->type
= GET_SIT_TYPE(rs
);
320 se
->mtime
= le64_to_cpu(rs
->mtime
);
323 static inline void seg_info_to_raw_sit(struct seg_entry
*se
,
324 struct f2fs_sit_entry
*rs
)
326 unsigned short raw_vblocks
= (se
->type
<< SIT_VBLOCKS_SHIFT
) |
328 rs
->vblocks
= cpu_to_le16(raw_vblocks
);
329 memcpy(rs
->valid_map
, se
->cur_valid_map
, SIT_VBLOCK_MAP_SIZE
);
330 memcpy(se
->ckpt_valid_map
, rs
->valid_map
, SIT_VBLOCK_MAP_SIZE
);
331 se
->ckpt_valid_blocks
= se
->valid_blocks
;
332 rs
->mtime
= cpu_to_le64(se
->mtime
);
335 static inline unsigned int find_next_inuse(struct free_segmap_info
*free_i
,
336 unsigned int max
, unsigned int segno
)
339 spin_lock(&free_i
->segmap_lock
);
340 ret
= find_next_bit(free_i
->free_segmap
, max
, segno
);
341 spin_unlock(&free_i
->segmap_lock
);
345 static inline void __set_free(struct f2fs_sb_info
*sbi
, unsigned int segno
)
347 struct free_segmap_info
*free_i
= FREE_I(sbi
);
348 unsigned int secno
= segno
/ sbi
->segs_per_sec
;
349 unsigned int start_segno
= secno
* sbi
->segs_per_sec
;
352 spin_lock(&free_i
->segmap_lock
);
353 clear_bit(segno
, free_i
->free_segmap
);
354 free_i
->free_segments
++;
356 next
= find_next_bit(free_i
->free_segmap
,
357 start_segno
+ sbi
->segs_per_sec
, start_segno
);
358 if (next
>= start_segno
+ sbi
->segs_per_sec
) {
359 clear_bit(secno
, free_i
->free_secmap
);
360 free_i
->free_sections
++;
362 spin_unlock(&free_i
->segmap_lock
);
365 static inline void __set_inuse(struct f2fs_sb_info
*sbi
,
368 struct free_segmap_info
*free_i
= FREE_I(sbi
);
369 unsigned int secno
= segno
/ sbi
->segs_per_sec
;
370 set_bit(segno
, free_i
->free_segmap
);
371 free_i
->free_segments
--;
372 if (!test_and_set_bit(secno
, free_i
->free_secmap
))
373 free_i
->free_sections
--;
376 static inline void __set_test_and_free(struct f2fs_sb_info
*sbi
,
379 struct free_segmap_info
*free_i
= FREE_I(sbi
);
380 unsigned int secno
= segno
/ sbi
->segs_per_sec
;
381 unsigned int start_segno
= secno
* sbi
->segs_per_sec
;
384 spin_lock(&free_i
->segmap_lock
);
385 if (test_and_clear_bit(segno
, free_i
->free_segmap
)) {
386 free_i
->free_segments
++;
388 next
= find_next_bit(free_i
->free_segmap
,
389 start_segno
+ sbi
->segs_per_sec
, start_segno
);
390 if (next
>= start_segno
+ sbi
->segs_per_sec
) {
391 if (test_and_clear_bit(secno
, free_i
->free_secmap
))
392 free_i
->free_sections
++;
395 spin_unlock(&free_i
->segmap_lock
);
398 static inline void __set_test_and_inuse(struct f2fs_sb_info
*sbi
,
401 struct free_segmap_info
*free_i
= FREE_I(sbi
);
402 unsigned int secno
= segno
/ sbi
->segs_per_sec
;
403 spin_lock(&free_i
->segmap_lock
);
404 if (!test_and_set_bit(segno
, free_i
->free_segmap
)) {
405 free_i
->free_segments
--;
406 if (!test_and_set_bit(secno
, free_i
->free_secmap
))
407 free_i
->free_sections
--;
409 spin_unlock(&free_i
->segmap_lock
);
412 static inline void get_sit_bitmap(struct f2fs_sb_info
*sbi
,
415 struct sit_info
*sit_i
= SIT_I(sbi
);
416 memcpy(dst_addr
, sit_i
->sit_bitmap
, sit_i
->bitmap_size
);
419 static inline block_t
written_block_count(struct f2fs_sb_info
*sbi
)
421 return SIT_I(sbi
)->written_valid_blocks
;
424 static inline unsigned int free_segments(struct f2fs_sb_info
*sbi
)
426 return FREE_I(sbi
)->free_segments
;
429 static inline int reserved_segments(struct f2fs_sb_info
*sbi
)
431 return SM_I(sbi
)->reserved_segments
;
434 static inline unsigned int free_sections(struct f2fs_sb_info
*sbi
)
436 return FREE_I(sbi
)->free_sections
;
439 static inline unsigned int prefree_segments(struct f2fs_sb_info
*sbi
)
441 return DIRTY_I(sbi
)->nr_dirty
[PRE
];
444 static inline unsigned int dirty_segments(struct f2fs_sb_info
*sbi
)
446 return DIRTY_I(sbi
)->nr_dirty
[DIRTY_HOT_DATA
] +
447 DIRTY_I(sbi
)->nr_dirty
[DIRTY_WARM_DATA
] +
448 DIRTY_I(sbi
)->nr_dirty
[DIRTY_COLD_DATA
] +
449 DIRTY_I(sbi
)->nr_dirty
[DIRTY_HOT_NODE
] +
450 DIRTY_I(sbi
)->nr_dirty
[DIRTY_WARM_NODE
] +
451 DIRTY_I(sbi
)->nr_dirty
[DIRTY_COLD_NODE
];
454 static inline int overprovision_segments(struct f2fs_sb_info
*sbi
)
456 return SM_I(sbi
)->ovp_segments
;
459 static inline int overprovision_sections(struct f2fs_sb_info
*sbi
)
461 return ((unsigned int) overprovision_segments(sbi
)) / sbi
->segs_per_sec
;
464 static inline int reserved_sections(struct f2fs_sb_info
*sbi
)
466 return ((unsigned int) reserved_segments(sbi
)) / sbi
->segs_per_sec
;
469 static inline bool need_SSR(struct f2fs_sb_info
*sbi
)
471 int node_secs
= get_blocktype_secs(sbi
, F2FS_DIRTY_NODES
);
472 int dent_secs
= get_blocktype_secs(sbi
, F2FS_DIRTY_DENTS
);
473 return free_sections(sbi
) <= (node_secs
+ 2 * dent_secs
+
474 reserved_sections(sbi
) + 1);
477 static inline bool has_not_enough_free_secs(struct f2fs_sb_info
*sbi
, int freed
)
479 int node_secs
= get_blocktype_secs(sbi
, F2FS_DIRTY_NODES
);
480 int dent_secs
= get_blocktype_secs(sbi
, F2FS_DIRTY_DENTS
);
482 if (unlikely(is_sbi_flag_set(sbi
, SBI_POR_DOING
)))
485 return (free_sections(sbi
) + freed
) <= (node_secs
+ 2 * dent_secs
+
486 reserved_sections(sbi
));
489 static inline bool excess_prefree_segs(struct f2fs_sb_info
*sbi
)
491 return prefree_segments(sbi
) > SM_I(sbi
)->rec_prefree_segments
;
494 static inline int utilization(struct f2fs_sb_info
*sbi
)
496 return div_u64((u64
)valid_user_blocks(sbi
) * 100,
497 sbi
->user_block_count
);
501 * Sometimes f2fs may be better to drop out-of-place update policy.
502 * And, users can control the policy through sysfs entries.
503 * There are five policies with triggering conditions as follows.
504 * F2FS_IPU_FORCE - all the time,
505 * F2FS_IPU_SSR - if SSR mode is activated,
506 * F2FS_IPU_UTIL - if FS utilization is over threashold,
507 * F2FS_IPU_SSR_UTIL - if SSR mode is activated and FS utilization is over
509 * F2FS_IPU_FSYNC - activated in fsync path only for high performance flash
510 * storages. IPU will be triggered only if the # of dirty
511 * pages over min_fsync_blocks.
512 * F2FS_IPUT_DISABLE - disable IPU. (=default option)
514 #define DEF_MIN_IPU_UTIL 70
515 #define DEF_MIN_FSYNC_BLOCKS 8
525 static inline bool need_inplace_update(struct inode
*inode
)
527 struct f2fs_sb_info
*sbi
= F2FS_I_SB(inode
);
528 unsigned int policy
= SM_I(sbi
)->ipu_policy
;
530 /* IPU can be done only for the user data */
531 if (S_ISDIR(inode
->i_mode
) || f2fs_is_atomic_file(inode
))
534 if (policy
& (0x1 << F2FS_IPU_FORCE
))
536 if (policy
& (0x1 << F2FS_IPU_SSR
) && need_SSR(sbi
))
538 if (policy
& (0x1 << F2FS_IPU_UTIL
) &&
539 utilization(sbi
) > SM_I(sbi
)->min_ipu_util
)
541 if (policy
& (0x1 << F2FS_IPU_SSR_UTIL
) && need_SSR(sbi
) &&
542 utilization(sbi
) > SM_I(sbi
)->min_ipu_util
)
545 /* this is only set during fdatasync */
546 if (policy
& (0x1 << F2FS_IPU_FSYNC
) &&
547 is_inode_flag_set(F2FS_I(inode
), FI_NEED_IPU
))
553 static inline unsigned int curseg_segno(struct f2fs_sb_info
*sbi
,
556 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
557 return curseg
->segno
;
560 static inline unsigned char curseg_alloc_type(struct f2fs_sb_info
*sbi
,
563 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
564 return curseg
->alloc_type
;
567 static inline unsigned short curseg_blkoff(struct f2fs_sb_info
*sbi
, int type
)
569 struct curseg_info
*curseg
= CURSEG_I(sbi
, type
);
570 return curseg
->next_blkoff
;
573 static inline void check_seg_range(struct f2fs_sb_info
*sbi
, unsigned int segno
)
575 f2fs_bug_on(sbi
, segno
> TOTAL_SEGS(sbi
) - 1);
578 static inline void verify_block_addr(struct f2fs_sb_info
*sbi
, block_t blk_addr
)
580 f2fs_bug_on(sbi
, blk_addr
< SEG0_BLKADDR(sbi
)
581 || blk_addr
>= MAX_BLKADDR(sbi
));
585 * Summary block is always treated as an invalid block
587 static inline void check_block_count(struct f2fs_sb_info
*sbi
,
588 int segno
, struct f2fs_sit_entry
*raw_sit
)
590 #ifdef CONFIG_F2FS_CHECK_FS
591 bool is_valid
= test_bit_le(0, raw_sit
->valid_map
) ? true : false;
592 int valid_blocks
= 0;
593 int cur_pos
= 0, next_pos
;
595 /* check bitmap with valid block count */
598 next_pos
= find_next_zero_bit_le(&raw_sit
->valid_map
,
601 valid_blocks
+= next_pos
- cur_pos
;
603 next_pos
= find_next_bit_le(&raw_sit
->valid_map
,
607 is_valid
= !is_valid
;
608 } while (cur_pos
< sbi
->blocks_per_seg
);
609 BUG_ON(GET_SIT_VBLOCKS(raw_sit
) != valid_blocks
);
611 /* check segment usage, and check boundary of a given segment number */
612 f2fs_bug_on(sbi
, GET_SIT_VBLOCKS(raw_sit
) > sbi
->blocks_per_seg
613 || segno
> TOTAL_SEGS(sbi
) - 1);
616 static inline pgoff_t
current_sit_addr(struct f2fs_sb_info
*sbi
,
619 struct sit_info
*sit_i
= SIT_I(sbi
);
620 unsigned int offset
= SIT_BLOCK_OFFSET(start
);
621 block_t blk_addr
= sit_i
->sit_base_addr
+ offset
;
623 check_seg_range(sbi
, start
);
625 /* calculate sit block address */
626 if (f2fs_test_bit(offset
, sit_i
->sit_bitmap
))
627 blk_addr
+= sit_i
->sit_blocks
;
632 static inline pgoff_t
next_sit_addr(struct f2fs_sb_info
*sbi
,
635 struct sit_info
*sit_i
= SIT_I(sbi
);
636 block_addr
-= sit_i
->sit_base_addr
;
637 if (block_addr
< sit_i
->sit_blocks
)
638 block_addr
+= sit_i
->sit_blocks
;
640 block_addr
-= sit_i
->sit_blocks
;
642 return block_addr
+ sit_i
->sit_base_addr
;
645 static inline void set_to_next_sit(struct sit_info
*sit_i
, unsigned int start
)
647 unsigned int block_off
= SIT_BLOCK_OFFSET(start
);
649 f2fs_change_bit(block_off
, sit_i
->sit_bitmap
);
652 static inline unsigned long long get_mtime(struct f2fs_sb_info
*sbi
)
654 struct sit_info
*sit_i
= SIT_I(sbi
);
655 return sit_i
->elapsed_time
+ CURRENT_TIME_SEC
.tv_sec
-
659 static inline void set_summary(struct f2fs_summary
*sum
, nid_t nid
,
660 unsigned int ofs_in_node
, unsigned char version
)
662 sum
->nid
= cpu_to_le32(nid
);
663 sum
->ofs_in_node
= cpu_to_le16(ofs_in_node
);
664 sum
->version
= version
;
667 static inline block_t
start_sum_block(struct f2fs_sb_info
*sbi
)
669 return __start_cp_addr(sbi
) +
670 le32_to_cpu(F2FS_CKPT(sbi
)->cp_pack_start_sum
);
673 static inline block_t
sum_blk_addr(struct f2fs_sb_info
*sbi
, int base
, int type
)
675 return __start_cp_addr(sbi
) +
676 le32_to_cpu(F2FS_CKPT(sbi
)->cp_pack_total_block_count
)
680 static inline bool sec_usage_check(struct f2fs_sb_info
*sbi
, unsigned int secno
)
682 if (IS_CURSEC(sbi
, secno
) || (sbi
->cur_victim_sec
== secno
))
687 static inline unsigned int max_hw_blocks(struct f2fs_sb_info
*sbi
)
689 struct block_device
*bdev
= sbi
->sb
->s_bdev
;
690 struct request_queue
*q
= bdev_get_queue(bdev
);
691 return SECTOR_TO_BLOCK(queue_max_sectors(q
));
695 * It is very important to gather dirty pages and write at once, so that we can
696 * submit a big bio without interfering other data writes.
697 * By default, 512 pages for directory data,
698 * 512 pages (2MB) * 3 for three types of nodes, and
699 * max_bio_blocks for meta are set.
701 static inline int nr_pages_to_skip(struct f2fs_sb_info
*sbi
, int type
)
703 if (sbi
->sb
->s_bdi
->wb
.dirty_exceeded
)
707 return sbi
->blocks_per_seg
;
708 else if (type
== NODE
)
709 return 3 * sbi
->blocks_per_seg
;
710 else if (type
== META
)
711 return MAX_BIO_BLOCKS(sbi
);
717 * When writing pages, it'd better align nr_to_write for segment size.
719 static inline long nr_pages_to_write(struct f2fs_sb_info
*sbi
, int type
,
720 struct writeback_control
*wbc
)
722 long nr_to_write
, desired
;
724 if (wbc
->sync_mode
!= WB_SYNC_NONE
)
727 nr_to_write
= wbc
->nr_to_write
;
731 else if (type
== NODE
)
732 desired
= 3 * max_hw_blocks(sbi
);
734 desired
= MAX_BIO_BLOCKS(sbi
);
736 wbc
->nr_to_write
= desired
;
737 return desired
- nr_to_write
;