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