Lines Matching defs:qindex
415 bqisclean(int qindex)
418 return (qindex >= QUEUE_CLEAN && qindex < QUEUE_CLEAN + CLEAN_QUEUES);
427 bqlock(int qindex)
430 return (struct mtx *)&bqlocks[qindex];
1312 binsfree(struct buf *bp, int qindex)
1316 if (qindex != QUEUE_EMPTY) {
1324 if (qindex == QUEUE_CLEAN) {
1326 qindex = bp->b_qindex;
1328 qindex = bqcleanq();
1334 nlock = bqlock(qindex);
1349 bp->b_qindex = qindex;
1500 buf_qrecycle(int qindex, bool kva)
1507 mtx_lock(&bqlocks[qindex]);
1508 nbp = TAILQ_FIRST(&bufqueues[qindex]);
1539 KASSERT(bp->b_qindex == qindex,
1540 ("getnewbuf: inconsistent queue %d bp %p", qindex, bp));
1546 mtx_unlock(&bqlocks[qindex]);
1554 mtx_lock(&bqlocks[qindex]);
1555 nbp = TAILQ_FIRST(&bufqueues[qindex]);
1562 mtx_unlock(&bqlocks[qindex]);
1576 int qindex, first_qindex;
1578 qindex = first_qindex = bqcleanq();
1580 if (buf_qrecycle(qindex, kva) == 0)
1582 if (++qindex == QUEUE_CLEAN + clean_queues)
1583 qindex = QUEUE_CLEAN;
1584 } while (qindex != first_qindex);
2269 int qindex;
2403 qindex = QUEUE_CLEAN;
2407 qindex = QUEUE_DIRTY;
2409 qindex = QUEUE_CLEAN;
2411 binsfree(bp, qindex);
2418 if (qindex == QUEUE_CLEAN)
2436 int qindex;
2442 qindex = QUEUE_NONE;
2462 qindex = QUEUE_DIRTY;
2471 qindex = QUEUE_CLEAN;
2473 binsfree(bp, qindex);
2478 if (qindex == QUEUE_CLEAN)