Lines Matching defs:entry
41 * ipath_cq_enter - add a new entry to the completion queue
43 * @entry: work completion entry to add
44 * @sig: true if @entry is a solicitated entry
48 void ipath_cq_enter(struct ipath_cq *cq, struct ib_wc *entry, int solicited)
81 wc->uqueue[head].wr_id = entry->wr_id;
82 wc->uqueue[head].status = entry->status;
83 wc->uqueue[head].opcode = entry->opcode;
84 wc->uqueue[head].vendor_err = entry->vendor_err;
85 wc->uqueue[head].byte_len = entry->byte_len;
86 wc->uqueue[head].ex.imm_data = (__u32 __force) entry->ex.imm_data;
87 wc->uqueue[head].qp_num = entry->qp->qp_num;
88 wc->uqueue[head].src_qp = entry->src_qp;
89 wc->uqueue[head].wc_flags = entry->wc_flags;
90 wc->uqueue[head].pkey_index = entry->pkey_index;
91 wc->uqueue[head].slid = entry->slid;
92 wc->uqueue[head].sl = entry->sl;
93 wc->uqueue[head].dlid_path_bits = entry->dlid_path_bits;
94 wc->uqueue[head].port_num = entry->port_num;
95 /* Make sure entry is written before the head index. */
98 wc->kqueue[head] = *entry;
114 if (entry->status != IB_WC_SUCCESS)
122 * @entry: pointer to array where work completions are placed
129 int ipath_poll_cq(struct ib_cq *ibcq, int num_entries, struct ib_wc *entry)
149 for (npolled = 0; npolled < num_entries; ++npolled, ++entry) {
153 *entry = wc->kqueue[tail];
173 * and poll for all pending entries. If a new completion entry