Searched refs:pidx (Results 1 - 25 of 39) sorted by relevance

12

/freebsd-11.0-release/sys/net/
H A Dmp_ring.c111 uint16_t pidx = os.pidx_tail; local
114 MPASS(cidx != pidx);
121 while (cidx != pidx) {
123 /* Items from cidx to pidx are available for consumption. */
124 n = r->drain(r, cidx, pidx);
143 * We update the cidx only if we've caught up with the pidx, the
147 if (cidx != pidx && pending < 64 && total < budget)
169 * associated with any pidx change that we notice here.
171 pidx = ns.pidx_tail;
186 uint16_t pidx local
[all...]
H A Diflib.h101 uint32_t ipi_pidx; /* start pidx for encap */
102 uint32_t ipi_new_pidx; /* next available pidx post-encap */
162 int (*ift_rxd_available) (void *, uint16_t qsidx, uint32_t pidx,
165 void (*ift_rxd_refill) (void * , uint16_t qsidx, uint8_t flidx, uint32_t pidx,
167 void (*ift_rxd_flush) (void *, uint16_t qsidx, uint8_t flidx, uint32_t pidx);
H A Diflib.c389 get_inuse(int size, int cidx, int pidx, int gen) argument
393 if (pidx > cidx)
394 used = pidx - cidx;
395 else if (pidx < cidx)
396 used = size - cidx + pidx;
397 else if (gen == 0 && pidx == cidx)
399 else if (gen == 1 && pidx == cidx)
414 * these are the cq cidx and pidx. Otherwise
1535 int pidx = fl->ifl_pidx; local
1536 iflib_rxsd_t rxsd = &fl->ifl_sds[pidx];
2432 int ntxd, i, pidx; local
2464 int i, next, pidx, mask, err, maxsegsz, ntxd, count; local
2567 int err, nsegs, ndesc, max_segs, pidx, cidx, next, ntxd; local
2858 iflib_txq_drain(struct ifmp_ring *r, uint32_t cidx, uint32_t pidx) argument
[all...]
/freebsd-11.0-release/contrib/ofed/libcxgb4/src/
H A Ddev.c257 u16 cidx, pidx; local
262 " SQ: id %u queue %p sw_queue %p cidx %u pidx %u in_use %u wq_pidx %u depth %u flags 0x%x flush_cidx %d\n"
263 " RQ: id %u queue %p sw_queue %p cidx %u pidx %u in_use %u depth %u\n",
273 qhp->wq.sq.pidx,
283 qhp->wq.rq.pidx,
287 pidx = qhp->wq.sq.pidx;
288 if (cidx != pidx)
290 while (cidx != pidx) {
317 fprintf(stderr, " <-- pidx");
[all...]
H A Dt4.h114 __be16 pidx; member in struct:t4_status_page
336 u16 pidx; member in struct:t4_sq
360 u16 pidx; member in struct:t4_rq
404 if (++wq->rq.pidx == wq->rq.size)
405 wq->rq.pidx = 0;
410 wq->rq.queue[wq->rq.size].status.host_pidx = wq->rq.pidx;
419 assert((wq->rq.cidx != wq->rq.pidx) || wq->rq.in_use == 0);
447 if (++wq->sq.pidx == wq->sq.size)
448 wq->sq.pidx = 0;
453 wq->sq.queue[wq->sq.size].status.host_pidx = (wq->sq.pidx);
[all...]
H A Dqp.c341 swsqe = &qhp->wq.sq.sw_sq[qhp->wq.sq.pidx];
378 swsqe->idx = qhp->wq.sq.pidx;
385 init_wr_hdr(wqe, qhp->wq.sq.pidx, fw_opcode, fw_flags, len16);
386 PDBG("%s cookie 0x%llx pidx 0x%x opcode 0x%x\n",
387 __func__, (unsigned long long)wr->wr_id, qhp->wq.sq.pidx,
444 qhp->wq.rq.sw_rq[qhp->wq.rq.pidx].wr_id = wr->wr_id;
448 wqe->recv.wrid = qhp->wq.rq.pidx;
453 PDBG("%s cookie 0x%llx pidx %u\n", __func__,
454 (unsigned long long) wr->wr_id, qhp->wq.rq.pidx);
H A Dcq.c111 while (idx != wq->sq.pidx) {
139 while (cidx != wq->sq.pidx) {
185 while (rptr != wq->sq.pidx) {
/freebsd-11.0-release/sys/dev/cxgbe/
H A Dt4_mp_ring.c109 uint16_t pidx = os.pidx_tail; local
112 MPASS(cidx != pidx);
119 while (cidx != pidx) {
121 /* Items from cidx to pidx are available for consumption. */
122 n = r->drain(r, cidx, pidx);
145 * We update the cidx only if we've caught up with the pidx, the
149 if (cidx != pidx && pending < 64 && total < budget)
173 * associated with any pidx change that we notice here.
175 pidx = ns.pidx_tail;
302 * that the items are visible to any thread that sees the updated pidx
[all...]
H A Dt4_netmap.c274 nm_txq->pidx = nm_txq->cidx = 0;
365 j /= 8; /* driver pidx to hardware pidx */
420 /* Wait for hw pidx to catch up ... */
421 while (be16toh(nm_txq->pidx) != spg->pidx)
425 while (spg->pidx != spg->cidx)
493 #define NMIDXDIFF(q, idx) IDXDIFF((q)->pidx, (q)->idx, (q)->sidx)
501 MPASS(nm_txq->pidx != nm_txq->dbidx);
523 __func__, nm_txq->doorbells, n, nm_txq->pidx, nm_tx
[all...]
H A Dt4_sge.c1854 MPASS(eq->pidx == eq->dbidx);
1859 if (eq->pidx == eq->cidx)
1862 available = IDXDIFF(eq->cidx, eq->pidx, eq->sidx) - 1;
1869 dst = (void *)&eq->desc[eq->pidx];
1870 if (__predict_true(eq->sidx - eq->pidx > n)) {
1873 eq->pidx += n;
1875 int first_portion = (eq->sidx - eq->pidx) * EQ_ESIZE;
1882 eq->pidx = n - (eq->sidx - eq->pidx);
1889 eq->equeqidx = eq->pidx;
2306 int ndesc, pidx; local
2380 eth_tx(struct mp_ring *r, u_int cidx, u_int pidx) argument
3787 uint16_t pidx = fl->pidx / 8; local
4430 uint16_t hw_cidx, pidx; local
[all...]
H A Dadapter.h440 uint16_t pidx; /* producer idx (desc idx) */ member in struct:sge_eq
441 uint16_t equeqidx; /* EQUEQ last requested at this pidx */
442 uint16_t dbidx; /* pidx of the most recent doorbell */
512 uint16_t dbidx; /* hw pidx after last doorbell */
518 uint32_t pidx; /* producer index */ member in struct:sge_fl
625 int pidx; member in struct:wrq_cookie
700 uint16_t pidx; member in struct:sge_nm_txq
702 uint16_t equiqidx; /* EQUIQ last requested at this pidx */
703 uint16_t equeqidx; /* EQUEQ last requested at this pidx */
704 uint16_t dbidx; /* pidx o
[all...]
/freebsd-11.0-release/sys/dev/cxgb/
H A Dcxgb_sge.c195 unsigned int pidx; member in struct:txq_state
703 struct rx_sw_desc *sd = &q->sdesc[q->pidx];
704 struct rx_desc *d = &q->desc[q->pidx];
760 if (++q->pidx == q->size) {
761 q->pidx = 0;
842 struct rx_desc *to = &q->desc[q->pidx];
844 q->sdesc[q->pidx] = q->sdesc[idx];
852 if (++q->pidx == q->size) {
853 q->pidx = 0;
1137 txqs->pidx
2198 write_ofld_wr(adapter_t *adap, struct mbuf *m, struct sge_txq *q, unsigned int pidx, unsigned int gen, unsigned int ndesc) argument
2270 unsigned int pidx, gen; local
2322 unsigned int gen, pidx; local
[all...]
H A Dcxgb_adapter.h209 uint32_t pidx; member in struct:sge_fl
237 uint32_t pidx; member in struct:sge_txq
/freebsd-11.0-release/sys/dev/xen/privcmd/
H A Dprivcmd.c157 vm_pindex_t pidx; local
163 pidx = OFF_TO_IDX(offset);
164 if (pidx >= map->size || BIT_ISSET(map->size, pidx, map->err))
184 vm_page_insert(page, object, pidx);
/freebsd-11.0-release/sys/dev/cxgbe/iw_cxgbe/
H A Dt4.h84 __be16 pidx; member in struct:t4_status_page
309 u16 pidx; member in struct:t4_sq
332 u16 pidx; member in struct:t4_rq
367 if (++wq->rq.pidx == wq->rq.size)
368 wq->rq.pidx = 0;
410 if (++wq->sq.pidx == wq->sq.size)
411 wq->sq.pidx = 0;
/freebsd-11.0-release/sys/dev/cxgbe/cxgbei/
H A Dcxgbei.c122 unsigned int pidx)
128 for (i = 0; i < (PPOD_PAGES + 1); i++, pidx++) {
129 ppod->addr[i] = pidx < gl->nelem ?
130 cpu_to_be64(gl->dma_sg[pidx].phys_addr) : 0ULL;
213 unsigned int pidx = 0, w_npods = 0, cnt; local
225 pidx += PPOD_PAGES) {
229 err = ppod_write_idata(ci, hdr, idx, cnt, gl, pidx, toep);
244 u_int pidx = 0; local
249 pidx += PPOD_PAGES) {
119 ppod_set(struct pagepod *ppod, struct cxgbei_ulp2_pagepod_hdr *hdr, struct cxgbei_ulp2_gather_list *gl, unsigned int pidx) argument
/freebsd-11.0-release/usr.sbin/bhyve/
H A Dvirtio.h454 int vq_getchain(struct vqueue_info *vq, uint16_t *pidx,
H A Dvirtio.c257 vq_getchain(struct vqueue_info *vq, uint16_t *pidx, argument
305 *pidx = next = vq->vq_avail->va_ring[idx & (vq->vq_qsize - 1)];
/freebsd-11.0-release/sys/dev/netmap/
H A Dnetmap_freebsd.c503 vm_pindex_t pidx; local
508 pidx = OFF_TO_IDX(offset);
537 vm_page_insert(page, object, pidx);
/freebsd-11.0-release/sys/netpfil/ipfw/
H A Dip_fw_sockopt.c166 struct tid_info *ti, struct obj_idx *pidx, int *unresolved);
2441 struct obj_idx *oib, struct obj_idx *pidx, struct tid_info *ti)
2452 for (p = oib; p < pidx; p++) {
2478 unref_oib_objects(ch, cmd, oib, pidx);
2622 * Saves object info in @pidx, sets
2629 struct obj_idx *pidx, int *unresolved)
2641 pidx->uidx = ti->uidx;
2642 pidx->type = ti->type;
2674 struct obj_idx *pidx; local
2678 pidx
2440 create_objects_compat(struct ip_fw_chain *ch, ipfw_insn *cmd, struct obj_idx *oib, struct obj_idx *pidx, struct tid_info *ti) argument
2628 ref_opcode_object(struct ip_fw_chain *ch, ipfw_insn *cmd, struct tid_info *ti, struct obj_idx *pidx, int *unresolved) argument
4569 ipfw_objhash_alloc_idx(void *n, uint16_t *pidx) argument
[all...]
H A Dip_fw_private.h701 int ipfw_objhash_alloc_idx(void *n, uint16_t *pidx);
715 struct obj_idx *oib, struct obj_idx *pidx, struct tid_info *ti);
/freebsd-11.0-release/sys/dev/cxgbe/common/
H A Dt4_hw.h100 volatile __be16 pidx; member in struct:sge_qstat
/freebsd-11.0-release/sys/x86/iommu/
H A Dintel_idpgtbl.c339 vm_pindex_t idx, pidx; local
345 for (pidx = idx = 0, i = 0; i < lvl; i++, pidx = idx) {
347 pidx * DMAR_NPTEPG + 1;
/freebsd-11.0-release/sys/dev/oce/
H A Doce_if.h296 ring->pidx = GET_Q_NEXT(ring->pidx, n, ring->num_items)
303 (void *)(((type *)DBUF_VA(&ring->dma)) + ring->pidx)
305 (uint64_t)(((type *)DBUF_PA(ring->dbuf)) + ring->pidx)
325 uint16_t pidx; /* Put Ptr */ member in struct:oce_ring_buffer_s
/freebsd-11.0-release/contrib/libgnuregex/
H A Dregexec.c1272 int *pidx, int node, re_node_set *eps_via_nodes,
1279 re_node_set *cur_nodes = &mctx->state_log[*pidx]->nodes;
1303 && push_fail_stack (fs, *pidx, candidate, nregs, regs,
1320 naccepted = check_node_accept_bytes (dfa, node, &mctx->input, *pidx);
1334 if (memcmp (buf + regs[subexp_idx].rm_so, buf + *pidx,
1347 if (re_node_set_contains (&mctx->state_log[*pidx]->nodes,
1354 || check_node_accept (mctx, dfa->nodes + node, *pidx))
1357 *pidx = (naccepted == 0) ? *pidx + 1 : *pidx
1268 proceed_next_node(const re_match_context_t *mctx, int nregs, regmatch_t *regs, int *pidx, int node, re_node_set *eps_via_nodes, struct re_fail_stack_t *fs) argument
1395 pop_fail_stack(struct re_fail_stack_t *fs, int *pidx, int nregs, regmatch_t *regs, re_node_set *eps_via_nodes) argument
[all...]

Completed in 250 milliseconds

12