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