Home
last modified time | relevance | path

Searched refs:s_ack_queue (Results 1 – 5 of 5) sorted by relevance

/linux/drivers/infiniband/hw/hfi1/
H A Dtid_rdma.c398 priv->tid_req.e.ack = &qp->s_ack_queue[i]; in hfi1_qp_priv_init()
406 qp->s_ack_queue[i].priv = priv; in hfi1_qp_priv_init()
426 struct hfi1_ack_priv *priv = qp->s_ack_queue[i].priv; in hfi1_qp_priv_tid_free()
431 qp->s_ack_queue[i].priv = NULL; in hfi1_qp_priv_tid_free()
2098 e = &qp->s_ack_queue[i]; in tid_rdma_rcv_error()
2160 e = &qp->s_ack_queue[i]; in tid_rdma_rcv_error()
2222 * 2. Put TID RDMA READ REQ into the response queue (s_ack_queue) in hfi1_rc_rcv_tid_rdma_read_req()
2278 if (!qp->s_ack_queue[next].sent) { in hfi1_rc_rcv_tid_rdma_read_req()
2284 e = &qp->s_ack_queue[qp->r_head_ack_queue]; in hfi1_rc_rcv_tid_rdma_read_req()
2939 e = &qp->s_ack_queue[qpri in hfi1_handle_kdeth_eflags()
[all...]
H A Drc.c35 e = &qp->s_ack_queue[p]; in find_prev_entry()
100 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in make_rc_ack()
115 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in make_rc_ack()
131 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in make_rc_ack()
242 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in make_rc_ack()
270 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in make_rc_ack()
307 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in make_rc_ack()
3023 /* s_ack_queue is size rvt_size_atomic()+1 so use > not >= */ in hfi1_rc_rcv()
3028 if (!qp->s_ack_queue[next].sent) in hfi1_rc_rcv()
3032 e = &qp->s_ack_queue[q in hfi1_rc_rcv()
[all...]
H A Dqp.c612 if (qp->s_ack_queue) in qp_iter_print()
613 e = &qp->s_ack_queue[qp->s_tail_ack_queue]; in qp_iter_print()
/linux/drivers/infiniband/sw/rdmavt/
H A Dqp.c604 for (n = 0; qp->s_ack_queue && n < rvt_max_atomic(rdi); n++) { in rvt_clear_mr_refs()
605 struct rvt_ack_entry *e = &qp->s_ack_queue[n]; in rvt_clear_mr_refs()
668 for (i = 0; qp->s_ack_queue && i < rvt_max_atomic(rdi); i++) { in rvt_qp_acks_has_lkey()
669 struct rvt_ack_entry *e = &qp->s_ack_queue[i]; in rvt_qp_acks_has_lkey()
1100 qp->s_ack_queue = in rvt_create_qp()
1102 sizeof(*qp->s_ack_queue), in rvt_create_qp()
1105 if (!qp->s_ack_queue) in rvt_create_qp()
1268 kfree(qp->s_ack_queue); in rvt_create_qp()
1699 kfree(qp->s_ack_queue); in rvt_destroy_qp()
/linux/include/rdma/
H A Drdmavt_qp.h375 struct rvt_ack_entry *s_ack_queue; member
389 u8 r_head_ack_queue; /* index into s_ack_queue[] */
436 u8 s_tail_ack_queue; /* index into s_ack_queue[] */
437 u8 s_acked_ack_queue; /* index into s_ack_queue[] */