Commit | Line | Data |
---|---|---|
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> |
6b4afdd7 | 16 | #include <linux/kthread.h> |
74de593a | 17 | #include <linux/swap.h> |
60b99b48 | 18 | #include <linux/timer.h> |
351df4b2 JK |
19 | |
20 | #include "f2fs.h" | |
21 | #include "segment.h" | |
22 | #include "node.h" | |
9e4ded3f | 23 | #include "trace.h" |
6ec178da | 24 | #include <trace/events/f2fs.h> |
351df4b2 | 25 | |
9a7f143a CL |
26 | #define __reverse_ffz(x) __reverse_ffs(~(x)) |
27 | ||
7fd9e544 | 28 | static struct kmem_cache *discard_entry_slab; |
184a5cd2 | 29 | static struct kmem_cache *sit_entry_set_slab; |
88b88a66 | 30 | static struct kmem_cache *inmem_entry_slab; |
7fd9e544 | 31 | |
f96999c3 JK |
32 | static unsigned long __reverse_ulong(unsigned char *str) |
33 | { | |
34 | unsigned long tmp = 0; | |
35 | int shift = 24, idx = 0; | |
36 | ||
37 | #if BITS_PER_LONG == 64 | |
38 | shift = 56; | |
39 | #endif | |
40 | while (shift >= 0) { | |
41 | tmp |= (unsigned long)str[idx++] << shift; | |
42 | shift -= BITS_PER_BYTE; | |
43 | } | |
44 | return tmp; | |
45 | } | |
46 | ||
9a7f143a CL |
47 | /* |
48 | * __reverse_ffs is copied from include/asm-generic/bitops/__ffs.h since | |
49 | * MSB and LSB are reversed in a byte by f2fs_set_bit. | |
50 | */ | |
51 | static inline unsigned long __reverse_ffs(unsigned long word) | |
52 | { | |
53 | int num = 0; | |
54 | ||
55 | #if BITS_PER_LONG == 64 | |
f96999c3 | 56 | if ((word & 0xffffffff00000000UL) == 0) |
9a7f143a | 57 | num += 32; |
f96999c3 | 58 | else |
9a7f143a | 59 | word >>= 32; |
9a7f143a | 60 | #endif |
f96999c3 | 61 | if ((word & 0xffff0000) == 0) |
9a7f143a | 62 | num += 16; |
f96999c3 | 63 | else |
9a7f143a | 64 | word >>= 16; |
f96999c3 JK |
65 | |
66 | if ((word & 0xff00) == 0) | |
9a7f143a | 67 | num += 8; |
f96999c3 | 68 | else |
9a7f143a | 69 | word >>= 8; |
f96999c3 | 70 | |
9a7f143a CL |
71 | if ((word & 0xf0) == 0) |
72 | num += 4; | |
73 | else | |
74 | word >>= 4; | |
f96999c3 | 75 | |
9a7f143a CL |
76 | if ((word & 0xc) == 0) |
77 | num += 2; | |
78 | else | |
79 | word >>= 2; | |
f96999c3 | 80 | |
9a7f143a CL |
81 | if ((word & 0x2) == 0) |
82 | num += 1; | |
83 | return num; | |
84 | } | |
85 | ||
86 | /* | |
e1c42045 | 87 | * __find_rev_next(_zero)_bit is copied from lib/find_next_bit.c because |
9a7f143a | 88 | * f2fs_set_bit makes MSB and LSB reversed in a byte. |
692223d1 | 89 | * @size must be integral times of unsigned long. |
9a7f143a | 90 | * Example: |
f96999c3 JK |
91 | * MSB <--> LSB |
92 | * f2fs_set_bit(0, bitmap) => 1000 0000 | |
93 | * f2fs_set_bit(7, bitmap) => 0000 0001 | |
9a7f143a CL |
94 | */ |
95 | static unsigned long __find_rev_next_bit(const unsigned long *addr, | |
96 | unsigned long size, unsigned long offset) | |
97 | { | |
98 | const unsigned long *p = addr + BIT_WORD(offset); | |
692223d1 | 99 | unsigned long result = size; |
9a7f143a | 100 | unsigned long tmp; |
9a7f143a CL |
101 | |
102 | if (offset >= size) | |
103 | return size; | |
104 | ||
692223d1 | 105 | size -= (offset & ~(BITS_PER_LONG - 1)); |
9a7f143a | 106 | offset %= BITS_PER_LONG; |
f96999c3 | 107 | |
692223d1 FL |
108 | while (1) { |
109 | if (*p == 0) | |
110 | goto pass; | |
9a7f143a | 111 | |
f96999c3 | 112 | tmp = __reverse_ulong((unsigned char *)p); |
692223d1 FL |
113 | |
114 | tmp &= ~0UL >> offset; | |
115 | if (size < BITS_PER_LONG) | |
116 | tmp &= (~0UL << (BITS_PER_LONG - size)); | |
9a7f143a | 117 | if (tmp) |
692223d1 FL |
118 | goto found; |
119 | pass: | |
120 | if (size <= BITS_PER_LONG) | |
121 | break; | |
9a7f143a | 122 | size -= BITS_PER_LONG; |
692223d1 | 123 | offset = 0; |
f96999c3 | 124 | p++; |
9a7f143a | 125 | } |
692223d1 FL |
126 | return result; |
127 | found: | |
128 | return result - size + __reverse_ffs(tmp); | |
9a7f143a CL |
129 | } |
130 | ||
131 | static unsigned long __find_rev_next_zero_bit(const unsigned long *addr, | |
132 | unsigned long size, unsigned long offset) | |
133 | { | |
134 | const unsigned long *p = addr + BIT_WORD(offset); | |
135 | unsigned long result = offset & ~(BITS_PER_LONG - 1); | |
136 | unsigned long tmp; | |
9a7f143a CL |
137 | |
138 | if (offset >= size) | |
139 | return size; | |
140 | ||
141 | size -= result; | |
142 | offset %= BITS_PER_LONG; | |
143 | if (!offset) | |
144 | goto aligned; | |
145 | ||
f96999c3 JK |
146 | tmp = __reverse_ulong((unsigned char *)p); |
147 | tmp |= ~((~0UL << offset) >> offset); | |
148 | ||
9a7f143a CL |
149 | if (size < BITS_PER_LONG) |
150 | goto found_first; | |
f96999c3 | 151 | if (tmp != ~0UL) |
9a7f143a CL |
152 | goto found_middle; |
153 | ||
154 | size -= BITS_PER_LONG; | |
155 | result += BITS_PER_LONG; | |
f96999c3 | 156 | p++; |
9a7f143a CL |
157 | aligned: |
158 | while (size & ~(BITS_PER_LONG - 1)) { | |
f96999c3 JK |
159 | tmp = __reverse_ulong((unsigned char *)p); |
160 | if (tmp != ~0UL) | |
9a7f143a CL |
161 | goto found_middle; |
162 | result += BITS_PER_LONG; | |
163 | size -= BITS_PER_LONG; | |
f96999c3 | 164 | p++; |
9a7f143a CL |
165 | } |
166 | if (!size) | |
167 | return result; | |
9a7f143a | 168 | |
f96999c3 | 169 | tmp = __reverse_ulong((unsigned char *)p); |
9a7f143a | 170 | found_first: |
f96999c3 JK |
171 | tmp |= ~(~0UL << (BITS_PER_LONG - size)); |
172 | if (tmp == ~0UL) /* Are any bits zero? */ | |
9a7f143a CL |
173 | return result + size; /* Nope. */ |
174 | found_middle: | |
175 | return result + __reverse_ffz(tmp); | |
176 | } | |
177 | ||
88b88a66 JK |
178 | void register_inmem_page(struct inode *inode, struct page *page) |
179 | { | |
180 | struct f2fs_inode_info *fi = F2FS_I(inode); | |
181 | struct inmem_pages *new; | |
9be32d72 | 182 | |
9e4ded3f | 183 | f2fs_trace_pid(page); |
0722b101 | 184 | |
decd36b6 CY |
185 | set_page_private(page, (unsigned long)ATOMIC_WRITTEN_PAGE); |
186 | SetPagePrivate(page); | |
187 | ||
88b88a66 JK |
188 | new = f2fs_kmem_cache_alloc(inmem_entry_slab, GFP_NOFS); |
189 | ||
190 | /* add atomic page indices to the list */ | |
191 | new->page = page; | |
192 | INIT_LIST_HEAD(&new->list); | |
decd36b6 | 193 | |
88b88a66 JK |
194 | /* increase reference count with clean state */ |
195 | mutex_lock(&fi->inmem_lock); | |
196 | get_page(page); | |
197 | list_add_tail(&new->list, &fi->inmem_pages); | |
8dcf2ff7 | 198 | inc_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES); |
88b88a66 | 199 | mutex_unlock(&fi->inmem_lock); |
8ce67cb0 JK |
200 | |
201 | trace_f2fs_register_inmem_page(page, INMEM); | |
88b88a66 JK |
202 | } |
203 | ||
edb27dee | 204 | int commit_inmem_pages(struct inode *inode, bool abort) |
88b88a66 JK |
205 | { |
206 | struct f2fs_sb_info *sbi = F2FS_I_SB(inode); | |
207 | struct f2fs_inode_info *fi = F2FS_I(inode); | |
208 | struct inmem_pages *cur, *tmp; | |
209 | bool submit_bio = false; | |
210 | struct f2fs_io_info fio = { | |
05ca3632 | 211 | .sbi = sbi, |
88b88a66 | 212 | .type = DATA, |
1e84371f | 213 | .rw = WRITE_SYNC | REQ_PRIO, |
4375a336 | 214 | .encrypted_page = NULL, |
88b88a66 | 215 | }; |
edb27dee | 216 | int err = 0; |
88b88a66 | 217 | |
0341845e JK |
218 | /* |
219 | * The abort is true only when f2fs_evict_inode is called. | |
220 | * Basically, the f2fs_evict_inode doesn't produce any data writes, so | |
221 | * that we don't need to call f2fs_balance_fs. | |
222 | * Otherwise, f2fs_gc in f2fs_balance_fs can wait forever until this | |
223 | * inode becomes free by iget_locked in f2fs_iget. | |
224 | */ | |
70c640b1 | 225 | if (!abort) { |
0341845e | 226 | f2fs_balance_fs(sbi); |
70c640b1 JK |
227 | f2fs_lock_op(sbi); |
228 | } | |
88b88a66 JK |
229 | |
230 | mutex_lock(&fi->inmem_lock); | |
231 | list_for_each_entry_safe(cur, tmp, &fi->inmem_pages, list) { | |
decd36b6 | 232 | lock_page(cur->page); |
70c640b1 | 233 | if (!abort) { |
70c640b1 | 234 | if (cur->page->mapping == inode->i_mapping) { |
6282adbf | 235 | set_page_dirty(cur->page); |
70c640b1 JK |
236 | f2fs_wait_on_page_writeback(cur->page, DATA); |
237 | if (clear_page_dirty_for_io(cur->page)) | |
238 | inode_dec_dirty_pages(inode); | |
8ce67cb0 | 239 | trace_f2fs_commit_inmem_page(cur->page, INMEM); |
05ca3632 | 240 | fio.page = cur->page; |
edb27dee | 241 | err = do_write_data_page(&fio); |
edb27dee JK |
242 | if (err) { |
243 | unlock_page(cur->page); | |
244 | break; | |
245 | } | |
7fee7406 | 246 | clear_cold_data(cur->page); |
2b246fb0 | 247 | submit_bio = true; |
70c640b1 | 248 | } |
70c640b1 | 249 | } else { |
f478f43f | 250 | ClearPageUptodate(cur->page); |
8ce67cb0 | 251 | trace_f2fs_commit_inmem_page(cur->page, INMEM_DROP); |
88b88a66 | 252 | } |
decd36b6 CY |
253 | set_page_private(cur->page, 0); |
254 | ClearPagePrivate(cur->page); | |
255 | f2fs_put_page(cur->page, 1); | |
256 | ||
88b88a66 JK |
257 | list_del(&cur->list); |
258 | kmem_cache_free(inmem_entry_slab, cur); | |
8dcf2ff7 | 259 | dec_page_count(F2FS_I_SB(inode), F2FS_INMEM_PAGES); |
88b88a66 | 260 | } |
88b88a66 JK |
261 | mutex_unlock(&fi->inmem_lock); |
262 | ||
70c640b1 JK |
263 | if (!abort) { |
264 | f2fs_unlock_op(sbi); | |
265 | if (submit_bio) | |
266 | f2fs_submit_merged_bio(sbi, DATA, WRITE); | |
267 | } | |
edb27dee | 268 | return err; |
88b88a66 JK |
269 | } |
270 | ||
0a8165d7 | 271 | /* |
351df4b2 JK |
272 | * This function balances dirty node and dentry pages. |
273 | * In addition, it controls garbage collection. | |
274 | */ | |
275 | void f2fs_balance_fs(struct f2fs_sb_info *sbi) | |
276 | { | |
351df4b2 | 277 | /* |
029cd28c JK |
278 | * We should do GC or end up with checkpoint, if there are so many dirty |
279 | * dir/node pages without enough free segments. | |
351df4b2 | 280 | */ |
43727527 | 281 | if (has_not_enough_free_secs(sbi, 0)) { |
351df4b2 | 282 | mutex_lock(&sbi->gc_mutex); |
d530d4d8 | 283 | f2fs_gc(sbi, false); |
351df4b2 JK |
284 | } |
285 | } | |
286 | ||
4660f9c0 JK |
287 | void f2fs_balance_fs_bg(struct f2fs_sb_info *sbi) |
288 | { | |
1dcc336b | 289 | /* try to shrink extent cache when there is no enough memory */ |
554df79e JK |
290 | if (!available_free_memory(sbi, EXTENT_CACHE)) |
291 | f2fs_shrink_extent_tree(sbi, EXTENT_CACHE_SHRINK_NUMBER); | |
1dcc336b | 292 | |
1b38dc8e JK |
293 | /* check the # of cached NAT entries */ |
294 | if (!available_free_memory(sbi, NAT_ENTRIES)) | |
295 | try_to_free_nats(sbi, NAT_ENTRY_PER_BLOCK); | |
296 | ||
31696580 CY |
297 | if (!available_free_memory(sbi, FREE_NIDS)) |
298 | try_to_free_nids(sbi, NAT_ENTRY_PER_BLOCK * FREE_NID_PAGES); | |
299 | ||
1b38dc8e JK |
300 | /* checkpoint is the only way to shrink partial cached entries */ |
301 | if (!available_free_memory(sbi, NAT_ENTRIES) || | |
e5e7ea3c | 302 | excess_prefree_segs(sbi) || |
60b99b48 JK |
303 | !available_free_memory(sbi, INO_ENTRIES) || |
304 | jiffies > sbi->cp_expires) | |
4660f9c0 JK |
305 | f2fs_sync_fs(sbi->sb, true); |
306 | } | |
307 | ||
2163d198 | 308 | static int issue_flush_thread(void *data) |
6b4afdd7 JK |
309 | { |
310 | struct f2fs_sb_info *sbi = data; | |
a688b9d9 GZ |
311 | struct flush_cmd_control *fcc = SM_I(sbi)->cmd_control_info; |
312 | wait_queue_head_t *q = &fcc->flush_wait_queue; | |
6b4afdd7 JK |
313 | repeat: |
314 | if (kthread_should_stop()) | |
315 | return 0; | |
316 | ||
721bd4d5 | 317 | if (!llist_empty(&fcc->issue_list)) { |
740432f8 | 318 | struct bio *bio; |
6b4afdd7 JK |
319 | struct flush_cmd *cmd, *next; |
320 | int ret; | |
321 | ||
740432f8 JK |
322 | bio = f2fs_bio_alloc(0); |
323 | ||
721bd4d5 GZ |
324 | fcc->dispatch_list = llist_del_all(&fcc->issue_list); |
325 | fcc->dispatch_list = llist_reverse_order(fcc->dispatch_list); | |
326 | ||
6b4afdd7 JK |
327 | bio->bi_bdev = sbi->sb->s_bdev; |
328 | ret = submit_bio_wait(WRITE_FLUSH, bio); | |
329 | ||
721bd4d5 GZ |
330 | llist_for_each_entry_safe(cmd, next, |
331 | fcc->dispatch_list, llnode) { | |
6b4afdd7 | 332 | cmd->ret = ret; |
6b4afdd7 JK |
333 | complete(&cmd->wait); |
334 | } | |
a4ed23f2 | 335 | bio_put(bio); |
a688b9d9 | 336 | fcc->dispatch_list = NULL; |
6b4afdd7 JK |
337 | } |
338 | ||
a688b9d9 | 339 | wait_event_interruptible(*q, |
721bd4d5 | 340 | kthread_should_stop() || !llist_empty(&fcc->issue_list)); |
6b4afdd7 JK |
341 | goto repeat; |
342 | } | |
343 | ||
344 | int f2fs_issue_flush(struct f2fs_sb_info *sbi) | |
345 | { | |
a688b9d9 | 346 | struct flush_cmd_control *fcc = SM_I(sbi)->cmd_control_info; |
adf8d90b | 347 | struct flush_cmd cmd; |
6b4afdd7 | 348 | |
24a9ee0f JK |
349 | trace_f2fs_issue_flush(sbi->sb, test_opt(sbi, NOBARRIER), |
350 | test_opt(sbi, FLUSH_MERGE)); | |
351 | ||
0f7b2abd JK |
352 | if (test_opt(sbi, NOBARRIER)) |
353 | return 0; | |
354 | ||
740432f8 JK |
355 | if (!test_opt(sbi, FLUSH_MERGE)) { |
356 | struct bio *bio = f2fs_bio_alloc(0); | |
357 | int ret; | |
358 | ||
359 | bio->bi_bdev = sbi->sb->s_bdev; | |
360 | ret = submit_bio_wait(WRITE_FLUSH, bio); | |
361 | bio_put(bio); | |
362 | return ret; | |
363 | } | |
6b4afdd7 | 364 | |
adf8d90b | 365 | init_completion(&cmd.wait); |
6b4afdd7 | 366 | |
721bd4d5 | 367 | llist_add(&cmd.llnode, &fcc->issue_list); |
6b4afdd7 | 368 | |
a688b9d9 GZ |
369 | if (!fcc->dispatch_list) |
370 | wake_up(&fcc->flush_wait_queue); | |
6b4afdd7 | 371 | |
adf8d90b CY |
372 | wait_for_completion(&cmd.wait); |
373 | ||
374 | return cmd.ret; | |
6b4afdd7 JK |
375 | } |
376 | ||
2163d198 GZ |
377 | int create_flush_cmd_control(struct f2fs_sb_info *sbi) |
378 | { | |
379 | dev_t dev = sbi->sb->s_bdev->bd_dev; | |
380 | struct flush_cmd_control *fcc; | |
381 | int err = 0; | |
382 | ||
383 | fcc = kzalloc(sizeof(struct flush_cmd_control), GFP_KERNEL); | |
384 | if (!fcc) | |
385 | return -ENOMEM; | |
2163d198 | 386 | init_waitqueue_head(&fcc->flush_wait_queue); |
721bd4d5 | 387 | init_llist_head(&fcc->issue_list); |
6b2920a5 | 388 | SM_I(sbi)->cmd_control_info = fcc; |
2163d198 GZ |
389 | fcc->f2fs_issue_flush = kthread_run(issue_flush_thread, sbi, |
390 | "f2fs_flush-%u:%u", MAJOR(dev), MINOR(dev)); | |
391 | if (IS_ERR(fcc->f2fs_issue_flush)) { | |
392 | err = PTR_ERR(fcc->f2fs_issue_flush); | |
393 | kfree(fcc); | |
6b2920a5 | 394 | SM_I(sbi)->cmd_control_info = NULL; |
2163d198 GZ |
395 | return err; |
396 | } | |
2163d198 GZ |
397 | |
398 | return err; | |
399 | } | |
400 | ||
401 | void destroy_flush_cmd_control(struct f2fs_sb_info *sbi) | |
402 | { | |
6b2920a5 | 403 | struct flush_cmd_control *fcc = SM_I(sbi)->cmd_control_info; |
2163d198 GZ |
404 | |
405 | if (fcc && fcc->f2fs_issue_flush) | |
406 | kthread_stop(fcc->f2fs_issue_flush); | |
407 | kfree(fcc); | |
6b2920a5 | 408 | SM_I(sbi)->cmd_control_info = NULL; |
2163d198 GZ |
409 | } |
410 | ||
351df4b2 JK |
411 | static void __locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno, |
412 | enum dirty_type dirty_type) | |
413 | { | |
414 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
415 | ||
416 | /* need not be added */ | |
417 | if (IS_CURSEG(sbi, segno)) | |
418 | return; | |
419 | ||
420 | if (!test_and_set_bit(segno, dirty_i->dirty_segmap[dirty_type])) | |
421 | dirty_i->nr_dirty[dirty_type]++; | |
422 | ||
423 | if (dirty_type == DIRTY) { | |
424 | struct seg_entry *sentry = get_seg_entry(sbi, segno); | |
4625d6aa | 425 | enum dirty_type t = sentry->type; |
b2f2c390 | 426 | |
ec325b52 JK |
427 | if (unlikely(t >= DIRTY)) { |
428 | f2fs_bug_on(sbi, 1); | |
429 | return; | |
430 | } | |
4625d6aa CL |
431 | if (!test_and_set_bit(segno, dirty_i->dirty_segmap[t])) |
432 | dirty_i->nr_dirty[t]++; | |
351df4b2 JK |
433 | } |
434 | } | |
435 | ||
436 | static void __remove_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno, | |
437 | enum dirty_type dirty_type) | |
438 | { | |
439 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
440 | ||
441 | if (test_and_clear_bit(segno, dirty_i->dirty_segmap[dirty_type])) | |
442 | dirty_i->nr_dirty[dirty_type]--; | |
443 | ||
444 | if (dirty_type == DIRTY) { | |
4625d6aa CL |
445 | struct seg_entry *sentry = get_seg_entry(sbi, segno); |
446 | enum dirty_type t = sentry->type; | |
447 | ||
448 | if (test_and_clear_bit(segno, dirty_i->dirty_segmap[t])) | |
449 | dirty_i->nr_dirty[t]--; | |
b2f2c390 | 450 | |
5ec4e49f JK |
451 | if (get_valid_blocks(sbi, segno, sbi->segs_per_sec) == 0) |
452 | clear_bit(GET_SECNO(sbi, segno), | |
453 | dirty_i->victim_secmap); | |
351df4b2 JK |
454 | } |
455 | } | |
456 | ||
0a8165d7 | 457 | /* |
351df4b2 JK |
458 | * Should not occur error such as -ENOMEM. |
459 | * Adding dirty entry into seglist is not critical operation. | |
460 | * If a given segment is one of current working segments, it won't be added. | |
461 | */ | |
8d8451af | 462 | static void locate_dirty_segment(struct f2fs_sb_info *sbi, unsigned int segno) |
351df4b2 JK |
463 | { |
464 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
465 | unsigned short valid_blocks; | |
466 | ||
467 | if (segno == NULL_SEGNO || IS_CURSEG(sbi, segno)) | |
468 | return; | |
469 | ||
470 | mutex_lock(&dirty_i->seglist_lock); | |
471 | ||
472 | valid_blocks = get_valid_blocks(sbi, segno, 0); | |
473 | ||
474 | if (valid_blocks == 0) { | |
475 | __locate_dirty_segment(sbi, segno, PRE); | |
476 | __remove_dirty_segment(sbi, segno, DIRTY); | |
477 | } else if (valid_blocks < sbi->blocks_per_seg) { | |
478 | __locate_dirty_segment(sbi, segno, DIRTY); | |
479 | } else { | |
480 | /* Recovery routine with SSR needs this */ | |
481 | __remove_dirty_segment(sbi, segno, DIRTY); | |
482 | } | |
483 | ||
484 | mutex_unlock(&dirty_i->seglist_lock); | |
351df4b2 JK |
485 | } |
486 | ||
1e87a78d | 487 | static int f2fs_issue_discard(struct f2fs_sb_info *sbi, |
37208879 JK |
488 | block_t blkstart, block_t blklen) |
489 | { | |
55cf9cb6 CY |
490 | sector_t start = SECTOR_FROM_BLOCK(blkstart); |
491 | sector_t len = SECTOR_FROM_BLOCK(blklen); | |
a66cdd98 JK |
492 | struct seg_entry *se; |
493 | unsigned int offset; | |
494 | block_t i; | |
495 | ||
496 | for (i = blkstart; i < blkstart + blklen; i++) { | |
497 | se = get_seg_entry(sbi, GET_SEGNO(sbi, i)); | |
498 | offset = GET_BLKOFF_FROM_SEG0(sbi, i); | |
499 | ||
500 | if (!f2fs_test_and_set_bit(offset, se->discard_map)) | |
501 | sbi->discard_blks--; | |
502 | } | |
1661d07c | 503 | trace_f2fs_issue_discard(sbi->sb, blkstart, blklen); |
1e87a78d JK |
504 | return blkdev_issue_discard(sbi->sb->s_bdev, start, len, GFP_NOFS, 0); |
505 | } | |
506 | ||
e90c2d28 | 507 | bool discard_next_dnode(struct f2fs_sb_info *sbi, block_t blkaddr) |
1e87a78d | 508 | { |
40a02be1 JK |
509 | int err = -ENOTSUPP; |
510 | ||
511 | if (test_opt(sbi, DISCARD)) { | |
512 | struct seg_entry *se = get_seg_entry(sbi, | |
513 | GET_SEGNO(sbi, blkaddr)); | |
514 | unsigned int offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr); | |
515 | ||
516 | if (f2fs_test_bit(offset, se->discard_map)) | |
e90c2d28 | 517 | return false; |
40a02be1 JK |
518 | |
519 | err = f2fs_issue_discard(sbi, blkaddr, 1); | |
520 | } | |
521 | ||
e90c2d28 | 522 | if (err) { |
381722d2 | 523 | update_meta_page(sbi, NULL, blkaddr); |
e90c2d28 CY |
524 | return true; |
525 | } | |
526 | return false; | |
37208879 JK |
527 | } |
528 | ||
adf4983b | 529 | static void __add_discard_entry(struct f2fs_sb_info *sbi, |
a66cdd98 JK |
530 | struct cp_control *cpc, struct seg_entry *se, |
531 | unsigned int start, unsigned int end) | |
b2955550 JK |
532 | { |
533 | struct list_head *head = &SM_I(sbi)->discard_list; | |
adf4983b JK |
534 | struct discard_entry *new, *last; |
535 | ||
536 | if (!list_empty(head)) { | |
537 | last = list_last_entry(head, struct discard_entry, list); | |
538 | if (START_BLOCK(sbi, cpc->trim_start) + start == | |
539 | last->blkaddr + last->len) { | |
540 | last->len += end - start; | |
541 | goto done; | |
542 | } | |
543 | } | |
544 | ||
545 | new = f2fs_kmem_cache_alloc(discard_entry_slab, GFP_NOFS); | |
546 | INIT_LIST_HEAD(&new->list); | |
547 | new->blkaddr = START_BLOCK(sbi, cpc->trim_start) + start; | |
548 | new->len = end - start; | |
549 | list_add_tail(&new->list, head); | |
550 | done: | |
551 | SM_I(sbi)->nr_discards += end - start; | |
adf4983b JK |
552 | } |
553 | ||
554 | static void add_discard_addrs(struct f2fs_sb_info *sbi, struct cp_control *cpc) | |
555 | { | |
b2955550 JK |
556 | int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long); |
557 | int max_blocks = sbi->blocks_per_seg; | |
4b2fecc8 | 558 | struct seg_entry *se = get_seg_entry(sbi, cpc->trim_start); |
b2955550 JK |
559 | unsigned long *cur_map = (unsigned long *)se->cur_valid_map; |
560 | unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map; | |
a66cdd98 | 561 | unsigned long *discard_map = (unsigned long *)se->discard_map; |
60a3b782 | 562 | unsigned long *dmap = SIT_I(sbi)->tmp_map; |
b2955550 | 563 | unsigned int start = 0, end = -1; |
4b2fecc8 | 564 | bool force = (cpc->reason == CP_DISCARD); |
b2955550 JK |
565 | int i; |
566 | ||
a66cdd98 | 567 | if (se->valid_blocks == max_blocks) |
b2955550 JK |
568 | return; |
569 | ||
a66cdd98 JK |
570 | if (!force) { |
571 | if (!test_opt(sbi, DISCARD) || !se->valid_blocks || | |
912a83b5 DC |
572 | SM_I(sbi)->nr_discards >= SM_I(sbi)->max_discards) |
573 | return; | |
4b2fecc8 JK |
574 | } |
575 | ||
b2955550 JK |
576 | /* SIT_VBLOCK_MAP_SIZE should be multiple of sizeof(unsigned long) */ |
577 | for (i = 0; i < entries; i++) | |
a66cdd98 | 578 | dmap[i] = force ? ~ckpt_map[i] & ~discard_map[i] : |
d7bc2484 | 579 | (cur_map[i] ^ ckpt_map[i]) & ckpt_map[i]; |
b2955550 | 580 | |
4b2fecc8 | 581 | while (force || SM_I(sbi)->nr_discards <= SM_I(sbi)->max_discards) { |
b2955550 JK |
582 | start = __find_rev_next_bit(dmap, max_blocks, end + 1); |
583 | if (start >= max_blocks) | |
584 | break; | |
585 | ||
586 | end = __find_rev_next_zero_bit(dmap, max_blocks, start + 1); | |
a66cdd98 | 587 | __add_discard_entry(sbi, cpc, se, start, end); |
b2955550 JK |
588 | } |
589 | } | |
590 | ||
4b2fecc8 JK |
591 | void release_discard_addrs(struct f2fs_sb_info *sbi) |
592 | { | |
593 | struct list_head *head = &(SM_I(sbi)->discard_list); | |
594 | struct discard_entry *entry, *this; | |
595 | ||
596 | /* drop caches */ | |
597 | list_for_each_entry_safe(entry, this, head, list) { | |
598 | list_del(&entry->list); | |
599 | kmem_cache_free(discard_entry_slab, entry); | |
600 | } | |
601 | } | |
602 | ||
0a8165d7 | 603 | /* |
351df4b2 JK |
604 | * Should call clear_prefree_segments after checkpoint is done. |
605 | */ | |
606 | static void set_prefree_as_free_segments(struct f2fs_sb_info *sbi) | |
607 | { | |
608 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
b65ee148 | 609 | unsigned int segno; |
351df4b2 JK |
610 | |
611 | mutex_lock(&dirty_i->seglist_lock); | |
7cd8558b | 612 | for_each_set_bit(segno, dirty_i->dirty_segmap[PRE], MAIN_SEGS(sbi)) |
351df4b2 | 613 | __set_test_and_free(sbi, segno); |
351df4b2 JK |
614 | mutex_unlock(&dirty_i->seglist_lock); |
615 | } | |
616 | ||
836b5a63 | 617 | void clear_prefree_segments(struct f2fs_sb_info *sbi, struct cp_control *cpc) |
351df4b2 | 618 | { |
b2955550 | 619 | struct list_head *head = &(SM_I(sbi)->discard_list); |
2d7b822a | 620 | struct discard_entry *entry, *this; |
351df4b2 | 621 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); |
29e59c14 | 622 | unsigned long *prefree_map = dirty_i->dirty_segmap[PRE]; |
29e59c14 | 623 | unsigned int start = 0, end = -1; |
351df4b2 JK |
624 | |
625 | mutex_lock(&dirty_i->seglist_lock); | |
29e59c14 | 626 | |
351df4b2 | 627 | while (1) { |
29e59c14 | 628 | int i; |
7cd8558b JK |
629 | start = find_next_bit(prefree_map, MAIN_SEGS(sbi), end + 1); |
630 | if (start >= MAIN_SEGS(sbi)) | |
351df4b2 | 631 | break; |
7cd8558b JK |
632 | end = find_next_zero_bit(prefree_map, MAIN_SEGS(sbi), |
633 | start + 1); | |
29e59c14 CL |
634 | |
635 | for (i = start; i < end; i++) | |
636 | clear_bit(i, prefree_map); | |
637 | ||
638 | dirty_i->nr_dirty[PRE] -= end - start; | |
639 | ||
640 | if (!test_opt(sbi, DISCARD)) | |
641 | continue; | |
351df4b2 | 642 | |
37208879 JK |
643 | f2fs_issue_discard(sbi, START_BLOCK(sbi, start), |
644 | (end - start) << sbi->log_blocks_per_seg); | |
351df4b2 JK |
645 | } |
646 | mutex_unlock(&dirty_i->seglist_lock); | |
b2955550 JK |
647 | |
648 | /* send small discards */ | |
2d7b822a | 649 | list_for_each_entry_safe(entry, this, head, list) { |
836b5a63 JK |
650 | if (cpc->reason == CP_DISCARD && entry->len < cpc->trim_minlen) |
651 | goto skip; | |
37208879 | 652 | f2fs_issue_discard(sbi, entry->blkaddr, entry->len); |
f56aa1c5 | 653 | cpc->trimmed += entry->len; |
836b5a63 | 654 | skip: |
b2955550 JK |
655 | list_del(&entry->list); |
656 | SM_I(sbi)->nr_discards -= entry->len; | |
657 | kmem_cache_free(discard_entry_slab, entry); | |
658 | } | |
351df4b2 JK |
659 | } |
660 | ||
184a5cd2 | 661 | static bool __mark_sit_entry_dirty(struct f2fs_sb_info *sbi, unsigned int segno) |
351df4b2 JK |
662 | { |
663 | struct sit_info *sit_i = SIT_I(sbi); | |
184a5cd2 CY |
664 | |
665 | if (!__test_and_set_bit(segno, sit_i->dirty_sentries_bitmap)) { | |
351df4b2 | 666 | sit_i->dirty_sentries++; |
184a5cd2 CY |
667 | return false; |
668 | } | |
669 | ||
670 | return true; | |
351df4b2 JK |
671 | } |
672 | ||
673 | static void __set_sit_entry_type(struct f2fs_sb_info *sbi, int type, | |
674 | unsigned int segno, int modified) | |
675 | { | |
676 | struct seg_entry *se = get_seg_entry(sbi, segno); | |
677 | se->type = type; | |
678 | if (modified) | |
679 | __mark_sit_entry_dirty(sbi, segno); | |
680 | } | |
681 | ||
682 | static void update_sit_entry(struct f2fs_sb_info *sbi, block_t blkaddr, int del) | |
683 | { | |
684 | struct seg_entry *se; | |
685 | unsigned int segno, offset; | |
686 | long int new_vblocks; | |
687 | ||
688 | segno = GET_SEGNO(sbi, blkaddr); | |
689 | ||
690 | se = get_seg_entry(sbi, segno); | |
691 | new_vblocks = se->valid_blocks + del; | |
491c0854 | 692 | offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr); |
351df4b2 | 693 | |
9850cf4a | 694 | f2fs_bug_on(sbi, (new_vblocks >> (sizeof(unsigned short) << 3) || |
351df4b2 JK |
695 | (new_vblocks > sbi->blocks_per_seg))); |
696 | ||
697 | se->valid_blocks = new_vblocks; | |
698 | se->mtime = get_mtime(sbi); | |
699 | SIT_I(sbi)->max_mtime = se->mtime; | |
700 | ||
701 | /* Update valid block bitmap */ | |
702 | if (del > 0) { | |
52aca074 | 703 | if (f2fs_test_and_set_bit(offset, se->cur_valid_map)) |
05796763 | 704 | f2fs_bug_on(sbi, 1); |
a66cdd98 JK |
705 | if (!f2fs_test_and_set_bit(offset, se->discard_map)) |
706 | sbi->discard_blks--; | |
351df4b2 | 707 | } else { |
52aca074 | 708 | if (!f2fs_test_and_clear_bit(offset, se->cur_valid_map)) |
05796763 | 709 | f2fs_bug_on(sbi, 1); |
a66cdd98 JK |
710 | if (f2fs_test_and_clear_bit(offset, se->discard_map)) |
711 | sbi->discard_blks++; | |
351df4b2 JK |
712 | } |
713 | if (!f2fs_test_bit(offset, se->ckpt_valid_map)) | |
714 | se->ckpt_valid_blocks += del; | |
715 | ||
716 | __mark_sit_entry_dirty(sbi, segno); | |
717 | ||
718 | /* update total number of valid blocks to be written in ckpt area */ | |
719 | SIT_I(sbi)->written_valid_blocks += del; | |
720 | ||
721 | if (sbi->segs_per_sec > 1) | |
722 | get_sec_entry(sbi, segno)->valid_blocks += del; | |
723 | } | |
724 | ||
5e443818 | 725 | void refresh_sit_entry(struct f2fs_sb_info *sbi, block_t old, block_t new) |
351df4b2 | 726 | { |
5e443818 JK |
727 | update_sit_entry(sbi, new, 1); |
728 | if (GET_SEGNO(sbi, old) != NULL_SEGNO) | |
729 | update_sit_entry(sbi, old, -1); | |
730 | ||
731 | locate_dirty_segment(sbi, GET_SEGNO(sbi, old)); | |
732 | locate_dirty_segment(sbi, GET_SEGNO(sbi, new)); | |
351df4b2 JK |
733 | } |
734 | ||
735 | void invalidate_blocks(struct f2fs_sb_info *sbi, block_t addr) | |
736 | { | |
737 | unsigned int segno = GET_SEGNO(sbi, addr); | |
738 | struct sit_info *sit_i = SIT_I(sbi); | |
739 | ||
9850cf4a | 740 | f2fs_bug_on(sbi, addr == NULL_ADDR); |
351df4b2 JK |
741 | if (addr == NEW_ADDR) |
742 | return; | |
743 | ||
744 | /* add it into sit main buffer */ | |
745 | mutex_lock(&sit_i->sentry_lock); | |
746 | ||
747 | update_sit_entry(sbi, addr, -1); | |
748 | ||
749 | /* add it into dirty seglist */ | |
750 | locate_dirty_segment(sbi, segno); | |
751 | ||
752 | mutex_unlock(&sit_i->sentry_lock); | |
753 | } | |
754 | ||
6e2c64ad JK |
755 | bool is_checkpointed_data(struct f2fs_sb_info *sbi, block_t blkaddr) |
756 | { | |
757 | struct sit_info *sit_i = SIT_I(sbi); | |
758 | unsigned int segno, offset; | |
759 | struct seg_entry *se; | |
760 | bool is_cp = false; | |
761 | ||
762 | if (blkaddr == NEW_ADDR || blkaddr == NULL_ADDR) | |
763 | return true; | |
764 | ||
765 | mutex_lock(&sit_i->sentry_lock); | |
766 | ||
767 | segno = GET_SEGNO(sbi, blkaddr); | |
768 | se = get_seg_entry(sbi, segno); | |
769 | offset = GET_BLKOFF_FROM_SEG0(sbi, blkaddr); | |
770 | ||
771 | if (f2fs_test_bit(offset, se->ckpt_valid_map)) | |
772 | is_cp = true; | |
773 | ||
774 | mutex_unlock(&sit_i->sentry_lock); | |
775 | ||
776 | return is_cp; | |
777 | } | |
778 | ||
0a8165d7 | 779 | /* |
351df4b2 JK |
780 | * This function should be resided under the curseg_mutex lock |
781 | */ | |
782 | static void __add_sum_entry(struct f2fs_sb_info *sbi, int type, | |
e79efe3b | 783 | struct f2fs_summary *sum) |
351df4b2 JK |
784 | { |
785 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
786 | void *addr = curseg->sum_blk; | |
e79efe3b | 787 | addr += curseg->next_blkoff * sizeof(struct f2fs_summary); |
351df4b2 | 788 | memcpy(addr, sum, sizeof(struct f2fs_summary)); |
351df4b2 JK |
789 | } |
790 | ||
0a8165d7 | 791 | /* |
351df4b2 JK |
792 | * Calculate the number of current summary pages for writing |
793 | */ | |
3fa06d7b | 794 | int npages_for_summary_flush(struct f2fs_sb_info *sbi, bool for_ra) |
351df4b2 | 795 | { |
351df4b2 | 796 | int valid_sum_count = 0; |
9a47938b | 797 | int i, sum_in_page; |
351df4b2 JK |
798 | |
799 | for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) { | |
800 | if (sbi->ckpt->alloc_type[i] == SSR) | |
801 | valid_sum_count += sbi->blocks_per_seg; | |
3fa06d7b CY |
802 | else { |
803 | if (for_ra) | |
804 | valid_sum_count += le16_to_cpu( | |
805 | F2FS_CKPT(sbi)->cur_data_blkoff[i]); | |
806 | else | |
807 | valid_sum_count += curseg_blkoff(sbi, i); | |
808 | } | |
351df4b2 JK |
809 | } |
810 | ||
9a47938b FL |
811 | sum_in_page = (PAGE_CACHE_SIZE - 2 * SUM_JOURNAL_SIZE - |
812 | SUM_FOOTER_SIZE) / SUMMARY_SIZE; | |
813 | if (valid_sum_count <= sum_in_page) | |
351df4b2 | 814 | return 1; |
9a47938b FL |
815 | else if ((valid_sum_count - sum_in_page) <= |
816 | (PAGE_CACHE_SIZE - SUM_FOOTER_SIZE) / SUMMARY_SIZE) | |
351df4b2 JK |
817 | return 2; |
818 | return 3; | |
819 | } | |
820 | ||
0a8165d7 | 821 | /* |
351df4b2 JK |
822 | * Caller should put this summary page |
823 | */ | |
824 | struct page *get_sum_page(struct f2fs_sb_info *sbi, unsigned int segno) | |
825 | { | |
826 | return get_meta_page(sbi, GET_SUM_BLOCK(sbi, segno)); | |
827 | } | |
828 | ||
381722d2 | 829 | void update_meta_page(struct f2fs_sb_info *sbi, void *src, block_t blk_addr) |
351df4b2 JK |
830 | { |
831 | struct page *page = grab_meta_page(sbi, blk_addr); | |
381722d2 CY |
832 | void *dst = page_address(page); |
833 | ||
834 | if (src) | |
835 | memcpy(dst, src, PAGE_CACHE_SIZE); | |
836 | else | |
837 | memset(dst, 0, PAGE_CACHE_SIZE); | |
351df4b2 JK |
838 | set_page_dirty(page); |
839 | f2fs_put_page(page, 1); | |
840 | } | |
841 | ||
381722d2 CY |
842 | static void write_sum_page(struct f2fs_sb_info *sbi, |
843 | struct f2fs_summary_block *sum_blk, block_t blk_addr) | |
844 | { | |
845 | update_meta_page(sbi, (void *)sum_blk, blk_addr); | |
846 | } | |
847 | ||
60374688 JK |
848 | static int is_next_segment_free(struct f2fs_sb_info *sbi, int type) |
849 | { | |
850 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
81fb5e87 | 851 | unsigned int segno = curseg->segno + 1; |
60374688 JK |
852 | struct free_segmap_info *free_i = FREE_I(sbi); |
853 | ||
7cd8558b | 854 | if (segno < MAIN_SEGS(sbi) && segno % sbi->segs_per_sec) |
81fb5e87 | 855 | return !test_bit(segno, free_i->free_segmap); |
60374688 JK |
856 | return 0; |
857 | } | |
858 | ||
0a8165d7 | 859 | /* |
351df4b2 JK |
860 | * Find a new segment from the free segments bitmap to right order |
861 | * This function should be returned with success, otherwise BUG | |
862 | */ | |
863 | static void get_new_segment(struct f2fs_sb_info *sbi, | |
864 | unsigned int *newseg, bool new_sec, int dir) | |
865 | { | |
866 | struct free_segmap_info *free_i = FREE_I(sbi); | |
351df4b2 | 867 | unsigned int segno, secno, zoneno; |
7cd8558b | 868 | unsigned int total_zones = MAIN_SECS(sbi) / sbi->secs_per_zone; |
351df4b2 JK |
869 | unsigned int hint = *newseg / sbi->segs_per_sec; |
870 | unsigned int old_zoneno = GET_ZONENO_FROM_SEGNO(sbi, *newseg); | |
871 | unsigned int left_start = hint; | |
872 | bool init = true; | |
873 | int go_left = 0; | |
874 | int i; | |
875 | ||
1a118ccf | 876 | spin_lock(&free_i->segmap_lock); |
351df4b2 JK |
877 | |
878 | if (!new_sec && ((*newseg + 1) % sbi->segs_per_sec)) { | |
879 | segno = find_next_zero_bit(free_i->free_segmap, | |
7cd8558b | 880 | MAIN_SEGS(sbi), *newseg + 1); |
33afa7fd JK |
881 | if (segno - *newseg < sbi->segs_per_sec - |
882 | (*newseg % sbi->segs_per_sec)) | |
351df4b2 JK |
883 | goto got_it; |
884 | } | |
885 | find_other_zone: | |
7cd8558b JK |
886 | secno = find_next_zero_bit(free_i->free_secmap, MAIN_SECS(sbi), hint); |
887 | if (secno >= MAIN_SECS(sbi)) { | |
351df4b2 JK |
888 | if (dir == ALLOC_RIGHT) { |
889 | secno = find_next_zero_bit(free_i->free_secmap, | |
7cd8558b JK |
890 | MAIN_SECS(sbi), 0); |
891 | f2fs_bug_on(sbi, secno >= MAIN_SECS(sbi)); | |
351df4b2 JK |
892 | } else { |
893 | go_left = 1; | |
894 | left_start = hint - 1; | |
895 | } | |
896 | } | |
897 | if (go_left == 0) | |
898 | goto skip_left; | |
899 | ||
900 | while (test_bit(left_start, free_i->free_secmap)) { | |
901 | if (left_start > 0) { | |
902 | left_start--; | |
903 | continue; | |
904 | } | |
905 | left_start = find_next_zero_bit(free_i->free_secmap, | |
7cd8558b JK |
906 | MAIN_SECS(sbi), 0); |
907 | f2fs_bug_on(sbi, left_start >= MAIN_SECS(sbi)); | |
351df4b2 JK |
908 | break; |
909 | } | |
910 | secno = left_start; | |
911 | skip_left: | |
912 | hint = secno; | |
913 | segno = secno * sbi->segs_per_sec; | |
914 | zoneno = secno / sbi->secs_per_zone; | |
915 | ||
916 | /* give up on finding another zone */ | |
917 | if (!init) | |
918 | goto got_it; | |
919 | if (sbi->secs_per_zone == 1) | |
920 | goto got_it; | |
921 | if (zoneno == old_zoneno) | |
922 | goto got_it; | |
923 | if (dir == ALLOC_LEFT) { | |
924 | if (!go_left && zoneno + 1 >= total_zones) | |
925 | goto got_it; | |
926 | if (go_left && zoneno == 0) | |
927 | goto got_it; | |
928 | } | |
929 | for (i = 0; i < NR_CURSEG_TYPE; i++) | |
930 | if (CURSEG_I(sbi, i)->zone == zoneno) | |
931 | break; | |
932 | ||
933 | if (i < NR_CURSEG_TYPE) { | |
934 | /* zone is in user, try another */ | |
935 | if (go_left) | |
936 | hint = zoneno * sbi->secs_per_zone - 1; | |
937 | else if (zoneno + 1 >= total_zones) | |
938 | hint = 0; | |
939 | else | |
940 | hint = (zoneno + 1) * sbi->secs_per_zone; | |
941 | init = false; | |
942 | goto find_other_zone; | |
943 | } | |
944 | got_it: | |
945 | /* set it as dirty segment in free segmap */ | |
9850cf4a | 946 | f2fs_bug_on(sbi, test_bit(segno, free_i->free_segmap)); |
351df4b2 JK |
947 | __set_inuse(sbi, segno); |
948 | *newseg = segno; | |
1a118ccf | 949 | spin_unlock(&free_i->segmap_lock); |
351df4b2 JK |
950 | } |
951 | ||
952 | static void reset_curseg(struct f2fs_sb_info *sbi, int type, int modified) | |
953 | { | |
954 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
955 | struct summary_footer *sum_footer; | |
956 | ||
957 | curseg->segno = curseg->next_segno; | |
958 | curseg->zone = GET_ZONENO_FROM_SEGNO(sbi, curseg->segno); | |
959 | curseg->next_blkoff = 0; | |
960 | curseg->next_segno = NULL_SEGNO; | |
961 | ||
962 | sum_footer = &(curseg->sum_blk->footer); | |
963 | memset(sum_footer, 0, sizeof(struct summary_footer)); | |
964 | if (IS_DATASEG(type)) | |
965 | SET_SUM_TYPE(sum_footer, SUM_TYPE_DATA); | |
966 | if (IS_NODESEG(type)) | |
967 | SET_SUM_TYPE(sum_footer, SUM_TYPE_NODE); | |
968 | __set_sit_entry_type(sbi, type, curseg->segno, modified); | |
969 | } | |
970 | ||
0a8165d7 | 971 | /* |
351df4b2 JK |
972 | * Allocate a current working segment. |
973 | * This function always allocates a free segment in LFS manner. | |
974 | */ | |
975 | static void new_curseg(struct f2fs_sb_info *sbi, int type, bool new_sec) | |
976 | { | |
977 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
978 | unsigned int segno = curseg->segno; | |
979 | int dir = ALLOC_LEFT; | |
980 | ||
981 | write_sum_page(sbi, curseg->sum_blk, | |
81fb5e87 | 982 | GET_SUM_BLOCK(sbi, segno)); |
351df4b2 JK |
983 | if (type == CURSEG_WARM_DATA || type == CURSEG_COLD_DATA) |
984 | dir = ALLOC_RIGHT; | |
985 | ||
986 | if (test_opt(sbi, NOHEAP)) | |
987 | dir = ALLOC_RIGHT; | |
988 | ||
989 | get_new_segment(sbi, &segno, new_sec, dir); | |
990 | curseg->next_segno = segno; | |
991 | reset_curseg(sbi, type, 1); | |
992 | curseg->alloc_type = LFS; | |
993 | } | |
994 | ||
995 | static void __next_free_blkoff(struct f2fs_sb_info *sbi, | |
996 | struct curseg_info *seg, block_t start) | |
997 | { | |
998 | struct seg_entry *se = get_seg_entry(sbi, seg->segno); | |
e81c93cf | 999 | int entries = SIT_VBLOCK_MAP_SIZE / sizeof(unsigned long); |
60a3b782 | 1000 | unsigned long *target_map = SIT_I(sbi)->tmp_map; |
e81c93cf CL |
1001 | unsigned long *ckpt_map = (unsigned long *)se->ckpt_valid_map; |
1002 | unsigned long *cur_map = (unsigned long *)se->cur_valid_map; | |
1003 | int i, pos; | |
1004 | ||
1005 | for (i = 0; i < entries; i++) | |
1006 | target_map[i] = ckpt_map[i] | cur_map[i]; | |
1007 | ||
1008 | pos = __find_rev_next_zero_bit(target_map, sbi->blocks_per_seg, start); | |
1009 | ||
1010 | seg->next_blkoff = pos; | |
351df4b2 JK |
1011 | } |
1012 | ||
0a8165d7 | 1013 | /* |
351df4b2 JK |
1014 | * If a segment is written by LFS manner, next block offset is just obtained |
1015 | * by increasing the current block offset. However, if a segment is written by | |
1016 | * SSR manner, next block offset obtained by calling __next_free_blkoff | |
1017 | */ | |
1018 | static void __refresh_next_blkoff(struct f2fs_sb_info *sbi, | |
1019 | struct curseg_info *seg) | |
1020 | { | |
1021 | if (seg->alloc_type == SSR) | |
1022 | __next_free_blkoff(sbi, seg, seg->next_blkoff + 1); | |
1023 | else | |
1024 | seg->next_blkoff++; | |
1025 | } | |
1026 | ||
0a8165d7 | 1027 | /* |
e1c42045 | 1028 | * This function always allocates a used segment(from dirty seglist) by SSR |
351df4b2 JK |
1029 | * manner, so it should recover the existing segment information of valid blocks |
1030 | */ | |
1031 | static void change_curseg(struct f2fs_sb_info *sbi, int type, bool reuse) | |
1032 | { | |
1033 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
1034 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
1035 | unsigned int new_segno = curseg->next_segno; | |
1036 | struct f2fs_summary_block *sum_node; | |
1037 | struct page *sum_page; | |
1038 | ||
1039 | write_sum_page(sbi, curseg->sum_blk, | |
1040 | GET_SUM_BLOCK(sbi, curseg->segno)); | |
1041 | __set_test_and_inuse(sbi, new_segno); | |
1042 | ||
1043 | mutex_lock(&dirty_i->seglist_lock); | |
1044 | __remove_dirty_segment(sbi, new_segno, PRE); | |
1045 | __remove_dirty_segment(sbi, new_segno, DIRTY); | |
1046 | mutex_unlock(&dirty_i->seglist_lock); | |
1047 | ||
1048 | reset_curseg(sbi, type, 1); | |
1049 | curseg->alloc_type = SSR; | |
1050 | __next_free_blkoff(sbi, curseg, 0); | |
1051 | ||
1052 | if (reuse) { | |
1053 | sum_page = get_sum_page(sbi, new_segno); | |
1054 | sum_node = (struct f2fs_summary_block *)page_address(sum_page); | |
1055 | memcpy(curseg->sum_blk, sum_node, SUM_ENTRY_SIZE); | |
1056 | f2fs_put_page(sum_page, 1); | |
1057 | } | |
1058 | } | |
1059 | ||
43727527 JK |
1060 | static int get_ssr_segment(struct f2fs_sb_info *sbi, int type) |
1061 | { | |
1062 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
1063 | const struct victim_selection *v_ops = DIRTY_I(sbi)->v_ops; | |
1064 | ||
1065 | if (IS_NODESEG(type) || !has_not_enough_free_secs(sbi, 0)) | |
1066 | return v_ops->get_victim(sbi, | |
1067 | &(curseg)->next_segno, BG_GC, type, SSR); | |
1068 | ||
1069 | /* For data segments, let's do SSR more intensively */ | |
1070 | for (; type >= CURSEG_HOT_DATA; type--) | |
1071 | if (v_ops->get_victim(sbi, &(curseg)->next_segno, | |
1072 | BG_GC, type, SSR)) | |
1073 | return 1; | |
1074 | return 0; | |
1075 | } | |
1076 | ||
351df4b2 JK |
1077 | /* |
1078 | * flush out current segment and replace it with new segment | |
1079 | * This function should be returned with success, otherwise BUG | |
1080 | */ | |
1081 | static void allocate_segment_by_default(struct f2fs_sb_info *sbi, | |
1082 | int type, bool force) | |
1083 | { | |
1084 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
351df4b2 | 1085 | |
7b405275 | 1086 | if (force) |
351df4b2 | 1087 | new_curseg(sbi, type, true); |
7b405275 | 1088 | else if (type == CURSEG_WARM_NODE) |
351df4b2 | 1089 | new_curseg(sbi, type, false); |
60374688 JK |
1090 | else if (curseg->alloc_type == LFS && is_next_segment_free(sbi, type)) |
1091 | new_curseg(sbi, type, false); | |
351df4b2 JK |
1092 | else if (need_SSR(sbi) && get_ssr_segment(sbi, type)) |
1093 | change_curseg(sbi, type, true); | |
1094 | else | |
1095 | new_curseg(sbi, type, false); | |
dcdfff65 JK |
1096 | |
1097 | stat_inc_seg_type(sbi, curseg); | |
351df4b2 JK |
1098 | } |
1099 | ||
38aa0889 JK |
1100 | static void __allocate_new_segments(struct f2fs_sb_info *sbi, int type) |
1101 | { | |
1102 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
1103 | unsigned int old_segno; | |
1104 | ||
1105 | old_segno = curseg->segno; | |
1106 | SIT_I(sbi)->s_ops->allocate_segment(sbi, type, true); | |
1107 | locate_dirty_segment(sbi, old_segno); | |
1108 | } | |
1109 | ||
351df4b2 JK |
1110 | void allocate_new_segments(struct f2fs_sb_info *sbi) |
1111 | { | |
351df4b2 JK |
1112 | int i; |
1113 | ||
38aa0889 JK |
1114 | for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) |
1115 | __allocate_new_segments(sbi, i); | |
351df4b2 JK |
1116 | } |
1117 | ||
1118 | static const struct segment_allocation default_salloc_ops = { | |
1119 | .allocate_segment = allocate_segment_by_default, | |
1120 | }; | |
1121 | ||
4b2fecc8 JK |
1122 | int f2fs_trim_fs(struct f2fs_sb_info *sbi, struct fstrim_range *range) |
1123 | { | |
f7ef9b83 JK |
1124 | __u64 start = F2FS_BYTES_TO_BLK(range->start); |
1125 | __u64 end = start + F2FS_BYTES_TO_BLK(range->len) - 1; | |
4b2fecc8 JK |
1126 | unsigned int start_segno, end_segno; |
1127 | struct cp_control cpc; | |
1128 | ||
836b5a63 | 1129 | if (start >= MAX_BLKADDR(sbi) || range->len < sbi->blocksize) |
4b2fecc8 JK |
1130 | return -EINVAL; |
1131 | ||
9bd27ae4 | 1132 | cpc.trimmed = 0; |
7cd8558b | 1133 | if (end <= MAIN_BLKADDR(sbi)) |
4b2fecc8 JK |
1134 | goto out; |
1135 | ||
1136 | /* start/end segment number in main_area */ | |
7cd8558b JK |
1137 | start_segno = (start <= MAIN_BLKADDR(sbi)) ? 0 : GET_SEGNO(sbi, start); |
1138 | end_segno = (end >= MAX_BLKADDR(sbi)) ? MAIN_SEGS(sbi) - 1 : | |
1139 | GET_SEGNO(sbi, end); | |
4b2fecc8 | 1140 | cpc.reason = CP_DISCARD; |
836b5a63 | 1141 | cpc.trim_minlen = max_t(__u64, 1, F2FS_BYTES_TO_BLK(range->minlen)); |
4b2fecc8 JK |
1142 | |
1143 | /* do checkpoint to issue discard commands safely */ | |
bba681cb JK |
1144 | for (; start_segno <= end_segno; start_segno = cpc.trim_end + 1) { |
1145 | cpc.trim_start = start_segno; | |
a66cdd98 JK |
1146 | |
1147 | if (sbi->discard_blks == 0) | |
1148 | break; | |
1149 | else if (sbi->discard_blks < BATCHED_TRIM_BLOCKS(sbi)) | |
1150 | cpc.trim_end = end_segno; | |
1151 | else | |
1152 | cpc.trim_end = min_t(unsigned int, | |
1153 | rounddown(start_segno + | |
bba681cb JK |
1154 | BATCHED_TRIM_SEGMENTS(sbi), |
1155 | sbi->segs_per_sec) - 1, end_segno); | |
1156 | ||
1157 | mutex_lock(&sbi->gc_mutex); | |
1158 | write_checkpoint(sbi, &cpc); | |
1159 | mutex_unlock(&sbi->gc_mutex); | |
1160 | } | |
4b2fecc8 | 1161 | out: |
f7ef9b83 | 1162 | range->len = F2FS_BLK_TO_BYTES(cpc.trimmed); |
4b2fecc8 JK |
1163 | return 0; |
1164 | } | |
1165 | ||
351df4b2 JK |
1166 | static bool __has_curseg_space(struct f2fs_sb_info *sbi, int type) |
1167 | { | |
1168 | struct curseg_info *curseg = CURSEG_I(sbi, type); | |
1169 | if (curseg->next_blkoff < sbi->blocks_per_seg) | |
1170 | return true; | |
1171 | return false; | |
1172 | } | |
1173 | ||
1174 | static int __get_segment_type_2(struct page *page, enum page_type p_type) | |
1175 | { | |
1176 | if (p_type == DATA) | |
1177 | return CURSEG_HOT_DATA; | |
1178 | else | |
1179 | return CURSEG_HOT_NODE; | |
1180 | } | |
1181 | ||
1182 | static int __get_segment_type_4(struct page *page, enum page_type p_type) | |
1183 | { | |
1184 | if (p_type == DATA) { | |
1185 | struct inode *inode = page->mapping->host; | |
1186 | ||
1187 | if (S_ISDIR(inode->i_mode)) | |
1188 | return CURSEG_HOT_DATA; | |
1189 | else | |
1190 | return CURSEG_COLD_DATA; | |
1191 | } else { | |
a344b9fd JK |
1192 | if (IS_DNODE(page) && is_cold_node(page)) |
1193 | return CURSEG_WARM_NODE; | |
351df4b2 JK |
1194 | else |
1195 | return CURSEG_COLD_NODE; | |
1196 | } | |
1197 | } | |
1198 | ||
1199 | static int __get_segment_type_6(struct page *page, enum page_type p_type) | |
1200 | { | |
1201 | if (p_type == DATA) { | |
1202 | struct inode *inode = page->mapping->host; | |
1203 | ||
1204 | if (S_ISDIR(inode->i_mode)) | |
1205 | return CURSEG_HOT_DATA; | |
354a3399 | 1206 | else if (is_cold_data(page) || file_is_cold(inode)) |
351df4b2 JK |
1207 | return CURSEG_COLD_DATA; |
1208 | else | |
1209 | return CURSEG_WARM_DATA; | |
1210 | } else { | |
1211 | if (IS_DNODE(page)) | |
1212 | return is_cold_node(page) ? CURSEG_WARM_NODE : | |
1213 | CURSEG_HOT_NODE; | |
1214 | else | |
1215 | return CURSEG_COLD_NODE; | |
1216 | } | |
1217 | } | |
1218 | ||
1219 | static int __get_segment_type(struct page *page, enum page_type p_type) | |
1220 | { | |
4081363f | 1221 | switch (F2FS_P_SB(page)->active_logs) { |
351df4b2 JK |
1222 | case 2: |
1223 | return __get_segment_type_2(page, p_type); | |
1224 | case 4: | |
1225 | return __get_segment_type_4(page, p_type); | |
351df4b2 | 1226 | } |
12a67146 | 1227 | /* NR_CURSEG_TYPE(6) logs by default */ |
9850cf4a JK |
1228 | f2fs_bug_on(F2FS_P_SB(page), |
1229 | F2FS_P_SB(page)->active_logs != NR_CURSEG_TYPE); | |
12a67146 | 1230 | return __get_segment_type_6(page, p_type); |
351df4b2 JK |
1231 | } |
1232 | ||
bfad7c2d JK |
1233 | void allocate_data_block(struct f2fs_sb_info *sbi, struct page *page, |
1234 | block_t old_blkaddr, block_t *new_blkaddr, | |
1235 | struct f2fs_summary *sum, int type) | |
351df4b2 JK |
1236 | { |
1237 | struct sit_info *sit_i = SIT_I(sbi); | |
1238 | struct curseg_info *curseg; | |
38aa0889 JK |
1239 | bool direct_io = (type == CURSEG_DIRECT_IO); |
1240 | ||
1241 | type = direct_io ? CURSEG_WARM_DATA : type; | |
351df4b2 | 1242 | |
351df4b2 JK |
1243 | curseg = CURSEG_I(sbi, type); |
1244 | ||
1245 | mutex_lock(&curseg->curseg_mutex); | |
21cb1d99 | 1246 | mutex_lock(&sit_i->sentry_lock); |
351df4b2 | 1247 | |
38aa0889 | 1248 | /* direct_io'ed data is aligned to the segment for better performance */ |
47e70ca4 JK |
1249 | if (direct_io && curseg->next_blkoff && |
1250 | !has_not_enough_free_secs(sbi, 0)) | |
38aa0889 JK |
1251 | __allocate_new_segments(sbi, type); |
1252 | ||
351df4b2 | 1253 | *new_blkaddr = NEXT_FREE_BLKADDR(sbi, curseg); |
351df4b2 JK |
1254 | |
1255 | /* | |
1256 | * __add_sum_entry should be resided under the curseg_mutex | |
1257 | * because, this function updates a summary entry in the | |
1258 | * current summary block. | |
1259 | */ | |
e79efe3b | 1260 | __add_sum_entry(sbi, type, sum); |
351df4b2 | 1261 | |
351df4b2 | 1262 | __refresh_next_blkoff(sbi, curseg); |
dcdfff65 JK |
1263 | |
1264 | stat_inc_block_count(sbi, curseg); | |
351df4b2 | 1265 | |
5e443818 JK |
1266 | if (!__has_curseg_space(sbi, type)) |
1267 | sit_i->s_ops->allocate_segment(sbi, type, false); | |
351df4b2 JK |
1268 | /* |
1269 | * SIT information should be updated before segment allocation, | |
1270 | * since SSR needs latest valid block information. | |
1271 | */ | |
1272 | refresh_sit_entry(sbi, old_blkaddr, *new_blkaddr); | |
5e443818 | 1273 | |
351df4b2 JK |
1274 | mutex_unlock(&sit_i->sentry_lock); |
1275 | ||
bfad7c2d | 1276 | if (page && IS_NODESEG(type)) |
351df4b2 JK |
1277 | fill_node_footer_blkaddr(page, NEXT_FREE_BLKADDR(sbi, curseg)); |
1278 | ||
bfad7c2d JK |
1279 | mutex_unlock(&curseg->curseg_mutex); |
1280 | } | |
1281 | ||
05ca3632 | 1282 | static void do_write_page(struct f2fs_summary *sum, struct f2fs_io_info *fio) |
bfad7c2d | 1283 | { |
05ca3632 | 1284 | int type = __get_segment_type(fio->page, fio->type); |
bfad7c2d | 1285 | |
05ca3632 JK |
1286 | allocate_data_block(fio->sbi, fio->page, fio->blk_addr, |
1287 | &fio->blk_addr, sum, type); | |
bfad7c2d | 1288 | |
351df4b2 | 1289 | /* writeout dirty page into bdev */ |
05ca3632 | 1290 | f2fs_submit_page_mbio(fio); |
351df4b2 JK |
1291 | } |
1292 | ||
577e3495 | 1293 | void write_meta_page(struct f2fs_sb_info *sbi, struct page *page) |
351df4b2 | 1294 | { |
458e6197 | 1295 | struct f2fs_io_info fio = { |
05ca3632 | 1296 | .sbi = sbi, |
458e6197 | 1297 | .type = META, |
cf04e8eb JK |
1298 | .rw = WRITE_SYNC | REQ_META | REQ_PRIO, |
1299 | .blk_addr = page->index, | |
05ca3632 | 1300 | .page = page, |
4375a336 | 1301 | .encrypted_page = NULL, |
458e6197 JK |
1302 | }; |
1303 | ||
2b947003 CY |
1304 | if (unlikely(page->index >= MAIN_BLKADDR(sbi))) |
1305 | fio.rw &= ~REQ_META; | |
1306 | ||
351df4b2 | 1307 | set_page_writeback(page); |
05ca3632 | 1308 | f2fs_submit_page_mbio(&fio); |
351df4b2 JK |
1309 | } |
1310 | ||
05ca3632 | 1311 | void write_node_page(unsigned int nid, struct f2fs_io_info *fio) |
351df4b2 JK |
1312 | { |
1313 | struct f2fs_summary sum; | |
05ca3632 | 1314 | |
351df4b2 | 1315 | set_summary(&sum, nid, 0, 0); |
05ca3632 | 1316 | do_write_page(&sum, fio); |
351df4b2 JK |
1317 | } |
1318 | ||
05ca3632 | 1319 | void write_data_page(struct dnode_of_data *dn, struct f2fs_io_info *fio) |
351df4b2 | 1320 | { |
05ca3632 | 1321 | struct f2fs_sb_info *sbi = fio->sbi; |
351df4b2 JK |
1322 | struct f2fs_summary sum; |
1323 | struct node_info ni; | |
1324 | ||
9850cf4a | 1325 | f2fs_bug_on(sbi, dn->data_blkaddr == NULL_ADDR); |
351df4b2 JK |
1326 | get_node_info(sbi, dn->nid, &ni); |
1327 | set_summary(&sum, dn->nid, dn->ofs_in_node, ni.version); | |
05ca3632 | 1328 | do_write_page(&sum, fio); |
e1509cf2 | 1329 | dn->data_blkaddr = fio->blk_addr; |
351df4b2 JK |
1330 | } |
1331 | ||
05ca3632 | 1332 | void rewrite_data_page(struct f2fs_io_info *fio) |
351df4b2 | 1333 | { |
05ca3632 JK |
1334 | stat_inc_inplace_blocks(fio->sbi); |
1335 | f2fs_submit_page_mbio(fio); | |
351df4b2 JK |
1336 | } |
1337 | ||
528e3459 CY |
1338 | static void __f2fs_replace_block(struct f2fs_sb_info *sbi, |
1339 | struct f2fs_summary *sum, | |
19f106bc CY |
1340 | block_t old_blkaddr, block_t new_blkaddr, |
1341 | bool recover_curseg) | |
351df4b2 JK |
1342 | { |
1343 | struct sit_info *sit_i = SIT_I(sbi); | |
1344 | struct curseg_info *curseg; | |
1345 | unsigned int segno, old_cursegno; | |
1346 | struct seg_entry *se; | |
1347 | int type; | |
19f106bc | 1348 | unsigned short old_blkoff; |
351df4b2 JK |
1349 | |
1350 | segno = GET_SEGNO(sbi, new_blkaddr); | |
1351 | se = get_seg_entry(sbi, segno); | |
1352 | type = se->type; | |
1353 | ||
19f106bc CY |
1354 | if (!recover_curseg) { |
1355 | /* for recovery flow */ | |
1356 | if (se->valid_blocks == 0 && !IS_CURSEG(sbi, segno)) { | |
1357 | if (old_blkaddr == NULL_ADDR) | |
1358 | type = CURSEG_COLD_DATA; | |
1359 | else | |
1360 | type = CURSEG_WARM_DATA; | |
1361 | } | |
1362 | } else { | |
1363 | if (!IS_CURSEG(sbi, segno)) | |
351df4b2 JK |
1364 | type = CURSEG_WARM_DATA; |
1365 | } | |
19f106bc | 1366 | |
351df4b2 JK |
1367 | curseg = CURSEG_I(sbi, type); |
1368 | ||
1369 | mutex_lock(&curseg->curseg_mutex); | |
1370 | mutex_lock(&sit_i->sentry_lock); | |
1371 | ||
1372 | old_cursegno = curseg->segno; | |
19f106bc | 1373 | old_blkoff = curseg->next_blkoff; |
351df4b2 JK |
1374 | |
1375 | /* change the current segment */ | |
1376 | if (segno != curseg->segno) { | |
1377 | curseg->next_segno = segno; | |
1378 | change_curseg(sbi, type, true); | |
1379 | } | |
1380 | ||
491c0854 | 1381 | curseg->next_blkoff = GET_BLKOFF_FROM_SEG0(sbi, new_blkaddr); |
e79efe3b | 1382 | __add_sum_entry(sbi, type, sum); |
351df4b2 | 1383 | |
6e2c64ad JK |
1384 | if (!recover_curseg) |
1385 | update_sit_entry(sbi, new_blkaddr, 1); | |
1386 | if (GET_SEGNO(sbi, old_blkaddr) != NULL_SEGNO) | |
1387 | update_sit_entry(sbi, old_blkaddr, -1); | |
1388 | ||
1389 | locate_dirty_segment(sbi, GET_SEGNO(sbi, old_blkaddr)); | |
1390 | locate_dirty_segment(sbi, GET_SEGNO(sbi, new_blkaddr)); | |
1391 | ||
351df4b2 | 1392 | locate_dirty_segment(sbi, old_cursegno); |
351df4b2 | 1393 | |
19f106bc CY |
1394 | if (recover_curseg) { |
1395 | if (old_cursegno != curseg->segno) { | |
1396 | curseg->next_segno = old_cursegno; | |
1397 | change_curseg(sbi, type, true); | |
1398 | } | |
1399 | curseg->next_blkoff = old_blkoff; | |
1400 | } | |
1401 | ||
351df4b2 JK |
1402 | mutex_unlock(&sit_i->sentry_lock); |
1403 | mutex_unlock(&curseg->curseg_mutex); | |
1404 | } | |
1405 | ||
528e3459 CY |
1406 | void f2fs_replace_block(struct f2fs_sb_info *sbi, struct dnode_of_data *dn, |
1407 | block_t old_addr, block_t new_addr, | |
1408 | unsigned char version, bool recover_curseg) | |
1409 | { | |
1410 | struct f2fs_summary sum; | |
1411 | ||
1412 | set_summary(&sum, dn->nid, dn->ofs_in_node, version); | |
1413 | ||
1414 | __f2fs_replace_block(sbi, &sum, old_addr, new_addr, recover_curseg); | |
1415 | ||
1416 | dn->data_blkaddr = new_addr; | |
1417 | set_data_blkaddr(dn); | |
1418 | f2fs_update_extent_cache(dn); | |
1419 | } | |
1420 | ||
df0f8dc0 CY |
1421 | static inline bool is_merged_page(struct f2fs_sb_info *sbi, |
1422 | struct page *page, enum page_type type) | |
1423 | { | |
1424 | enum page_type btype = PAGE_TYPE_OF_BIO(type); | |
1425 | struct f2fs_bio_info *io = &sbi->write_io[btype]; | |
df0f8dc0 | 1426 | struct bio_vec *bvec; |
4375a336 | 1427 | struct page *target; |
df0f8dc0 CY |
1428 | int i; |
1429 | ||
1430 | down_read(&io->io_rwsem); | |
4375a336 JK |
1431 | if (!io->bio) { |
1432 | up_read(&io->io_rwsem); | |
1433 | return false; | |
1434 | } | |
df0f8dc0 | 1435 | |
ce23447f | 1436 | bio_for_each_segment_all(bvec, io->bio, i) { |
4375a336 JK |
1437 | |
1438 | if (bvec->bv_page->mapping) { | |
1439 | target = bvec->bv_page; | |
1440 | } else { | |
1441 | struct f2fs_crypto_ctx *ctx; | |
1442 | ||
1443 | /* encrypted page */ | |
1444 | ctx = (struct f2fs_crypto_ctx *)page_private( | |
1445 | bvec->bv_page); | |
ca40b030 | 1446 | target = ctx->w.control_page; |
4375a336 JK |
1447 | } |
1448 | ||
1449 | if (page == target) { | |
df0f8dc0 CY |
1450 | up_read(&io->io_rwsem); |
1451 | return true; | |
1452 | } | |
1453 | } | |
1454 | ||
df0f8dc0 CY |
1455 | up_read(&io->io_rwsem); |
1456 | return false; | |
1457 | } | |
1458 | ||
93dfe2ac | 1459 | void f2fs_wait_on_page_writeback(struct page *page, |
5514f0aa | 1460 | enum page_type type) |
93dfe2ac | 1461 | { |
93dfe2ac | 1462 | if (PageWriteback(page)) { |
4081363f JK |
1463 | struct f2fs_sb_info *sbi = F2FS_P_SB(page); |
1464 | ||
df0f8dc0 CY |
1465 | if (is_merged_page(sbi, page, type)) |
1466 | f2fs_submit_merged_bio(sbi, type, WRITE); | |
93dfe2ac JK |
1467 | wait_on_page_writeback(page); |
1468 | } | |
1469 | } | |
1470 | ||
08b39fbd CY |
1471 | void f2fs_wait_on_encrypted_page_writeback(struct f2fs_sb_info *sbi, |
1472 | block_t blkaddr) | |
1473 | { | |
1474 | struct page *cpage; | |
1475 | ||
1476 | if (blkaddr == NEW_ADDR) | |
1477 | return; | |
1478 | ||
1479 | f2fs_bug_on(sbi, blkaddr == NULL_ADDR); | |
1480 | ||
1481 | cpage = find_lock_page(META_MAPPING(sbi), blkaddr); | |
1482 | if (cpage) { | |
1483 | f2fs_wait_on_page_writeback(cpage, DATA); | |
1484 | f2fs_put_page(cpage, 1); | |
1485 | } | |
1486 | } | |
1487 | ||
351df4b2 JK |
1488 | static int read_compacted_summaries(struct f2fs_sb_info *sbi) |
1489 | { | |
1490 | struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); | |
1491 | struct curseg_info *seg_i; | |
1492 | unsigned char *kaddr; | |
1493 | struct page *page; | |
1494 | block_t start; | |
1495 | int i, j, offset; | |
1496 | ||
1497 | start = start_sum_block(sbi); | |
1498 | ||
1499 | page = get_meta_page(sbi, start++); | |
1500 | kaddr = (unsigned char *)page_address(page); | |
1501 | ||
1502 | /* Step 1: restore nat cache */ | |
1503 | seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
1504 | memcpy(&seg_i->sum_blk->n_nats, kaddr, SUM_JOURNAL_SIZE); | |
1505 | ||
1506 | /* Step 2: restore sit cache */ | |
1507 | seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA); | |
1508 | memcpy(&seg_i->sum_blk->n_sits, kaddr + SUM_JOURNAL_SIZE, | |
1509 | SUM_JOURNAL_SIZE); | |
1510 | offset = 2 * SUM_JOURNAL_SIZE; | |
1511 | ||
1512 | /* Step 3: restore summary entries */ | |
1513 | for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) { | |
1514 | unsigned short blk_off; | |
1515 | unsigned int segno; | |
1516 | ||
1517 | seg_i = CURSEG_I(sbi, i); | |
1518 | segno = le32_to_cpu(ckpt->cur_data_segno[i]); | |
1519 | blk_off = le16_to_cpu(ckpt->cur_data_blkoff[i]); | |
1520 | seg_i->next_segno = segno; | |
1521 | reset_curseg(sbi, i, 0); | |
1522 | seg_i->alloc_type = ckpt->alloc_type[i]; | |
1523 | seg_i->next_blkoff = blk_off; | |
1524 | ||
1525 | if (seg_i->alloc_type == SSR) | |
1526 | blk_off = sbi->blocks_per_seg; | |
1527 | ||
1528 | for (j = 0; j < blk_off; j++) { | |
1529 | struct f2fs_summary *s; | |
1530 | s = (struct f2fs_summary *)(kaddr + offset); | |
1531 | seg_i->sum_blk->entries[j] = *s; | |
1532 | offset += SUMMARY_SIZE; | |
1533 | if (offset + SUMMARY_SIZE <= PAGE_CACHE_SIZE - | |
1534 | SUM_FOOTER_SIZE) | |
1535 | continue; | |
1536 | ||
1537 | f2fs_put_page(page, 1); | |
1538 | page = NULL; | |
1539 | ||
1540 | page = get_meta_page(sbi, start++); | |
1541 | kaddr = (unsigned char *)page_address(page); | |
1542 | offset = 0; | |
1543 | } | |
1544 | } | |
1545 | f2fs_put_page(page, 1); | |
1546 | return 0; | |
1547 | } | |
1548 | ||
1549 | static int read_normal_summaries(struct f2fs_sb_info *sbi, int type) | |
1550 | { | |
1551 | struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); | |
1552 | struct f2fs_summary_block *sum; | |
1553 | struct curseg_info *curseg; | |
1554 | struct page *new; | |
1555 | unsigned short blk_off; | |
1556 | unsigned int segno = 0; | |
1557 | block_t blk_addr = 0; | |
1558 | ||
1559 | /* get segment number and block addr */ | |
1560 | if (IS_DATASEG(type)) { | |
1561 | segno = le32_to_cpu(ckpt->cur_data_segno[type]); | |
1562 | blk_off = le16_to_cpu(ckpt->cur_data_blkoff[type - | |
1563 | CURSEG_HOT_DATA]); | |
119ee914 | 1564 | if (__exist_node_summaries(sbi)) |
351df4b2 JK |
1565 | blk_addr = sum_blk_addr(sbi, NR_CURSEG_TYPE, type); |
1566 | else | |
1567 | blk_addr = sum_blk_addr(sbi, NR_CURSEG_DATA_TYPE, type); | |
1568 | } else { | |
1569 | segno = le32_to_cpu(ckpt->cur_node_segno[type - | |
1570 | CURSEG_HOT_NODE]); | |
1571 | blk_off = le16_to_cpu(ckpt->cur_node_blkoff[type - | |
1572 | CURSEG_HOT_NODE]); | |
119ee914 | 1573 | if (__exist_node_summaries(sbi)) |
351df4b2 JK |
1574 | blk_addr = sum_blk_addr(sbi, NR_CURSEG_NODE_TYPE, |
1575 | type - CURSEG_HOT_NODE); | |
1576 | else | |
1577 | blk_addr = GET_SUM_BLOCK(sbi, segno); | |
1578 | } | |
1579 | ||
1580 | new = get_meta_page(sbi, blk_addr); | |
1581 | sum = (struct f2fs_summary_block *)page_address(new); | |
1582 | ||
1583 | if (IS_NODESEG(type)) { | |
119ee914 | 1584 | if (__exist_node_summaries(sbi)) { |
351df4b2 JK |
1585 | struct f2fs_summary *ns = &sum->entries[0]; |
1586 | int i; | |
1587 | for (i = 0; i < sbi->blocks_per_seg; i++, ns++) { | |
1588 | ns->version = 0; | |
1589 | ns->ofs_in_node = 0; | |
1590 | } | |
1591 | } else { | |
d653788a GZ |
1592 | int err; |
1593 | ||
1594 | err = restore_node_summary(sbi, segno, sum); | |
1595 | if (err) { | |
351df4b2 | 1596 | f2fs_put_page(new, 1); |
d653788a | 1597 | return err; |
351df4b2 JK |
1598 | } |
1599 | } | |
1600 | } | |
1601 | ||
1602 | /* set uncompleted segment to curseg */ | |
1603 | curseg = CURSEG_I(sbi, type); | |
1604 | mutex_lock(&curseg->curseg_mutex); | |
1605 | memcpy(curseg->sum_blk, sum, PAGE_CACHE_SIZE); | |
1606 | curseg->next_segno = segno; | |
1607 | reset_curseg(sbi, type, 0); | |
1608 | curseg->alloc_type = ckpt->alloc_type[type]; | |
1609 | curseg->next_blkoff = blk_off; | |
1610 | mutex_unlock(&curseg->curseg_mutex); | |
1611 | f2fs_put_page(new, 1); | |
1612 | return 0; | |
1613 | } | |
1614 | ||
1615 | static int restore_curseg_summaries(struct f2fs_sb_info *sbi) | |
1616 | { | |
1617 | int type = CURSEG_HOT_DATA; | |
e4fc5fbf | 1618 | int err; |
351df4b2 | 1619 | |
25ca923b | 1620 | if (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_COMPACT_SUM_FLAG)) { |
3fa06d7b CY |
1621 | int npages = npages_for_summary_flush(sbi, true); |
1622 | ||
1623 | if (npages >= 2) | |
1624 | ra_meta_pages(sbi, start_sum_block(sbi), npages, | |
26879fb1 | 1625 | META_CP, true); |
3fa06d7b | 1626 | |
351df4b2 JK |
1627 | /* restore for compacted data summary */ |
1628 | if (read_compacted_summaries(sbi)) | |
1629 | return -EINVAL; | |
1630 | type = CURSEG_HOT_NODE; | |
1631 | } | |
1632 | ||
119ee914 | 1633 | if (__exist_node_summaries(sbi)) |
3fa06d7b | 1634 | ra_meta_pages(sbi, sum_blk_addr(sbi, NR_CURSEG_TYPE, type), |
26879fb1 | 1635 | NR_CURSEG_TYPE - type, META_CP, true); |
3fa06d7b | 1636 | |
e4fc5fbf CY |
1637 | for (; type <= CURSEG_COLD_NODE; type++) { |
1638 | err = read_normal_summaries(sbi, type); | |
1639 | if (err) | |
1640 | return err; | |
1641 | } | |
1642 | ||
351df4b2 JK |
1643 | return 0; |
1644 | } | |
1645 | ||
1646 | static void write_compacted_summaries(struct f2fs_sb_info *sbi, block_t blkaddr) | |
1647 | { | |
1648 | struct page *page; | |
1649 | unsigned char *kaddr; | |
1650 | struct f2fs_summary *summary; | |
1651 | struct curseg_info *seg_i; | |
1652 | int written_size = 0; | |
1653 | int i, j; | |
1654 | ||
1655 | page = grab_meta_page(sbi, blkaddr++); | |
1656 | kaddr = (unsigned char *)page_address(page); | |
1657 | ||
1658 | /* Step 1: write nat cache */ | |
1659 | seg_i = CURSEG_I(sbi, CURSEG_HOT_DATA); | |
1660 | memcpy(kaddr, &seg_i->sum_blk->n_nats, SUM_JOURNAL_SIZE); | |
1661 | written_size += SUM_JOURNAL_SIZE; | |
1662 | ||
1663 | /* Step 2: write sit cache */ | |
1664 | seg_i = CURSEG_I(sbi, CURSEG_COLD_DATA); | |
1665 | memcpy(kaddr + written_size, &seg_i->sum_blk->n_sits, | |
1666 | SUM_JOURNAL_SIZE); | |
1667 | written_size += SUM_JOURNAL_SIZE; | |
1668 | ||
351df4b2 JK |
1669 | /* Step 3: write summary entries */ |
1670 | for (i = CURSEG_HOT_DATA; i <= CURSEG_COLD_DATA; i++) { | |
1671 | unsigned short blkoff; | |
1672 | seg_i = CURSEG_I(sbi, i); | |
1673 | if (sbi->ckpt->alloc_type[i] == SSR) | |
1674 | blkoff = sbi->blocks_per_seg; | |
1675 | else | |
1676 | blkoff = curseg_blkoff(sbi, i); | |
1677 | ||
1678 | for (j = 0; j < blkoff; j++) { | |
1679 | if (!page) { | |
1680 | page = grab_meta_page(sbi, blkaddr++); | |
1681 | kaddr = (unsigned char *)page_address(page); | |
1682 | written_size = 0; | |
1683 | } | |
1684 | summary = (struct f2fs_summary *)(kaddr + written_size); | |
1685 | *summary = seg_i->sum_blk->entries[j]; | |
1686 | written_size += SUMMARY_SIZE; | |
351df4b2 JK |
1687 | |
1688 | if (written_size + SUMMARY_SIZE <= PAGE_CACHE_SIZE - | |
1689 | SUM_FOOTER_SIZE) | |
1690 | continue; | |
1691 | ||
e8d61a74 | 1692 | set_page_dirty(page); |
351df4b2 JK |
1693 | f2fs_put_page(page, 1); |
1694 | page = NULL; | |
1695 | } | |
1696 | } | |
e8d61a74 CY |
1697 | if (page) { |
1698 | set_page_dirty(page); | |
351df4b2 | 1699 | f2fs_put_page(page, 1); |
e8d61a74 | 1700 | } |
351df4b2 JK |
1701 | } |
1702 | ||
1703 | static void write_normal_summaries(struct f2fs_sb_info *sbi, | |
1704 | block_t blkaddr, int type) | |
1705 | { | |
1706 | int i, end; | |
1707 | if (IS_DATASEG(type)) | |
1708 | end = type + NR_CURSEG_DATA_TYPE; | |
1709 | else | |
1710 | end = type + NR_CURSEG_NODE_TYPE; | |
1711 | ||
1712 | for (i = type; i < end; i++) { | |
1713 | struct curseg_info *sum = CURSEG_I(sbi, i); | |
1714 | mutex_lock(&sum->curseg_mutex); | |
1715 | write_sum_page(sbi, sum->sum_blk, blkaddr + (i - type)); | |
1716 | mutex_unlock(&sum->curseg_mutex); | |
1717 | } | |
1718 | } | |
1719 | ||
1720 | void write_data_summaries(struct f2fs_sb_info *sbi, block_t start_blk) | |
1721 | { | |
25ca923b | 1722 | if (is_set_ckpt_flags(F2FS_CKPT(sbi), CP_COMPACT_SUM_FLAG)) |
351df4b2 JK |
1723 | write_compacted_summaries(sbi, start_blk); |
1724 | else | |
1725 | write_normal_summaries(sbi, start_blk, CURSEG_HOT_DATA); | |
1726 | } | |
1727 | ||
1728 | void write_node_summaries(struct f2fs_sb_info *sbi, block_t start_blk) | |
1729 | { | |
119ee914 | 1730 | write_normal_summaries(sbi, start_blk, CURSEG_HOT_NODE); |
351df4b2 JK |
1731 | } |
1732 | ||
1733 | int lookup_journal_in_cursum(struct f2fs_summary_block *sum, int type, | |
1734 | unsigned int val, int alloc) | |
1735 | { | |
1736 | int i; | |
1737 | ||
1738 | if (type == NAT_JOURNAL) { | |
1739 | for (i = 0; i < nats_in_cursum(sum); i++) { | |
1740 | if (le32_to_cpu(nid_in_journal(sum, i)) == val) | |
1741 | return i; | |
1742 | } | |
855639de | 1743 | if (alloc && __has_cursum_space(sum, 1, NAT_JOURNAL)) |
351df4b2 JK |
1744 | return update_nats_in_cursum(sum, 1); |
1745 | } else if (type == SIT_JOURNAL) { | |
1746 | for (i = 0; i < sits_in_cursum(sum); i++) | |
1747 | if (le32_to_cpu(segno_in_journal(sum, i)) == val) | |
1748 | return i; | |
855639de | 1749 | if (alloc && __has_cursum_space(sum, 1, SIT_JOURNAL)) |
351df4b2 JK |
1750 | return update_sits_in_cursum(sum, 1); |
1751 | } | |
1752 | return -1; | |
1753 | } | |
1754 | ||
1755 | static struct page *get_current_sit_page(struct f2fs_sb_info *sbi, | |
1756 | unsigned int segno) | |
1757 | { | |
2cc22186 | 1758 | return get_meta_page(sbi, current_sit_addr(sbi, segno)); |
351df4b2 JK |
1759 | } |
1760 | ||
1761 | static struct page *get_next_sit_page(struct f2fs_sb_info *sbi, | |
1762 | unsigned int start) | |
1763 | { | |
1764 | struct sit_info *sit_i = SIT_I(sbi); | |
1765 | struct page *src_page, *dst_page; | |
1766 | pgoff_t src_off, dst_off; | |
1767 | void *src_addr, *dst_addr; | |
1768 | ||
1769 | src_off = current_sit_addr(sbi, start); | |
1770 | dst_off = next_sit_addr(sbi, src_off); | |
1771 | ||
1772 | /* get current sit block page without lock */ | |
1773 | src_page = get_meta_page(sbi, src_off); | |
1774 | dst_page = grab_meta_page(sbi, dst_off); | |
9850cf4a | 1775 | f2fs_bug_on(sbi, PageDirty(src_page)); |
351df4b2 JK |
1776 | |
1777 | src_addr = page_address(src_page); | |
1778 | dst_addr = page_address(dst_page); | |
1779 | memcpy(dst_addr, src_addr, PAGE_CACHE_SIZE); | |
1780 | ||
1781 | set_page_dirty(dst_page); | |
1782 | f2fs_put_page(src_page, 1); | |
1783 | ||
1784 | set_to_next_sit(sit_i, start); | |
1785 | ||
1786 | return dst_page; | |
1787 | } | |
1788 | ||
184a5cd2 CY |
1789 | static struct sit_entry_set *grab_sit_entry_set(void) |
1790 | { | |
1791 | struct sit_entry_set *ses = | |
80c54505 | 1792 | f2fs_kmem_cache_alloc(sit_entry_set_slab, GFP_NOFS); |
184a5cd2 CY |
1793 | |
1794 | ses->entry_cnt = 0; | |
1795 | INIT_LIST_HEAD(&ses->set_list); | |
1796 | return ses; | |
1797 | } | |
1798 | ||
1799 | static void release_sit_entry_set(struct sit_entry_set *ses) | |
1800 | { | |
1801 | list_del(&ses->set_list); | |
1802 | kmem_cache_free(sit_entry_set_slab, ses); | |
1803 | } | |
1804 | ||
1805 | static void adjust_sit_entry_set(struct sit_entry_set *ses, | |
1806 | struct list_head *head) | |
1807 | { | |
1808 | struct sit_entry_set *next = ses; | |
1809 | ||
1810 | if (list_is_last(&ses->set_list, head)) | |
1811 | return; | |
1812 | ||
1813 | list_for_each_entry_continue(next, head, set_list) | |
1814 | if (ses->entry_cnt <= next->entry_cnt) | |
1815 | break; | |
1816 | ||
1817 | list_move_tail(&ses->set_list, &next->set_list); | |
1818 | } | |
1819 | ||
1820 | static void add_sit_entry(unsigned int segno, struct list_head *head) | |
1821 | { | |
1822 | struct sit_entry_set *ses; | |
1823 | unsigned int start_segno = START_SEGNO(segno); | |
1824 | ||
1825 | list_for_each_entry(ses, head, set_list) { | |
1826 | if (ses->start_segno == start_segno) { | |
1827 | ses->entry_cnt++; | |
1828 | adjust_sit_entry_set(ses, head); | |
1829 | return; | |
1830 | } | |
1831 | } | |
1832 | ||
1833 | ses = grab_sit_entry_set(); | |
1834 | ||
1835 | ses->start_segno = start_segno; | |
1836 | ses->entry_cnt++; | |
1837 | list_add(&ses->set_list, head); | |
1838 | } | |
1839 | ||
1840 | static void add_sits_in_set(struct f2fs_sb_info *sbi) | |
1841 | { | |
1842 | struct f2fs_sm_info *sm_info = SM_I(sbi); | |
1843 | struct list_head *set_list = &sm_info->sit_entry_set; | |
1844 | unsigned long *bitmap = SIT_I(sbi)->dirty_sentries_bitmap; | |
184a5cd2 CY |
1845 | unsigned int segno; |
1846 | ||
7cd8558b | 1847 | for_each_set_bit(segno, bitmap, MAIN_SEGS(sbi)) |
184a5cd2 CY |
1848 | add_sit_entry(segno, set_list); |
1849 | } | |
1850 | ||
1851 | static void remove_sits_in_journal(struct f2fs_sb_info *sbi) | |
351df4b2 JK |
1852 | { |
1853 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA); | |
1854 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
1855 | int i; | |
1856 | ||
184a5cd2 CY |
1857 | for (i = sits_in_cursum(sum) - 1; i >= 0; i--) { |
1858 | unsigned int segno; | |
1859 | bool dirtied; | |
1860 | ||
1861 | segno = le32_to_cpu(segno_in_journal(sum, i)); | |
1862 | dirtied = __mark_sit_entry_dirty(sbi, segno); | |
1863 | ||
1864 | if (!dirtied) | |
1865 | add_sit_entry(segno, &SM_I(sbi)->sit_entry_set); | |
351df4b2 | 1866 | } |
184a5cd2 | 1867 | update_sits_in_cursum(sum, -sits_in_cursum(sum)); |
351df4b2 JK |
1868 | } |
1869 | ||
0a8165d7 | 1870 | /* |
351df4b2 JK |
1871 | * CP calls this function, which flushes SIT entries including sit_journal, |
1872 | * and moves prefree segs to free segs. | |
1873 | */ | |
4b2fecc8 | 1874 | void flush_sit_entries(struct f2fs_sb_info *sbi, struct cp_control *cpc) |
351df4b2 JK |
1875 | { |
1876 | struct sit_info *sit_i = SIT_I(sbi); | |
1877 | unsigned long *bitmap = sit_i->dirty_sentries_bitmap; | |
1878 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA); | |
1879 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
184a5cd2 CY |
1880 | struct sit_entry_set *ses, *tmp; |
1881 | struct list_head *head = &SM_I(sbi)->sit_entry_set; | |
184a5cd2 | 1882 | bool to_journal = true; |
4b2fecc8 | 1883 | struct seg_entry *se; |
351df4b2 JK |
1884 | |
1885 | mutex_lock(&curseg->curseg_mutex); | |
1886 | mutex_lock(&sit_i->sentry_lock); | |
1887 | ||
2b11a74b WL |
1888 | if (!sit_i->dirty_sentries) |
1889 | goto out; | |
1890 | ||
351df4b2 | 1891 | /* |
184a5cd2 CY |
1892 | * add and account sit entries of dirty bitmap in sit entry |
1893 | * set temporarily | |
351df4b2 | 1894 | */ |
184a5cd2 | 1895 | add_sits_in_set(sbi); |
351df4b2 | 1896 | |
184a5cd2 CY |
1897 | /* |
1898 | * if there are no enough space in journal to store dirty sit | |
1899 | * entries, remove all entries from journal and add and account | |
1900 | * them in sit entry set. | |
1901 | */ | |
1902 | if (!__has_cursum_space(sum, sit_i->dirty_sentries, SIT_JOURNAL)) | |
1903 | remove_sits_in_journal(sbi); | |
b2955550 | 1904 | |
184a5cd2 CY |
1905 | /* |
1906 | * there are two steps to flush sit entries: | |
1907 | * #1, flush sit entries to journal in current cold data summary block. | |
1908 | * #2, flush sit entries to sit page. | |
1909 | */ | |
1910 | list_for_each_entry_safe(ses, tmp, head, set_list) { | |
4a257ed6 | 1911 | struct page *page = NULL; |
184a5cd2 CY |
1912 | struct f2fs_sit_block *raw_sit = NULL; |
1913 | unsigned int start_segno = ses->start_segno; | |
1914 | unsigned int end = min(start_segno + SIT_ENTRY_PER_BLOCK, | |
7cd8558b | 1915 | (unsigned long)MAIN_SEGS(sbi)); |
184a5cd2 CY |
1916 | unsigned int segno = start_segno; |
1917 | ||
1918 | if (to_journal && | |
1919 | !__has_cursum_space(sum, ses->entry_cnt, SIT_JOURNAL)) | |
1920 | to_journal = false; | |
1921 | ||
1922 | if (!to_journal) { | |
1923 | page = get_next_sit_page(sbi, start_segno); | |
1924 | raw_sit = page_address(page); | |
351df4b2 | 1925 | } |
351df4b2 | 1926 | |
184a5cd2 CY |
1927 | /* flush dirty sit entries in region of current sit set */ |
1928 | for_each_set_bit_from(segno, bitmap, end) { | |
1929 | int offset, sit_offset; | |
4b2fecc8 JK |
1930 | |
1931 | se = get_seg_entry(sbi, segno); | |
184a5cd2 CY |
1932 | |
1933 | /* add discard candidates */ | |
d7bc2484 | 1934 | if (cpc->reason != CP_DISCARD) { |
4b2fecc8 JK |
1935 | cpc->trim_start = segno; |
1936 | add_discard_addrs(sbi, cpc); | |
1937 | } | |
184a5cd2 CY |
1938 | |
1939 | if (to_journal) { | |
1940 | offset = lookup_journal_in_cursum(sum, | |
1941 | SIT_JOURNAL, segno, 1); | |
1942 | f2fs_bug_on(sbi, offset < 0); | |
1943 | segno_in_journal(sum, offset) = | |
1944 | cpu_to_le32(segno); | |
1945 | seg_info_to_raw_sit(se, | |
1946 | &sit_in_journal(sum, offset)); | |
1947 | } else { | |
1948 | sit_offset = SIT_ENTRY_OFFSET(sit_i, segno); | |
1949 | seg_info_to_raw_sit(se, | |
1950 | &raw_sit->entries[sit_offset]); | |
1951 | } | |
351df4b2 | 1952 | |
184a5cd2 CY |
1953 | __clear_bit(segno, bitmap); |
1954 | sit_i->dirty_sentries--; | |
1955 | ses->entry_cnt--; | |
351df4b2 JK |
1956 | } |
1957 | ||
184a5cd2 CY |
1958 | if (!to_journal) |
1959 | f2fs_put_page(page, 1); | |
1960 | ||
1961 | f2fs_bug_on(sbi, ses->entry_cnt); | |
1962 | release_sit_entry_set(ses); | |
351df4b2 | 1963 | } |
184a5cd2 CY |
1964 | |
1965 | f2fs_bug_on(sbi, !list_empty(head)); | |
1966 | f2fs_bug_on(sbi, sit_i->dirty_sentries); | |
184a5cd2 | 1967 | out: |
4b2fecc8 JK |
1968 | if (cpc->reason == CP_DISCARD) { |
1969 | for (; cpc->trim_start <= cpc->trim_end; cpc->trim_start++) | |
1970 | add_discard_addrs(sbi, cpc); | |
1971 | } | |
351df4b2 JK |
1972 | mutex_unlock(&sit_i->sentry_lock); |
1973 | mutex_unlock(&curseg->curseg_mutex); | |
1974 | ||
351df4b2 JK |
1975 | set_prefree_as_free_segments(sbi); |
1976 | } | |
1977 | ||
1978 | static int build_sit_info(struct f2fs_sb_info *sbi) | |
1979 | { | |
1980 | struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi); | |
1981 | struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); | |
1982 | struct sit_info *sit_i; | |
1983 | unsigned int sit_segs, start; | |
1984 | char *src_bitmap, *dst_bitmap; | |
1985 | unsigned int bitmap_size; | |
1986 | ||
1987 | /* allocate memory for SIT information */ | |
1988 | sit_i = kzalloc(sizeof(struct sit_info), GFP_KERNEL); | |
1989 | if (!sit_i) | |
1990 | return -ENOMEM; | |
1991 | ||
1992 | SM_I(sbi)->sit_info = sit_i; | |
1993 | ||
39307a8e JK |
1994 | sit_i->sentries = f2fs_kvzalloc(MAIN_SEGS(sbi) * |
1995 | sizeof(struct seg_entry), GFP_KERNEL); | |
351df4b2 JK |
1996 | if (!sit_i->sentries) |
1997 | return -ENOMEM; | |
1998 | ||
7cd8558b | 1999 | bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi)); |
39307a8e | 2000 | sit_i->dirty_sentries_bitmap = f2fs_kvzalloc(bitmap_size, GFP_KERNEL); |
351df4b2 JK |
2001 | if (!sit_i->dirty_sentries_bitmap) |
2002 | return -ENOMEM; | |
2003 | ||
7cd8558b | 2004 | for (start = 0; start < MAIN_SEGS(sbi); start++) { |
351df4b2 JK |
2005 | sit_i->sentries[start].cur_valid_map |
2006 | = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL); | |
2007 | sit_i->sentries[start].ckpt_valid_map | |
2008 | = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL); | |
a66cdd98 JK |
2009 | sit_i->sentries[start].discard_map |
2010 | = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL); | |
2011 | if (!sit_i->sentries[start].cur_valid_map || | |
2012 | !sit_i->sentries[start].ckpt_valid_map || | |
2013 | !sit_i->sentries[start].discard_map) | |
351df4b2 JK |
2014 | return -ENOMEM; |
2015 | } | |
2016 | ||
60a3b782 JK |
2017 | sit_i->tmp_map = kzalloc(SIT_VBLOCK_MAP_SIZE, GFP_KERNEL); |
2018 | if (!sit_i->tmp_map) | |
2019 | return -ENOMEM; | |
2020 | ||
351df4b2 | 2021 | if (sbi->segs_per_sec > 1) { |
39307a8e JK |
2022 | sit_i->sec_entries = f2fs_kvzalloc(MAIN_SECS(sbi) * |
2023 | sizeof(struct sec_entry), GFP_KERNEL); | |
351df4b2 JK |
2024 | if (!sit_i->sec_entries) |
2025 | return -ENOMEM; | |
2026 | } | |
2027 | ||
2028 | /* get information related with SIT */ | |
2029 | sit_segs = le32_to_cpu(raw_super->segment_count_sit) >> 1; | |
2030 | ||
2031 | /* setup SIT bitmap from ckeckpoint pack */ | |
2032 | bitmap_size = __bitmap_size(sbi, SIT_BITMAP); | |
2033 | src_bitmap = __bitmap_ptr(sbi, SIT_BITMAP); | |
2034 | ||
79b5793b | 2035 | dst_bitmap = kmemdup(src_bitmap, bitmap_size, GFP_KERNEL); |
351df4b2 JK |
2036 | if (!dst_bitmap) |
2037 | return -ENOMEM; | |
351df4b2 JK |
2038 | |
2039 | /* init SIT information */ | |
2040 | sit_i->s_ops = &default_salloc_ops; | |
2041 | ||
2042 | sit_i->sit_base_addr = le32_to_cpu(raw_super->sit_blkaddr); | |
2043 | sit_i->sit_blocks = sit_segs << sbi->log_blocks_per_seg; | |
2044 | sit_i->written_valid_blocks = le64_to_cpu(ckpt->valid_block_count); | |
2045 | sit_i->sit_bitmap = dst_bitmap; | |
2046 | sit_i->bitmap_size = bitmap_size; | |
2047 | sit_i->dirty_sentries = 0; | |
2048 | sit_i->sents_per_block = SIT_ENTRY_PER_BLOCK; | |
2049 | sit_i->elapsed_time = le64_to_cpu(sbi->ckpt->elapsed_time); | |
2050 | sit_i->mounted_time = CURRENT_TIME_SEC.tv_sec; | |
2051 | mutex_init(&sit_i->sentry_lock); | |
2052 | return 0; | |
2053 | } | |
2054 | ||
2055 | static int build_free_segmap(struct f2fs_sb_info *sbi) | |
2056 | { | |
351df4b2 JK |
2057 | struct free_segmap_info *free_i; |
2058 | unsigned int bitmap_size, sec_bitmap_size; | |
2059 | ||
2060 | /* allocate memory for free segmap information */ | |
2061 | free_i = kzalloc(sizeof(struct free_segmap_info), GFP_KERNEL); | |
2062 | if (!free_i) | |
2063 | return -ENOMEM; | |
2064 | ||
2065 | SM_I(sbi)->free_info = free_i; | |
2066 | ||
7cd8558b | 2067 | bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi)); |
39307a8e | 2068 | free_i->free_segmap = f2fs_kvmalloc(bitmap_size, GFP_KERNEL); |
351df4b2 JK |
2069 | if (!free_i->free_segmap) |
2070 | return -ENOMEM; | |
2071 | ||
7cd8558b | 2072 | sec_bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi)); |
39307a8e | 2073 | free_i->free_secmap = f2fs_kvmalloc(sec_bitmap_size, GFP_KERNEL); |
351df4b2 JK |
2074 | if (!free_i->free_secmap) |
2075 | return -ENOMEM; | |
2076 | ||
2077 | /* set all segments as dirty temporarily */ | |
2078 | memset(free_i->free_segmap, 0xff, bitmap_size); | |
2079 | memset(free_i->free_secmap, 0xff, sec_bitmap_size); | |
2080 | ||
2081 | /* init free segmap information */ | |
7cd8558b | 2082 | free_i->start_segno = GET_SEGNO_FROM_SEG0(sbi, MAIN_BLKADDR(sbi)); |
351df4b2 JK |
2083 | free_i->free_segments = 0; |
2084 | free_i->free_sections = 0; | |
1a118ccf | 2085 | spin_lock_init(&free_i->segmap_lock); |
351df4b2 JK |
2086 | return 0; |
2087 | } | |
2088 | ||
2089 | static int build_curseg(struct f2fs_sb_info *sbi) | |
2090 | { | |
1042d60f | 2091 | struct curseg_info *array; |
351df4b2 JK |
2092 | int i; |
2093 | ||
b434babf | 2094 | array = kcalloc(NR_CURSEG_TYPE, sizeof(*array), GFP_KERNEL); |
351df4b2 JK |
2095 | if (!array) |
2096 | return -ENOMEM; | |
2097 | ||
2098 | SM_I(sbi)->curseg_array = array; | |
2099 | ||
2100 | for (i = 0; i < NR_CURSEG_TYPE; i++) { | |
2101 | mutex_init(&array[i].curseg_mutex); | |
2102 | array[i].sum_blk = kzalloc(PAGE_CACHE_SIZE, GFP_KERNEL); | |
2103 | if (!array[i].sum_blk) | |
2104 | return -ENOMEM; | |
2105 | array[i].segno = NULL_SEGNO; | |
2106 | array[i].next_blkoff = 0; | |
2107 | } | |
2108 | return restore_curseg_summaries(sbi); | |
2109 | } | |
2110 | ||
2111 | static void build_sit_entries(struct f2fs_sb_info *sbi) | |
2112 | { | |
2113 | struct sit_info *sit_i = SIT_I(sbi); | |
2114 | struct curseg_info *curseg = CURSEG_I(sbi, CURSEG_COLD_DATA); | |
2115 | struct f2fs_summary_block *sum = curseg->sum_blk; | |
74de593a CY |
2116 | int sit_blk_cnt = SIT_BLK_CNT(sbi); |
2117 | unsigned int i, start, end; | |
2118 | unsigned int readed, start_blk = 0; | |
90a893c7 | 2119 | int nrpages = MAX_BIO_BLOCKS(sbi); |
351df4b2 | 2120 | |
74de593a | 2121 | do { |
26879fb1 | 2122 | readed = ra_meta_pages(sbi, start_blk, nrpages, META_SIT, true); |
74de593a CY |
2123 | |
2124 | start = start_blk * sit_i->sents_per_block; | |
2125 | end = (start_blk + readed) * sit_i->sents_per_block; | |
2126 | ||
7cd8558b | 2127 | for (; start < end && start < MAIN_SEGS(sbi); start++) { |
74de593a CY |
2128 | struct seg_entry *se = &sit_i->sentries[start]; |
2129 | struct f2fs_sit_block *sit_blk; | |
2130 | struct f2fs_sit_entry sit; | |
2131 | struct page *page; | |
2132 | ||
2133 | mutex_lock(&curseg->curseg_mutex); | |
2134 | for (i = 0; i < sits_in_cursum(sum); i++) { | |
6c311ec6 CF |
2135 | if (le32_to_cpu(segno_in_journal(sum, i)) |
2136 | == start) { | |
74de593a CY |
2137 | sit = sit_in_journal(sum, i); |
2138 | mutex_unlock(&curseg->curseg_mutex); | |
2139 | goto got_it; | |
2140 | } | |
351df4b2 | 2141 | } |
74de593a CY |
2142 | mutex_unlock(&curseg->curseg_mutex); |
2143 | ||
2144 | page = get_current_sit_page(sbi, start); | |
2145 | sit_blk = (struct f2fs_sit_block *)page_address(page); | |
2146 | sit = sit_blk->entries[SIT_ENTRY_OFFSET(sit_i, start)]; | |
2147 | f2fs_put_page(page, 1); | |
351df4b2 | 2148 | got_it: |
74de593a CY |
2149 | check_block_count(sbi, start, &sit); |
2150 | seg_info_from_raw_sit(se, &sit); | |
a66cdd98 JK |
2151 | |
2152 | /* build discard map only one time */ | |
2153 | memcpy(se->discard_map, se->cur_valid_map, SIT_VBLOCK_MAP_SIZE); | |
2154 | sbi->discard_blks += sbi->blocks_per_seg - se->valid_blocks; | |
2155 | ||
74de593a CY |
2156 | if (sbi->segs_per_sec > 1) { |
2157 | struct sec_entry *e = get_sec_entry(sbi, start); | |
2158 | e->valid_blocks += se->valid_blocks; | |
2159 | } | |
351df4b2 | 2160 | } |
74de593a CY |
2161 | start_blk += readed; |
2162 | } while (start_blk < sit_blk_cnt); | |
351df4b2 JK |
2163 | } |
2164 | ||
2165 | static void init_free_segmap(struct f2fs_sb_info *sbi) | |
2166 | { | |
2167 | unsigned int start; | |
2168 | int type; | |
2169 | ||
7cd8558b | 2170 | for (start = 0; start < MAIN_SEGS(sbi); start++) { |
351df4b2 JK |
2171 | struct seg_entry *sentry = get_seg_entry(sbi, start); |
2172 | if (!sentry->valid_blocks) | |
2173 | __set_free(sbi, start); | |
2174 | } | |
2175 | ||
2176 | /* set use the current segments */ | |
2177 | for (type = CURSEG_HOT_DATA; type <= CURSEG_COLD_NODE; type++) { | |
2178 | struct curseg_info *curseg_t = CURSEG_I(sbi, type); | |
2179 | __set_test_and_inuse(sbi, curseg_t->segno); | |
2180 | } | |
2181 | } | |
2182 | ||
2183 | static void init_dirty_segmap(struct f2fs_sb_info *sbi) | |
2184 | { | |
2185 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
2186 | struct free_segmap_info *free_i = FREE_I(sbi); | |
7cd8558b | 2187 | unsigned int segno = 0, offset = 0; |
351df4b2 JK |
2188 | unsigned short valid_blocks; |
2189 | ||
8736fbf0 | 2190 | while (1) { |
351df4b2 | 2191 | /* find dirty segment based on free segmap */ |
7cd8558b JK |
2192 | segno = find_next_inuse(free_i, MAIN_SEGS(sbi), offset); |
2193 | if (segno >= MAIN_SEGS(sbi)) | |
351df4b2 JK |
2194 | break; |
2195 | offset = segno + 1; | |
2196 | valid_blocks = get_valid_blocks(sbi, segno, 0); | |
ec325b52 | 2197 | if (valid_blocks == sbi->blocks_per_seg || !valid_blocks) |
351df4b2 | 2198 | continue; |
ec325b52 JK |
2199 | if (valid_blocks > sbi->blocks_per_seg) { |
2200 | f2fs_bug_on(sbi, 1); | |
2201 | continue; | |
2202 | } | |
351df4b2 JK |
2203 | mutex_lock(&dirty_i->seglist_lock); |
2204 | __locate_dirty_segment(sbi, segno, DIRTY); | |
2205 | mutex_unlock(&dirty_i->seglist_lock); | |
2206 | } | |
2207 | } | |
2208 | ||
5ec4e49f | 2209 | static int init_victim_secmap(struct f2fs_sb_info *sbi) |
351df4b2 JK |
2210 | { |
2211 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
7cd8558b | 2212 | unsigned int bitmap_size = f2fs_bitmap_size(MAIN_SECS(sbi)); |
351df4b2 | 2213 | |
39307a8e | 2214 | dirty_i->victim_secmap = f2fs_kvzalloc(bitmap_size, GFP_KERNEL); |
5ec4e49f | 2215 | if (!dirty_i->victim_secmap) |
351df4b2 JK |
2216 | return -ENOMEM; |
2217 | return 0; | |
2218 | } | |
2219 | ||
2220 | static int build_dirty_segmap(struct f2fs_sb_info *sbi) | |
2221 | { | |
2222 | struct dirty_seglist_info *dirty_i; | |
2223 | unsigned int bitmap_size, i; | |
2224 | ||
2225 | /* allocate memory for dirty segments list information */ | |
2226 | dirty_i = kzalloc(sizeof(struct dirty_seglist_info), GFP_KERNEL); | |
2227 | if (!dirty_i) | |
2228 | return -ENOMEM; | |
2229 | ||
2230 | SM_I(sbi)->dirty_info = dirty_i; | |
2231 | mutex_init(&dirty_i->seglist_lock); | |
2232 | ||
7cd8558b | 2233 | bitmap_size = f2fs_bitmap_size(MAIN_SEGS(sbi)); |
351df4b2 JK |
2234 | |
2235 | for (i = 0; i < NR_DIRTY_TYPE; i++) { | |
39307a8e | 2236 | dirty_i->dirty_segmap[i] = f2fs_kvzalloc(bitmap_size, GFP_KERNEL); |
351df4b2 JK |
2237 | if (!dirty_i->dirty_segmap[i]) |
2238 | return -ENOMEM; | |
2239 | } | |
2240 | ||
2241 | init_dirty_segmap(sbi); | |
5ec4e49f | 2242 | return init_victim_secmap(sbi); |
351df4b2 JK |
2243 | } |
2244 | ||
0a8165d7 | 2245 | /* |
351df4b2 JK |
2246 | * Update min, max modified time for cost-benefit GC algorithm |
2247 | */ | |
2248 | static void init_min_max_mtime(struct f2fs_sb_info *sbi) | |
2249 | { | |
2250 | struct sit_info *sit_i = SIT_I(sbi); | |
2251 | unsigned int segno; | |
2252 | ||
2253 | mutex_lock(&sit_i->sentry_lock); | |
2254 | ||
2255 | sit_i->min_mtime = LLONG_MAX; | |
2256 | ||
7cd8558b | 2257 | for (segno = 0; segno < MAIN_SEGS(sbi); segno += sbi->segs_per_sec) { |
351df4b2 JK |
2258 | unsigned int i; |
2259 | unsigned long long mtime = 0; | |
2260 | ||
2261 | for (i = 0; i < sbi->segs_per_sec; i++) | |
2262 | mtime += get_seg_entry(sbi, segno + i)->mtime; | |
2263 | ||
2264 | mtime = div_u64(mtime, sbi->segs_per_sec); | |
2265 | ||
2266 | if (sit_i->min_mtime > mtime) | |
2267 | sit_i->min_mtime = mtime; | |
2268 | } | |
2269 | sit_i->max_mtime = get_mtime(sbi); | |
2270 | mutex_unlock(&sit_i->sentry_lock); | |
2271 | } | |
2272 | ||
2273 | int build_segment_manager(struct f2fs_sb_info *sbi) | |
2274 | { | |
2275 | struct f2fs_super_block *raw_super = F2FS_RAW_SUPER(sbi); | |
2276 | struct f2fs_checkpoint *ckpt = F2FS_CKPT(sbi); | |
1042d60f | 2277 | struct f2fs_sm_info *sm_info; |
351df4b2 JK |
2278 | int err; |
2279 | ||
2280 | sm_info = kzalloc(sizeof(struct f2fs_sm_info), GFP_KERNEL); | |
2281 | if (!sm_info) | |
2282 | return -ENOMEM; | |
2283 | ||
2284 | /* init sm info */ | |
2285 | sbi->sm_info = sm_info; | |
351df4b2 JK |
2286 | sm_info->seg0_blkaddr = le32_to_cpu(raw_super->segment0_blkaddr); |
2287 | sm_info->main_blkaddr = le32_to_cpu(raw_super->main_blkaddr); | |
2288 | sm_info->segment_count = le32_to_cpu(raw_super->segment_count); | |
2289 | sm_info->reserved_segments = le32_to_cpu(ckpt->rsvd_segment_count); | |
2290 | sm_info->ovp_segments = le32_to_cpu(ckpt->overprov_segment_count); | |
2291 | sm_info->main_segments = le32_to_cpu(raw_super->segment_count_main); | |
2292 | sm_info->ssa_blkaddr = le32_to_cpu(raw_super->ssa_blkaddr); | |
58c41035 JK |
2293 | sm_info->rec_prefree_segments = sm_info->main_segments * |
2294 | DEF_RECLAIM_PREFREE_SEGMENTS / 100; | |
9b5f136f | 2295 | sm_info->ipu_policy = 1 << F2FS_IPU_FSYNC; |
216fbd64 | 2296 | sm_info->min_ipu_util = DEF_MIN_IPU_UTIL; |
c1ce1b02 | 2297 | sm_info->min_fsync_blocks = DEF_MIN_FSYNC_BLOCKS; |
351df4b2 | 2298 | |
7fd9e544 JK |
2299 | INIT_LIST_HEAD(&sm_info->discard_list); |
2300 | sm_info->nr_discards = 0; | |
2301 | sm_info->max_discards = 0; | |
2302 | ||
bba681cb JK |
2303 | sm_info->trim_sections = DEF_BATCHED_TRIM_SECTIONS; |
2304 | ||
184a5cd2 CY |
2305 | INIT_LIST_HEAD(&sm_info->sit_entry_set); |
2306 | ||
b270ad6f | 2307 | if (test_opt(sbi, FLUSH_MERGE) && !f2fs_readonly(sbi->sb)) { |
2163d198 GZ |
2308 | err = create_flush_cmd_control(sbi); |
2309 | if (err) | |
a688b9d9 | 2310 | return err; |
6b4afdd7 JK |
2311 | } |
2312 | ||
351df4b2 JK |
2313 | err = build_sit_info(sbi); |
2314 | if (err) | |
2315 | return err; | |
2316 | err = build_free_segmap(sbi); | |
2317 | if (err) | |
2318 | return err; | |
2319 | err = build_curseg(sbi); | |
2320 | if (err) | |
2321 | return err; | |
2322 | ||
2323 | /* reinit free segmap based on SIT */ | |
2324 | build_sit_entries(sbi); | |
2325 | ||
2326 | init_free_segmap(sbi); | |
2327 | err = build_dirty_segmap(sbi); | |
2328 | if (err) | |
2329 | return err; | |
2330 | ||
2331 | init_min_max_mtime(sbi); | |
2332 | return 0; | |
2333 | } | |
2334 | ||
2335 | static void discard_dirty_segmap(struct f2fs_sb_info *sbi, | |
2336 | enum dirty_type dirty_type) | |
2337 | { | |
2338 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
2339 | ||
2340 | mutex_lock(&dirty_i->seglist_lock); | |
39307a8e | 2341 | kvfree(dirty_i->dirty_segmap[dirty_type]); |
351df4b2 JK |
2342 | dirty_i->nr_dirty[dirty_type] = 0; |
2343 | mutex_unlock(&dirty_i->seglist_lock); | |
2344 | } | |
2345 | ||
5ec4e49f | 2346 | static void destroy_victim_secmap(struct f2fs_sb_info *sbi) |
351df4b2 JK |
2347 | { |
2348 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
39307a8e | 2349 | kvfree(dirty_i->victim_secmap); |
351df4b2 JK |
2350 | } |
2351 | ||
2352 | static void destroy_dirty_segmap(struct f2fs_sb_info *sbi) | |
2353 | { | |
2354 | struct dirty_seglist_info *dirty_i = DIRTY_I(sbi); | |
2355 | int i; | |
2356 | ||
2357 | if (!dirty_i) | |
2358 | return; | |
2359 | ||
2360 | /* discard pre-free/dirty segments list */ | |
2361 | for (i = 0; i < NR_DIRTY_TYPE; i++) | |
2362 | discard_dirty_segmap(sbi, i); | |
2363 | ||
5ec4e49f | 2364 | destroy_victim_secmap(sbi); |
351df4b2 JK |
2365 | SM_I(sbi)->dirty_info = NULL; |
2366 | kfree(dirty_i); | |
2367 | } | |
2368 | ||
2369 | static void destroy_curseg(struct f2fs_sb_info *sbi) | |
2370 | { | |
2371 | struct curseg_info *array = SM_I(sbi)->curseg_array; | |
2372 | int i; | |
2373 | ||
2374 | if (!array) | |
2375 | return; | |
2376 | SM_I(sbi)->curseg_array = NULL; | |
2377 | for (i = 0; i < NR_CURSEG_TYPE; i++) | |
2378 | kfree(array[i].sum_blk); | |
2379 | kfree(array); | |
2380 | } | |
2381 | ||
2382 | static void destroy_free_segmap(struct f2fs_sb_info *sbi) | |
2383 | { | |
2384 | struct free_segmap_info *free_i = SM_I(sbi)->free_info; | |
2385 | if (!free_i) | |
2386 | return; | |
2387 | SM_I(sbi)->free_info = NULL; | |
39307a8e JK |
2388 | kvfree(free_i->free_segmap); |
2389 | kvfree(free_i->free_secmap); | |
351df4b2 JK |
2390 | kfree(free_i); |
2391 | } | |
2392 | ||
2393 | static void destroy_sit_info(struct f2fs_sb_info *sbi) | |
2394 | { | |
2395 | struct sit_info *sit_i = SIT_I(sbi); | |
2396 | unsigned int start; | |
2397 | ||
2398 | if (!sit_i) | |
2399 | return; | |
2400 | ||
2401 | if (sit_i->sentries) { | |
7cd8558b | 2402 | for (start = 0; start < MAIN_SEGS(sbi); start++) { |
351df4b2 JK |
2403 | kfree(sit_i->sentries[start].cur_valid_map); |
2404 | kfree(sit_i->sentries[start].ckpt_valid_map); | |
a66cdd98 | 2405 | kfree(sit_i->sentries[start].discard_map); |
351df4b2 JK |
2406 | } |
2407 | } | |
60a3b782 JK |
2408 | kfree(sit_i->tmp_map); |
2409 | ||
39307a8e JK |
2410 | kvfree(sit_i->sentries); |
2411 | kvfree(sit_i->sec_entries); | |
2412 | kvfree(sit_i->dirty_sentries_bitmap); | |
351df4b2 JK |
2413 | |
2414 | SM_I(sbi)->sit_info = NULL; | |
2415 | kfree(sit_i->sit_bitmap); | |
2416 | kfree(sit_i); | |
2417 | } | |
2418 | ||
2419 | void destroy_segment_manager(struct f2fs_sb_info *sbi) | |
2420 | { | |
2421 | struct f2fs_sm_info *sm_info = SM_I(sbi); | |
a688b9d9 | 2422 | |
3b03f724 CY |
2423 | if (!sm_info) |
2424 | return; | |
2163d198 | 2425 | destroy_flush_cmd_control(sbi); |
351df4b2 JK |
2426 | destroy_dirty_segmap(sbi); |
2427 | destroy_curseg(sbi); | |
2428 | destroy_free_segmap(sbi); | |
2429 | destroy_sit_info(sbi); | |
2430 | sbi->sm_info = NULL; | |
2431 | kfree(sm_info); | |
2432 | } | |
7fd9e544 JK |
2433 | |
2434 | int __init create_segment_manager_caches(void) | |
2435 | { | |
2436 | discard_entry_slab = f2fs_kmem_cache_create("discard_entry", | |
e8512d2e | 2437 | sizeof(struct discard_entry)); |
7fd9e544 | 2438 | if (!discard_entry_slab) |
184a5cd2 CY |
2439 | goto fail; |
2440 | ||
2441 | sit_entry_set_slab = f2fs_kmem_cache_create("sit_entry_set", | |
c9ee0085 | 2442 | sizeof(struct sit_entry_set)); |
184a5cd2 CY |
2443 | if (!sit_entry_set_slab) |
2444 | goto destory_discard_entry; | |
88b88a66 JK |
2445 | |
2446 | inmem_entry_slab = f2fs_kmem_cache_create("inmem_page_entry", | |
2447 | sizeof(struct inmem_pages)); | |
2448 | if (!inmem_entry_slab) | |
2449 | goto destroy_sit_entry_set; | |
7fd9e544 | 2450 | return 0; |
184a5cd2 | 2451 | |
88b88a66 JK |
2452 | destroy_sit_entry_set: |
2453 | kmem_cache_destroy(sit_entry_set_slab); | |
184a5cd2 CY |
2454 | destory_discard_entry: |
2455 | kmem_cache_destroy(discard_entry_slab); | |
2456 | fail: | |
2457 | return -ENOMEM; | |
7fd9e544 JK |
2458 | } |
2459 | ||
2460 | void destroy_segment_manager_caches(void) | |
2461 | { | |
184a5cd2 | 2462 | kmem_cache_destroy(sit_entry_set_slab); |
7fd9e544 | 2463 | kmem_cache_destroy(discard_entry_slab); |
88b88a66 | 2464 | kmem_cache_destroy(inmem_entry_slab); |
7fd9e544 | 2465 | } |