projects / deliverable / linux.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
f2fs: introduce a radix_tree for the free_nid list
[deliverable/linux.git] / fs / f2fs / segment.h
CommitLineData
0a8165d7 1/*
39a53e0c
JK		 2 * fs/f2fs/segment.h
3 *
4 * Copyright (c) 2012 Samsung Electronics Co., Ltd.
5 * http://www.samsung.com/
6 *
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.
10 */
ac5d156c
JK		 11#include <linux/blkdev.h>
12
39a53e0c
JK		 13/* constant macro */
14#define NULL_SEGNO ((unsigned int)(~0))
5ec4e49f 15#define NULL_SECNO ((unsigned int)(~0))
39a53e0c 16
81eb8d6e
JK		 17#define DEF_RECLAIM_PREFREE_SEGMENTS 100 /* 200MB of prefree segments */
18
6224da87 19/* L: Logical segment # in volume, R: Relative segment # in main area */
39a53e0c
JK		 20#define GET_L2R_SEGNO(free_i, segno) (segno - free_i->start_segno)
21#define GET_R2L_SEGNO(free_i, segno) (segno + free_i->start_segno)
22
61ae45c8
CL		 23#define IS_DATASEG(t) (t <= CURSEG_COLD_DATA)
24#define IS_NODESEG(t) (t >= CURSEG_HOT_NODE)
39a53e0c 25
5c773ba3
JK		 26#define IS_CURSEG(sbi, seg) \
27 ((seg == CURSEG_I(sbi, CURSEG_HOT_DATA)->segno) || \
28 (seg == CURSEG_I(sbi, CURSEG_WARM_DATA)->segno) || \
29 (seg == CURSEG_I(sbi, CURSEG_COLD_DATA)->segno) || \
30 (seg == CURSEG_I(sbi, CURSEG_HOT_NODE)->segno) || \
31 (seg == CURSEG_I(sbi, CURSEG_WARM_NODE)->segno) || \
32 (seg == CURSEG_I(sbi, CURSEG_COLD_NODE)->segno))
39a53e0c
JK		 33
34#define IS_CURSEC(sbi, secno) \
35 ((secno == CURSEG_I(sbi, CURSEG_HOT_DATA)->segno / \
36 sbi->segs_per_sec) || \
37 (secno == CURSEG_I(sbi, CURSEG_WARM_DATA)->segno / \
38 sbi->segs_per_sec) || \
39 (secno == CURSEG_I(sbi, CURSEG_COLD_DATA)->segno / \
40 sbi->segs_per_sec) || \
41 (secno == CURSEG_I(sbi, CURSEG_HOT_NODE)->segno / \
42 sbi->segs_per_sec) || \
43 (secno == CURSEG_I(sbi, CURSEG_WARM_NODE)->segno / \
44 sbi->segs_per_sec) || \
45 (secno == CURSEG_I(sbi, CURSEG_COLD_NODE)->segno / \
46 sbi->segs_per_sec)) \
47
48#define START_BLOCK(sbi, segno) \
49 (SM_I(sbi)->seg0_blkaddr + \
50 (GET_R2L_SEGNO(FREE_I(sbi), segno) << sbi->log_blocks_per_seg))
51#define NEXT_FREE_BLKADDR(sbi, curseg) \
52 (START_BLOCK(sbi, curseg->segno) + curseg->next_blkoff)
53
54#define MAIN_BASE_BLOCK(sbi) (SM_I(sbi)->main_blkaddr)
55
56#define GET_SEGOFF_FROM_SEG0(sbi, blk_addr) \
57 ((blk_addr) - SM_I(sbi)->seg0_blkaddr)
58#define GET_SEGNO_FROM_SEG0(sbi, blk_addr) \
59 (GET_SEGOFF_FROM_SEG0(sbi, blk_addr) >> sbi->log_blocks_per_seg)
491c0854
JK		 60#define GET_BLKOFF_FROM_SEG0(sbi, blk_addr) \
61 (GET_SEGOFF_FROM_SEG0(sbi, blk_addr) & (sbi->blocks_per_seg - 1))
62
39a53e0c
JK		 63#define GET_SEGNO(sbi, blk_addr) \
64 (((blk_addr == NULL_ADDR) || (blk_addr == NEW_ADDR)) ? \
65 NULL_SEGNO : GET_L2R_SEGNO(FREE_I(sbi), \
66 GET_SEGNO_FROM_SEG0(sbi, blk_addr)))
67#define GET_SECNO(sbi, segno) \
68 ((segno) / sbi->segs_per_sec)
69#define GET_ZONENO_FROM_SEGNO(sbi, segno) \
70 ((segno / sbi->segs_per_sec) / sbi->secs_per_zone)
71
72#define GET_SUM_BLOCK(sbi, segno) \
73 ((sbi->sm_info->ssa_blkaddr) + segno)
74
75#define GET_SUM_TYPE(footer) ((footer)->entry_type)
76#define SET_SUM_TYPE(footer, type) ((footer)->entry_type = type)
77
78#define SIT_ENTRY_OFFSET(sit_i, segno) \
79 (segno % sit_i->sents_per_block)
80#define SIT_BLOCK_OFFSET(sit_i, segno) \
81 (segno / SIT_ENTRY_PER_BLOCK)
82#define START_SEGNO(sit_i, segno) \
83 (SIT_BLOCK_OFFSET(sit_i, segno) * SIT_ENTRY_PER_BLOCK)
74de593a
CY		 84#define SIT_BLK_CNT(sbi) \
85 ((TOTAL_SEGS(sbi) + SIT_ENTRY_PER_BLOCK - 1) / SIT_ENTRY_PER_BLOCK)
39a53e0c
JK		 86#define f2fs_bitmap_size(nr) \
87 (BITS_TO_LONGS(nr) * sizeof(unsigned long))
88#define TOTAL_SEGS(sbi) (SM_I(sbi)->main_segments)
53cf9522 89#define TOTAL_SECS(sbi) (sbi->total_sections)
39a53e0c 90
3cd8a239 91#define SECTOR_FROM_BLOCK(sbi, blk_addr) \
f9a4e6df 92 (((sector_t)blk_addr) << (sbi)->log_sectors_per_block)
ac5d156c 93#define SECTOR_TO_BLOCK(sbi, sectors) \
f9a4e6df 94 (sectors >> (sbi)->log_sectors_per_block)
cc7b1bb1
CY		 95#define MAX_BIO_BLOCKS(max_hw_blocks) \
96 (min((int)max_hw_blocks, BIO_MAX_PAGES))
3cd8a239 97
39a53e0c
JK		 98/*
99 * indicate a block allocation direction: RIGHT and LEFT.
100 * RIGHT means allocating new sections towards the end of volume.
101 * LEFT means the opposite direction.
102 */
103enum {
104 ALLOC_RIGHT = 0,
105 ALLOC_LEFT
106};
107
108/*
109 * In the victim_sel_policy->alloc_mode, there are two block allocation modes.
110 * LFS writes data sequentially with cleaning operations.
111 * SSR (Slack Space Recycle) reuses obsolete space without cleaning operations.
112 */
113enum {
114 LFS = 0,
115 SSR
116};
117
118/*
119 * In the victim_sel_policy->gc_mode, there are two gc, aka cleaning, modes.
120 * GC_CB is based on cost-benefit algorithm.
121 * GC_GREEDY is based on greedy algorithm.
122 */
123enum {
124 GC_CB = 0,
125 GC_GREEDY
126};
127
128/*
129 * BG_GC means the background cleaning job.
130 * FG_GC means the on-demand cleaning job.
131 */
132enum {
133 BG_GC = 0,
134 FG_GC
135};
136
137/* for a function parameter to select a victim segment */
138struct victim_sel_policy {
139 int alloc_mode; /* LFS or SSR */
140 int gc_mode; /* GC_CB or GC_GREEDY */
141 unsigned long *dirty_segmap; /* dirty segment bitmap */
a26b7c8a 142 unsigned int max_search; /* maximum # of segments to search */
39a53e0c
JK		 143 unsigned int offset; /* last scanned bitmap offset */
144 unsigned int ofs_unit; /* bitmap search unit */
145 unsigned int min_cost; /* minimum cost */
146 unsigned int min_segno; /* segment # having min. cost */
147};
148
149struct seg_entry {
150 unsigned short valid_blocks; /* # of valid blocks */
151 unsigned char *cur_valid_map; /* validity bitmap of blocks */
152 /*
153 * # of valid blocks and the validity bitmap stored in the the last
154 * checkpoint pack. This information is used by the SSR mode.
155 */
156 unsigned short ckpt_valid_blocks;
157 unsigned char *ckpt_valid_map;
158 unsigned char type; /* segment type like CURSEG_XXX_TYPE */
159 unsigned long long mtime; /* modification time of the segment */
160};
161
162struct sec_entry {
163 unsigned int valid_blocks; /* # of valid blocks in a section */
164};
165
166struct segment_allocation {
167 void (*allocate_segment)(struct f2fs_sb_info *, int, bool);
168};
169
170struct sit_info {
171 const struct segment_allocation *s_ops;
172
173 block_t sit_base_addr; /* start block address of SIT area */
174 block_t sit_blocks; /* # of blocks used by SIT area */
175 block_t written_valid_blocks; /* # of valid blocks in main area */
176 char *sit_bitmap; /* SIT bitmap pointer */
177 unsigned int bitmap_size; /* SIT bitmap size */
178
179 unsigned long *dirty_sentries_bitmap; /* bitmap for dirty sentries */
180 unsigned int dirty_sentries; /* # of dirty sentries */
181 unsigned int sents_per_block; /* # of SIT entries per block */
182 struct mutex sentry_lock; /* to protect SIT cache */
183 struct seg_entry *sentries; /* SIT segment-level cache */
184 struct sec_entry *sec_entries; /* SIT section-level cache */
185
186 /* for cost-benefit algorithm in cleaning procedure */
187 unsigned long long elapsed_time; /* elapsed time after mount */
188 unsigned long long mounted_time; /* mount time */
189 unsigned long long min_mtime; /* min. modification time */
190 unsigned long long max_mtime; /* max. modification time */
191};
192
193struct free_segmap_info {
194 unsigned int start_segno; /* start segment number logically */
195 unsigned int free_segments; /* # of free segments */
196 unsigned int free_sections; /* # of free sections */
197 rwlock_t segmap_lock; /* free segmap lock */
198 unsigned long *free_segmap; /* free segment bitmap */
199 unsigned long *free_secmap; /* free section bitmap */
200};
201
202/* Notice: The order of dirty type is same with CURSEG_XXX in f2fs.h */
203enum dirty_type {
204 DIRTY_HOT_DATA, /* dirty segments assigned as hot data logs */
205 DIRTY_WARM_DATA, /* dirty segments assigned as warm data logs */
206 DIRTY_COLD_DATA, /* dirty segments assigned as cold data logs */
207 DIRTY_HOT_NODE, /* dirty segments assigned as hot node logs */
208 DIRTY_WARM_NODE, /* dirty segments assigned as warm node logs */
209 DIRTY_COLD_NODE, /* dirty segments assigned as cold node logs */
210 DIRTY, /* to count # of dirty segments */
211 PRE, /* to count # of entirely obsolete segments */
212 NR_DIRTY_TYPE
213};
214
215struct dirty_seglist_info {
216 const struct victim_selection *v_ops; /* victim selction operation */
217 unsigned long *dirty_segmap[NR_DIRTY_TYPE];
218 struct mutex seglist_lock; /* lock for segment bitmaps */
219 int nr_dirty[NR_DIRTY_TYPE]; /* # of dirty segments */
5ec4e49f 220 unsigned long *victim_secmap; /* background GC victims */
39a53e0c
JK		 221};
222
223/* victim selection function for cleaning and SSR */
224struct victim_selection {
225 int (*get_victim)(struct f2fs_sb_info *, unsigned int *,
226 int, int, char);
227};
228
229/* for active log information */
230struct curseg_info {
231 struct mutex curseg_mutex; /* lock for consistency */
232 struct f2fs_summary_block *sum_blk; /* cached summary block */
233 unsigned char alloc_type; /* current allocation type */
234 unsigned int segno; /* current segment number */
235 unsigned short next_blkoff; /* next block offset to write */
236 unsigned int zone; /* current zone number */
237 unsigned int next_segno; /* preallocated segment */
238};
239
240/*
241 * inline functions
242 */
243static inline struct curseg_info *CURSEG_I(struct f2fs_sb_info *sbi, int type)
244{
245 return (struct curseg_info *)(SM_I(sbi)->curseg_array + type);
246}
247
248static inline struct seg_entry *get_seg_entry(struct f2fs_sb_info *sbi,
249 unsigned int segno)
250{
251 struct sit_info *sit_i = SIT_I(sbi);
252 return &sit_i->sentries[segno];
253}
254
255static inline struct sec_entry *get_sec_entry(struct f2fs_sb_info *sbi,
256 unsigned int segno)
257{
258 struct sit_info *sit_i = SIT_I(sbi);
259 return &sit_i->sec_entries[GET_SECNO(sbi, segno)];
260}
261
262static inline unsigned int get_valid_blocks(struct f2fs_sb_info *sbi,
263 unsigned int segno, int section)
264{
265 /*
266 * In order to get # of valid blocks in a section instantly from many
267 * segments, f2fs manages two counting structures separately.
268 */
269 if (section > 1)
270 return get_sec_entry(sbi, segno)->valid_blocks;
271 else
272 return get_seg_entry(sbi, segno)->valid_blocks;
273}
274
275static inline void seg_info_from_raw_sit(struct seg_entry *se,
276 struct f2fs_sit_entry *rs)
277{
278 se->valid_blocks = GET_SIT_VBLOCKS(rs);
279 se->ckpt_valid_blocks = GET_SIT_VBLOCKS(rs);
280 memcpy(se->cur_valid_map, rs->valid_map, SIT_VBLOCK_MAP_SIZE);
281 memcpy(se->ckpt_valid_map, rs->valid_map, SIT_VBLOCK_MAP_SIZE);
282 se->type = GET_SIT_TYPE(rs);
283 se->mtime = le64_to_cpu(rs->mtime);
284}
285
286static inline void seg_info_to_raw_sit(struct seg_entry *se,
287 struct f2fs_sit_entry *rs)
288{
289 unsigned short raw_vblocks = (se->type << SIT_VBLOCKS_SHIFT) |
290 se->valid_blocks;
291 rs->vblocks = cpu_to_le16(raw_vblocks);
292 memcpy(rs->valid_map, se->cur_valid_map, SIT_VBLOCK_MAP_SIZE);
293 memcpy(se->ckpt_valid_map, rs->valid_map, SIT_VBLOCK_MAP_SIZE);
294 se->ckpt_valid_blocks = se->valid_blocks;
295 rs->mtime = cpu_to_le64(se->mtime);
296}
297
298static inline unsigned int find_next_inuse(struct free_segmap_info *free_i,
299 unsigned int max, unsigned int segno)
300{
301 unsigned int ret;
302 read_lock(&free_i->segmap_lock);
303 ret = find_next_bit(free_i->free_segmap, max, segno);
304 read_unlock(&free_i->segmap_lock);
305 return ret;
306}
307
308static inline void __set_free(struct f2fs_sb_info *sbi, unsigned int segno)
309{
310 struct free_segmap_info *free_i = FREE_I(sbi);
311 unsigned int secno = segno / sbi->segs_per_sec;
312 unsigned int start_segno = secno * sbi->segs_per_sec;
313 unsigned int next;
314
315 write_lock(&free_i->segmap_lock);
316 clear_bit(segno, free_i->free_segmap);
317 free_i->free_segments++;
318
319 next = find_next_bit(free_i->free_segmap, TOTAL_SEGS(sbi), start_segno);
320 if (next >= start_segno + sbi->segs_per_sec) {
321 clear_bit(secno, free_i->free_secmap);
322 free_i->free_sections++;
323 }
324 write_unlock(&free_i->segmap_lock);
325}
326
327static inline void __set_inuse(struct f2fs_sb_info *sbi,
328 unsigned int segno)
329{
330 struct free_segmap_info *free_i = FREE_I(sbi);
331 unsigned int secno = segno / sbi->segs_per_sec;
332 set_bit(segno, free_i->free_segmap);
333 free_i->free_segments--;
334 if (!test_and_set_bit(secno, free_i->free_secmap))
335 free_i->free_sections--;
336}
337
338static inline void __set_test_and_free(struct f2fs_sb_info *sbi,
339 unsigned int segno)
340{
341 struct free_segmap_info *free_i = FREE_I(sbi);
342 unsigned int secno = segno / sbi->segs_per_sec;
343 unsigned int start_segno = secno * sbi->segs_per_sec;
344 unsigned int next;
345
346 write_lock(&free_i->segmap_lock);
347 if (test_and_clear_bit(segno, free_i->free_segmap)) {
348 free_i->free_segments++;
349
350 next = find_next_bit(free_i->free_segmap, TOTAL_SEGS(sbi),
351 start_segno);
352 if (next >= start_segno + sbi->segs_per_sec) {
353 if (test_and_clear_bit(secno, free_i->free_secmap))
354 free_i->free_sections++;
355 }
356 }
357 write_unlock(&free_i->segmap_lock);
358}
359
360static inline void __set_test_and_inuse(struct f2fs_sb_info *sbi,
361 unsigned int segno)
362{
363 struct free_segmap_info *free_i = FREE_I(sbi);
364 unsigned int secno = segno / sbi->segs_per_sec;
365 write_lock(&free_i->segmap_lock);
366 if (!test_and_set_bit(segno, free_i->free_segmap)) {
367 free_i->free_segments--;
368 if (!test_and_set_bit(secno, free_i->free_secmap))
369 free_i->free_sections--;
370 }
371 write_unlock(&free_i->segmap_lock);
372}
373
374static inline void get_sit_bitmap(struct f2fs_sb_info *sbi,
375 void *dst_addr)
376{
377 struct sit_info *sit_i = SIT_I(sbi);
378 memcpy(dst_addr, sit_i->sit_bitmap, sit_i->bitmap_size);
379}
380
381static inline block_t written_block_count(struct f2fs_sb_info *sbi)
382{
383 struct sit_info *sit_i = SIT_I(sbi);
384 block_t vblocks;
385
386 mutex_lock(&sit_i->sentry_lock);
387 vblocks = sit_i->written_valid_blocks;
388 mutex_unlock(&sit_i->sentry_lock);
389
390 return vblocks;
391}
392
393static inline unsigned int free_segments(struct f2fs_sb_info *sbi)
394{
395 struct free_segmap_info *free_i = FREE_I(sbi);
396 unsigned int free_segs;
397
398 read_lock(&free_i->segmap_lock);
399 free_segs = free_i->free_segments;
400 read_unlock(&free_i->segmap_lock);
401
402 return free_segs;
403}
404
405static inline int reserved_segments(struct f2fs_sb_info *sbi)
406{
407 return SM_I(sbi)->reserved_segments;
408}
409
410static inline unsigned int free_sections(struct f2fs_sb_info *sbi)
411{
412 struct free_segmap_info *free_i = FREE_I(sbi);
413 unsigned int free_secs;
414
415 read_lock(&free_i->segmap_lock);
416 free_secs = free_i->free_sections;
417 read_unlock(&free_i->segmap_lock);
418
419 return free_secs;
420}
421
422static inline unsigned int prefree_segments(struct f2fs_sb_info *sbi)
423{
424 return DIRTY_I(sbi)->nr_dirty[PRE];
425}
426
427static inline unsigned int dirty_segments(struct f2fs_sb_info *sbi)
428{
429 return DIRTY_I(sbi)->nr_dirty[DIRTY_HOT_DATA] +
430 DIRTY_I(sbi)->nr_dirty[DIRTY_WARM_DATA] +
431 DIRTY_I(sbi)->nr_dirty[DIRTY_COLD_DATA] +
432 DIRTY_I(sbi)->nr_dirty[DIRTY_HOT_NODE] +
433 DIRTY_I(sbi)->nr_dirty[DIRTY_WARM_NODE] +
434 DIRTY_I(sbi)->nr_dirty[DIRTY_COLD_NODE];
435}
436
437static inline int overprovision_segments(struct f2fs_sb_info *sbi)
438{
439 return SM_I(sbi)->ovp_segments;
440}
441
442static inline int overprovision_sections(struct f2fs_sb_info *sbi)
443{
444 return ((unsigned int) overprovision_segments(sbi)) / sbi->segs_per_sec;
445}
446
447static inline int reserved_sections(struct f2fs_sb_info *sbi)
448{
449 return ((unsigned int) reserved_segments(sbi)) / sbi->segs_per_sec;
450}
451
452static inline bool need_SSR(struct f2fs_sb_info *sbi)
453{
6c311ec6
CF		 454 return (prefree_segments(sbi) / sbi->segs_per_sec)
455 + free_sections(sbi) < overprovision_sections(sbi);
39a53e0c
JK		 456}
457
43727527 458static inline bool has_not_enough_free_secs(struct f2fs_sb_info *sbi, int freed)
39a53e0c 459{
5ac206cf
NJ		 460 int node_secs = get_blocktype_secs(sbi, F2FS_DIRTY_NODES);
461 int dent_secs = get_blocktype_secs(sbi, F2FS_DIRTY_DENTS);
43727527 462
cfb271d4 463 if (unlikely(sbi->por_doing))
029cd28c
JK		 464 return false;
465
6c311ec6
CF		 466 return (free_sections(sbi) + freed) <= (node_secs + 2 * dent_secs +
467 reserved_sections(sbi));
39a53e0c
JK		 468}
469
81eb8d6e
JK		 470static inline bool excess_prefree_segs(struct f2fs_sb_info *sbi)
471{
6c311ec6 472 return prefree_segments(sbi) > SM_I(sbi)->rec_prefree_segments;
81eb8d6e
JK		 473}
474
39a53e0c
JK		 475static inline int utilization(struct f2fs_sb_info *sbi)
476{
6c311ec6
CF		 477 return div_u64((u64)valid_user_blocks(sbi) * 100,
478 sbi->user_block_count);
39a53e0c
JK		 479}
480
481/*
482 * Sometimes f2fs may be better to drop out-of-place update policy.
216fbd64
JK		 483 * And, users can control the policy through sysfs entries.
484 * There are five policies with triggering conditions as follows.
485 * F2FS_IPU_FORCE - all the time,
486 * F2FS_IPU_SSR - if SSR mode is activated,
487 * F2FS_IPU_UTIL - if FS utilization is over threashold,
488 * F2FS_IPU_SSR_UTIL - if SSR mode is activated and FS utilization is over
489 * threashold,
490 * F2FS_IPUT_DISABLE - disable IPU. (=default option)
39a53e0c 491 */
216fbd64
JK		 492#define DEF_MIN_IPU_UTIL 70
493
494enum {
495 F2FS_IPU_FORCE,
496 F2FS_IPU_SSR,
497 F2FS_IPU_UTIL,
498 F2FS_IPU_SSR_UTIL,
499 F2FS_IPU_DISABLE,
500};
501
39a53e0c
JK		 502static inline bool need_inplace_update(struct inode *inode)
503{
504 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
216fbd64
JK		 505
506 /* IPU can be done only for the user data */
39a53e0c
JK		 507 if (S_ISDIR(inode->i_mode))
508 return false;
216fbd64
JK		 509
510 switch (SM_I(sbi)->ipu_policy) {
511 case F2FS_IPU_FORCE:
39a53e0c 512 return true;
216fbd64
JK		 513 case F2FS_IPU_SSR:
514 if (need_SSR(sbi))
515 return true;
516 break;
517 case F2FS_IPU_UTIL:
518 if (utilization(sbi) > SM_I(sbi)->min_ipu_util)
519 return true;
520 break;
521 case F2FS_IPU_SSR_UTIL:
522 if (need_SSR(sbi) && utilization(sbi) > SM_I(sbi)->min_ipu_util)
523 return true;
524 break;
525 case F2FS_IPU_DISABLE:
526 break;
527 }
39a53e0c
JK		 528 return false;
529}
530
531static inline unsigned int curseg_segno(struct f2fs_sb_info *sbi,
532 int type)
533{
534 struct curseg_info *curseg = CURSEG_I(sbi, type);
535 return curseg->segno;
536}
537
538static inline unsigned char curseg_alloc_type(struct f2fs_sb_info *sbi,
539 int type)
540{
541 struct curseg_info *curseg = CURSEG_I(sbi, type);
542 return curseg->alloc_type;
543}
544
545static inline unsigned short curseg_blkoff(struct f2fs_sb_info *sbi, int type)
546{
547 struct curseg_info *curseg = CURSEG_I(sbi, type);
548 return curseg->next_blkoff;
549}
550
5d56b671 551#ifdef CONFIG_F2FS_CHECK_FS
39a53e0c
JK		 552static inline void check_seg_range(struct f2fs_sb_info *sbi, unsigned int segno)
553{
554 unsigned int end_segno = SM_I(sbi)->segment_count - 1;
555 BUG_ON(segno > end_segno);
556}
557
39a53e0c
JK		 558static inline void verify_block_addr(struct f2fs_sb_info *sbi, block_t blk_addr)
559{
560 struct f2fs_sm_info *sm_info = SM_I(sbi);
561 block_t total_blks = sm_info->segment_count << sbi->log_blocks_per_seg;
562 block_t start_addr = sm_info->seg0_blkaddr;
563 block_t end_addr = start_addr + total_blks - 1;
564 BUG_ON(blk_addr < start_addr);
565 BUG_ON(blk_addr > end_addr);
566}
567
568/*
569 * Summary block is always treated as invalid block
570 */
571static inline void check_block_count(struct f2fs_sb_info *sbi,
572 int segno, struct f2fs_sit_entry *raw_sit)
573{
574 struct f2fs_sm_info *sm_info = SM_I(sbi);
575 unsigned int end_segno = sm_info->segment_count - 1;
44c60bf2 576 bool is_valid = test_bit_le(0, raw_sit->valid_map) ? true : false;
39a53e0c 577 int valid_blocks = 0;
44c60bf2 578 int cur_pos = 0, next_pos;
39a53e0c
JK		 579
580 /* check segment usage */
581 BUG_ON(GET_SIT_VBLOCKS(raw_sit) > sbi->blocks_per_seg);
582
583 /* check boundary of a given segment number */
584 BUG_ON(segno > end_segno);
585
586 /* check bitmap with valid block count */
44c60bf2
CY		 587 do {
588 if (is_valid) {
589 next_pos = find_next_zero_bit_le(&raw_sit->valid_map,
590 sbi->blocks_per_seg,
591 cur_pos);
592 valid_blocks += next_pos - cur_pos;
593 } else
594 next_pos = find_next_bit_le(&raw_sit->valid_map,
595 sbi->blocks_per_seg,
596 cur_pos);
597 cur_pos = next_pos;
598 is_valid = !is_valid;
599 } while (cur_pos < sbi->blocks_per_seg);
39a53e0c
JK		 600 BUG_ON(GET_SIT_VBLOCKS(raw_sit) != valid_blocks);
601}
5d56b671
JK		 602#else
603#define check_seg_range(sbi, segno)
604#define verify_block_addr(sbi, blk_addr)
605#define check_block_count(sbi, segno, raw_sit)
606#endif
39a53e0c
JK		 607
608static inline pgoff_t current_sit_addr(struct f2fs_sb_info *sbi,
609 unsigned int start)
610{
611 struct sit_info *sit_i = SIT_I(sbi);
612 unsigned int offset = SIT_BLOCK_OFFSET(sit_i, start);
613 block_t blk_addr = sit_i->sit_base_addr + offset;
614
615 check_seg_range(sbi, start);
616
617 /* calculate sit block address */
618 if (f2fs_test_bit(offset, sit_i->sit_bitmap))
619 blk_addr += sit_i->sit_blocks;
620
621 return blk_addr;
622}
623
624static inline pgoff_t next_sit_addr(struct f2fs_sb_info *sbi,
625 pgoff_t block_addr)
626{
627 struct sit_info *sit_i = SIT_I(sbi);
628 block_addr -= sit_i->sit_base_addr;
629 if (block_addr < sit_i->sit_blocks)
630 block_addr += sit_i->sit_blocks;
631 else
632 block_addr -= sit_i->sit_blocks;
633
634 return block_addr + sit_i->sit_base_addr;
635}
636
637static inline void set_to_next_sit(struct sit_info *sit_i, unsigned int start)
638{
639 unsigned int block_off = SIT_BLOCK_OFFSET(sit_i, start);
640
641 if (f2fs_test_bit(block_off, sit_i->sit_bitmap))
642 f2fs_clear_bit(block_off, sit_i->sit_bitmap);
643 else
644 f2fs_set_bit(block_off, sit_i->sit_bitmap);
645}
646
647static inline unsigned long long get_mtime(struct f2fs_sb_info *sbi)
648{
649 struct sit_info *sit_i = SIT_I(sbi);
650 return sit_i->elapsed_time + CURRENT_TIME_SEC.tv_sec -
651 sit_i->mounted_time;
652}
653
654static inline void set_summary(struct f2fs_summary *sum, nid_t nid,
655 unsigned int ofs_in_node, unsigned char version)
656{
657 sum->nid = cpu_to_le32(nid);
658 sum->ofs_in_node = cpu_to_le16(ofs_in_node);
659 sum->version = version;
660}
661
662static inline block_t start_sum_block(struct f2fs_sb_info *sbi)
663{
664 return __start_cp_addr(sbi) +
665 le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_start_sum);
666}
667
668static inline block_t sum_blk_addr(struct f2fs_sb_info *sbi, int base, int type)
669{
670 return __start_cp_addr(sbi) +
671 le32_to_cpu(F2FS_CKPT(sbi)->cp_pack_total_block_count)
672 - (base + 1) + type;
673}
5ec4e49f
JK		 674
675static inline bool sec_usage_check(struct f2fs_sb_info *sbi, unsigned int secno)
676{
677 if (IS_CURSEC(sbi, secno) || (sbi->cur_victim_sec == secno))
678 return true;
679 return false;
680}
ac5d156c
JK		 681
682static inline unsigned int max_hw_blocks(struct f2fs_sb_info *sbi)
683{
684 struct block_device *bdev = sbi->sb->s_bdev;
685 struct request_queue *q = bdev_get_queue(bdev);
686 return SECTOR_TO_BLOCK(sbi, queue_max_sectors(q));
687}
Linux kernel - Deliverables
This page took 0.166551 seconds and 5 git commands to generate.