2 * Copyright (C) 2016 CNEX Labs
3 * Initial release: Javier Gonzalez <javier@cnexlabs.com>
5 * Based upon the circular ringbuffer.
7 * This program is free software; you can redistribute it and/or
8 * modify it under the terms of the GNU General Public License version
9 * 2 as published by the Free Software Foundation.
11 * This program is distributed in the hope that it will be useful, but
12 * WITHOUT ANY WARRANTY; without even the implied warranty of
13 * MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the GNU
14 * General Public License for more details.
16 * pblk-rb.c - pblk's write buffer
19 #include <linux/circ_buf.h>
23 static DECLARE_RWSEM(pblk_rb_lock
);
25 void pblk_rb_data_free(struct pblk_rb
*rb
)
27 struct pblk_rb_pages
*p
, *t
;
29 down_write(&pblk_rb_lock
);
30 list_for_each_entry_safe(p
, t
, &rb
->pages
, list
) {
31 free_pages((unsigned long)page_address(p
->pages
), p
->order
);
35 up_write(&pblk_rb_lock
);
39 * Initialize ring buffer. The data and metadata buffers must be previously
40 * allocated and their size must be a power of two
41 * (Documentation/circular-buffers.txt)
43 int pblk_rb_init(struct pblk_rb
*rb
, struct pblk_rb_entry
*rb_entry_base
,
44 unsigned int power_size
, unsigned int power_seg_sz
)
46 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
47 unsigned int init_entry
= 0;
48 unsigned int alloc_order
= power_size
;
49 unsigned int max_order
= MAX_ORDER
- 1;
50 unsigned int order
, iter
;
52 down_write(&pblk_rb_lock
);
53 rb
->entries
= rb_entry_base
;
54 rb
->seg_size
= (1 << power_seg_sz
);
55 rb
->nr_entries
= (1 << power_size
);
56 rb
->mem
= rb
->subm
= rb
->sync
= rb
->l2p_update
= 0;
57 rb
->sync_point
= EMPTY_ENTRY
;
59 spin_lock_init(&rb
->w_lock
);
60 spin_lock_init(&rb
->s_lock
);
62 INIT_LIST_HEAD(&rb
->pages
);
64 if (alloc_order
>= max_order
) {
66 iter
= (1 << (alloc_order
- max_order
));
73 struct pblk_rb_entry
*entry
;
74 struct pblk_rb_pages
*page_set
;
76 unsigned long set_size
;
79 page_set
= kmalloc(sizeof(struct pblk_rb_pages
), GFP_KERNEL
);
81 up_write(&pblk_rb_lock
);
85 page_set
->order
= order
;
86 page_set
->pages
= alloc_pages(GFP_KERNEL
, order
);
87 if (!page_set
->pages
) {
89 pblk_rb_data_free(rb
);
90 up_write(&pblk_rb_lock
);
93 kaddr
= page_address(page_set
->pages
);
95 entry
= &rb
->entries
[init_entry
];
97 entry
->cacheline
= pblk_cacheline_to_addr(init_entry
++);
98 entry
->w_ctx
.flags
= PBLK_WRITABLE_ENTRY
;
100 set_size
= (1 << order
);
101 for (i
= 1; i
< set_size
; i
++) {
102 entry
= &rb
->entries
[init_entry
];
103 entry
->cacheline
= pblk_cacheline_to_addr(init_entry
++);
104 entry
->data
= kaddr
+ (i
* rb
->seg_size
);
105 entry
->w_ctx
.flags
= PBLK_WRITABLE_ENTRY
;
106 bio_list_init(&entry
->w_ctx
.bios
);
109 list_add_tail(&page_set
->list
, &rb
->pages
);
112 up_write(&pblk_rb_lock
);
114 #ifdef CONFIG_NVM_DEBUG
115 atomic_set(&rb
->inflight_sync_point
, 0);
119 * Initialize rate-limiter, which controls access to the write buffer
120 * but user and GC I/O
122 pblk_rl_init(&pblk
->rl
, rb
->nr_entries
);
128 * pblk_rb_calculate_size -- calculate the size of the write buffer
130 unsigned int pblk_rb_calculate_size(unsigned int nr_entries
)
132 /* Alloc a write buffer that can at least fit 128 entries */
133 return (1 << max(get_count_order(nr_entries
), 7));
136 void *pblk_rb_entries_ref(struct pblk_rb
*rb
)
141 static void clean_wctx(struct pblk_w_ctx
*w_ctx
)
146 flags
= READ_ONCE(w_ctx
->flags
);
147 if (!(flags
& PBLK_SUBMITTED_ENTRY
))
150 /* Release flags on context. Protect from writes and reads */
151 smp_store_release(&w_ctx
->flags
, PBLK_WRITABLE_ENTRY
);
152 pblk_ppa_set_empty(&w_ctx
->ppa
);
153 w_ctx
->lba
= ADDR_EMPTY
;
156 #define pblk_rb_ring_count(head, tail, size) CIRC_CNT(head, tail, size)
157 #define pblk_rb_ring_space(rb, head, tail, size) \
158 (CIRC_SPACE(head, tail, size))
161 * Buffer space is calculated with respect to the back pointer signaling
162 * synchronized entries to the media.
164 static unsigned int pblk_rb_space(struct pblk_rb
*rb
)
166 unsigned int mem
= READ_ONCE(rb
->mem
);
167 unsigned int sync
= READ_ONCE(rb
->sync
);
169 return pblk_rb_ring_space(rb
, mem
, sync
, rb
->nr_entries
);
173 * Buffer count is calculated with respect to the submission entry signaling the
174 * entries that are available to send to the media
176 unsigned int pblk_rb_read_count(struct pblk_rb
*rb
)
178 unsigned int mem
= READ_ONCE(rb
->mem
);
179 unsigned int subm
= READ_ONCE(rb
->subm
);
181 return pblk_rb_ring_count(mem
, subm
, rb
->nr_entries
);
184 unsigned int pblk_rb_sync_count(struct pblk_rb
*rb
)
186 unsigned int mem
= READ_ONCE(rb
->mem
);
187 unsigned int sync
= READ_ONCE(rb
->sync
);
189 return pblk_rb_ring_count(mem
, sync
, rb
->nr_entries
);
192 unsigned int pblk_rb_read_commit(struct pblk_rb
*rb
, unsigned int nr_entries
)
196 subm
= READ_ONCE(rb
->subm
);
197 /* Commit read means updating submission pointer */
198 smp_store_release(&rb
->subm
,
199 (subm
+ nr_entries
) & (rb
->nr_entries
- 1));
204 static int __pblk_rb_update_l2p(struct pblk_rb
*rb
, unsigned int to_update
)
206 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
207 struct pblk_line
*line
;
208 struct pblk_rb_entry
*entry
;
209 struct pblk_w_ctx
*w_ctx
;
210 unsigned int user_io
= 0, gc_io
= 0;
214 for (i
= 0; i
< to_update
; i
++) {
215 entry
= &rb
->entries
[rb
->l2p_update
];
216 w_ctx
= &entry
->w_ctx
;
218 flags
= READ_ONCE(entry
->w_ctx
.flags
);
219 if (flags
& PBLK_IOTYPE_USER
)
221 else if (flags
& PBLK_IOTYPE_GC
)
224 WARN(1, "pblk: unknown IO type\n");
226 pblk_update_map_dev(pblk
, w_ctx
->lba
, w_ctx
->ppa
,
229 line
= &pblk
->lines
[pblk_tgt_ppa_to_line(w_ctx
->ppa
)];
230 kref_put(&line
->ref
, pblk_line_put
);
232 rb
->l2p_update
= (rb
->l2p_update
+ 1) & (rb
->nr_entries
- 1);
235 pblk_rl_out(&pblk
->rl
, user_io
, gc_io
);
241 * When we move the l2p_update pointer, we update the l2p table - lookups will
242 * point to the physical address instead of to the cacheline in the write buffer
243 * from this moment on.
245 static int pblk_rb_update_l2p(struct pblk_rb
*rb
, unsigned int nr_entries
,
246 unsigned int mem
, unsigned int sync
)
248 unsigned int space
, count
;
251 lockdep_assert_held(&rb
->w_lock
);
253 /* Update l2p only as buffer entries are being overwritten */
254 space
= pblk_rb_ring_space(rb
, mem
, rb
->l2p_update
, rb
->nr_entries
);
255 if (space
> nr_entries
)
258 count
= nr_entries
- space
;
259 /* l2p_update used exclusively under rb->w_lock */
260 ret
= __pblk_rb_update_l2p(rb
, count
);
267 * Update the l2p entry for all sectors stored on the write buffer. This means
268 * that all future lookups to the l2p table will point to a device address, not
269 * to the cacheline in the write buffer.
271 void pblk_rb_sync_l2p(struct pblk_rb
*rb
)
274 unsigned int to_update
;
276 spin_lock(&rb
->w_lock
);
278 /* Protect from reads and writes */
279 sync
= smp_load_acquire(&rb
->sync
);
281 to_update
= pblk_rb_ring_count(sync
, rb
->l2p_update
, rb
->nr_entries
);
282 __pblk_rb_update_l2p(rb
, to_update
);
284 spin_unlock(&rb
->w_lock
);
288 * Write @nr_entries to ring buffer from @data buffer if there is enough space.
289 * Typically, 4KB data chunks coming from a bio will be copied to the ring
290 * buffer, thus the write will fail if not all incoming data can be copied.
293 static void __pblk_rb_write_entry(struct pblk_rb
*rb
, void *data
,
294 struct pblk_w_ctx w_ctx
,
295 struct pblk_rb_entry
*entry
)
297 memcpy(entry
->data
, data
, rb
->seg_size
);
299 entry
->w_ctx
.lba
= w_ctx
.lba
;
300 entry
->w_ctx
.ppa
= w_ctx
.ppa
;
303 void pblk_rb_write_entry_user(struct pblk_rb
*rb
, void *data
,
304 struct pblk_w_ctx w_ctx
, unsigned int ring_pos
)
306 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
307 struct pblk_rb_entry
*entry
;
310 entry
= &rb
->entries
[ring_pos
];
311 flags
= READ_ONCE(entry
->w_ctx
.flags
);
312 #ifdef CONFIG_NVM_DEBUG
313 /* Caller must guarantee that the entry is free */
314 BUG_ON(!(flags
& PBLK_WRITABLE_ENTRY
));
317 __pblk_rb_write_entry(rb
, data
, w_ctx
, entry
);
319 pblk_update_map_cache(pblk
, w_ctx
.lba
, entry
->cacheline
);
320 flags
= w_ctx
.flags
| PBLK_WRITTEN_DATA
;
322 /* Release flags on write context. Protect from writes */
323 smp_store_release(&entry
->w_ctx
.flags
, flags
);
326 void pblk_rb_write_entry_gc(struct pblk_rb
*rb
, void *data
,
327 struct pblk_w_ctx w_ctx
, struct pblk_line
*line
,
328 u64 paddr
, unsigned int ring_pos
)
330 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
331 struct pblk_rb_entry
*entry
;
334 entry
= &rb
->entries
[ring_pos
];
335 flags
= READ_ONCE(entry
->w_ctx
.flags
);
336 #ifdef CONFIG_NVM_DEBUG
337 /* Caller must guarantee that the entry is free */
338 BUG_ON(!(flags
& PBLK_WRITABLE_ENTRY
));
341 __pblk_rb_write_entry(rb
, data
, w_ctx
, entry
);
343 if (!pblk_update_map_gc(pblk
, w_ctx
.lba
, entry
->cacheline
, line
, paddr
))
344 entry
->w_ctx
.lba
= ADDR_EMPTY
;
346 flags
= w_ctx
.flags
| PBLK_WRITTEN_DATA
;
348 /* Release flags on write context. Protect from writes */
349 smp_store_release(&entry
->w_ctx
.flags
, flags
);
352 static int pblk_rb_sync_point_set(struct pblk_rb
*rb
, struct bio
*bio
,
355 struct pblk_rb_entry
*entry
;
356 unsigned int subm
, sync_point
;
358 subm
= READ_ONCE(rb
->subm
);
360 #ifdef CONFIG_NVM_DEBUG
361 atomic_inc(&rb
->inflight_sync_point
);
367 sync_point
= (pos
== 0) ? (rb
->nr_entries
- 1) : (pos
- 1);
368 entry
= &rb
->entries
[sync_point
];
371 smp_store_release(&rb
->sync_point
, sync_point
);
376 spin_lock_irq(&rb
->s_lock
);
377 bio_list_add(&entry
->w_ctx
.bios
, bio
);
378 spin_unlock_irq(&rb
->s_lock
);
383 static int __pblk_rb_may_write(struct pblk_rb
*rb
, unsigned int nr_entries
,
389 sync
= READ_ONCE(rb
->sync
);
390 mem
= READ_ONCE(rb
->mem
);
392 if (pblk_rb_ring_space(rb
, mem
, sync
, rb
->nr_entries
) < nr_entries
)
395 if (pblk_rb_update_l2p(rb
, nr_entries
, mem
, sync
))
403 static int pblk_rb_may_write(struct pblk_rb
*rb
, unsigned int nr_entries
,
406 if (!__pblk_rb_may_write(rb
, nr_entries
, pos
))
409 /* Protect from read count */
410 smp_store_release(&rb
->mem
, (*pos
+ nr_entries
) & (rb
->nr_entries
- 1));
414 void pblk_rb_flush(struct pblk_rb
*rb
)
416 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
417 unsigned int mem
= READ_ONCE(rb
->mem
);
419 if (pblk_rb_sync_point_set(rb
, NULL
, mem
))
422 pblk_write_should_kick(pblk
);
425 static int pblk_rb_may_write_flush(struct pblk_rb
*rb
, unsigned int nr_entries
,
426 unsigned int *pos
, struct bio
*bio
,
431 if (!__pblk_rb_may_write(rb
, nr_entries
, pos
))
434 mem
= (*pos
+ nr_entries
) & (rb
->nr_entries
- 1);
435 *io_ret
= NVM_IO_DONE
;
437 if (bio
->bi_opf
& REQ_PREFLUSH
) {
438 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
440 #ifdef CONFIG_NVM_DEBUG
441 atomic_long_inc(&pblk
->nr_flush
);
443 if (pblk_rb_sync_point_set(&pblk
->rwb
, bio
, mem
))
447 /* Protect from read count */
448 smp_store_release(&rb
->mem
, mem
);
454 * Atomically check that (i) there is space on the write buffer for the
455 * incoming I/O, and (ii) the current I/O type has enough budget in the write
456 * buffer (rate-limiter).
458 int pblk_rb_may_write_user(struct pblk_rb
*rb
, struct bio
*bio
,
459 unsigned int nr_entries
, unsigned int *pos
)
461 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
464 spin_lock(&rb
->w_lock
);
465 io_ret
= pblk_rl_user_may_insert(&pblk
->rl
, nr_entries
);
467 spin_unlock(&rb
->w_lock
);
471 if (!pblk_rb_may_write_flush(rb
, nr_entries
, pos
, bio
, &io_ret
)) {
472 spin_unlock(&rb
->w_lock
);
473 return NVM_IO_REQUEUE
;
476 pblk_rl_user_in(&pblk
->rl
, nr_entries
);
477 spin_unlock(&rb
->w_lock
);
483 * Look at pblk_rb_may_write_user comment
485 int pblk_rb_may_write_gc(struct pblk_rb
*rb
, unsigned int nr_entries
,
488 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
490 spin_lock(&rb
->w_lock
);
491 if (!pblk_rl_gc_may_insert(&pblk
->rl
, nr_entries
)) {
492 spin_unlock(&rb
->w_lock
);
496 if (!pblk_rb_may_write(rb
, nr_entries
, pos
)) {
497 spin_unlock(&rb
->w_lock
);
501 pblk_rl_gc_in(&pblk
->rl
, nr_entries
);
502 spin_unlock(&rb
->w_lock
);
508 * The caller of this function must ensure that the backpointer will not
509 * overwrite the entries passed on the list.
511 unsigned int pblk_rb_read_to_bio_list(struct pblk_rb
*rb
, struct bio
*bio
,
512 struct list_head
*list
,
515 struct pblk_rb_entry
*entry
, *tentry
;
517 unsigned int read
= 0;
520 list_for_each_entry_safe(entry
, tentry
, list
, index
) {
522 pr_err("pblk: too many entries on list\n");
526 page
= virt_to_page(entry
->data
);
528 pr_err("pblk: could not allocate write bio page\n");
532 ret
= bio_add_page(bio
, page
, rb
->seg_size
, 0);
533 if (ret
!= rb
->seg_size
) {
534 pr_err("pblk: could not add page to write bio\n");
538 list_del(&entry
->index
);
547 * Read available entries on rb and add them to the given bio. To avoid a memory
548 * copy, a page reference to the write buffer is used to be added to the bio.
550 * This function is used by the write thread to form the write bio that will
551 * persist data on the write buffer to the media.
553 unsigned int pblk_rb_read_to_bio(struct pblk_rb
*rb
, struct nvm_rq
*rqd
,
554 unsigned int pos
, unsigned int nr_entries
,
557 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
558 struct request_queue
*q
= pblk
->dev
->q
;
559 struct pblk_c_ctx
*c_ctx
= nvm_rq_to_pdu(rqd
);
560 struct bio
*bio
= rqd
->bio
;
561 struct pblk_rb_entry
*entry
;
563 unsigned int pad
= 0, to_read
= nr_entries
;
567 if (count
< nr_entries
) {
568 pad
= nr_entries
- count
;
573 c_ctx
->nr_valid
= to_read
;
574 c_ctx
->nr_padded
= pad
;
576 for (i
= 0; i
< to_read
; i
++) {
577 entry
= &rb
->entries
[pos
];
579 /* A write has been allowed into the buffer, but data is still
580 * being copied to it. It is ok to busy wait.
583 flags
= READ_ONCE(entry
->w_ctx
.flags
);
584 if (!(flags
& PBLK_WRITTEN_DATA
)) {
589 page
= virt_to_page(entry
->data
);
591 pr_err("pblk: could not allocate write bio page\n");
592 flags
&= ~PBLK_WRITTEN_DATA
;
593 flags
|= PBLK_SUBMITTED_ENTRY
;
594 /* Release flags on context. Protect from writes */
595 smp_store_release(&entry
->w_ctx
.flags
, flags
);
599 if (bio_add_pc_page(q
, bio
, page
, rb
->seg_size
, 0) !=
601 pr_err("pblk: could not add page to write bio\n");
602 flags
&= ~PBLK_WRITTEN_DATA
;
603 flags
|= PBLK_SUBMITTED_ENTRY
;
604 /* Release flags on context. Protect from writes */
605 smp_store_release(&entry
->w_ctx
.flags
, flags
);
609 if (flags
& PBLK_FLUSH_ENTRY
) {
610 unsigned int sync_point
;
612 sync_point
= READ_ONCE(rb
->sync_point
);
613 if (sync_point
== pos
) {
615 smp_store_release(&rb
->sync_point
, EMPTY_ENTRY
);
618 flags
&= ~PBLK_FLUSH_ENTRY
;
619 #ifdef CONFIG_NVM_DEBUG
620 atomic_dec(&rb
->inflight_sync_point
);
624 flags
&= ~PBLK_WRITTEN_DATA
;
625 flags
|= PBLK_SUBMITTED_ENTRY
;
627 /* Release flags on context. Protect from writes */
628 smp_store_release(&entry
->w_ctx
.flags
, flags
);
630 pos
= (pos
+ 1) & (rb
->nr_entries
- 1);
634 if (pblk_bio_add_pages(pblk
, bio
, GFP_KERNEL
, pad
)) {
635 pr_err("pblk: could not pad page in write bio\n");
640 #ifdef CONFIG_NVM_DEBUG
641 atomic_long_add(pad
, &((struct pblk
*)
642 (container_of(rb
, struct pblk
, rwb
)))->padded_writes
);
649 * Copy to bio only if the lba matches the one on the given cache entry.
650 * Otherwise, it means that the entry has been overwritten, and the bio should
651 * be directed to disk.
653 int pblk_rb_copy_to_bio(struct pblk_rb
*rb
, struct bio
*bio
, sector_t lba
,
654 struct ppa_addr ppa
, int bio_iter
, bool advanced_bio
)
656 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
657 struct pblk_rb_entry
*entry
;
658 struct pblk_w_ctx
*w_ctx
;
659 struct ppa_addr l2p_ppa
;
660 u64 pos
= pblk_addr_to_cacheline(ppa
);
666 #ifdef CONFIG_NVM_DEBUG
667 /* Caller must ensure that the access will not cause an overflow */
668 BUG_ON(pos
>= rb
->nr_entries
);
670 entry
= &rb
->entries
[pos
];
671 w_ctx
= &entry
->w_ctx
;
672 flags
= READ_ONCE(w_ctx
->flags
);
674 spin_lock(&rb
->w_lock
);
675 spin_lock(&pblk
->trans_lock
);
676 l2p_ppa
= pblk_trans_map_get(pblk
, lba
);
677 spin_unlock(&pblk
->trans_lock
);
679 /* Check if the entry has been overwritten or is scheduled to be */
680 if (!pblk_ppa_comp(l2p_ppa
, ppa
) || w_ctx
->lba
!= lba
||
681 flags
& PBLK_WRITABLE_ENTRY
) {
686 /* Only advance the bio if it hasn't been advanced already. If advanced,
687 * this bio is at least a partial bio (i.e., it has partially been
688 * filled with data from the cache). If part of the data resides on the
689 * media, we will read later on
691 if (unlikely(!advanced_bio
))
692 bio_advance(bio
, bio_iter
* PBLK_EXPOSED_PAGE_SIZE
);
694 data
= bio_data(bio
);
695 memcpy(data
, entry
->data
, rb
->seg_size
);
698 spin_unlock(&rb
->w_lock
);
702 struct pblk_w_ctx
*pblk_rb_w_ctx(struct pblk_rb
*rb
, unsigned int pos
)
704 unsigned int entry
= pos
& (rb
->nr_entries
- 1);
706 return &rb
->entries
[entry
].w_ctx
;
709 unsigned int pblk_rb_sync_init(struct pblk_rb
*rb
, unsigned long *flags
)
710 __acquires(&rb
->s_lock
)
713 spin_lock_irqsave(&rb
->s_lock
, *flags
);
715 spin_lock_irq(&rb
->s_lock
);
720 void pblk_rb_sync_end(struct pblk_rb
*rb
, unsigned long *flags
)
721 __releases(&rb
->s_lock
)
723 lockdep_assert_held(&rb
->s_lock
);
726 spin_unlock_irqrestore(&rb
->s_lock
, *flags
);
728 spin_unlock_irq(&rb
->s_lock
);
731 unsigned int pblk_rb_sync_advance(struct pblk_rb
*rb
, unsigned int nr_entries
)
736 lockdep_assert_held(&rb
->s_lock
);
738 sync
= READ_ONCE(rb
->sync
);
740 for (i
= 0; i
< nr_entries
; i
++)
741 sync
= (sync
+ 1) & (rb
->nr_entries
- 1);
743 /* Protect from counts */
744 smp_store_release(&rb
->sync
, sync
);
749 unsigned int pblk_rb_sync_point_count(struct pblk_rb
*rb
)
751 unsigned int subm
, sync_point
;
755 sync_point
= smp_load_acquire(&rb
->sync_point
);
756 if (sync_point
== EMPTY_ENTRY
)
759 subm
= READ_ONCE(rb
->subm
);
761 /* The sync point itself counts as a sector to sync */
762 count
= pblk_rb_ring_count(sync_point
, subm
, rb
->nr_entries
) + 1;
768 * Scan from the current position of the sync pointer to find the entry that
769 * corresponds to the given ppa. This is necessary since write requests can be
770 * completed out of order. The assumption is that the ppa is close to the sync
771 * pointer thus the search will not take long.
773 * The caller of this function must guarantee that the sync pointer will no
774 * reach the entry while it is using the metadata associated with it. With this
775 * assumption in mind, there is no need to take the sync lock.
777 struct pblk_rb_entry
*pblk_rb_sync_scan_entry(struct pblk_rb
*rb
,
778 struct ppa_addr
*ppa
)
780 unsigned int sync
, subm
, count
;
783 sync
= READ_ONCE(rb
->sync
);
784 subm
= READ_ONCE(rb
->subm
);
785 count
= pblk_rb_ring_count(subm
, sync
, rb
->nr_entries
);
787 for (i
= 0; i
< count
; i
++)
788 sync
= (sync
+ 1) & (rb
->nr_entries
- 1);
793 int pblk_rb_tear_down_check(struct pblk_rb
*rb
)
795 struct pblk_rb_entry
*entry
;
799 spin_lock(&rb
->w_lock
);
800 spin_lock_irq(&rb
->s_lock
);
802 if ((rb
->mem
== rb
->subm
) && (rb
->subm
== rb
->sync
) &&
803 (rb
->sync
== rb
->l2p_update
) &&
804 (rb
->sync_point
== EMPTY_ENTRY
)) {
813 for (i
= 0; i
< rb
->nr_entries
; i
++) {
814 entry
= &rb
->entries
[i
];
823 spin_unlock(&rb
->w_lock
);
824 spin_unlock_irq(&rb
->s_lock
);
829 unsigned int pblk_rb_wrap_pos(struct pblk_rb
*rb
, unsigned int pos
)
831 return (pos
& (rb
->nr_entries
- 1));
834 int pblk_rb_pos_oob(struct pblk_rb
*rb
, u64 pos
)
836 return (pos
>= rb
->nr_entries
);
839 ssize_t
pblk_rb_sysfs(struct pblk_rb
*rb
, char *buf
)
841 struct pblk
*pblk
= container_of(rb
, struct pblk
, rwb
);
842 struct pblk_c_ctx
*c
;
844 int queued_entries
= 0;
846 spin_lock_irq(&rb
->s_lock
);
847 list_for_each_entry(c
, &pblk
->compl_list
, list
)
849 spin_unlock_irq(&rb
->s_lock
);
851 if (rb
->sync_point
!= EMPTY_ENTRY
)
852 offset
= scnprintf(buf
, PAGE_SIZE
,
853 "%u\t%u\t%u\t%u\t%u\t%u\t%u - %u/%u/%u - %d\n",
859 #ifdef CONFIG_NVM_DEBUG
860 atomic_read(&rb
->inflight_sync_point
),
865 pblk_rb_read_count(rb
),
867 pblk_rb_sync_point_count(rb
),
870 offset
= scnprintf(buf
, PAGE_SIZE
,
871 "%u\t%u\t%u\t%u\t%u\t%u\tNULL - %u/%u/%u - %d\n",
877 #ifdef CONFIG_NVM_DEBUG
878 atomic_read(&rb
->inflight_sync_point
),
882 pblk_rb_read_count(rb
),
884 pblk_rb_sync_point_count(rb
),