Lines Matching defs:queue
452 * the rcd wait queue to be fetched under the exp_lock and
470 struct tid_queue *queue)
476 priv = list_first_entry_or_null(&queue->queue_head,
488 * @queue: the queue to operate on
505 struct tid_queue *queue, struct rvt_qp *qp)
513 fqp = first_qp(rcd, queue);
523 * @queue: the queue to operate on
538 struct tid_queue *queue, struct rvt_qp *qp)
549 queue->dequeue++;
556 * @queue: the queue to operate on
560 * wait queue and the HFI1_S_WAIT_TID_SPACE s_flag is set.
565 struct tid_queue *queue, struct rvt_qp *qp)
574 list_add_tail(&priv->tid_wait, &queue->queue_head);
575 priv->tid_enqueue = ++queue->enqueue;
669 static void _tid_rdma_flush_wait(struct rvt_qp *qp, struct tid_queue *queue)
683 queue->dequeue++;
794 goto queue;
798 goto queue;
814 queue:
1496 goto queue;
1504 goto queue;
1536 queue:
1618 * @qp: the queue patch
2272 /* We've verified the request, insert it into the ack queue. */
2313 * queue, qpriv->r_tid_alloc follows qp->r_head_ack_queue. It is ok to
2566 * state. However, if the wqe queue is empty (qp->s_acked == qp->s_tail
3406 * queue. Rather than a computationaly expensive exact estimate of when
3408 * the flow queue it has to wait approximately (N + 1) * (number of
3416 struct tid_queue *queue)
3418 return qpriv->tid_enqueue - queue->dequeue;
3709 /* We've verified the request, insert it into the ack queue. */
4000 * Go though the entire ack queue and clear any outstanding
4175 * they might not appear sequentially in the queue. Therefore, the
4358 * (of any kind) in the queue.
5283 * req could be pointing at the previous ack queue entry
5452 * queue and false if the qp is already on the queue before
5453 * this call. Either way, the qp will be on the queue when the