]> git.proxmox.com Git - mirror_ubuntu-zesty-kernel.git/blame - fs/f2fs/segment.c
projects / mirror_ubuntu-zesty-kernel.git / blame
? search:
summary | shortlog | log | commit | commitdiff | tree
blob | blame (incremental) | history | HEAD
f2fs: move all the bio initialization into __bio_alloc
[mirror_ubuntu-zesty-kernel.git] / fs / f2fs / segment.c
CommitLineData
0a8165d7 1/*
351df4b2
JK		 2 * fs/f2fs/segment.c
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 */
11#include <linux/fs.h>
12#include <linux/f2fs_fs.h>
13#include <linux/bio.h>
14#include <linux/blkdev.h>
690e4a3e 15#include <linux/prefetch.h>
351df4b2 16#include <linux/vmalloc.h>
74de593a 17#include <linux/swap.h>
351df4b2
JK		 18
19#include "f2fs.h"
20#include "segment.h"
21#include "node.h"
6ec178da 22#include <trace/events/f2fs.h>
351df4b2 23
9a7f143a
CL		 24#define __reverse_ffz(x) __reverse_ffs(~(x))
25
7fd9e544
JK		 26static struct kmem_cache *discard_entry_slab;
27
9a7f143a
CL		 28/*
29 * __reverse_ffs is copied from include/asm-generic/bitops/__ffs.h since
30 * MSB and LSB are reversed in a byte by f2fs_set_bit.
31 */
32static inline unsigned long __reverse_ffs(unsigned long word)
33{
34 int num = 0;
35
36#if BITS_PER_LONG == 64
37 if ((word & 0xffffffff) == 0) {
38 num += 32;
39 word >>= 32;
40 }
41#endif
42 if ((word & 0xffff) == 0) {
43 num += 16;
44 word >>= 16;
45 }
46 if ((word & 0xff) == 0) {
47 num += 8;
48 word >>= 8;
49 }
50 if ((word & 0xf0) == 0)
51 num += 4;
52 else
53 word >>= 4;
54 if ((word & 0xc) == 0)
55 num += 2;
56 else
57 word >>= 2;
58 if ((word & 0x2) == 0)
59 num += 1;
60 return num;
61}
62
63/*
64 * __find_rev_next(_zero)_bit is copied from lib/find_next_bit.c becasue
65 * f2fs_set_bit makes MSB and LSB reversed in a byte.
66 * Example:
67 * LSB <--> MSB
68 * f2fs_set_bit(0, bitmap) => 0000 0001
69 * f2fs_set_bit(7, bitmap) => 1000 0000
70 */
71static unsigned long __find_rev_next_bit(const unsigned long *addr,
72 unsigned long size, unsigned long offset)
73{
74 const unsigned long *p = addr + BIT_WORD(offset);
75 unsigned long result = offset & ~(BITS_PER_LONG - 1);
76 unsigned long tmp;
77 unsigned long mask, submask;
78 unsigned long quot, rest;
79
80 if (offset >= size)
81 return size;
82
83 size -= result;
84 offset %= BITS_PER_LONG;
85 if (!offset)
86 goto aligned;
87
88 tmp = *(p++);
89 quot = (offset >> 3) << 3;
90 rest = offset & 0x7;
91 mask = ~0UL << quot;
92 submask = (unsigned char)(0xff << rest) >> rest;
93 submask <<= quot;
94 mask &= submask;
95 tmp &= mask;
96 if (size < BITS_PER_LONG)
97 goto found_first;
98 if (tmp)
99 goto found_middle;
100
101 size -= BITS_PER_LONG;
102 result += BITS_PER_LONG;
103aligned:
104 while (size & ~(BITS_PER_LONG-1)) {
105 tmp = *(p++);
106 if (tmp)
107 goto found_middle;
108 result += BITS_PER_LONG;
109 size -= BITS_PER_LONG;
110 }
111 if (!size)
112 return result;
113 tmp = *p;
114found_first:
115 tmp &= (~0UL >> (BITS_PER_LONG - size));
116 if (tmp == 0UL) /* Are any bits set? */
117 return result + size; /* Nope. */
118found_middle:
119 return result + __reverse_ffs(tmp);
120}
121
122static unsigned long __find_rev_next_zero_bit(const unsigned long *addr,
123 unsigned long size, unsigned long offset)
124{
125 const unsigned long *p = addr + BIT_WORD(offset);
126 unsigned long result = offset & ~(BITS_PER_LONG - 1);
127 unsigned long tmp;
128 unsigned long mask, submask;
129 unsigned long quot, rest;
130
131 if (offset >= size)
132 return size;
133
134 size -= result;
135 offset %= BITS_PER_LONG;
136 if (!offset)
137 goto aligned;
138
139 tmp = *(p++);
140 quot = (offset >> 3) << 3;
141 rest = offset & 0x7;
142 mask = ~(~0UL << quot);
143 submask = (unsigned char)~((unsigned char)(0xff << rest) >> rest);
144 submask <<= quot;
145 mask += submask;
146 tmp |= mask;
147 if (size < BITS_PER_LONG)
148 goto found_first;
149 if (~tmp)
150 goto found_middle;
151
152 size -= BITS_PER_LONG;
153 result += BITS_PER_LONG;
154aligned:
155 while (size & ~(BITS_PER_LONG - 1)) {
156 tmp = *(p++);
157 if (~tmp)
158 goto found_middle;
159 result += BITS_PER_LONG;
160 size -= BITS_PER_LONG;
161 }
162 if (!size)
163 return result;
164 tmp = *p;
165
166found_first:
167 tmp |= ~0UL << size;
168 if (tmp == ~0UL) /* Are any bits zero? */
169 return result + size; /* Nope. */
170found_middle:
171 return result + __reverse_ffz(tmp);
172}
173
0a8165d7 174/*
351df4b2
JK		 175 * This function balances dirty node and dentry pages.
176 * In addition, it controls garbage collection.
177 */
178void f2fs_balance_fs(struct f2fs_sb_info *sbi)
179{
351df4b2 180 /*
029cd28c
JK		 181 * We should do GC or end up with checkpoint, if there are so many dirty
182 * dir/node pages without enough free segments.
351df4b2 183 */
43727527 184 if (has_not_enough_free_secs(sbi, 0)) {
351df4b2 185 mutex_lock(&sbi->gc_mutex);
408e9375 186 f2fs_gc(sbi);
351df4b2
JK		 187 }
188}
189
4660f9c0
JK		 190void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi)
191{
192 /* check the # of cached NAT entries and prefree segments */
193 if (try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK) ||
194 excess_prefree_segs(sbi))
195 f2fs_sync_fs(sbi->sb, true);
196}
197
351df4b2
JK		 198static void __locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
199 enum dirty_type dirty_type)
200{
201 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
202
203 /* need not be added */
204 if (IS_CURSEG(sbi, segno))
205 return;
206
207 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[dirty_type]))
208 dirty_i->nr_dirty[dirty_type]++;
209
210 if (dirty_type == DIRTY) {
211 struct seg_entry *sentry = get_seg_entry(sbi, segno);
4625d6aa 212 enum dirty_type t = sentry->type;
b2f2c390 213
4625d6aa
CL		 214 if (!test_and_set_bit(segno, dirty_i->dirty_segmap[t]))
215 dirty_i->nr_dirty[t]++;
351df4b2
JK		 216 }
217}
218
219static void __remove_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno,
220 enum dirty_type dirty_type)
221{
222 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
223
224 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[dirty_type]))
225 dirty_i->nr_dirty[dirty_type]--;
226
227 if (dirty_type == DIRTY) {
4625d6aa
CL		 228 struct seg_entry *sentry = get_seg_entry(sbi, segno);
229 enum dirty_type t = sentry->type;
230
231 if (test_and_clear_bit(segno, dirty_i->dirty_segmap[t]))
232 dirty_i->nr_dirty[t]--;
b2f2c390 233
5ec4e49f
JK		 234 if (get_valid_blocks(sbi, segno, sbi->segs_per_sec) == 0)
235 clear_bit(GET_SECNO(sbi, segno),
236 dirty_i->victim_secmap);
351df4b2
JK		 237 }
238}
239
0a8165d7 240/*
351df4b2
JK		 241 * Should not occur error such as -ENOMEM.
242 * Adding dirty entry into seglist is not critical operation.
243 * If a given segment is one of current working segments, it won't be added.
244 */
8d8451af 245static void locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno)
351df4b2
JK		 246{
247 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
248 unsigned short valid_blocks;
249
250 if (segno == NULL_SEGNO || IS_CURSEG(sbi, segno))
251 return;
252
253 mutex_lock(&dirty_i->seglist_lock);
254
255 valid_blocks = get_valid_blocks(sbi, segno, 0);
256
257 if (valid_blocks == 0) {
258 __locate_dirty_segment(sbi, segno, PRE);
259 __remove_dirty_segment(sbi, segno, DIRTY);
260 } else if (valid_blocks < sbi->blocks_per_seg) {
261 __locate_dirty_segment(sbi, segno, DIRTY);
262 } else {
263 /* Recovery routine with SSR needs this */
264 __remove_dirty_segment(sbi, segno, DIRTY);
265 }
266
267 mutex_unlock(&dirty_i->seglist_lock);
351df4b2
JK		 268}
269
37208879
JK		 270static void f2fs_issue_discard(struct f2fs_sb_info *sbi,
271 block_t blkstart, block_t blklen)
272{
f9a4e6df
JK		 273 sector_t start = SECTOR_FROM_BLOCK(sbi, blkstart);
274 sector_t len = SECTOR_FROM_BLOCK(sbi, blklen);
37208879 275 blkdev_issue_discard(sbi->sb->s_bdev, start, len, GFP_NOFS, 0);
1661d07c 276 trace_f2fs_issue_discard(sbi->sb, blkstart, blklen);
37208879
JK		 277}
278
b2955550
JK		 279static void add_discard_addrs(struct f2fs_sb_info *sbi,
280 unsigned int segno, struct seg_entry *se)
281{
282 struct list_head *head = &SM_I(sbi)->discard_list;
283 struct discard_entry *new;
284 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
285 int max_blocks = sbi->blocks_per_seg;
286 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
287 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
288 unsigned long dmap[entries];
289 unsigned int start = 0, end = -1;
290 int i;
291
292 if (!test_opt(sbi, DISCARD))
293 return;
294
295 /* zero block will be discarded through the prefree list */
296 if (!se->valid_blocks || se->valid_blocks == max_blocks)
297 return;
298
299 /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */
300 for (i = 0; i < entries; i++)
301 dmap[i] = (cur_map[i] ^ ckpt_map[i]) & ckpt_map[i];
302
303 while (SM_I(sbi)->nr_discards <= SM_I(sbi)->max_discards) {
304 start = __find_rev_next_bit(dmap, max_blocks, end + 1);
305 if (start >= max_blocks)
306 break;
307
308 end = __find_rev_next_zero_bit(dmap, max_blocks, start + 1);
309
310 new = f2fs_kmem_cache_alloc(discard_entry_slab, GFP_NOFS);
311 INIT_LIST_HEAD(&new->list);
312 new->blkaddr = START_BLOCK(sbi, segno) + start;
313 new->len = end - start;
314
315 list_add_tail(&new->list, head);
316 SM_I(sbi)->nr_discards += end - start;
317 }
318}
319
0a8165d7 320/*
351df4b2
JK		 321 * Should call clear_prefree_segments after checkpoint is done.
322 */
323static void set_prefree_as_free_segments(struct f2fs_sb_info *sbi)
324{
325 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
81fb5e87 326 unsigned int segno = -1;
351df4b2
JK		 327 unsigned int total_segs = TOTAL_SEGS(sbi);
328
329 mutex_lock(&dirty_i->seglist_lock);
330 while (1) {
331 segno = find_next_bit(dirty_i->dirty_segmap[PRE], total_segs,
81fb5e87 332 segno + 1);
351df4b2
JK		 333 if (segno >= total_segs)
334 break;
335 __set_test_and_free(sbi, segno);
351df4b2
JK		 336 }
337 mutex_unlock(&dirty_i->seglist_lock);
338}
339
340void clear_prefree_segments(struct f2fs_sb_info *sbi)
341{
b2955550
JK		 342 struct list_head *head = &(SM_I(sbi)->discard_list);
343 struct list_head *this, *next;
344 struct discard_entry *entry;
351df4b2 345 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
29e59c14 346 unsigned long *prefree_map = dirty_i->dirty_segmap[PRE];
351df4b2 347 unsigned int total_segs = TOTAL_SEGS(sbi);
29e59c14 348 unsigned int start = 0, end = -1;
351df4b2
JK		 349
350 mutex_lock(&dirty_i->seglist_lock);
29e59c14 351
351df4b2 352 while (1) {
29e59c14
CL		 353 int i;
354 start = find_next_bit(prefree_map, total_segs, end + 1);
355 if (start >= total_segs)
351df4b2 356 break;
29e59c14
CL		 357 end = find_next_zero_bit(prefree_map, total_segs, start + 1);
358
359 for (i = start; i < end; i++)
360 clear_bit(i, prefree_map);
361
362 dirty_i->nr_dirty[PRE] -= end - start;
363
364 if (!test_opt(sbi, DISCARD))
365 continue;
351df4b2 366
37208879
JK		 367 f2fs_issue_discard(sbi, START_BLOCK(sbi, start),
368 (end - start) << sbi->log_blocks_per_seg);
351df4b2
JK		 369 }
370 mutex_unlock(&dirty_i->seglist_lock);
b2955550
JK		 371
372 /* send small discards */
373 list_for_each_safe(this, next, head) {
374 entry = list_entry(this, struct discard_entry, list);
37208879 375 f2fs_issue_discard(sbi, entry->blkaddr, entry->len);
b2955550
JK		 376 list_del(&entry->list);
377 SM_I(sbi)->nr_discards -= entry->len;
378 kmem_cache_free(discard_entry_slab, entry);
379 }
351df4b2
JK		 380}
381
382static void __mark_sit_entry_dirty(struct f2fs_sb_info *sbi, unsigned int segno)
383{
384 struct sit_info *sit_i = SIT_I(sbi);
385 if (!__test_and_set_bit(segno, sit_i->dirty_sentries_bitmap))
386 sit_i->dirty_sentries++;
387}
388
389static void __set_sit_entry_type(struct f2fs_sb_info *sbi, int type,
390 unsigned int segno, int modified)
391{
392 struct seg_entry *se = get_seg_entry(sbi, segno);
393 se->type = type;
394 if (modified)
395 __mark_sit_entry_dirty(sbi, segno);
396}
397
398static void update_sit_entry(struct f2fs_sb_info *sbi, block_t blkaddr, int del)
399{
400 struct seg_entry *se;
401 unsigned int segno, offset;
402 long int new_vblocks;
403
404 segno = GET_SEGNO(sbi, blkaddr);
405
406 se = get_seg_entry(sbi, segno);
407 new_vblocks = se->valid_blocks + del;
408 offset = GET_SEGOFF_FROM_SEG0(sbi, blkaddr) & (sbi->blocks_per_seg - 1);
409
5d56b671 410 f2fs_bug_on((new_vblocks >> (sizeof(unsigned short) << 3) ||
351df4b2
JK		 411 (new_vblocks > sbi->blocks_per_seg)));
412
413 se->valid_blocks = new_vblocks;
414 se->mtime = get_mtime(sbi);
415 SIT_I(sbi)->max_mtime = se->mtime;
416
417 /* Update valid block bitmap */
418 if (del > 0) {
419 if (f2fs_set_bit(offset, se->cur_valid_map))
420 BUG();
421 } else {
422 if (!f2fs_clear_bit(offset, se->cur_valid_map))
423 BUG();
424 }
425 if (!f2fs_test_bit(offset, se->ckpt_valid_map))
426 se->ckpt_valid_blocks += del;
427
428 __mark_sit_entry_dirty(sbi, segno);
429
430 /* update total number of valid blocks to be written in ckpt area */
431 SIT_I(sbi)->written_valid_blocks += del;
432
433 if (sbi->segs_per_sec > 1)
434 get_sec_entry(sbi, segno)->valid_blocks += del;
435}
436
437static void refresh_sit_entry(struct f2fs_sb_info *sbi,
438 block_t old_blkaddr, block_t new_blkaddr)
439{
440 update_sit_entry(sbi, new_blkaddr, 1);
441 if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO)
442 update_sit_entry(sbi, old_blkaddr, -1);
443}
444
445void invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr)
446{
447 unsigned int segno = GET_SEGNO(sbi, addr);
448 struct sit_info *sit_i = SIT_I(sbi);
449
5d56b671 450 f2fs_bug_on(addr == NULL_ADDR);
351df4b2
JK		 451 if (addr == NEW_ADDR)
452 return;
453
454 /* add it into sit main buffer */
455 mutex_lock(&sit_i->sentry_lock);
456
457 update_sit_entry(sbi, addr, -1);
458
459 /* add it into dirty seglist */
460 locate_dirty_segment(sbi, segno);
461
462 mutex_unlock(&sit_i->sentry_lock);
463}
464
0a8165d7 465/*
351df4b2
JK		 466 * This function should be resided under the curseg_mutex lock
467 */
468static void __add_sum_entry(struct f2fs_sb_info *sbi, int type,
e79efe3b 469 struct f2fs_summary *sum)
351df4b2
JK		 470{
471 struct curseg_info *curseg = CURSEG_I(sbi, type);
472 void *addr = curseg->sum_blk;
e79efe3b 473 addr += curseg->next_blkoff * sizeof(struct f2fs_summary);
351df4b2 474 memcpy(addr, sum, sizeof(struct f2fs_summary));
351df4b2
JK		 475}
476
0a8165d7 477/*
351df4b2
JK		 478 * Calculate the number of current summary pages for writing
479 */
480int npages_for_summary_flush(struct f2fs_sb_info *sbi)
481{
351df4b2 482 int valid_sum_count = 0;
9a47938b 483 int i, sum_in_page;
351df4b2
JK		 484
485 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
486 if (sbi->ckpt->alloc_type[i] == SSR)
487 valid_sum_count += sbi->blocks_per_seg;
488 else
489 valid_sum_count += curseg_blkoff(sbi, i);
490 }
491
9a47938b
FL		 492 sum_in_page = (PAGE_CACHE_SIZE - 2 * SUM_JOURNAL_SIZE -
493 SUM_FOOTER_SIZE) / SUMMARY_SIZE;
494 if (valid_sum_count <= sum_in_page)
351df4b2 495 return 1;
9a47938b
FL		 496 else if ((valid_sum_count - sum_in_page) <=
497 (PAGE_CACHE_SIZE - SUM_FOOTER_SIZE) / SUMMARY_SIZE)
351df4b2
JK		 498 return 2;
499 return 3;
500}
501
0a8165d7 502/*
351df4b2
JK		 503 * Caller should put this summary page
504 */
505struct page *get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno)
506{
507 return get_meta_page(sbi, GET_SUM_BLOCK(sbi, segno));
508}
509
510static void write_sum_page(struct f2fs_sb_info *sbi,
511 struct f2fs_summary_block *sum_blk, block_t blk_addr)
512{
513 struct page *page = grab_meta_page(sbi, blk_addr);
514 void *kaddr = page_address(page);
515 memcpy(kaddr, sum_blk, PAGE_CACHE_SIZE);
516 set_page_dirty(page);
517 f2fs_put_page(page, 1);
518}
519
60374688
JK		 520static int is_next_segment_free(struct f2fs_sb_info *sbi, int type)
521{
522 struct curseg_info *curseg = CURSEG_I(sbi, type);
81fb5e87 523 unsigned int segno = curseg->segno + 1;
60374688
JK		 524 struct free_segmap_info *free_i = FREE_I(sbi);
525
81fb5e87
HL		 526 if (segno < TOTAL_SEGS(sbi) && segno % sbi->segs_per_sec)
527 return !test_bit(segno, free_i->free_segmap);
60374688
JK		 528 return 0;
529}
530
0a8165d7 531/*
351df4b2
JK		 532 * Find a new segment from the free segments bitmap to right order
533 * This function should be returned with success, otherwise BUG
534 */
535static void get_new_segment(struct f2fs_sb_info *sbi,
536 unsigned int *newseg, bool new_sec, int dir)
537{
538 struct free_segmap_info *free_i = FREE_I(sbi);
351df4b2 539 unsigned int segno, secno, zoneno;
53cf9522 540 unsigned int total_zones = TOTAL_SECS(sbi) / sbi->secs_per_zone;
351df4b2
JK		 541 unsigned int hint = *newseg / sbi->segs_per_sec;
542 unsigned int old_zoneno = GET_ZONENO_FROM_SEGNO(sbi, *newseg);
543 unsigned int left_start = hint;
544 bool init = true;
545 int go_left = 0;
546 int i;
547
548 write_lock(&free_i->segmap_lock);
549
550 if (!new_sec && ((*newseg + 1) % sbi->segs_per_sec)) {
551 segno = find_next_zero_bit(free_i->free_segmap,
552 TOTAL_SEGS(sbi), *newseg + 1);
33afa7fd
JK		 553 if (segno - *newseg < sbi->segs_per_sec -
554 (*newseg % sbi->segs_per_sec))
351df4b2
JK		 555 goto got_it;
556 }
557find_other_zone:
53cf9522
JK		 558 secno = find_next_zero_bit(free_i->free_secmap, TOTAL_SECS(sbi), hint);
559 if (secno >= TOTAL_SECS(sbi)) {
351df4b2
JK		 560 if (dir == ALLOC_RIGHT) {
561 secno = find_next_zero_bit(free_i->free_secmap,
53cf9522 562 TOTAL_SECS(sbi), 0);
5d56b671 563 f2fs_bug_on(secno >= TOTAL_SECS(sbi));
351df4b2
JK		 564 } else {
565 go_left = 1;
566 left_start = hint - 1;
567 }
568 }
569 if (go_left == 0)
570 goto skip_left;
571
572 while (test_bit(left_start, free_i->free_secmap)) {
573 if (left_start > 0) {
574 left_start--;
575 continue;
576 }
577 left_start = find_next_zero_bit(free_i->free_secmap,
53cf9522 578 TOTAL_SECS(sbi), 0);
5d56b671 579 f2fs_bug_on(left_start >= TOTAL_SECS(sbi));
351df4b2
JK		 580 break;
581 }
582 secno = left_start;
583skip_left:
584 hint = secno;
585 segno = secno * sbi->segs_per_sec;
586 zoneno = secno / sbi->secs_per_zone;
587
588 /* give up on finding another zone */
589 if (!init)
590 goto got_it;
591 if (sbi->secs_per_zone == 1)
592 goto got_it;
593 if (zoneno == old_zoneno)
594 goto got_it;
595 if (dir == ALLOC_LEFT) {
596 if (!go_left && zoneno + 1 >= total_zones)
597 goto got_it;
598 if (go_left && zoneno == 0)
599 goto got_it;
600 }
601 for (i = 0; i < NR_CURSEG_TYPE; i++)
602 if (CURSEG_I(sbi, i)->zone == zoneno)
603 break;
604
605 if (i < NR_CURSEG_TYPE) {
606 /* zone is in user, try another */
607 if (go_left)
608 hint = zoneno * sbi->secs_per_zone - 1;
609 else if (zoneno + 1 >= total_zones)
610 hint = 0;
611 else
612 hint = (zoneno + 1) * sbi->secs_per_zone;
613 init = false;
614 goto find_other_zone;
615 }
616got_it:
617 /* set it as dirty segment in free segmap */
5d56b671 618 f2fs_bug_on(test_bit(segno, free_i->free_segmap));
351df4b2
JK		 619 __set_inuse(sbi, segno);
620 *newseg = segno;
621 write_unlock(&free_i->segmap_lock);
622}
623
624static void reset_curseg(struct f2fs_sb_info *sbi, int type, int modified)
625{
626 struct curseg_info *curseg = CURSEG_I(sbi, type);
627 struct summary_footer *sum_footer;
628
629 curseg->segno = curseg->next_segno;
630 curseg->zone = GET_ZONENO_FROM_SEGNO(sbi, curseg->segno);
631 curseg->next_blkoff = 0;
632 curseg->next_segno = NULL_SEGNO;
633
634 sum_footer = &(curseg->sum_blk->footer);
635 memset(sum_footer, 0, sizeof(struct summary_footer));
636 if (IS_DATASEG(type))
637 SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA);
638 if (IS_NODESEG(type))
639 SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE);
640 __set_sit_entry_type(sbi, type, curseg->segno, modified);
641}
642
0a8165d7 643/*
351df4b2
JK		 644 * Allocate a current working segment.
645 * This function always allocates a free segment in LFS manner.
646 */
647static void new_curseg(struct f2fs_sb_info *sbi, int type, bool new_sec)
648{
649 struct curseg_info *curseg = CURSEG_I(sbi, type);
650 unsigned int segno = curseg->segno;
651 int dir = ALLOC_LEFT;
652
653 write_sum_page(sbi, curseg->sum_blk,
81fb5e87 654 GET_SUM_BLOCK(sbi, segno));
351df4b2
JK		 655 if (type == CURSEG_WARM_DATA || type == CURSEG_COLD_DATA)
656 dir = ALLOC_RIGHT;
657
658 if (test_opt(sbi, NOHEAP))
659 dir = ALLOC_RIGHT;
660
661 get_new_segment(sbi, &segno, new_sec, dir);
662 curseg->next_segno = segno;
663 reset_curseg(sbi, type, 1);
664 curseg->alloc_type = LFS;
665}
666
667static void __next_free_blkoff(struct f2fs_sb_info *sbi,
668 struct curseg_info *seg, block_t start)
669{
670 struct seg_entry *se = get_seg_entry(sbi, seg->segno);
e81c93cf
CL		 671 int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long);
672 unsigned long target_map[entries];
673 unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map;
674 unsigned long *cur_map = (unsigned long *)se->cur_valid_map;
675 int i, pos;
676
677 for (i = 0; i < entries; i++)
678 target_map[i] = ckpt_map[i] | cur_map[i];
679
680 pos = __find_rev_next_zero_bit(target_map, sbi->blocks_per_seg, start);
681
682 seg->next_blkoff = pos;
351df4b2
JK		 683}
684
0a8165d7 685/*
351df4b2
JK		 686 * If a segment is written by LFS manner, next block offset is just obtained
687 * by increasing the current block offset. However, if a segment is written by
688 * SSR manner, next block offset obtained by calling __next_free_blkoff
689 */
690static void __refresh_next_blkoff(struct f2fs_sb_info *sbi,
691 struct curseg_info *seg)
692{
693 if (seg->alloc_type == SSR)
694 __next_free_blkoff(sbi, seg, seg->next_blkoff + 1);
695 else
696 seg->next_blkoff++;
697}
698
0a8165d7 699/*
351df4b2
JK		 700 * This function always allocates a used segment (from dirty seglist) by SSR
701 * manner, so it should recover the existing segment information of valid blocks
702 */
703static void change_curseg(struct f2fs_sb_info *sbi, int type, bool reuse)
704{
705 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
706 struct curseg_info *curseg = CURSEG_I(sbi, type);
707 unsigned int new_segno = curseg->next_segno;
708 struct f2fs_summary_block *sum_node;
709 struct page *sum_page;
710
711 write_sum_page(sbi, curseg->sum_blk,
712 GET_SUM_BLOCK(sbi, curseg->segno));
713 __set_test_and_inuse(sbi, new_segno);
714
715 mutex_lock(&dirty_i->seglist_lock);
716 __remove_dirty_segment(sbi, new_segno, PRE);
717 __remove_dirty_segment(sbi, new_segno, DIRTY);
718 mutex_unlock(&dirty_i->seglist_lock);
719
720 reset_curseg(sbi, type, 1);
721 curseg->alloc_type = SSR;
722 __next_free_blkoff(sbi, curseg, 0);
723
724 if (reuse) {
725 sum_page = get_sum_page(sbi, new_segno);
726 sum_node = (struct f2fs_summary_block *)page_address(sum_page);
727 memcpy(curseg->sum_blk, sum_node, SUM_ENTRY_SIZE);
728 f2fs_put_page(sum_page, 1);
729 }
730}
731
43727527
JK		 732static int get_ssr_segment(struct f2fs_sb_info *sbi, int type)
733{
734 struct curseg_info *curseg = CURSEG_I(sbi, type);
735 const struct victim_selection *v_ops = DIRTY_I(sbi)->v_ops;
736
737 if (IS_NODESEG(type) || !has_not_enough_free_secs(sbi, 0))
738 return v_ops->get_victim(sbi,
739 &(curseg)->next_segno, BG_GC, type, SSR);
740
741 /* For data segments, let's do SSR more intensively */
742 for (; type >= CURSEG_HOT_DATA; type--)
743 if (v_ops->get_victim(sbi, &(curseg)->next_segno,
744 BG_GC, type, SSR))
745 return 1;
746 return 0;
747}
748
351df4b2
JK		 749/*
750 * flush out current segment and replace it with new segment
751 * This function should be returned with success, otherwise BUG
752 */
753static void allocate_segment_by_default(struct f2fs_sb_info *sbi,
754 int type, bool force)
755{
756 struct curseg_info *curseg = CURSEG_I(sbi, type);
351df4b2 757
7b405275 758 if (force)
351df4b2 759 new_curseg(sbi, type, true);
7b405275 760 else if (type == CURSEG_WARM_NODE)
351df4b2 761 new_curseg(sbi, type, false);
60374688
JK		 762 else if (curseg->alloc_type == LFS && is_next_segment_free(sbi, type))
763 new_curseg(sbi, type, false);
351df4b2
JK		 764 else if (need_SSR(sbi) && get_ssr_segment(sbi, type))
765 change_curseg(sbi, type, true);
766 else
767 new_curseg(sbi, type, false);
dcdfff65
JK		 768
769 stat_inc_seg_type(sbi, curseg);
351df4b2
JK		 770}
771
772void allocate_new_segments(struct f2fs_sb_info *sbi)
773{
774 struct curseg_info *curseg;
775 unsigned int old_curseg;
776 int i;
777
778 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
779 curseg = CURSEG_I(sbi, i);
780 old_curseg = curseg->segno;
781 SIT_I(sbi)->s_ops->allocate_segment(sbi, i, true);
782 locate_dirty_segment(sbi, old_curseg);
783 }
784}
785
786static const struct segment_allocation default_salloc_ops = {
787 .allocate_segment = allocate_segment_by_default,
788};
789
351df4b2
JK		 790static bool __has_curseg_space(struct f2fs_sb_info *sbi, int type)
791{
792 struct curseg_info *curseg = CURSEG_I(sbi, type);
793 if (curseg->next_blkoff < sbi->blocks_per_seg)
794 return true;
795 return false;
796}
797
798static int __get_segment_type_2(struct page *page, enum page_type p_type)
799{
800 if (p_type == DATA)
801 return CURSEG_HOT_DATA;
802 else
803 return CURSEG_HOT_NODE;
804}
805
806static int __get_segment_type_4(struct page *page, enum page_type p_type)
807{
808 if (p_type == DATA) {
809 struct inode *inode = page->mapping->host;
810
811 if (S_ISDIR(inode->i_mode))
812 return CURSEG_HOT_DATA;
813 else
814 return CURSEG_COLD_DATA;
815 } else {
816 if (IS_DNODE(page) && !is_cold_node(page))
817 return CURSEG_HOT_NODE;
818 else
819 return CURSEG_COLD_NODE;
820 }
821}
822
823static int __get_segment_type_6(struct page *page, enum page_type p_type)
824{
825 if (p_type == DATA) {
826 struct inode *inode = page->mapping->host;
827
828 if (S_ISDIR(inode->i_mode))
829 return CURSEG_HOT_DATA;
354a3399 830 else if (is_cold_data(page) || file_is_cold(inode))
351df4b2
JK		 831 return CURSEG_COLD_DATA;
832 else
833 return CURSEG_WARM_DATA;
834 } else {
835 if (IS_DNODE(page))
836 return is_cold_node(page) ? CURSEG_WARM_NODE :
837 CURSEG_HOT_NODE;
838 else
839 return CURSEG_COLD_NODE;
840 }
841}
842
843static int __get_segment_type(struct page *page, enum page_type p_type)
844{
845 struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb);
846 switch (sbi->active_logs) {
847 case 2:
848 return __get_segment_type_2(page, p_type);
849 case 4:
850 return __get_segment_type_4(page, p_type);
351df4b2 851 }
12a67146 852 /* NR_CURSEG_TYPE(6) logs by default */
5d56b671 853 f2fs_bug_on(sbi->active_logs != NR_CURSEG_TYPE);
12a67146 854 return __get_segment_type_6(page, p_type);
351df4b2
JK		 855}
856
bfad7c2d
JK		 857void allocate_data_block(struct f2fs_sb_info *sbi, struct page *page,
858 block_t old_blkaddr, block_t *new_blkaddr,
859 struct f2fs_summary *sum, int type)
351df4b2
JK		 860{
861 struct sit_info *sit_i = SIT_I(sbi);
862 struct curseg_info *curseg;
863 unsigned int old_cursegno;
351df4b2 864
351df4b2
JK		 865 curseg = CURSEG_I(sbi, type);
866
867 mutex_lock(&curseg->curseg_mutex);
868
869 *new_blkaddr = NEXT_FREE_BLKADDR(sbi, curseg);
870 old_cursegno = curseg->segno;
871
872 /*
873 * __add_sum_entry should be resided under the curseg_mutex
874 * because, this function updates a summary entry in the
875 * current summary block.
876 */
e79efe3b 877 __add_sum_entry(sbi, type, sum);
351df4b2
JK		 878
879 mutex_lock(&sit_i->sentry_lock);
880 __refresh_next_blkoff(sbi, curseg);
dcdfff65
JK		 881
882 stat_inc_block_count(sbi, curseg);
351df4b2
JK		 883
884 /*
885 * SIT information should be updated before segment allocation,
886 * since SSR needs latest valid block information.
887 */
888 refresh_sit_entry(sbi, old_blkaddr, *new_blkaddr);
889
890 if (!__has_curseg_space(sbi, type))
891 sit_i->s_ops->allocate_segment(sbi, type, false);
892
893 locate_dirty_segment(sbi, old_cursegno);
894 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
895 mutex_unlock(&sit_i->sentry_lock);
896
bfad7c2d 897 if (page && IS_NODESEG(type))
351df4b2
JK		 898 fill_node_footer_blkaddr(page, NEXT_FREE_BLKADDR(sbi, curseg));
899
bfad7c2d
JK		 900 mutex_unlock(&curseg->curseg_mutex);
901}
902
903static void do_write_page(struct f2fs_sb_info *sbi, struct page *page,
904 block_t old_blkaddr, block_t *new_blkaddr,
905 struct f2fs_summary *sum, struct f2fs_io_info *fio)
906{
907 int type = __get_segment_type(page, fio->type);
908
909 allocate_data_block(sbi, page, old_blkaddr, new_blkaddr, sum, type);
910
351df4b2 911 /* writeout dirty page into bdev */
458e6197 912 f2fs_submit_page_mbio(sbi, page, *new_blkaddr, fio);
351df4b2
JK		 913}
914
577e3495 915void write_meta_page(struct f2fs_sb_info *sbi, struct page *page)
351df4b2 916{
458e6197
JK		 917 struct f2fs_io_info fio = {
918 .type = META,
919 .rw = WRITE_SYNC,
920 .rw_flag = REQ_META | REQ_PRIO
921 };
922
351df4b2 923 set_page_writeback(page);
458e6197 924 f2fs_submit_page_mbio(sbi, page, page->index, &fio);
351df4b2
JK		 925}
926
927void write_node_page(struct f2fs_sb_info *sbi, struct page *page,
928 unsigned int nid, block_t old_blkaddr, block_t *new_blkaddr)
929{
930 struct f2fs_summary sum;
458e6197
JK		 931 struct f2fs_io_info fio = {
932 .type = NODE,
933 .rw = WRITE_SYNC,
934 .rw_flag = 0
63a0b7cb 935 };
458e6197 936
351df4b2 937 set_summary(&sum, nid, 0, 0);
458e6197 938 do_write_page(sbi, page, old_blkaddr, new_blkaddr, &sum, &fio);
351df4b2
JK		 939}
940
458e6197
JK		 941void write_data_page(struct page *page, struct dnode_of_data *dn,
942 block_t *new_blkaddr, struct f2fs_io_info *fio)
351df4b2 943{
458e6197 944 struct f2fs_sb_info *sbi = F2FS_SB(dn->inode->i_sb);
351df4b2
JK		 945 struct f2fs_summary sum;
946 struct node_info ni;
947
458e6197 948 f2fs_bug_on(dn->data_blkaddr == NULL_ADDR);
351df4b2
JK		 949 get_node_info(sbi, dn->nid, &ni);
950 set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version);
951
458e6197 952 do_write_page(sbi, page, dn->data_blkaddr, new_blkaddr, &sum, fio);
351df4b2
JK		 953}
954
458e6197 955void rewrite_data_page(struct page *page, block_t old_blkaddr, struct f2fs_io_info *fio)
351df4b2 956{
458e6197
JK		 957 struct inode *inode = page->mapping->host;
958 struct f2fs_sb_info *sbi = F2FS_SB(inode->i_sb);
959 f2fs_submit_page_mbio(sbi, page, old_blkaddr, fio);
351df4b2
JK		 960}
961
962void recover_data_page(struct f2fs_sb_info *sbi,
963 struct page *page, struct f2fs_summary *sum,
964 block_t old_blkaddr, block_t new_blkaddr)
965{
966 struct sit_info *sit_i = SIT_I(sbi);
967 struct curseg_info *curseg;
968 unsigned int segno, old_cursegno;
969 struct seg_entry *se;
970 int type;
971
972 segno = GET_SEGNO(sbi, new_blkaddr);
973 se = get_seg_entry(sbi, segno);
974 type = se->type;
975
976 if (se->valid_blocks == 0 && !IS_CURSEG(sbi, segno)) {
977 if (old_blkaddr == NULL_ADDR)
978 type = CURSEG_COLD_DATA;
979 else
980 type = CURSEG_WARM_DATA;
981 }
982 curseg = CURSEG_I(sbi, type);
983
984 mutex_lock(&curseg->curseg_mutex);
985 mutex_lock(&sit_i->sentry_lock);
986
987 old_cursegno = curseg->segno;
988
989 /* change the current segment */
990 if (segno != curseg->segno) {
991 curseg->next_segno = segno;
992 change_curseg(sbi, type, true);
993 }
994
995 curseg->next_blkoff = GET_SEGOFF_FROM_SEG0(sbi, new_blkaddr) &
996 (sbi->blocks_per_seg - 1);
e79efe3b 997 __add_sum_entry(sbi, type, sum);
351df4b2
JK		 998
999 refresh_sit_entry(sbi, old_blkaddr, new_blkaddr);
1000
1001 locate_dirty_segment(sbi, old_cursegno);
1002 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
1003
1004 mutex_unlock(&sit_i->sentry_lock);
1005 mutex_unlock(&curseg->curseg_mutex);
1006}
1007
1008void rewrite_node_page(struct f2fs_sb_info *sbi,
1009 struct page *page, struct f2fs_summary *sum,
1010 block_t old_blkaddr, block_t new_blkaddr)
1011{
1012 struct sit_info *sit_i = SIT_I(sbi);
1013 int type = CURSEG_WARM_NODE;
1014 struct curseg_info *curseg;
1015 unsigned int segno, old_cursegno;
1016 block_t next_blkaddr = next_blkaddr_of_node(page);
1017 unsigned int next_segno = GET_SEGNO(sbi, next_blkaddr);
458e6197
JK		 1018 struct f2fs_io_info fio = {
1019 .type = NODE,
1020 .rw = WRITE_SYNC,
1021 .rw_flag = 0
1022 };
351df4b2
JK		 1023
1024 curseg = CURSEG_I(sbi, type);
1025
1026 mutex_lock(&curseg->curseg_mutex);
1027 mutex_lock(&sit_i->sentry_lock);
1028
1029 segno = GET_SEGNO(sbi, new_blkaddr);
1030 old_cursegno = curseg->segno;
1031
1032 /* change the current segment */
1033 if (segno != curseg->segno) {
1034 curseg->next_segno = segno;
1035 change_curseg(sbi, type, true);
1036 }
1037 curseg->next_blkoff = GET_SEGOFF_FROM_SEG0(sbi, new_blkaddr) &
1038 (sbi->blocks_per_seg - 1);
e79efe3b 1039 __add_sum_entry(sbi, type, sum);
351df4b2
JK		 1040
1041 /* change the current log to the next block addr in advance */
1042 if (next_segno != segno) {
1043 curseg->next_segno = next_segno;
1044 change_curseg(sbi, type, true);
1045 }
1046 curseg->next_blkoff = GET_SEGOFF_FROM_SEG0(sbi, next_blkaddr) &
1047 (sbi->blocks_per_seg - 1);
1048
1049 /* rewrite node page */
1050 set_page_writeback(page);
458e6197
JK		 1051 f2fs_submit_page_mbio(sbi, page, new_blkaddr, &fio);
1052 f2fs_submit_merged_bio(sbi, NODE, WRITE);
351df4b2
JK		 1053 refresh_sit_entry(sbi, old_blkaddr, new_blkaddr);
1054
1055 locate_dirty_segment(sbi, old_cursegno);
1056 locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr));
1057
1058 mutex_unlock(&sit_i->sentry_lock);
1059 mutex_unlock(&curseg->curseg_mutex);
1060}
1061
93dfe2ac
JK		 1062void f2fs_wait_on_page_writeback(struct page *page,
1063 enum page_type type, bool sync)
1064{
1065 struct f2fs_sb_info *sbi = F2FS_SB(page->mapping->host->i_sb);
1066 if (PageWriteback(page)) {
458e6197 1067 f2fs_submit_merged_bio(sbi, type, WRITE);
93dfe2ac
JK		 1068 wait_on_page_writeback(page);
1069 }
1070}
1071
351df4b2
JK		 1072static int read_compacted_summaries(struct f2fs_sb_info *sbi)
1073{
1074 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1075 struct curseg_info *seg_i;
1076 unsigned char *kaddr;
1077 struct page *page;
1078 block_t start;
1079 int i, j, offset;
1080
1081 start = start_sum_block(sbi);
1082
1083 page = get_meta_page(sbi, start++);
1084 kaddr = (unsigned char *)page_address(page);
1085
1086 /* Step 1: restore nat cache */
1087 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
1088 memcpy(&seg_i->sum_blk->n_nats, kaddr, SUM_JOURNAL_SIZE);
1089
1090 /* Step 2: restore sit cache */
1091 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
1092 memcpy(&seg_i->sum_blk->n_sits, kaddr + SUM_JOURNAL_SIZE,
1093 SUM_JOURNAL_SIZE);
1094 offset = 2 * SUM_JOURNAL_SIZE;
1095
1096 /* Step 3: restore summary entries */
1097 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1098 unsigned short blk_off;
1099 unsigned int segno;
1100
1101 seg_i = CURSEG_I(sbi, i);
1102 segno = le32_to_cpu(ckpt->cur_data_segno[i]);
1103 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]);
1104 seg_i->next_segno = segno;
1105 reset_curseg(sbi, i, 0);
1106 seg_i->alloc_type = ckpt->alloc_type[i];
1107 seg_i->next_blkoff = blk_off;
1108
1109 if (seg_i->alloc_type == SSR)
1110 blk_off = sbi->blocks_per_seg;
1111
1112 for (j = 0; j < blk_off; j++) {
1113 struct f2fs_summary *s;
1114 s = (struct f2fs_summary *)(kaddr + offset);
1115 seg_i->sum_blk->entries[j] = *s;
1116 offset += SUMMARY_SIZE;
1117 if (offset + SUMMARY_SIZE <= PAGE_CACHE_SIZE -
1118 SUM_FOOTER_SIZE)
1119 continue;
1120
1121 f2fs_put_page(page, 1);
1122 page = NULL;
1123
1124 page = get_meta_page(sbi, start++);
1125 kaddr = (unsigned char *)page_address(page);
1126 offset = 0;
1127 }
1128 }
1129 f2fs_put_page(page, 1);
1130 return 0;
1131}
1132
1133static int read_normal_summaries(struct f2fs_sb_info *sbi, int type)
1134{
1135 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1136 struct f2fs_summary_block *sum;
1137 struct curseg_info *curseg;
1138 struct page *new;
1139 unsigned short blk_off;
1140 unsigned int segno = 0;
1141 block_t blk_addr = 0;
1142
1143 /* get segment number and block addr */
1144 if (IS_DATASEG(type)) {
1145 segno = le32_to_cpu(ckpt->cur_data_segno[type]);
1146 blk_off = le16_to_cpu(ckpt->cur_data_blkoff[type -
1147 CURSEG_HOT_DATA]);
25ca923b 1148 if (is_set_ckpt_flags(ckpt, CP_UMOUNT_FLAG))
351df4b2
JK		 1149 blk_addr = sum_blk_addr(sbi, NR_CURSEG_TYPE, type);
1150 else
1151 blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type);
1152 } else {
1153 segno = le32_to_cpu(ckpt->cur_node_segno[type -
1154 CURSEG_HOT_NODE]);
1155 blk_off = le16_to_cpu(ckpt->cur_node_blkoff[type -
1156 CURSEG_HOT_NODE]);
25ca923b 1157 if (is_set_ckpt_flags(ckpt, CP_UMOUNT_FLAG))
351df4b2
JK		 1158 blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE,
1159 type - CURSEG_HOT_NODE);
1160 else
1161 blk_addr = GET_SUM_BLOCK(sbi, segno);
1162 }
1163
1164 new = get_meta_page(sbi, blk_addr);
1165 sum = (struct f2fs_summary_block *)page_address(new);
1166
1167 if (IS_NODESEG(type)) {
25ca923b 1168 if (is_set_ckpt_flags(ckpt, CP_UMOUNT_FLAG)) {
351df4b2
JK		 1169 struct f2fs_summary *ns = &sum->entries[0];
1170 int i;
1171 for (i = 0; i < sbi->blocks_per_seg; i++, ns++) {
1172 ns->version = 0;
1173 ns->ofs_in_node = 0;
1174 }
1175 } else {
1176 if (restore_node_summary(sbi, segno, sum)) {
1177 f2fs_put_page(new, 1);
1178 return -EINVAL;
1179 }
1180 }
1181 }
1182
1183 /* set uncompleted segment to curseg */
1184 curseg = CURSEG_I(sbi, type);
1185 mutex_lock(&curseg->curseg_mutex);
1186 memcpy(curseg->sum_blk, sum, PAGE_CACHE_SIZE);
1187 curseg->next_segno = segno;
1188 reset_curseg(sbi, type, 0);
1189 curseg->alloc_type = ckpt->alloc_type[type];
1190 curseg->next_blkoff = blk_off;
1191 mutex_unlock(&curseg->curseg_mutex);
1192 f2fs_put_page(new, 1);
1193 return 0;
1194}
1195
1196static int restore_curseg_summaries(struct f2fs_sb_info *sbi)
1197{
1198 int type = CURSEG_HOT_DATA;
1199
25ca923b 1200 if (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_COMPACT_SUM_FLAG)) {
351df4b2
JK		 1201 /* restore for compacted data summary */
1202 if (read_compacted_summaries(sbi))
1203 return -EINVAL;
1204 type = CURSEG_HOT_NODE;
1205 }
1206
1207 for (; type <= CURSEG_COLD_NODE; type++)
1208 if (read_normal_summaries(sbi, type))
1209 return -EINVAL;
1210 return 0;
1211}
1212
1213static void write_compacted_summaries(struct f2fs_sb_info *sbi, block_t blkaddr)
1214{
1215 struct page *page;
1216 unsigned char *kaddr;
1217 struct f2fs_summary *summary;
1218 struct curseg_info *seg_i;
1219 int written_size = 0;
1220 int i, j;
1221
1222 page = grab_meta_page(sbi, blkaddr++);
1223 kaddr = (unsigned char *)page_address(page);
1224
1225 /* Step 1: write nat cache */
1226 seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA);
1227 memcpy(kaddr, &seg_i->sum_blk->n_nats, SUM_JOURNAL_SIZE);
1228 written_size += SUM_JOURNAL_SIZE;
1229
1230 /* Step 2: write sit cache */
1231 seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA);
1232 memcpy(kaddr + written_size, &seg_i->sum_blk->n_sits,
1233 SUM_JOURNAL_SIZE);
1234 written_size += SUM_JOURNAL_SIZE;
1235
351df4b2
JK		 1236 /* Step 3: write summary entries */
1237 for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) {
1238 unsigned short blkoff;
1239 seg_i = CURSEG_I(sbi, i);
1240 if (sbi->ckpt->alloc_type[i] == SSR)
1241 blkoff = sbi->blocks_per_seg;
1242 else
1243 blkoff = curseg_blkoff(sbi, i);
1244
1245 for (j = 0; j < blkoff; j++) {
1246 if (!page) {
1247 page = grab_meta_page(sbi, blkaddr++);
1248 kaddr = (unsigned char *)page_address(page);
1249 written_size = 0;
1250 }
1251 summary = (struct f2fs_summary *)(kaddr + written_size);
1252 *summary = seg_i->sum_blk->entries[j];
1253 written_size += SUMMARY_SIZE;
351df4b2
JK		 1254
1255 if (written_size + SUMMARY_SIZE <= PAGE_CACHE_SIZE -
1256 SUM_FOOTER_SIZE)
1257 continue;
1258
e8d61a74 1259 set_page_dirty(page);
351df4b2
JK		 1260 f2fs_put_page(page, 1);
1261 page = NULL;
1262 }
1263 }
e8d61a74
CY		 1264 if (page) {
1265 set_page_dirty(page);
351df4b2 1266 f2fs_put_page(page, 1);
e8d61a74 1267 }
351df4b2
JK		 1268}
1269
1270static void write_normal_summaries(struct f2fs_sb_info *sbi,
1271 block_t blkaddr, int type)
1272{
1273 int i, end;
1274 if (IS_DATASEG(type))
1275 end = type + NR_CURSEG_DATA_TYPE;
1276 else
1277 end = type + NR_CURSEG_NODE_TYPE;
1278
1279 for (i = type; i < end; i++) {
1280 struct curseg_info *sum = CURSEG_I(sbi, i);
1281 mutex_lock(&sum->curseg_mutex);
1282 write_sum_page(sbi, sum->sum_blk, blkaddr + (i - type));
1283 mutex_unlock(&sum->curseg_mutex);
1284 }
1285}
1286
1287void write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
1288{
25ca923b 1289 if (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_COMPACT_SUM_FLAG))
351df4b2
JK		 1290 write_compacted_summaries(sbi, start_blk);
1291 else
1292 write_normal_summaries(sbi, start_blk, CURSEG_HOT_DATA);
1293}
1294
1295void write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk)
1296{
25ca923b 1297 if (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_UMOUNT_FLAG))
351df4b2 1298 write_normal_summaries(sbi, start_blk, CURSEG_HOT_NODE);
351df4b2
JK		 1299}
1300
1301int lookup_journal_in_cursum(struct f2fs_summary_block *sum, int type,
1302 unsigned int val, int alloc)
1303{
1304 int i;
1305
1306 if (type == NAT_JOURNAL) {
1307 for (i = 0; i < nats_in_cursum(sum); i++) {
1308 if (le32_to_cpu(nid_in_journal(sum, i)) == val)
1309 return i;
1310 }
1311 if (alloc && nats_in_cursum(sum) < NAT_JOURNAL_ENTRIES)
1312 return update_nats_in_cursum(sum, 1);
1313 } else if (type == SIT_JOURNAL) {
1314 for (i = 0; i < sits_in_cursum(sum); i++)
1315 if (le32_to_cpu(segno_in_journal(sum, i)) == val)
1316 return i;
1317 if (alloc && sits_in_cursum(sum) < SIT_JOURNAL_ENTRIES)
1318 return update_sits_in_cursum(sum, 1);
1319 }
1320 return -1;
1321}
1322
1323static struct page *get_current_sit_page(struct f2fs_sb_info *sbi,
1324 unsigned int segno)
1325{
1326 struct sit_info *sit_i = SIT_I(sbi);
1327 unsigned int offset = SIT_BLOCK_OFFSET(sit_i, segno);
1328 block_t blk_addr = sit_i->sit_base_addr + offset;
1329
1330 check_seg_range(sbi, segno);
1331
1332 /* calculate sit block address */
1333 if (f2fs_test_bit(offset, sit_i->sit_bitmap))
1334 blk_addr += sit_i->sit_blocks;
1335
1336 return get_meta_page(sbi, blk_addr);
1337}
1338
1339static struct page *get_next_sit_page(struct f2fs_sb_info *sbi,
1340 unsigned int start)
1341{
1342 struct sit_info *sit_i = SIT_I(sbi);
1343 struct page *src_page, *dst_page;
1344 pgoff_t src_off, dst_off;
1345 void *src_addr, *dst_addr;
1346
1347 src_off = current_sit_addr(sbi, start);
1348 dst_off = next_sit_addr(sbi, src_off);
1349
1350 /* get current sit block page without lock */
1351 src_page = get_meta_page(sbi, src_off);
1352 dst_page = grab_meta_page(sbi, dst_off);
5d56b671 1353 f2fs_bug_on(PageDirty(src_page));
351df4b2
JK		 1354
1355 src_addr = page_address(src_page);
1356 dst_addr = page_address(dst_page);
1357 memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE);
1358
1359 set_page_dirty(dst_page);
1360 f2fs_put_page(src_page, 1);
1361
1362 set_to_next_sit(sit_i, start);
1363
1364 return dst_page;
1365}
1366
1367static bool flush_sits_in_journal(struct f2fs_sb_info *sbi)
1368{
1369 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
1370 struct f2fs_summary_block *sum = curseg->sum_blk;
1371 int i;
1372
1373 /*
1374 * If the journal area in the current summary is full of sit entries,
1375 * all the sit entries will be flushed. Otherwise the sit entries
1376 * are not able to replace with newly hot sit entries.
1377 */
1378 if (sits_in_cursum(sum) >= SIT_JOURNAL_ENTRIES) {
1379 for (i = sits_in_cursum(sum) - 1; i >= 0; i--) {
1380 unsigned int segno;
1381 segno = le32_to_cpu(segno_in_journal(sum, i));
1382 __mark_sit_entry_dirty(sbi, segno);
1383 }
1384 update_sits_in_cursum(sum, -sits_in_cursum(sum));
cffbfa66 1385 return true;
351df4b2 1386 }
cffbfa66 1387 return false;
351df4b2
JK		 1388}
1389
0a8165d7 1390/*
351df4b2
JK		 1391 * CP calls this function, which flushes SIT entries including sit_journal,
1392 * and moves prefree segs to free segs.
1393 */
1394void flush_sit_entries(struct f2fs_sb_info *sbi)
1395{
1396 struct sit_info *sit_i = SIT_I(sbi);
1397 unsigned long *bitmap = sit_i->dirty_sentries_bitmap;
1398 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
1399 struct f2fs_summary_block *sum = curseg->sum_blk;
1400 unsigned long nsegs = TOTAL_SEGS(sbi);
1401 struct page *page = NULL;
1402 struct f2fs_sit_block *raw_sit = NULL;
1403 unsigned int start = 0, end = 0;
1404 unsigned int segno = -1;
1405 bool flushed;
1406
1407 mutex_lock(&curseg->curseg_mutex);
1408 mutex_lock(&sit_i->sentry_lock);
1409
1410 /*
1411 * "flushed" indicates whether sit entries in journal are flushed
1412 * to the SIT area or not.
1413 */
1414 flushed = flush_sits_in_journal(sbi);
1415
1416 while ((segno = find_next_bit(bitmap, nsegs, segno + 1)) < nsegs) {
1417 struct seg_entry *se = get_seg_entry(sbi, segno);
1418 int sit_offset, offset;
1419
1420 sit_offset = SIT_ENTRY_OFFSET(sit_i, segno);
1421
b2955550
JK		 1422 /* add discard candidates */
1423 if (SM_I(sbi)->nr_discards < SM_I(sbi)->max_discards)
1424 add_discard_addrs(sbi, segno, se);
1425
351df4b2
JK		 1426 if (flushed)
1427 goto to_sit_page;
1428
1429 offset = lookup_journal_in_cursum(sum, SIT_JOURNAL, segno, 1);
1430 if (offset >= 0) {
1431 segno_in_journal(sum, offset) = cpu_to_le32(segno);
1432 seg_info_to_raw_sit(se, &sit_in_journal(sum, offset));
1433 goto flush_done;
1434 }
1435to_sit_page:
1436 if (!page || (start > segno) || (segno > end)) {
1437 if (page) {
1438 f2fs_put_page(page, 1);
1439 page = NULL;
1440 }
1441
1442 start = START_SEGNO(sit_i, segno);
1443 end = start + SIT_ENTRY_PER_BLOCK - 1;
1444
1445 /* read sit block that will be updated */
1446 page = get_next_sit_page(sbi, start);
1447 raw_sit = page_address(page);
1448 }
1449
1450 /* udpate entry in SIT block */
1451 seg_info_to_raw_sit(se, &raw_sit->entries[sit_offset]);
1452flush_done:
1453 __clear_bit(segno, bitmap);
1454 sit_i->dirty_sentries--;
1455 }
1456 mutex_unlock(&sit_i->sentry_lock);
1457 mutex_unlock(&curseg->curseg_mutex);
1458
1459 /* writeout last modified SIT block */
1460 f2fs_put_page(page, 1);
1461
1462 set_prefree_as_free_segments(sbi);
1463}
1464
1465static int build_sit_info(struct f2fs_sb_info *sbi)
1466{
1467 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
1468 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1469 struct sit_info *sit_i;
1470 unsigned int sit_segs, start;
1471 char *src_bitmap, *dst_bitmap;
1472 unsigned int bitmap_size;
1473
1474 /* allocate memory for SIT information */
1475 sit_i = kzalloc(sizeof(struct sit_info), GFP_KERNEL);
1476 if (!sit_i)
1477 return -ENOMEM;
1478
1479 SM_I(sbi)->sit_info = sit_i;
1480
1481 sit_i->sentries = vzalloc(TOTAL_SEGS(sbi) * sizeof(struct seg_entry));
1482 if (!sit_i->sentries)
1483 return -ENOMEM;
1484
1485 bitmap_size = f2fs_bitmap_size(TOTAL_SEGS(sbi));
1486 sit_i->dirty_sentries_bitmap = kzalloc(bitmap_size, GFP_KERNEL);
1487 if (!sit_i->dirty_sentries_bitmap)
1488 return -ENOMEM;
1489
1490 for (start = 0; start < TOTAL_SEGS(sbi); start++) {
1491 sit_i->sentries[start].cur_valid_map
1492 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
1493 sit_i->sentries[start].ckpt_valid_map
1494 = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL);
1495 if (!sit_i->sentries[start].cur_valid_map
1496 || !sit_i->sentries[start].ckpt_valid_map)
1497 return -ENOMEM;
1498 }
1499
1500 if (sbi->segs_per_sec > 1) {
53cf9522 1501 sit_i->sec_entries = vzalloc(TOTAL_SECS(sbi) *
351df4b2
JK		 1502 sizeof(struct sec_entry));
1503 if (!sit_i->sec_entries)
1504 return -ENOMEM;
1505 }
1506
1507 /* get information related with SIT */
1508 sit_segs = le32_to_cpu(raw_super->segment_count_sit) >> 1;
1509
1510 /* setup SIT bitmap from ckeckpoint pack */
1511 bitmap_size = __bitmap_size(sbi, SIT_BITMAP);
1512 src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP);
1513
79b5793b 1514 dst_bitmap = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL);
351df4b2
JK		 1515 if (!dst_bitmap)
1516 return -ENOMEM;
351df4b2
JK		 1517
1518 /* init SIT information */
1519 sit_i->s_ops = &default_salloc_ops;
1520
1521 sit_i->sit_base_addr = le32_to_cpu(raw_super->sit_blkaddr);
1522 sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg;
1523 sit_i->written_valid_blocks = le64_to_cpu(ckpt->valid_block_count);
1524 sit_i->sit_bitmap = dst_bitmap;
1525 sit_i->bitmap_size = bitmap_size;
1526 sit_i->dirty_sentries = 0;
1527 sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK;
1528 sit_i->elapsed_time = le64_to_cpu(sbi->ckpt->elapsed_time);
1529 sit_i->mounted_time = CURRENT_TIME_SEC.tv_sec;
1530 mutex_init(&sit_i->sentry_lock);
1531 return 0;
1532}
1533
1534static int build_free_segmap(struct f2fs_sb_info *sbi)
1535{
1536 struct f2fs_sm_info *sm_info = SM_I(sbi);
1537 struct free_segmap_info *free_i;
1538 unsigned int bitmap_size, sec_bitmap_size;
1539
1540 /* allocate memory for free segmap information */
1541 free_i = kzalloc(sizeof(struct free_segmap_info), GFP_KERNEL);
1542 if (!free_i)
1543 return -ENOMEM;
1544
1545 SM_I(sbi)->free_info = free_i;
1546
1547 bitmap_size = f2fs_bitmap_size(TOTAL_SEGS(sbi));
1548 free_i->free_segmap = kmalloc(bitmap_size, GFP_KERNEL);
1549 if (!free_i->free_segmap)
1550 return -ENOMEM;
1551
53cf9522 1552 sec_bitmap_size = f2fs_bitmap_size(TOTAL_SECS(sbi));
351df4b2
JK		 1553 free_i->free_secmap = kmalloc(sec_bitmap_size, GFP_KERNEL);
1554 if (!free_i->free_secmap)
1555 return -ENOMEM;
1556
1557 /* set all segments as dirty temporarily */
1558 memset(free_i->free_segmap, 0xff, bitmap_size);
1559 memset(free_i->free_secmap, 0xff, sec_bitmap_size);
1560
1561 /* init free segmap information */
1562 free_i->start_segno =
1563 (unsigned int) GET_SEGNO_FROM_SEG0(sbi, sm_info->main_blkaddr);
1564 free_i->free_segments = 0;
1565 free_i->free_sections = 0;
1566 rwlock_init(&free_i->segmap_lock);
1567 return 0;
1568}
1569
1570static int build_curseg(struct f2fs_sb_info *sbi)
1571{
1042d60f 1572 struct curseg_info *array;
351df4b2
JK		 1573 int i;
1574
1575 array = kzalloc(sizeof(*array) * NR_CURSEG_TYPE, GFP_KERNEL);
1576 if (!array)
1577 return -ENOMEM;
1578
1579 SM_I(sbi)->curseg_array = array;
1580
1581 for (i = 0; i < NR_CURSEG_TYPE; i++) {
1582 mutex_init(&array[i].curseg_mutex);
1583 array[i].sum_blk = kzalloc(PAGE_CACHE_SIZE, GFP_KERNEL);
1584 if (!array[i].sum_blk)
1585 return -ENOMEM;
1586 array[i].segno = NULL_SEGNO;
1587 array[i].next_blkoff = 0;
1588 }
1589 return restore_curseg_summaries(sbi);
1590}
1591
74de593a
CY		 1592static int ra_sit_pages(struct f2fs_sb_info *sbi, int start, int nrpages)
1593{
1594 struct address_space *mapping = sbi->meta_inode->i_mapping;
1595 struct page *page;
1596 block_t blk_addr, prev_blk_addr = 0;
1597 int sit_blk_cnt = SIT_BLK_CNT(sbi);
1598 int blkno = start;
458e6197
JK		 1599 struct f2fs_io_info fio = {
1600 .type = META,
1601 .rw = READ_SYNC,
1602 .rw_flag = REQ_META | REQ_PRIO
1603 };
74de593a
CY		 1604
1605 for (; blkno < start + nrpages && blkno < sit_blk_cnt; blkno++) {
1606
1607 blk_addr = current_sit_addr(sbi, blkno * SIT_ENTRY_PER_BLOCK);
1608
1609 if (blkno != start && prev_blk_addr + 1 != blk_addr)
1610 break;
1611 prev_blk_addr = blk_addr;
1612repeat:
1613 page = grab_cache_page(mapping, blk_addr);
1614 if (!page) {
1615 cond_resched();
1616 goto repeat;
1617 }
1618 if (PageUptodate(page)) {
1619 mark_page_accessed(page);
1620 f2fs_put_page(page, 1);
1621 continue;
1622 }
1623
458e6197 1624 f2fs_submit_page_mbio(sbi, page, blk_addr, &fio);
74de593a
CY		 1625
1626 mark_page_accessed(page);
1627 f2fs_put_page(page, 0);
1628 }
1629
458e6197 1630 f2fs_submit_merged_bio(sbi, META, READ);
74de593a
CY		 1631 return blkno - start;
1632}
1633
351df4b2
JK		 1634static void build_sit_entries(struct f2fs_sb_info *sbi)
1635{
1636 struct sit_info *sit_i = SIT_I(sbi);
1637 struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA);
1638 struct f2fs_summary_block *sum = curseg->sum_blk;
74de593a
CY		 1639 int sit_blk_cnt = SIT_BLK_CNT(sbi);
1640 unsigned int i, start, end;
1641 unsigned int readed, start_blk = 0;
1642 int nrpages = MAX_BIO_BLOCKS(max_hw_blocks(sbi));
351df4b2 1643
74de593a
CY		 1644 do {
1645 readed = ra_sit_pages(sbi, start_blk, nrpages);
1646
1647 start = start_blk * sit_i->sents_per_block;
1648 end = (start_blk + readed) * sit_i->sents_per_block;
1649
1650 for (; start < end && start < TOTAL_SEGS(sbi); start++) {
1651 struct seg_entry *se = &sit_i->sentries[start];
1652 struct f2fs_sit_block *sit_blk;
1653 struct f2fs_sit_entry sit;
1654 struct page *page;
1655
1656 mutex_lock(&curseg->curseg_mutex);
1657 for (i = 0; i < sits_in_cursum(sum); i++) {
1658 if (le32_to_cpu(segno_in_journal(sum, i)) == start) {
1659 sit = sit_in_journal(sum, i);
1660 mutex_unlock(&curseg->curseg_mutex);
1661 goto got_it;
1662 }
351df4b2 1663 }
74de593a
CY		 1664 mutex_unlock(&curseg->curseg_mutex);
1665
1666 page = get_current_sit_page(sbi, start);
1667 sit_blk = (struct f2fs_sit_block *)page_address(page);
1668 sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, start)];
1669 f2fs_put_page(page, 1);
351df4b2 1670got_it:
74de593a
CY		 1671 check_block_count(sbi, start, &sit);
1672 seg_info_from_raw_sit(se, &sit);
1673 if (sbi->segs_per_sec > 1) {
1674 struct sec_entry *e = get_sec_entry(sbi, start);
1675 e->valid_blocks += se->valid_blocks;
1676 }
351df4b2 1677 }
74de593a
CY		 1678 start_blk += readed;
1679 } while (start_blk < sit_blk_cnt);
351df4b2
JK		 1680}
1681
1682static void init_free_segmap(struct f2fs_sb_info *sbi)
1683{
1684 unsigned int start;
1685 int type;
1686
1687 for (start = 0; start < TOTAL_SEGS(sbi); start++) {
1688 struct seg_entry *sentry = get_seg_entry(sbi, start);
1689 if (!sentry->valid_blocks)
1690 __set_free(sbi, start);
1691 }
1692
1693 /* set use the current segments */
1694 for (type = CURSEG_HOT_DATA; type <= CURSEG_COLD_NODE; type++) {
1695 struct curseg_info *curseg_t = CURSEG_I(sbi, type);
1696 __set_test_and_inuse(sbi, curseg_t->segno);
1697 }
1698}
1699
1700static void init_dirty_segmap(struct f2fs_sb_info *sbi)
1701{
1702 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1703 struct free_segmap_info *free_i = FREE_I(sbi);
8736fbf0 1704 unsigned int segno = 0, offset = 0, total_segs = TOTAL_SEGS(sbi);
351df4b2
JK		 1705 unsigned short valid_blocks;
1706
8736fbf0 1707 while (1) {
351df4b2 1708 /* find dirty segment based on free segmap */
8736fbf0
NJ		 1709 segno = find_next_inuse(free_i, total_segs, offset);
1710 if (segno >= total_segs)
351df4b2
JK		 1711 break;
1712 offset = segno + 1;
1713 valid_blocks = get_valid_blocks(sbi, segno, 0);
1714 if (valid_blocks >= sbi->blocks_per_seg || !valid_blocks)
1715 continue;
1716 mutex_lock(&dirty_i->seglist_lock);
1717 __locate_dirty_segment(sbi, segno, DIRTY);
1718 mutex_unlock(&dirty_i->seglist_lock);
1719 }
1720}
1721
5ec4e49f 1722static int init_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK		 1723{
1724 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
5ec4e49f 1725 unsigned int bitmap_size = f2fs_bitmap_size(TOTAL_SECS(sbi));
351df4b2 1726
5ec4e49f
JK		 1727 dirty_i->victim_secmap = kzalloc(bitmap_size, GFP_KERNEL);
1728 if (!dirty_i->victim_secmap)
351df4b2
JK		 1729 return -ENOMEM;
1730 return 0;
1731}
1732
1733static int build_dirty_segmap(struct f2fs_sb_info *sbi)
1734{
1735 struct dirty_seglist_info *dirty_i;
1736 unsigned int bitmap_size, i;
1737
1738 /* allocate memory for dirty segments list information */
1739 dirty_i = kzalloc(sizeof(struct dirty_seglist_info), GFP_KERNEL);
1740 if (!dirty_i)
1741 return -ENOMEM;
1742
1743 SM_I(sbi)->dirty_info = dirty_i;
1744 mutex_init(&dirty_i->seglist_lock);
1745
1746 bitmap_size = f2fs_bitmap_size(TOTAL_SEGS(sbi));
1747
1748 for (i = 0; i < NR_DIRTY_TYPE; i++) {
1749 dirty_i->dirty_segmap[i] = kzalloc(bitmap_size, GFP_KERNEL);
351df4b2
JK		 1750 if (!dirty_i->dirty_segmap[i])
1751 return -ENOMEM;
1752 }
1753
1754 init_dirty_segmap(sbi);
5ec4e49f 1755 return init_victim_secmap(sbi);
351df4b2
JK		 1756}
1757
0a8165d7 1758/*
351df4b2
JK		 1759 * Update min, max modified time for cost-benefit GC algorithm
1760 */
1761static void init_min_max_mtime(struct f2fs_sb_info *sbi)
1762{
1763 struct sit_info *sit_i = SIT_I(sbi);
1764 unsigned int segno;
1765
1766 mutex_lock(&sit_i->sentry_lock);
1767
1768 sit_i->min_mtime = LLONG_MAX;
1769
1770 for (segno = 0; segno < TOTAL_SEGS(sbi); segno += sbi->segs_per_sec) {
1771 unsigned int i;
1772 unsigned long long mtime = 0;
1773
1774 for (i = 0; i < sbi->segs_per_sec; i++)
1775 mtime += get_seg_entry(sbi, segno + i)->mtime;
1776
1777 mtime = div_u64(mtime, sbi->segs_per_sec);
1778
1779 if (sit_i->min_mtime > mtime)
1780 sit_i->min_mtime = mtime;
1781 }
1782 sit_i->max_mtime = get_mtime(sbi);
1783 mutex_unlock(&sit_i->sentry_lock);
1784}
1785
1786int build_segment_manager(struct f2fs_sb_info *sbi)
1787{
1788 struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi);
1789 struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi);
1042d60f 1790 struct f2fs_sm_info *sm_info;
351df4b2
JK		 1791 int err;
1792
1793 sm_info = kzalloc(sizeof(struct f2fs_sm_info), GFP_KERNEL);
1794 if (!sm_info)
1795 return -ENOMEM;
1796
1797 /* init sm info */
1798 sbi->sm_info = sm_info;
1799 INIT_LIST_HEAD(&sm_info->wblist_head);
1800 spin_lock_init(&sm_info->wblist_lock);
1801 sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr);
1802 sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr);
1803 sm_info->segment_count = le32_to_cpu(raw_super->segment_count);
1804 sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count);
1805 sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count);
1806 sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main);
1807 sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr);
81eb8d6e 1808 sm_info->rec_prefree_segments = DEF_RECLAIM_PREFREE_SEGMENTS;
216fbd64
JK		 1809 sm_info->ipu_policy = F2FS_IPU_DISABLE;
1810 sm_info->min_ipu_util = DEF_MIN_IPU_UTIL;
351df4b2 1811
7fd9e544
JK		 1812 INIT_LIST_HEAD(&sm_info->discard_list);
1813 sm_info->nr_discards = 0;
1814 sm_info->max_discards = 0;
1815
351df4b2
JK		 1816 err = build_sit_info(sbi);
1817 if (err)
1818 return err;
1819 err = build_free_segmap(sbi);
1820 if (err)
1821 return err;
1822 err = build_curseg(sbi);
1823 if (err)
1824 return err;
1825
1826 /* reinit free segmap based on SIT */
1827 build_sit_entries(sbi);
1828
1829 init_free_segmap(sbi);
1830 err = build_dirty_segmap(sbi);
1831 if (err)
1832 return err;
1833
1834 init_min_max_mtime(sbi);
1835 return 0;
1836}
1837
1838static void discard_dirty_segmap(struct f2fs_sb_info *sbi,
1839 enum dirty_type dirty_type)
1840{
1841 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1842
1843 mutex_lock(&dirty_i->seglist_lock);
1844 kfree(dirty_i->dirty_segmap[dirty_type]);
1845 dirty_i->nr_dirty[dirty_type] = 0;
1846 mutex_unlock(&dirty_i->seglist_lock);
1847}
1848
5ec4e49f 1849static void destroy_victim_secmap(struct f2fs_sb_info *sbi)
351df4b2
JK		 1850{
1851 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
5ec4e49f 1852 kfree(dirty_i->victim_secmap);
351df4b2
JK		 1853}
1854
1855static void destroy_dirty_segmap(struct f2fs_sb_info *sbi)
1856{
1857 struct dirty_seglist_info *dirty_i = DIRTY_I(sbi);
1858 int i;
1859
1860 if (!dirty_i)
1861 return;
1862
1863 /* discard pre-free/dirty segments list */
1864 for (i = 0; i < NR_DIRTY_TYPE; i++)
1865 discard_dirty_segmap(sbi, i);
1866
5ec4e49f 1867 destroy_victim_secmap(sbi);
351df4b2
JK		 1868 SM_I(sbi)->dirty_info = NULL;
1869 kfree(dirty_i);
1870}
1871
1872static void destroy_curseg(struct f2fs_sb_info *sbi)
1873{
1874 struct curseg_info *array = SM_I(sbi)->curseg_array;
1875 int i;
1876
1877 if (!array)
1878 return;
1879 SM_I(sbi)->curseg_array = NULL;
1880 for (i = 0; i < NR_CURSEG_TYPE; i++)
1881 kfree(array[i].sum_blk);
1882 kfree(array);
1883}
1884
1885static void destroy_free_segmap(struct f2fs_sb_info *sbi)
1886{
1887 struct free_segmap_info *free_i = SM_I(sbi)->free_info;
1888 if (!free_i)
1889 return;
1890 SM_I(sbi)->free_info = NULL;
1891 kfree(free_i->free_segmap);
1892 kfree(free_i->free_secmap);
1893 kfree(free_i);
1894}
1895
1896static void destroy_sit_info(struct f2fs_sb_info *sbi)
1897{
1898 struct sit_info *sit_i = SIT_I(sbi);
1899 unsigned int start;
1900
1901 if (!sit_i)
1902 return;
1903
1904 if (sit_i->sentries) {
1905 for (start = 0; start < TOTAL_SEGS(sbi); start++) {
1906 kfree(sit_i->sentries[start].cur_valid_map);
1907 kfree(sit_i->sentries[start].ckpt_valid_map);
1908 }
1909 }
1910 vfree(sit_i->sentries);
1911 vfree(sit_i->sec_entries);
1912 kfree(sit_i->dirty_sentries_bitmap);
1913
1914 SM_I(sbi)->sit_info = NULL;
1915 kfree(sit_i->sit_bitmap);
1916 kfree(sit_i);
1917}
1918
1919void destroy_segment_manager(struct f2fs_sb_info *sbi)
1920{
1921 struct f2fs_sm_info *sm_info = SM_I(sbi);
3b03f724
CY		 1922 if (!sm_info)
1923 return;
351df4b2
JK		 1924 destroy_dirty_segmap(sbi);
1925 destroy_curseg(sbi);
1926 destroy_free_segmap(sbi);
1927 destroy_sit_info(sbi);
1928 sbi->sm_info = NULL;
1929 kfree(sm_info);
1930}
7fd9e544
JK		 1931
1932int __init create_segment_manager_caches(void)
1933{
1934 discard_entry_slab = f2fs_kmem_cache_create("discard_entry",
1935 sizeof(struct discard_entry), NULL);
1936 if (!discard_entry_slab)
1937 return -ENOMEM;
1938 return 0;
1939}
1940
1941void destroy_segment_manager_caches(void)
1942{
1943 kmem_cache_destroy(discard_entry_slab);
1944}
ubuntu-zesty-kernel mirror