Lines Matching refs:entry
15 * rvt_cq_enter - add a new entry to the completion queue
17 * @entry: work completion entry to add
18 * @solicited: true if @entry is solicited
25 bool rvt_cq_enter(struct rvt_cq *cq, struct ib_wc *entry, bool solicited)
78 trace_rvt_cq_enter(cq, entry, head);
80 uqueue[head].wr_id = entry->wr_id;
81 uqueue[head].status = entry->status;
82 uqueue[head].opcode = entry->opcode;
83 uqueue[head].vendor_err = entry->vendor_err;
84 uqueue[head].byte_len = entry->byte_len;
85 uqueue[head].ex.imm_data = entry->ex.imm_data;
86 uqueue[head].qp_num = entry->qp->qp_num;
87 uqueue[head].src_qp = entry->src_qp;
88 uqueue[head].wc_flags = entry->wc_flags;
89 uqueue[head].pkey_index = entry->pkey_index;
90 uqueue[head].slid = ib_lid_cpu16(entry->slid);
91 uqueue[head].sl = entry->sl;
92 uqueue[head].dlid_path_bits = entry->dlid_path_bits;
93 uqueue[head].port_num = entry->port_num;
94 /* Make sure entry is written before the head index. */
97 kqueue[head] = *entry;
103 (solicited || entry->status != IB_WC_SUCCESS))) {
125 * and poll for all pending entries. If a new completion entry
469 * @entry: pointer to array where work completions are placed
476 int rvt_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *entry)
494 for (npolled = 0; npolled < num_entries; ++npolled, ++entry) {
499 *entry = wc->kqueue[tail];