Searched refs:UBI_PROT_QUEUE_LEN (Results 1 – 4 of 4) sorted by relevance
288 pq_tail = UBI_PROT_QUEUE_LEN - 1; in prot_queue_add()289 ubi_assert(pq_tail >= 0 && pq_tail < UBI_PROT_QUEUE_LEN); in prot_queue_add()521 if (ubi->pq_head == UBI_PROT_QUEUE_LEN) in serve_prot_queue()523 ubi_assert(ubi->pq_head >= 0 && ubi->pq_head < UBI_PROT_QUEUE_LEN); in serve_prot_queue()1550 for (i = 0; i < UBI_PROT_QUEUE_LEN; i++)1671 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) {1781 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i)
79 #define UBI_PROT_QUEUE_LEN 10 macro583 struct list_head pq[UBI_PROT_QUEUE_LEN];985 for ((i) = 0; (i) < UBI_PROT_QUEUE_LEN; (i)++) \
280 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) in in_pq()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()1774 for (i = 0; i < UBI_PROT_QUEUE_LEN; i++)1926 for (i = 0; i < UBI_PROT_QUEUE_LEN; ++i) {
73 #define UBI_PROT_QUEUE_LEN 10 macro613 struct list_head pq[UBI_PROT_QUEUE_LEN];1031 for ((i) = 0; (i) < UBI_PROT_QUEUE_LEN; (i)++) \