Home
last modified time | relevance | path

Searched refs:UBI_PROT_QUEUE_LEN (Results 1 - 4 of 4) sorted by relevance

/kernel/linux/linux-5.10/drivers/mtd/ubi/
H A Dubi.h73 #define UBI_PROT_QUEUE_LEN 10 macro
613 struct list_head pq[UBI_PROT_QUEUE_LEN];
1031 for ((i) = 0; (i) < UBI_PROT_QUEUE_LEN; (i)++) \
H A Dwl.c280 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) in in_pq()
294 * @e will stay for %UBI_PROT_QUEUE_LEN erase operations and will be
303 pq_tail = UBI_PROT_QUEUE_LEN - 1; in prot_queue_add()
304 ubi_assert(pq_tail >= 0 && pq_tail < UBI_PROT_QUEUE_LEN); in prot_queue_add()
528 if (ubi->pq_head == UBI_PROT_QUEUE_LEN) in serve_prot_queue()
530 ubi_assert(ubi->pq_head >= 0 && ubi->pq_head < UBI_PROT_QUEUE_LEN); in serve_prot_queue()
1792 for (i = 0; i < UBI_PROT_QUEUE_LEN; i++)
1944 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) {
/kernel/linux/linux-6.6/drivers/mtd/ubi/
H A Dubi.h73 #define UBI_PROT_QUEUE_LEN 10 macro
611 struct list_head pq[UBI_PROT_QUEUE_LEN];
1030 for ((i) = 0; (i) < UBI_PROT_QUEUE_LEN; (i)++) \
H A Dwl.c280 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) in in_pq()
294 * @e will stay for %UBI_PROT_QUEUE_LEN erase operations and will be
303 pq_tail = UBI_PROT_QUEUE_LEN - 1; in prot_queue_add()
304 ubi_assert(pq_tail >= 0 && pq_tail < UBI_PROT_QUEUE_LEN); in prot_queue_add()
528 if (ubi->pq_head == UBI_PROT_QUEUE_LEN) in serve_prot_queue()
530 ubi_assert(ubi->pq_head >= 0 && ubi->pq_head < UBI_PROT_QUEUE_LEN); in serve_prot_queue()
1802 for (i = 0; i < UBI_PROT_QUEUE_LEN; i++)
1954 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) {

Completed in 9 milliseconds