2 * Copyright (C) 2016 CNEX Labs
3 * Initial release: Javier Gonzalez <javier@cnexlabs.com>
4 * Matias Bjorling <matias@cnexlabs.com>
6 * This program is free software; you can redistribute it and/or
7 * modify it under the terms of the GNU General Public License version
8 * 2 as published by the Free Software Foundation.
10 * This program is distributed in the hope that it will be useful, but
11 * WITHOUT ANY WARRANTY; without even the implied warranty of
12 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
13 * General Public License for more details.
15 * pblk-core.c - pblk's core functionality
21 static void pblk_line_mark_bb(struct work_struct *work)
23 struct pblk_line_ws *line_ws = container_of(work, struct pblk_line_ws,
25 struct pblk *pblk = line_ws->pblk;
26 struct nvm_tgt_dev *dev = pblk->dev;
27 struct ppa_addr *ppa = line_ws->priv;
30 ret = nvm_set_tgt_bb_tbl(dev, ppa, 1, NVM_BLK_T_GRWN_BAD);
32 struct pblk_line *line;
35 line = &pblk->lines[pblk_dev_ppa_to_line(*ppa)];
36 pos = pblk_dev_ppa_to_pos(&dev->geo, *ppa);
38 pr_err("pblk: failed to mark bb, line:%d, pos:%d\n",
43 mempool_free(line_ws, pblk->gen_ws_pool);
46 static void pblk_mark_bb(struct pblk *pblk, struct pblk_line *line,
49 struct nvm_tgt_dev *dev = pblk->dev;
50 struct nvm_geo *geo = &dev->geo;
51 int pos = pblk_dev_ppa_to_pos(geo, *ppa);
53 pr_debug("pblk: erase failed: line:%d, pos:%d\n", line->id, pos);
54 atomic_long_inc(&pblk->erase_failed);
56 atomic_dec(&line->blk_in_line);
57 if (test_and_set_bit(pos, line->blk_bitmap))
58 pr_err("pblk: attempted to erase bb: line:%d, pos:%d\n",
61 pblk_gen_run_ws(pblk, NULL, ppa, pblk_line_mark_bb,
62 GFP_ATOMIC, pblk->bb_wq);
65 static void __pblk_end_io_erase(struct pblk *pblk, struct nvm_rq *rqd)
67 struct pblk_line *line;
69 line = &pblk->lines[pblk_dev_ppa_to_line(rqd->ppa_addr)];
70 atomic_dec(&line->left_seblks);
75 ppa = kmalloc(sizeof(struct ppa_addr), GFP_ATOMIC);
80 pblk_mark_bb(pblk, line, ppa);
83 atomic_dec(&pblk->inflight_io);
86 /* Erase completion assumes that only one block is erased at the time */
87 static void pblk_end_io_erase(struct nvm_rq *rqd)
89 struct pblk *pblk = rqd->private;
91 __pblk_end_io_erase(pblk, rqd);
92 mempool_free(rqd, pblk->e_rq_pool);
95 void __pblk_map_invalidate(struct pblk *pblk, struct pblk_line *line,
98 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
99 struct list_head *move_list = NULL;
101 /* Lines being reclaimed (GC'ed) cannot be invalidated. Before the L2P
102 * table is modified with reclaimed sectors, a check is done to endure
103 * that newer updates are not overwritten.
105 spin_lock(&line->lock);
106 WARN_ON(line->state == PBLK_LINESTATE_FREE);
108 if (test_and_set_bit(paddr, line->invalid_bitmap)) {
109 WARN_ONCE(1, "pblk: double invalidate\n");
110 spin_unlock(&line->lock);
113 le32_add_cpu(line->vsc, -1);
115 if (line->state == PBLK_LINESTATE_CLOSED)
116 move_list = pblk_line_gc_list(pblk, line);
117 spin_unlock(&line->lock);
120 spin_lock(&l_mg->gc_lock);
121 spin_lock(&line->lock);
122 /* Prevent moving a line that has just been chosen for GC */
123 if (line->state == PBLK_LINESTATE_GC) {
124 spin_unlock(&line->lock);
125 spin_unlock(&l_mg->gc_lock);
128 spin_unlock(&line->lock);
130 list_move_tail(&line->list, move_list);
131 spin_unlock(&l_mg->gc_lock);
135 void pblk_map_invalidate(struct pblk *pblk, struct ppa_addr ppa)
137 struct pblk_line *line;
141 #ifdef CONFIG_NVM_DEBUG
142 /* Callers must ensure that the ppa points to a device address */
143 BUG_ON(pblk_addr_in_cache(ppa));
144 BUG_ON(pblk_ppa_empty(ppa));
147 line_id = pblk_tgt_ppa_to_line(ppa);
148 line = &pblk->lines[line_id];
149 paddr = pblk_dev_ppa_to_line_addr(pblk, ppa);
151 __pblk_map_invalidate(pblk, line, paddr);
154 static void pblk_invalidate_range(struct pblk *pblk, sector_t slba,
155 unsigned int nr_secs)
159 spin_lock(&pblk->trans_lock);
160 for (lba = slba; lba < slba + nr_secs; lba++) {
163 ppa = pblk_trans_map_get(pblk, lba);
165 if (!pblk_addr_in_cache(ppa) && !pblk_ppa_empty(ppa))
166 pblk_map_invalidate(pblk, ppa);
168 pblk_ppa_set_empty(&ppa);
169 pblk_trans_map_set(pblk, lba, ppa);
171 spin_unlock(&pblk->trans_lock);
174 /* Caller must guarantee that the request is a valid type */
175 struct nvm_rq *pblk_alloc_rqd(struct pblk *pblk, int type)
184 pool = pblk->w_rq_pool;
185 rq_size = pblk_w_rq_size;
188 pool = pblk->r_rq_pool;
189 rq_size = pblk_g_rq_size;
192 pool = pblk->e_rq_pool;
193 rq_size = pblk_g_rq_size;
196 rqd = mempool_alloc(pool, GFP_KERNEL);
197 memset(rqd, 0, rq_size);
202 /* Typically used on completion path. Cannot guarantee request consistency */
203 void pblk_free_rqd(struct pblk *pblk, struct nvm_rq *rqd, int type)
205 struct nvm_tgt_dev *dev = pblk->dev;
210 kfree(((struct pblk_c_ctx *)nvm_rq_to_pdu(rqd))->lun_bitmap);
212 pool = pblk->w_rq_pool;
215 pool = pblk->r_rq_pool;
218 pool = pblk->e_rq_pool;
221 pr_err("pblk: trying to free unknown rqd type\n");
225 nvm_dev_dma_free(dev->parent, rqd->meta_list, rqd->dma_meta_list);
226 mempool_free(rqd, pool);
229 void pblk_bio_free_pages(struct pblk *pblk, struct bio *bio, int off,
235 WARN_ON(off + nr_pages != bio->bi_vcnt);
237 for (i = off; i < nr_pages + off; i++) {
238 bv = bio->bi_io_vec[i];
239 mempool_free(bv.bv_page, pblk->page_bio_pool);
243 int pblk_bio_add_pages(struct pblk *pblk, struct bio *bio, gfp_t flags,
246 struct request_queue *q = pblk->dev->q;
250 for (i = 0; i < nr_pages; i++) {
251 page = mempool_alloc(pblk->page_bio_pool, flags);
253 ret = bio_add_pc_page(q, bio, page, PBLK_EXPOSED_PAGE_SIZE, 0);
254 if (ret != PBLK_EXPOSED_PAGE_SIZE) {
255 pr_err("pblk: could not add page to bio\n");
256 mempool_free(page, pblk->page_bio_pool);
263 pblk_bio_free_pages(pblk, bio, 0, i - 1);
267 static void pblk_write_kick(struct pblk *pblk)
269 wake_up_process(pblk->writer_ts);
270 mod_timer(&pblk->wtimer, jiffies + msecs_to_jiffies(1000));
273 void pblk_write_timer_fn(struct timer_list *t)
275 struct pblk *pblk = from_timer(pblk, t, wtimer);
277 /* kick the write thread every tick to flush outstanding data */
278 pblk_write_kick(pblk);
281 void pblk_write_should_kick(struct pblk *pblk)
283 unsigned int secs_avail = pblk_rb_read_count(&pblk->rwb);
285 if (secs_avail >= pblk->min_write_pgs)
286 pblk_write_kick(pblk);
289 void pblk_end_io_sync(struct nvm_rq *rqd)
291 struct completion *waiting = rqd->private;
296 static void pblk_wait_for_meta(struct pblk *pblk)
299 if (!atomic_read(&pblk->inflight_io))
306 static void pblk_flush_writer(struct pblk *pblk)
308 pblk_rb_flush(&pblk->rwb);
310 if (!pblk_rb_sync_count(&pblk->rwb))
313 pblk_write_kick(pblk);
318 struct list_head *pblk_line_gc_list(struct pblk *pblk, struct pblk_line *line)
320 struct pblk_line_meta *lm = &pblk->lm;
321 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
322 struct list_head *move_list = NULL;
323 int vsc = le32_to_cpu(*line->vsc);
325 lockdep_assert_held(&line->lock);
328 if (line->gc_group != PBLK_LINEGC_FULL) {
329 line->gc_group = PBLK_LINEGC_FULL;
330 move_list = &l_mg->gc_full_list;
332 } else if (vsc < lm->high_thrs) {
333 if (line->gc_group != PBLK_LINEGC_HIGH) {
334 line->gc_group = PBLK_LINEGC_HIGH;
335 move_list = &l_mg->gc_high_list;
337 } else if (vsc < lm->mid_thrs) {
338 if (line->gc_group != PBLK_LINEGC_MID) {
339 line->gc_group = PBLK_LINEGC_MID;
340 move_list = &l_mg->gc_mid_list;
342 } else if (vsc < line->sec_in_line) {
343 if (line->gc_group != PBLK_LINEGC_LOW) {
344 line->gc_group = PBLK_LINEGC_LOW;
345 move_list = &l_mg->gc_low_list;
347 } else if (vsc == line->sec_in_line) {
348 if (line->gc_group != PBLK_LINEGC_EMPTY) {
349 line->gc_group = PBLK_LINEGC_EMPTY;
350 move_list = &l_mg->gc_empty_list;
353 line->state = PBLK_LINESTATE_CORRUPT;
354 line->gc_group = PBLK_LINEGC_NONE;
355 move_list = &l_mg->corrupt_list;
356 pr_err("pblk: corrupted vsc for line %d, vsc:%d (%d/%d/%d)\n",
359 lm->high_thrs, lm->mid_thrs);
365 void pblk_discard(struct pblk *pblk, struct bio *bio)
367 sector_t slba = pblk_get_lba(bio);
368 sector_t nr_secs = pblk_get_secs(bio);
370 pblk_invalidate_range(pblk, slba, nr_secs);
373 void pblk_log_write_err(struct pblk *pblk, struct nvm_rq *rqd)
375 atomic_long_inc(&pblk->write_failed);
376 #ifdef CONFIG_NVM_DEBUG
377 pblk_print_failed_rqd(pblk, rqd, rqd->error);
381 void pblk_log_read_err(struct pblk *pblk, struct nvm_rq *rqd)
383 /* Empty page read is not necessarily an error (e.g., L2P recovery) */
384 if (rqd->error == NVM_RSP_ERR_EMPTYPAGE) {
385 atomic_long_inc(&pblk->read_empty);
389 switch (rqd->error) {
390 case NVM_RSP_WARN_HIGHECC:
391 atomic_long_inc(&pblk->read_high_ecc);
393 case NVM_RSP_ERR_FAILECC:
394 case NVM_RSP_ERR_FAILCRC:
395 atomic_long_inc(&pblk->read_failed);
398 pr_err("pblk: unknown read error:%d\n", rqd->error);
400 #ifdef CONFIG_NVM_DEBUG
401 pblk_print_failed_rqd(pblk, rqd, rqd->error);
405 void pblk_set_sec_per_write(struct pblk *pblk, int sec_per_write)
407 pblk->sec_per_write = sec_per_write;
410 int pblk_submit_io(struct pblk *pblk, struct nvm_rq *rqd)
412 struct nvm_tgt_dev *dev = pblk->dev;
414 #ifdef CONFIG_NVM_DEBUG
417 ret = pblk_check_io(pblk, rqd);
422 atomic_inc(&pblk->inflight_io);
424 return nvm_submit_io(dev, rqd);
427 int pblk_submit_io_sync(struct pblk *pblk, struct nvm_rq *rqd)
429 struct nvm_tgt_dev *dev = pblk->dev;
431 #ifdef CONFIG_NVM_DEBUG
434 ret = pblk_check_io(pblk, rqd);
439 atomic_inc(&pblk->inflight_io);
441 return nvm_submit_io_sync(dev, rqd);
444 static void pblk_bio_map_addr_endio(struct bio *bio)
449 struct bio *pblk_bio_map_addr(struct pblk *pblk, void *data,
450 unsigned int nr_secs, unsigned int len,
451 int alloc_type, gfp_t gfp_mask)
453 struct nvm_tgt_dev *dev = pblk->dev;
459 if (alloc_type == PBLK_KMALLOC_META)
460 return bio_map_kern(dev->q, kaddr, len, gfp_mask);
462 bio = bio_kmalloc(gfp_mask, nr_secs);
464 return ERR_PTR(-ENOMEM);
466 for (i = 0; i < nr_secs; i++) {
467 page = vmalloc_to_page(kaddr);
469 pr_err("pblk: could not map vmalloc bio\n");
471 bio = ERR_PTR(-ENOMEM);
475 ret = bio_add_pc_page(dev->q, bio, page, PAGE_SIZE, 0);
476 if (ret != PAGE_SIZE) {
477 pr_err("pblk: could not add page to bio\n");
479 bio = ERR_PTR(-ENOMEM);
486 bio->bi_end_io = pblk_bio_map_addr_endio;
491 int pblk_calc_secs(struct pblk *pblk, unsigned long secs_avail,
492 unsigned long secs_to_flush)
494 int max = pblk->sec_per_write;
495 int min = pblk->min_write_pgs;
496 int secs_to_sync = 0;
498 if (secs_avail >= max)
500 else if (secs_avail >= min)
501 secs_to_sync = min * (secs_avail / min);
502 else if (secs_to_flush)
508 void pblk_dealloc_page(struct pblk *pblk, struct pblk_line *line, int nr_secs)
513 spin_lock(&line->lock);
514 addr = find_next_zero_bit(line->map_bitmap,
515 pblk->lm.sec_per_line, line->cur_sec);
516 line->cur_sec = addr - nr_secs;
518 for (i = 0; i < nr_secs; i++, line->cur_sec--)
519 WARN_ON(!test_and_clear_bit(line->cur_sec, line->map_bitmap));
520 spin_unlock(&line->lock);
523 u64 __pblk_alloc_page(struct pblk *pblk, struct pblk_line *line, int nr_secs)
528 lockdep_assert_held(&line->lock);
530 /* logic error: ppa out-of-bounds. Prevent generating bad address */
531 if (line->cur_sec + nr_secs > pblk->lm.sec_per_line) {
532 WARN(1, "pblk: page allocation out of bounds\n");
533 nr_secs = pblk->lm.sec_per_line - line->cur_sec;
536 line->cur_sec = addr = find_next_zero_bit(line->map_bitmap,
537 pblk->lm.sec_per_line, line->cur_sec);
538 for (i = 0; i < nr_secs; i++, line->cur_sec++)
539 WARN_ON(test_and_set_bit(line->cur_sec, line->map_bitmap));
544 u64 pblk_alloc_page(struct pblk *pblk, struct pblk_line *line, int nr_secs)
548 /* Lock needed in case a write fails and a recovery needs to remap
549 * failed write buffer entries
551 spin_lock(&line->lock);
552 addr = __pblk_alloc_page(pblk, line, nr_secs);
553 line->left_msecs -= nr_secs;
554 WARN(line->left_msecs < 0, "pblk: page allocation out of bounds\n");
555 spin_unlock(&line->lock);
560 u64 pblk_lookup_page(struct pblk *pblk, struct pblk_line *line)
564 spin_lock(&line->lock);
565 paddr = find_next_zero_bit(line->map_bitmap,
566 pblk->lm.sec_per_line, line->cur_sec);
567 spin_unlock(&line->lock);
573 * Submit emeta to one LUN in the raid line at the time to avoid a deadlock when
574 * taking the per LUN semaphore.
576 static int pblk_line_submit_emeta_io(struct pblk *pblk, struct pblk_line *line,
577 void *emeta_buf, u64 paddr, int dir)
579 struct nvm_tgt_dev *dev = pblk->dev;
580 struct nvm_geo *geo = &dev->geo;
581 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
582 struct pblk_line_meta *lm = &pblk->lm;
583 void *ppa_list, *meta_list;
586 dma_addr_t dma_ppa_list, dma_meta_list;
587 int min = pblk->min_write_pgs;
588 int left_ppas = lm->emeta_sec[0];
595 if (dir == PBLK_WRITE) {
596 bio_op = REQ_OP_WRITE;
597 cmd_op = NVM_OP_PWRITE;
598 } else if (dir == PBLK_READ) {
599 bio_op = REQ_OP_READ;
600 cmd_op = NVM_OP_PREAD;
604 meta_list = nvm_dev_dma_alloc(dev->parent, GFP_KERNEL,
609 ppa_list = meta_list + pblk_dma_meta_size;
610 dma_ppa_list = dma_meta_list + pblk_dma_meta_size;
613 memset(&rqd, 0, sizeof(struct nvm_rq));
615 rq_ppas = pblk_calc_secs(pblk, left_ppas, 0);
616 rq_len = rq_ppas * geo->sec_size;
618 bio = pblk_bio_map_addr(pblk, emeta_buf, rq_ppas, rq_len,
619 l_mg->emeta_alloc_type, GFP_KERNEL);
625 bio->bi_iter.bi_sector = 0; /* internal bio */
626 bio_set_op_attrs(bio, bio_op, 0);
629 rqd.meta_list = meta_list;
630 rqd.ppa_list = ppa_list;
631 rqd.dma_meta_list = dma_meta_list;
632 rqd.dma_ppa_list = dma_ppa_list;
634 rqd.nr_ppas = rq_ppas;
636 if (dir == PBLK_WRITE) {
637 struct pblk_sec_meta *meta_list = rqd.meta_list;
639 rqd.flags = pblk_set_progr_mode(pblk, PBLK_WRITE);
640 for (i = 0; i < rqd.nr_ppas; ) {
641 spin_lock(&line->lock);
642 paddr = __pblk_alloc_page(pblk, line, min);
643 spin_unlock(&line->lock);
644 for (j = 0; j < min; j++, i++, paddr++) {
645 meta_list[i].lba = cpu_to_le64(ADDR_EMPTY);
647 addr_to_gen_ppa(pblk, paddr, id);
651 for (i = 0; i < rqd.nr_ppas; ) {
652 struct ppa_addr ppa = addr_to_gen_ppa(pblk, paddr, id);
653 int pos = pblk_dev_ppa_to_pos(geo, ppa);
654 int read_type = PBLK_READ_RANDOM;
656 if (pblk_io_aligned(pblk, rq_ppas))
657 read_type = PBLK_READ_SEQUENTIAL;
658 rqd.flags = pblk_set_read_mode(pblk, read_type);
660 while (test_bit(pos, line->blk_bitmap)) {
662 if (pblk_boundary_paddr_checks(pblk, paddr)) {
663 pr_err("pblk: corrupt emeta line:%d\n",
670 ppa = addr_to_gen_ppa(pblk, paddr, id);
671 pos = pblk_dev_ppa_to_pos(geo, ppa);
674 if (pblk_boundary_paddr_checks(pblk, paddr + min)) {
675 pr_err("pblk: corrupt emeta line:%d\n",
682 for (j = 0; j < min; j++, i++, paddr++)
684 addr_to_gen_ppa(pblk, paddr, line->id);
688 ret = pblk_submit_io_sync(pblk, &rqd);
690 pr_err("pblk: emeta I/O submission failed: %d\n", ret);
695 atomic_dec(&pblk->inflight_io);
698 if (dir == PBLK_WRITE)
699 pblk_log_write_err(pblk, &rqd);
701 pblk_log_read_err(pblk, &rqd);
705 left_ppas -= rq_ppas;
709 nvm_dev_dma_free(dev->parent, rqd.meta_list, rqd.dma_meta_list);
713 u64 pblk_line_smeta_start(struct pblk *pblk, struct pblk_line *line)
715 struct nvm_tgt_dev *dev = pblk->dev;
716 struct nvm_geo *geo = &dev->geo;
717 struct pblk_line_meta *lm = &pblk->lm;
720 /* This usually only happens on bad lines */
721 bit = find_first_zero_bit(line->blk_bitmap, lm->blk_per_line);
722 if (bit >= lm->blk_per_line)
725 return bit * geo->sec_per_pl;
728 static int pblk_line_submit_smeta_io(struct pblk *pblk, struct pblk_line *line,
731 struct nvm_tgt_dev *dev = pblk->dev;
732 struct pblk_line_meta *lm = &pblk->lm;
735 __le64 *lba_list = NULL;
740 if (dir == PBLK_WRITE) {
741 bio_op = REQ_OP_WRITE;
742 cmd_op = NVM_OP_PWRITE;
743 flags = pblk_set_progr_mode(pblk, PBLK_WRITE);
744 lba_list = emeta_to_lbas(pblk, line->emeta->buf);
745 } else if (dir == PBLK_READ) {
746 bio_op = REQ_OP_READ;
747 cmd_op = NVM_OP_PREAD;
748 flags = pblk_set_read_mode(pblk, PBLK_READ_SEQUENTIAL);
752 memset(&rqd, 0, sizeof(struct nvm_rq));
754 rqd.meta_list = nvm_dev_dma_alloc(dev->parent, GFP_KERNEL,
759 rqd.ppa_list = rqd.meta_list + pblk_dma_meta_size;
760 rqd.dma_ppa_list = rqd.dma_meta_list + pblk_dma_meta_size;
762 bio = bio_map_kern(dev->q, line->smeta, lm->smeta_len, GFP_KERNEL);
768 bio->bi_iter.bi_sector = 0; /* internal bio */
769 bio_set_op_attrs(bio, bio_op, 0);
774 rqd.nr_ppas = lm->smeta_sec;
776 for (i = 0; i < lm->smeta_sec; i++, paddr++) {
777 struct pblk_sec_meta *meta_list = rqd.meta_list;
779 rqd.ppa_list[i] = addr_to_gen_ppa(pblk, paddr, line->id);
781 if (dir == PBLK_WRITE) {
782 __le64 addr_empty = cpu_to_le64(ADDR_EMPTY);
784 meta_list[i].lba = lba_list[paddr] = addr_empty;
789 * This I/O is sent by the write thread when a line is replace. Since
790 * the write thread is the only one sending write and erase commands,
791 * there is no need to take the LUN semaphore.
793 ret = pblk_submit_io_sync(pblk, &rqd);
795 pr_err("pblk: smeta I/O submission failed: %d\n", ret);
800 atomic_dec(&pblk->inflight_io);
803 if (dir == PBLK_WRITE)
804 pblk_log_write_err(pblk, &rqd);
806 pblk_log_read_err(pblk, &rqd);
810 nvm_dev_dma_free(dev->parent, rqd.meta_list, rqd.dma_meta_list);
815 int pblk_line_read_smeta(struct pblk *pblk, struct pblk_line *line)
817 u64 bpaddr = pblk_line_smeta_start(pblk, line);
819 return pblk_line_submit_smeta_io(pblk, line, bpaddr, PBLK_READ);
822 int pblk_line_read_emeta(struct pblk *pblk, struct pblk_line *line,
825 return pblk_line_submit_emeta_io(pblk, line, emeta_buf,
826 line->emeta_ssec, PBLK_READ);
829 static void pblk_setup_e_rq(struct pblk *pblk, struct nvm_rq *rqd,
832 rqd->opcode = NVM_OP_ERASE;
835 rqd->flags = pblk_set_progr_mode(pblk, PBLK_ERASE);
839 static int pblk_blk_erase_sync(struct pblk *pblk, struct ppa_addr ppa)
844 memset(&rqd, 0, sizeof(struct nvm_rq));
846 pblk_setup_e_rq(pblk, &rqd, ppa);
848 /* The write thread schedules erases so that it minimizes disturbances
849 * with writes. Thus, there is no need to take the LUN semaphore.
851 ret = pblk_submit_io_sync(pblk, &rqd);
853 struct nvm_tgt_dev *dev = pblk->dev;
854 struct nvm_geo *geo = &dev->geo;
856 pr_err("pblk: could not sync erase line:%d,blk:%d\n",
857 pblk_dev_ppa_to_line(ppa),
858 pblk_dev_ppa_to_pos(geo, ppa));
866 __pblk_end_io_erase(pblk, &rqd);
871 int pblk_line_erase(struct pblk *pblk, struct pblk_line *line)
873 struct pblk_line_meta *lm = &pblk->lm;
877 /* Erase only good blocks, one at a time */
879 spin_lock(&line->lock);
880 bit = find_next_zero_bit(line->erase_bitmap, lm->blk_per_line,
882 if (bit >= lm->blk_per_line) {
883 spin_unlock(&line->lock);
887 ppa = pblk->luns[bit].bppa; /* set ch and lun */
888 ppa.g.blk = line->id;
890 atomic_dec(&line->left_eblks);
891 WARN_ON(test_and_set_bit(bit, line->erase_bitmap));
892 spin_unlock(&line->lock);
894 ret = pblk_blk_erase_sync(pblk, ppa);
896 pr_err("pblk: failed to erase line %d\n", line->id);
904 static void pblk_line_setup_metadata(struct pblk_line *line,
905 struct pblk_line_mgmt *l_mg,
906 struct pblk_line_meta *lm)
910 lockdep_assert_held(&l_mg->free_lock);
913 meta_line = find_first_zero_bit(&l_mg->meta_bitmap, PBLK_DATA_LINES);
914 if (meta_line == PBLK_DATA_LINES) {
915 spin_unlock(&l_mg->free_lock);
917 spin_lock(&l_mg->free_lock);
921 set_bit(meta_line, &l_mg->meta_bitmap);
922 line->meta_line = meta_line;
924 line->smeta = l_mg->sline_meta[meta_line];
925 line->emeta = l_mg->eline_meta[meta_line];
927 memset(line->smeta, 0, lm->smeta_len);
928 memset(line->emeta->buf, 0, lm->emeta_len[0]);
930 line->emeta->mem = 0;
931 atomic_set(&line->emeta->sync, 0);
934 /* For now lines are always assumed full lines. Thus, smeta former and current
935 * lun bitmaps are omitted.
937 static int pblk_line_init_metadata(struct pblk *pblk, struct pblk_line *line,
938 struct pblk_line *cur)
940 struct nvm_tgt_dev *dev = pblk->dev;
941 struct nvm_geo *geo = &dev->geo;
942 struct pblk_line_meta *lm = &pblk->lm;
943 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
944 struct pblk_emeta *emeta = line->emeta;
945 struct line_emeta *emeta_buf = emeta->buf;
946 struct line_smeta *smeta_buf = (struct line_smeta *)line->smeta;
949 /* After erasing the line, new bad blocks might appear and we risk
950 * having an invalid line
952 nr_blk_line = lm->blk_per_line -
953 bitmap_weight(line->blk_bitmap, lm->blk_per_line);
954 if (nr_blk_line < lm->min_blk_line) {
955 spin_lock(&l_mg->free_lock);
956 spin_lock(&line->lock);
957 line->state = PBLK_LINESTATE_BAD;
958 spin_unlock(&line->lock);
960 list_add_tail(&line->list, &l_mg->bad_list);
961 spin_unlock(&l_mg->free_lock);
963 pr_debug("pblk: line %d is bad\n", line->id);
968 /* Run-time metadata */
969 line->lun_bitmap = ((void *)(smeta_buf)) + sizeof(struct line_smeta);
971 /* Mark LUNs allocated in this line (all for now) */
972 bitmap_set(line->lun_bitmap, 0, lm->lun_bitmap_len);
974 smeta_buf->header.identifier = cpu_to_le32(PBLK_MAGIC);
975 memcpy(smeta_buf->header.uuid, pblk->instance_uuid, 16);
976 smeta_buf->header.id = cpu_to_le32(line->id);
977 smeta_buf->header.type = cpu_to_le16(line->type);
978 smeta_buf->header.version = SMETA_VERSION;
981 smeta_buf->seq_nr = cpu_to_le64(line->seq_nr);
982 smeta_buf->window_wr_lun = cpu_to_le32(geo->nr_luns);
984 /* Fill metadata among lines */
986 memcpy(line->lun_bitmap, cur->lun_bitmap, lm->lun_bitmap_len);
987 smeta_buf->prev_id = cpu_to_le32(cur->id);
988 cur->emeta->buf->next_id = cpu_to_le32(line->id);
990 smeta_buf->prev_id = cpu_to_le32(PBLK_LINE_EMPTY);
993 /* All smeta must be set at this point */
994 smeta_buf->header.crc = cpu_to_le32(
995 pblk_calc_meta_header_crc(pblk, &smeta_buf->header));
996 smeta_buf->crc = cpu_to_le32(pblk_calc_smeta_crc(pblk, smeta_buf));
999 memcpy(&emeta_buf->header, &smeta_buf->header,
1000 sizeof(struct line_header));
1001 emeta_buf->seq_nr = cpu_to_le64(line->seq_nr);
1002 emeta_buf->nr_lbas = cpu_to_le64(line->sec_in_line);
1003 emeta_buf->nr_valid_lbas = cpu_to_le64(0);
1004 emeta_buf->next_id = cpu_to_le32(PBLK_LINE_EMPTY);
1005 emeta_buf->crc = cpu_to_le32(0);
1006 emeta_buf->prev_id = smeta_buf->prev_id;
1011 /* For now lines are always assumed full lines. Thus, smeta former and current
1012 * lun bitmaps are omitted.
1014 static int pblk_line_init_bb(struct pblk *pblk, struct pblk_line *line,
1017 struct nvm_tgt_dev *dev = pblk->dev;
1018 struct nvm_geo *geo = &dev->geo;
1019 struct pblk_line_meta *lm = &pblk->lm;
1020 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1025 line->sec_in_line = lm->sec_per_line;
1027 /* Capture bad block information on line mapping bitmaps */
1028 while ((bit = find_next_bit(line->blk_bitmap, lm->blk_per_line,
1029 bit + 1)) < lm->blk_per_line) {
1030 off = bit * geo->sec_per_pl;
1031 bitmap_shift_left(l_mg->bb_aux, l_mg->bb_template, off,
1033 bitmap_or(line->map_bitmap, line->map_bitmap, l_mg->bb_aux,
1035 line->sec_in_line -= geo->sec_per_blk;
1036 if (bit >= lm->emeta_bb)
1040 /* Mark smeta metadata sectors as bad sectors */
1041 bit = find_first_zero_bit(line->blk_bitmap, lm->blk_per_line);
1042 off = bit * geo->sec_per_pl;
1043 bitmap_set(line->map_bitmap, off, lm->smeta_sec);
1044 line->sec_in_line -= lm->smeta_sec;
1045 line->smeta_ssec = off;
1046 line->cur_sec = off + lm->smeta_sec;
1048 if (init && pblk_line_submit_smeta_io(pblk, line, off, PBLK_WRITE)) {
1049 pr_debug("pblk: line smeta I/O failed. Retry\n");
1053 bitmap_copy(line->invalid_bitmap, line->map_bitmap, lm->sec_per_line);
1055 /* Mark emeta metadata sectors as bad sectors. We need to consider bad
1056 * blocks to make sure that there are enough sectors to store emeta
1058 off = lm->sec_per_line - lm->emeta_sec[0];
1059 bitmap_set(line->invalid_bitmap, off, lm->emeta_sec[0]);
1061 off -= geo->sec_per_pl;
1062 if (!test_bit(off, line->invalid_bitmap)) {
1063 bitmap_set(line->invalid_bitmap, off, geo->sec_per_pl);
1068 line->sec_in_line -= lm->emeta_sec[0];
1069 line->emeta_ssec = off;
1070 line->nr_valid_lbas = 0;
1071 line->left_msecs = line->sec_in_line;
1072 *line->vsc = cpu_to_le32(line->sec_in_line);
1074 if (lm->sec_per_line - line->sec_in_line !=
1075 bitmap_weight(line->invalid_bitmap, lm->sec_per_line)) {
1076 spin_lock(&line->lock);
1077 line->state = PBLK_LINESTATE_BAD;
1078 spin_unlock(&line->lock);
1080 list_add_tail(&line->list, &l_mg->bad_list);
1081 pr_err("pblk: unexpected line %d is bad\n", line->id);
1089 static int pblk_line_prepare(struct pblk *pblk, struct pblk_line *line)
1091 struct pblk_line_meta *lm = &pblk->lm;
1092 int blk_in_line = atomic_read(&line->blk_in_line);
1094 line->map_bitmap = kzalloc(lm->sec_bitmap_len, GFP_ATOMIC);
1095 if (!line->map_bitmap)
1098 /* will be initialized using bb info from map_bitmap */
1099 line->invalid_bitmap = kmalloc(lm->sec_bitmap_len, GFP_ATOMIC);
1100 if (!line->invalid_bitmap) {
1101 kfree(line->map_bitmap);
1105 spin_lock(&line->lock);
1106 if (line->state != PBLK_LINESTATE_FREE) {
1107 kfree(line->map_bitmap);
1108 kfree(line->invalid_bitmap);
1109 spin_unlock(&line->lock);
1110 WARN(1, "pblk: corrupted line %d, state %d\n",
1111 line->id, line->state);
1115 line->state = PBLK_LINESTATE_OPEN;
1117 atomic_set(&line->left_eblks, blk_in_line);
1118 atomic_set(&line->left_seblks, blk_in_line);
1120 line->meta_distance = lm->meta_distance;
1121 spin_unlock(&line->lock);
1123 /* Bad blocks do not need to be erased */
1124 bitmap_copy(line->erase_bitmap, line->blk_bitmap, lm->blk_per_line);
1126 kref_init(&line->ref);
1131 int pblk_line_recov_alloc(struct pblk *pblk, struct pblk_line *line)
1133 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1136 spin_lock(&l_mg->free_lock);
1137 l_mg->data_line = line;
1138 list_del(&line->list);
1140 ret = pblk_line_prepare(pblk, line);
1142 list_add(&line->list, &l_mg->free_list);
1143 spin_unlock(&l_mg->free_lock);
1146 spin_unlock(&l_mg->free_lock);
1148 pblk_rl_free_lines_dec(&pblk->rl, line);
1150 if (!pblk_line_init_bb(pblk, line, 0)) {
1151 list_add(&line->list, &l_mg->free_list);
1158 void pblk_line_recov_close(struct pblk *pblk, struct pblk_line *line)
1160 kfree(line->map_bitmap);
1161 line->map_bitmap = NULL;
1166 struct pblk_line *pblk_line_get(struct pblk *pblk)
1168 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1169 struct pblk_line_meta *lm = &pblk->lm;
1170 struct pblk_line *line;
1173 lockdep_assert_held(&l_mg->free_lock);
1176 if (list_empty(&l_mg->free_list)) {
1177 pr_err("pblk: no free lines\n");
1181 line = list_first_entry(&l_mg->free_list, struct pblk_line, list);
1182 list_del(&line->list);
1183 l_mg->nr_free_lines--;
1185 bit = find_first_zero_bit(line->blk_bitmap, lm->blk_per_line);
1186 if (unlikely(bit >= lm->blk_per_line)) {
1187 spin_lock(&line->lock);
1188 line->state = PBLK_LINESTATE_BAD;
1189 spin_unlock(&line->lock);
1191 list_add_tail(&line->list, &l_mg->bad_list);
1193 pr_debug("pblk: line %d is bad\n", line->id);
1197 ret = pblk_line_prepare(pblk, line);
1199 if (ret == -EAGAIN) {
1200 list_add(&line->list, &l_mg->corrupt_list);
1203 pr_err("pblk: failed to prepare line %d\n", line->id);
1204 list_add(&line->list, &l_mg->free_list);
1205 l_mg->nr_free_lines++;
1213 static struct pblk_line *pblk_line_retry(struct pblk *pblk,
1214 struct pblk_line *line)
1216 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1217 struct pblk_line *retry_line;
1220 spin_lock(&l_mg->free_lock);
1221 retry_line = pblk_line_get(pblk);
1223 l_mg->data_line = NULL;
1224 spin_unlock(&l_mg->free_lock);
1228 retry_line->smeta = line->smeta;
1229 retry_line->emeta = line->emeta;
1230 retry_line->meta_line = line->meta_line;
1232 pblk_line_free(pblk, line);
1233 l_mg->data_line = retry_line;
1234 spin_unlock(&l_mg->free_lock);
1236 pblk_rl_free_lines_dec(&pblk->rl, retry_line);
1238 if (pblk_line_erase(pblk, retry_line))
1244 static void pblk_set_space_limit(struct pblk *pblk)
1246 struct pblk_rl *rl = &pblk->rl;
1248 atomic_set(&rl->rb_space, 0);
1251 struct pblk_line *pblk_line_get_first_data(struct pblk *pblk)
1253 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1254 struct pblk_line *line;
1257 spin_lock(&l_mg->free_lock);
1258 line = pblk_line_get(pblk);
1260 spin_unlock(&l_mg->free_lock);
1264 line->seq_nr = l_mg->d_seq_nr++;
1265 line->type = PBLK_LINETYPE_DATA;
1266 l_mg->data_line = line;
1268 pblk_line_setup_metadata(line, l_mg, &pblk->lm);
1270 /* Allocate next line for preparation */
1271 l_mg->data_next = pblk_line_get(pblk);
1272 if (!l_mg->data_next) {
1273 /* If we cannot get a new line, we need to stop the pipeline.
1274 * Only allow as many writes in as we can store safely and then
1277 pblk_set_space_limit(pblk);
1279 l_mg->data_next = NULL;
1281 l_mg->data_next->seq_nr = l_mg->d_seq_nr++;
1282 l_mg->data_next->type = PBLK_LINETYPE_DATA;
1285 spin_unlock(&l_mg->free_lock);
1287 if (pblk_line_erase(pblk, line)) {
1288 line = pblk_line_retry(pblk, line);
1293 pblk_rl_free_lines_dec(&pblk->rl, line);
1295 pblk_rl_free_lines_dec(&pblk->rl, l_mg->data_next);
1298 if (!pblk_line_init_metadata(pblk, line, NULL)) {
1299 line = pblk_line_retry(pblk, line);
1306 if (!pblk_line_init_bb(pblk, line, 1)) {
1307 line = pblk_line_retry(pblk, line);
1317 static void pblk_stop_writes(struct pblk *pblk, struct pblk_line *line)
1319 lockdep_assert_held(&pblk->l_mg.free_lock);
1321 pblk_set_space_limit(pblk);
1322 pblk->state = PBLK_STATE_STOPPING;
1325 static void pblk_line_close_meta_sync(struct pblk *pblk)
1327 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1328 struct pblk_line_meta *lm = &pblk->lm;
1329 struct pblk_line *line, *tline;
1332 spin_lock(&l_mg->close_lock);
1333 if (list_empty(&l_mg->emeta_list)) {
1334 spin_unlock(&l_mg->close_lock);
1338 list_cut_position(&list, &l_mg->emeta_list, l_mg->emeta_list.prev);
1339 spin_unlock(&l_mg->close_lock);
1341 list_for_each_entry_safe(line, tline, &list, list) {
1342 struct pblk_emeta *emeta = line->emeta;
1344 while (emeta->mem < lm->emeta_len[0]) {
1347 ret = pblk_submit_meta_io(pblk, line);
1349 pr_err("pblk: sync meta line %d failed (%d)\n",
1356 pblk_wait_for_meta(pblk);
1357 flush_workqueue(pblk->close_wq);
1360 void pblk_pipeline_stop(struct pblk *pblk)
1362 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1365 spin_lock(&l_mg->free_lock);
1366 if (pblk->state == PBLK_STATE_RECOVERING ||
1367 pblk->state == PBLK_STATE_STOPPED) {
1368 spin_unlock(&l_mg->free_lock);
1371 pblk->state = PBLK_STATE_RECOVERING;
1372 spin_unlock(&l_mg->free_lock);
1374 pblk_flush_writer(pblk);
1375 pblk_wait_for_meta(pblk);
1377 ret = pblk_recov_pad(pblk);
1379 pr_err("pblk: could not close data on teardown(%d)\n", ret);
1383 flush_workqueue(pblk->bb_wq);
1384 pblk_line_close_meta_sync(pblk);
1386 spin_lock(&l_mg->free_lock);
1387 pblk->state = PBLK_STATE_STOPPED;
1388 l_mg->data_line = NULL;
1389 l_mg->data_next = NULL;
1390 spin_unlock(&l_mg->free_lock);
1393 struct pblk_line *pblk_line_replace_data(struct pblk *pblk)
1395 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1396 struct pblk_line *cur, *new = NULL;
1397 unsigned int left_seblks;
1400 cur = l_mg->data_line;
1401 new = l_mg->data_next;
1404 l_mg->data_line = new;
1406 spin_lock(&l_mg->free_lock);
1407 if (pblk->state != PBLK_STATE_RUNNING) {
1408 l_mg->data_line = NULL;
1409 l_mg->data_next = NULL;
1410 spin_unlock(&l_mg->free_lock);
1414 pblk_line_setup_metadata(new, l_mg, &pblk->lm);
1415 spin_unlock(&l_mg->free_lock);
1418 left_seblks = atomic_read(&new->left_seblks);
1420 /* If line is not fully erased, erase it */
1421 if (atomic_read(&new->left_eblks)) {
1422 if (pblk_line_erase(pblk, new))
1431 if (!pblk_line_init_metadata(pblk, new, cur)) {
1432 new = pblk_line_retry(pblk, new);
1439 if (!pblk_line_init_bb(pblk, new, 1)) {
1440 new = pblk_line_retry(pblk, new);
1447 /* Allocate next line for preparation */
1448 spin_lock(&l_mg->free_lock);
1449 l_mg->data_next = pblk_line_get(pblk);
1450 if (!l_mg->data_next) {
1451 /* If we cannot get a new line, we need to stop the pipeline.
1452 * Only allow as many writes in as we can store safely and then
1455 pblk_stop_writes(pblk, new);
1456 l_mg->data_next = NULL;
1458 l_mg->data_next->seq_nr = l_mg->d_seq_nr++;
1459 l_mg->data_next->type = PBLK_LINETYPE_DATA;
1462 spin_unlock(&l_mg->free_lock);
1465 pblk_rl_free_lines_dec(&pblk->rl, l_mg->data_next);
1471 void pblk_line_free(struct pblk *pblk, struct pblk_line *line)
1473 kfree(line->map_bitmap);
1474 kfree(line->invalid_bitmap);
1476 *line->vsc = cpu_to_le32(EMPTY_ENTRY);
1478 line->map_bitmap = NULL;
1479 line->invalid_bitmap = NULL;
1484 static void __pblk_line_put(struct pblk *pblk, struct pblk_line *line)
1486 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1487 struct pblk_gc *gc = &pblk->gc;
1489 spin_lock(&line->lock);
1490 WARN_ON(line->state != PBLK_LINESTATE_GC);
1491 line->state = PBLK_LINESTATE_FREE;
1492 line->gc_group = PBLK_LINEGC_NONE;
1493 pblk_line_free(pblk, line);
1494 spin_unlock(&line->lock);
1496 atomic_dec(&gc->pipeline_gc);
1498 spin_lock(&l_mg->free_lock);
1499 list_add_tail(&line->list, &l_mg->free_list);
1500 l_mg->nr_free_lines++;
1501 spin_unlock(&l_mg->free_lock);
1503 pblk_rl_free_lines_inc(&pblk->rl, line);
1506 static void pblk_line_put_ws(struct work_struct *work)
1508 struct pblk_line_ws *line_put_ws = container_of(work,
1509 struct pblk_line_ws, ws);
1510 struct pblk *pblk = line_put_ws->pblk;
1511 struct pblk_line *line = line_put_ws->line;
1513 __pblk_line_put(pblk, line);
1514 mempool_free(line_put_ws, pblk->gen_ws_pool);
1517 void pblk_line_put(struct kref *ref)
1519 struct pblk_line *line = container_of(ref, struct pblk_line, ref);
1520 struct pblk *pblk = line->pblk;
1522 __pblk_line_put(pblk, line);
1525 void pblk_line_put_wq(struct kref *ref)
1527 struct pblk_line *line = container_of(ref, struct pblk_line, ref);
1528 struct pblk *pblk = line->pblk;
1529 struct pblk_line_ws *line_put_ws;
1531 line_put_ws = mempool_alloc(pblk->gen_ws_pool, GFP_ATOMIC);
1535 line_put_ws->pblk = pblk;
1536 line_put_ws->line = line;
1537 line_put_ws->priv = NULL;
1539 INIT_WORK(&line_put_ws->ws, pblk_line_put_ws);
1540 queue_work(pblk->r_end_wq, &line_put_ws->ws);
1543 int pblk_blk_erase_async(struct pblk *pblk, struct ppa_addr ppa)
1548 rqd = pblk_alloc_rqd(pblk, PBLK_ERASE);
1550 pblk_setup_e_rq(pblk, rqd, ppa);
1552 rqd->end_io = pblk_end_io_erase;
1553 rqd->private = pblk;
1555 /* The write thread schedules erases so that it minimizes disturbances
1556 * with writes. Thus, there is no need to take the LUN semaphore.
1558 err = pblk_submit_io(pblk, rqd);
1560 struct nvm_tgt_dev *dev = pblk->dev;
1561 struct nvm_geo *geo = &dev->geo;
1563 pr_err("pblk: could not async erase line:%d,blk:%d\n",
1564 pblk_dev_ppa_to_line(ppa),
1565 pblk_dev_ppa_to_pos(geo, ppa));
1571 struct pblk_line *pblk_line_get_data(struct pblk *pblk)
1573 return pblk->l_mg.data_line;
1576 /* For now, always erase next line */
1577 struct pblk_line *pblk_line_get_erase(struct pblk *pblk)
1579 return pblk->l_mg.data_next;
1582 int pblk_line_is_full(struct pblk_line *line)
1584 return (line->left_msecs == 0);
1587 static void pblk_line_should_sync_meta(struct pblk *pblk)
1589 if (pblk_rl_is_limit(&pblk->rl))
1590 pblk_line_close_meta_sync(pblk);
1593 void pblk_line_close(struct pblk *pblk, struct pblk_line *line)
1595 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1596 struct list_head *move_list;
1598 #ifdef CONFIG_NVM_DEBUG
1599 struct pblk_line_meta *lm = &pblk->lm;
1601 WARN(!bitmap_full(line->map_bitmap, lm->sec_per_line),
1602 "pblk: corrupt closed line %d\n", line->id);
1605 spin_lock(&l_mg->free_lock);
1606 WARN_ON(!test_and_clear_bit(line->meta_line, &l_mg->meta_bitmap));
1607 spin_unlock(&l_mg->free_lock);
1609 spin_lock(&l_mg->gc_lock);
1610 spin_lock(&line->lock);
1611 WARN_ON(line->state != PBLK_LINESTATE_OPEN);
1612 line->state = PBLK_LINESTATE_CLOSED;
1613 move_list = pblk_line_gc_list(pblk, line);
1615 list_add_tail(&line->list, move_list);
1617 kfree(line->map_bitmap);
1618 line->map_bitmap = NULL;
1622 spin_unlock(&line->lock);
1623 spin_unlock(&l_mg->gc_lock);
1626 void pblk_line_close_meta(struct pblk *pblk, struct pblk_line *line)
1628 struct pblk_line_mgmt *l_mg = &pblk->l_mg;
1629 struct pblk_line_meta *lm = &pblk->lm;
1630 struct pblk_emeta *emeta = line->emeta;
1631 struct line_emeta *emeta_buf = emeta->buf;
1633 /* No need for exact vsc value; avoid a big line lock and take aprox. */
1634 memcpy(emeta_to_vsc(pblk, emeta_buf), l_mg->vsc_list, lm->vsc_list_len);
1635 memcpy(emeta_to_bb(emeta_buf), line->blk_bitmap, lm->blk_bitmap_len);
1637 emeta_buf->nr_valid_lbas = cpu_to_le64(line->nr_valid_lbas);
1638 emeta_buf->crc = cpu_to_le32(pblk_calc_emeta_crc(pblk, emeta_buf));
1640 spin_lock(&l_mg->close_lock);
1641 spin_lock(&line->lock);
1642 list_add_tail(&line->list, &l_mg->emeta_list);
1643 spin_unlock(&line->lock);
1644 spin_unlock(&l_mg->close_lock);
1646 pblk_line_should_sync_meta(pblk);
1649 void pblk_line_close_ws(struct work_struct *work)
1651 struct pblk_line_ws *line_ws = container_of(work, struct pblk_line_ws,
1653 struct pblk *pblk = line_ws->pblk;
1654 struct pblk_line *line = line_ws->line;
1656 pblk_line_close(pblk, line);
1657 mempool_free(line_ws, pblk->gen_ws_pool);
1660 void pblk_gen_run_ws(struct pblk *pblk, struct pblk_line *line, void *priv,
1661 void (*work)(struct work_struct *), gfp_t gfp_mask,
1662 struct workqueue_struct *wq)
1664 struct pblk_line_ws *line_ws;
1666 line_ws = mempool_alloc(pblk->gen_ws_pool, gfp_mask);
1668 line_ws->pblk = pblk;
1669 line_ws->line = line;
1670 line_ws->priv = priv;
1672 INIT_WORK(&line_ws->ws, work);
1673 queue_work(wq, &line_ws->ws);
1676 static void __pblk_down_page(struct pblk *pblk, struct ppa_addr *ppa_list,
1677 int nr_ppas, int pos)
1679 struct pblk_lun *rlun = &pblk->luns[pos];
1683 * Only send one inflight I/O per LUN. Since we map at a page
1684 * granurality, all ppas in the I/O will map to the same LUN
1686 #ifdef CONFIG_NVM_DEBUG
1689 for (i = 1; i < nr_ppas; i++)
1690 WARN_ON(ppa_list[0].g.lun != ppa_list[i].g.lun ||
1691 ppa_list[0].g.ch != ppa_list[i].g.ch);
1694 ret = down_timeout(&rlun->wr_sem, msecs_to_jiffies(30000));
1695 if (ret == -ETIME || ret == -EINTR)
1696 pr_err("pblk: taking lun semaphore timed out: err %d\n", -ret);
1699 void pblk_down_page(struct pblk *pblk, struct ppa_addr *ppa_list, int nr_ppas)
1701 struct nvm_tgt_dev *dev = pblk->dev;
1702 struct nvm_geo *geo = &dev->geo;
1703 int pos = pblk_ppa_to_pos(geo, ppa_list[0]);
1705 __pblk_down_page(pblk, ppa_list, nr_ppas, pos);
1708 void pblk_down_rq(struct pblk *pblk, struct ppa_addr *ppa_list, int nr_ppas,
1709 unsigned long *lun_bitmap)
1711 struct nvm_tgt_dev *dev = pblk->dev;
1712 struct nvm_geo *geo = &dev->geo;
1713 int pos = pblk_ppa_to_pos(geo, ppa_list[0]);
1715 /* If the LUN has been locked for this same request, do no attempt to
1718 if (test_and_set_bit(pos, lun_bitmap))
1721 __pblk_down_page(pblk, ppa_list, nr_ppas, pos);
1724 void pblk_up_page(struct pblk *pblk, struct ppa_addr *ppa_list, int nr_ppas)
1726 struct nvm_tgt_dev *dev = pblk->dev;
1727 struct nvm_geo *geo = &dev->geo;
1728 struct pblk_lun *rlun;
1729 int pos = pblk_ppa_to_pos(geo, ppa_list[0]);
1731 #ifdef CONFIG_NVM_DEBUG
1734 for (i = 1; i < nr_ppas; i++)
1735 WARN_ON(ppa_list[0].g.lun != ppa_list[i].g.lun ||
1736 ppa_list[0].g.ch != ppa_list[i].g.ch);
1739 rlun = &pblk->luns[pos];
1743 void pblk_up_rq(struct pblk *pblk, struct ppa_addr *ppa_list, int nr_ppas,
1744 unsigned long *lun_bitmap)
1746 struct nvm_tgt_dev *dev = pblk->dev;
1747 struct nvm_geo *geo = &dev->geo;
1748 struct pblk_lun *rlun;
1749 int nr_luns = geo->nr_luns;
1752 while ((bit = find_next_bit(lun_bitmap, nr_luns, bit + 1)) < nr_luns) {
1753 rlun = &pblk->luns[bit];
1758 void pblk_update_map(struct pblk *pblk, sector_t lba, struct ppa_addr ppa)
1760 struct ppa_addr ppa_l2p;
1762 /* logic error: lba out-of-bounds. Ignore update */
1763 if (!(lba < pblk->rl.nr_secs)) {
1764 WARN(1, "pblk: corrupted L2P map request\n");
1768 spin_lock(&pblk->trans_lock);
1769 ppa_l2p = pblk_trans_map_get(pblk, lba);
1771 if (!pblk_addr_in_cache(ppa_l2p) && !pblk_ppa_empty(ppa_l2p))
1772 pblk_map_invalidate(pblk, ppa_l2p);
1774 pblk_trans_map_set(pblk, lba, ppa);
1775 spin_unlock(&pblk->trans_lock);
1778 void pblk_update_map_cache(struct pblk *pblk, sector_t lba, struct ppa_addr ppa)
1781 #ifdef CONFIG_NVM_DEBUG
1782 /* Callers must ensure that the ppa points to a cache address */
1783 BUG_ON(!pblk_addr_in_cache(ppa));
1784 BUG_ON(pblk_rb_pos_oob(&pblk->rwb, pblk_addr_to_cacheline(ppa)));
1787 pblk_update_map(pblk, lba, ppa);
1790 int pblk_update_map_gc(struct pblk *pblk, sector_t lba, struct ppa_addr ppa_new,
1791 struct pblk_line *gc_line, u64 paddr_gc)
1793 struct ppa_addr ppa_l2p, ppa_gc;
1796 #ifdef CONFIG_NVM_DEBUG
1797 /* Callers must ensure that the ppa points to a cache address */
1798 BUG_ON(!pblk_addr_in_cache(ppa_new));
1799 BUG_ON(pblk_rb_pos_oob(&pblk->rwb, pblk_addr_to_cacheline(ppa_new)));
1802 /* logic error: lba out-of-bounds. Ignore update */
1803 if (!(lba < pblk->rl.nr_secs)) {
1804 WARN(1, "pblk: corrupted L2P map request\n");
1808 spin_lock(&pblk->trans_lock);
1809 ppa_l2p = pblk_trans_map_get(pblk, lba);
1810 ppa_gc = addr_to_gen_ppa(pblk, paddr_gc, gc_line->id);
1812 if (!pblk_ppa_comp(ppa_l2p, ppa_gc)) {
1813 spin_lock(&gc_line->lock);
1814 WARN(!test_bit(paddr_gc, gc_line->invalid_bitmap),
1815 "pblk: corrupted GC update");
1816 spin_unlock(&gc_line->lock);
1822 pblk_trans_map_set(pblk, lba, ppa_new);
1824 spin_unlock(&pblk->trans_lock);
1828 void pblk_update_map_dev(struct pblk *pblk, sector_t lba,
1829 struct ppa_addr ppa_mapped, struct ppa_addr ppa_cache)
1831 struct ppa_addr ppa_l2p;
1833 #ifdef CONFIG_NVM_DEBUG
1834 /* Callers must ensure that the ppa points to a device address */
1835 BUG_ON(pblk_addr_in_cache(ppa_mapped));
1837 /* Invalidate and discard padded entries */
1838 if (lba == ADDR_EMPTY) {
1839 #ifdef CONFIG_NVM_DEBUG
1840 atomic_long_inc(&pblk->padded_wb);
1842 if (!pblk_ppa_empty(ppa_mapped))
1843 pblk_map_invalidate(pblk, ppa_mapped);
1847 /* logic error: lba out-of-bounds. Ignore update */
1848 if (!(lba < pblk->rl.nr_secs)) {
1849 WARN(1, "pblk: corrupted L2P map request\n");
1853 spin_lock(&pblk->trans_lock);
1854 ppa_l2p = pblk_trans_map_get(pblk, lba);
1856 /* Do not update L2P if the cacheline has been updated. In this case,
1857 * the mapped ppa must be invalidated
1859 if (!pblk_ppa_comp(ppa_l2p, ppa_cache)) {
1860 if (!pblk_ppa_empty(ppa_mapped))
1861 pblk_map_invalidate(pblk, ppa_mapped);
1865 #ifdef CONFIG_NVM_DEBUG
1866 WARN_ON(!pblk_addr_in_cache(ppa_l2p) && !pblk_ppa_empty(ppa_l2p));
1869 pblk_trans_map_set(pblk, lba, ppa_mapped);
1871 spin_unlock(&pblk->trans_lock);
1874 void pblk_lookup_l2p_seq(struct pblk *pblk, struct ppa_addr *ppas,
1875 sector_t blba, int nr_secs)
1879 spin_lock(&pblk->trans_lock);
1880 for (i = 0; i < nr_secs; i++) {
1881 struct ppa_addr ppa;
1883 ppa = ppas[i] = pblk_trans_map_get(pblk, blba + i);
1885 /* If the L2P entry maps to a line, the reference is valid */
1886 if (!pblk_ppa_empty(ppa) && !pblk_addr_in_cache(ppa)) {
1887 int line_id = pblk_dev_ppa_to_line(ppa);
1888 struct pblk_line *line = &pblk->lines[line_id];
1890 kref_get(&line->ref);
1893 spin_unlock(&pblk->trans_lock);
1896 void pblk_lookup_l2p_rand(struct pblk *pblk, struct ppa_addr *ppas,
1897 u64 *lba_list, int nr_secs)
1902 spin_lock(&pblk->trans_lock);
1903 for (i = 0; i < nr_secs; i++) {
1905 if (lba != ADDR_EMPTY) {
1906 /* logic error: lba out-of-bounds. Ignore update */
1907 if (!(lba < pblk->rl.nr_secs)) {
1908 WARN(1, "pblk: corrupted L2P map request\n");
1911 ppas[i] = pblk_trans_map_get(pblk, lba);
1914 spin_unlock(&pblk->trans_lock);