Home
last modified time | relevance | path

Searched refs:q (Results 1 – 25 of 451) sorted by relevance

12345678910>>...19

/f-stack/freebsd/sys/
H A Dqmath.h118 Q_TC(q, Q_SIGNED(q) ? ~(Q_SRAWMASK(q) | Q_CRAWMASK(q)) : ~Q_CRAWMASK(q))
123 #define Q_GIFRAW(q) Q_TC(q, (q) & Q_IFRAWMASK(q)) argument
125 #define Q_GIFVAL(q) Q_TC(q, Q_LTZ(q) ? -Q_GIFABSVAL(q) : Q_GIFABSVAL(q)) argument
140 #define Q_GIRAW(q) Q_TC(q, (q) & Q_IRAWMASK(q)) argument
141 #define Q_GIABSVAL(q) Q_TC(q, Q_GIRAW(q) >> Q_RPSHFT(q)) argument
142 #define Q_GIVAL(q) Q_TC(q, Q_LTZ(q) ? -Q_GIABSVAL(q) : Q_GIABSVAL(q)) argument
144 ((q) = ((q) & ~(Q_SRAWMASK(q) | Q_IRAWMASK(q))) | \
151 #define Q_GFRAW(q) Q_TC(q, (q) & Q_FRAWMASK(q)) argument
153 #define Q_GFVAL(q) Q_TC(q, Q_LTZ(q) ? -Q_GFABSVAL(q) : Q_GFABSVAL(q)) argument
155 ((q) = ((q) & ~(Q_SRAWMASK(q) | Q_FRAWMASK(q))) | \
[all …]
/f-stack/freebsd/netgraph/bluetooth/include/
H A Dng_bluetooth.h91 #define NG_BT_MBUFQ_FIRST(q) (q)->head argument
93 #define NG_BT_MBUFQ_LEN(q) (q)->len argument
95 #define NG_BT_MBUFQ_FULL(q) ((q)->len >= (q)->maxlen) argument
97 #define NG_BT_MBUFQ_DROP(q) (q)->drops ++ argument
109 (q)->len ++; \
116 (q)->head = (q)->head->m_nextpkt; \
120 (q)->len --; \
176 #define NG_BT_ITEMQ_FIRST(q) STAILQ_FIRST(&(q)->queue) argument
178 #define NG_BT_ITEMQ_LEN(q) NG_BT_MBUFQ_LEN((q)) argument
180 #define NG_BT_ITEMQ_FULL(q) NG_BT_MBUFQ_FULL((q)) argument
[all …]
/f-stack/freebsd/contrib/openzfs/module/zfs/
H A Dbqueue.c57 q->bq_size = 0; in bqueue_init()
58 q->bq_maxsize = size; in bqueue_init()
72 ASSERT0(q->bq_size); in bqueue_destroy()
76 mutex_exit(&q->bq_lock); in bqueue_destroy()
88 while (q->bq_size + item_size > q->bq_maxsize) { in bqueue_enqueue_impl()
89 cv_wait_sig(&q->bq_add_cv, &q->bq_lock); in bqueue_enqueue_impl()
91 q->bq_size += item_size; in bqueue_enqueue_impl()
93 if (q->bq_size >= q->bq_maxsize / q->bq_fill_fraction) in bqueue_enqueue_impl()
97 mutex_exit(&q->bq_lock); in bqueue_enqueue_impl()
136 cv_wait_sig(&q->bq_pop_cv, &q->bq_lock); in bqueue_dequeue()
[all …]
/f-stack/dpdk/drivers/net/fm10k/
H A Dfm10k_rxtx.c180 q->next_dd = (q->next_dd + q->nb_desc - count) % in fm10k_recv_pkts()
186 for (; q->next_alloc <= q->next_trigger; ++q->next_alloc) { in fm10k_recv_pkts()
187 mbuf = q->sw_ring[q->next_alloc]; in fm10k_recv_pkts()
195 q->hw_ring[q->next_alloc] = desc; in fm10k_recv_pkts()
338 q->next_dd = (q->next_dd + q->nb_desc - count) % in fm10k_recv_scattered_pkts()
344 for (; q->next_alloc <= q->next_trigger; ++q->next_alloc) { in fm10k_recv_scattered_pkts()
574 if (q->last_free == q->nb_desc) in tx_free_descriptors()
617 q->sw_ring[q->next_free] = mb; in tx_xmit_pkt()
620 q->hw_ring[q->next_free].buflen = in tx_xmit_pkt()
638 if (++q->next_free == q->nb_desc) in tx_xmit_pkt()
[all …]
/f-stack/freebsd/net/altq/
H A Daltq_classq.h70 #define qtype(q) (q)->qtype_ /* Get queue type */ argument
72 #define qlen(q) (q)->qlen_ /* Current queue length. */ argument
73 #define qsize(q) (q)->qsize_ /* Current queue size. */ argument
74 #define qtail(q) (q)->tail_ /* Tail of the queue */ argument
75 #define qhead(q) ((q)->tail_ ? (q)->tail_->m_nextpkt : NULL) argument
81 #define q_is_red_or_rio(q) ((q)->qtype_ == Q_RED || (q)->qtype_ == Q_RIO) argument
107 qlen(q)++; in _addq()
122 qlen(q)--; in _getq()
145 qlen(q)--; in _getq_tail()
173 qlen(q)--; in _getq_random()
[all …]
/f-stack/freebsd/netpfil/ipfw/
H A Ddn_sched_qfq.c327 q->iwsum = ONE_FP / q->wsum; /* XXX note theory */ in qfq_new_queue()
341 q->iwsum = ONE_FP / q->wsum; in qfq_free_queue()
385 q->bitmaps[dst] |= q->bitmaps[src] & mask; in qfq_move_groups()
498 (void)q; in qfq_slot_rotate()
508 ineligible = q->bitmaps[IR] | q->bitmaps[IB]; in qfq_update_eligible()
528 (void)q; in qfq_update_class()
564 grp = qfq_ffs(q, q->bitmaps[ER]); in qfq_dequeue()
576 q->V += (uint64_t)m->m_pkthdr.len * q->iwsum; in qfq_dequeue()
604 NO(if (!q->bitmaps[ER] && q->queued) in qfq_dequeue()
791 qfq_update_eligible(q, q->V);
[all …]
H A Ddn_sched_prio.c95 si->q_array[prio] = q; in prio_enqueue()
97 q = si->q_array[prio]; in prio_enqueue()
99 if (dn_enqueue(q, m, 0)) in prio_enqueue()
120 struct dn_queue *q; in prio_dequeue() local
129 q = si->q_array[prio]; in prio_dequeue()
132 m = dn_dequeue(q); in prio_dequeue()
171 if (q->mq.head == NULL) in prio_new_queue()
180 si->q_array[prio] = q; in prio_new_queue()
189 q->ni.length = 0; in prio_new_queue()
191 q->ni.len_bytes = 0; in prio_new_queue()
[all …]
H A Ddn_sched_rr.c87 q->credit = q->quantum; /* initialize credit */ in rr_append()
91 si->head = q; in rr_append()
93 si->tail->qnext = q; in rr_append()
123 if (q->status != 1) in remove_queue_q()
125 if (q == si->head) { in remove_queue_q()
134 if (q == si->tail) in remove_queue_q()
136 q->status = 0; in remove_queue_q()
160 if (m != q->mq.head) in rr_enqueue()
269 q->quantum = quantum; in rr_new_queue()
271 q->credit = q->quantum; in rr_new_queue()
[all …]
H A Ddn_sched_wf2q.c139 struct dn_fsk *fs = q->fs; in wf2qp_enqueue()
144 if (m != q->mq.head) { in wf2qp_enqueue()
198 struct dn_queue *q; in wf2qp_dequeue() local
235 q = HEAP_TOP(neh)->object; in wf2qp_dequeue()
238 heap_insert(sch, alg_fq->F, q); in wf2qp_dequeue()
243 q = HEAP_TOP(sch)->object; in wf2qp_dequeue()
245 m = dn_dequeue(q); in wf2qp_dequeue()
310 q->S = q->F + 1; /* mark timestamp as invalid. */ in wf2qp_new_queue()
332 si->wsum -= q->fs->fs.par[0]; in wf2qp_free_queue()
339 if (q->mq.head == NULL) { in wf2qp_free_queue()
[all …]
H A Ddn_sched.h169 dn_dequeue(struct dn_queue *q) in dn_dequeue() argument
171 struct mbuf *m = q->mq.head; in dn_dequeue()
176 if (q->fs->aqmfp && q->fs->aqmfp->dequeue ) in dn_dequeue()
177 return q->fs->aqmfp->dequeue(q); in dn_dequeue()
179 q->mq.head = m->m_nextpkt; in dn_dequeue()
180 q->mq.count--; in dn_dequeue()
183 q->ni.length--; in dn_dequeue()
184 q->ni.len_bytes -= m->m_pkthdr.len; in dn_dequeue()
185 if (q->_si) { in dn_dequeue()
186 q->_si->ni.length--; in dn_dequeue()
[all …]
H A Dip_dn_io.c302 q->head = m; in mq_append()
305 q->count++; in mq_append()
306 q->tail = m; in mq_append()
350 q->ni.len_bytes : q->ni.length; in red_drops()
367 if (q->avg) { in red_drops()
418 if (SCALE_MUL(p_b, SCALE((int64_t)q->count)) > q->random) { in red_drops()
502 if (q->fs == NULL || q->_si == NULL) { in dn_enqueue()
504 __FUNCTION__, q->fs, q->_si); in dn_enqueue()
523 return q->fs->aqmfp->enqueue(q ,m); in dn_enqueue()
544 q->ni.drops++; in dn_enqueue()
[all …]
H A Ddn_sched_fq_codel_helper.h61 m = fq_codel_extract_head(q, &pkt_ts, si); in fqc_dodequeue()
65 q->cst.first_above_time= 0; in fqc_dodequeue()
83 if (sojourn_time < schk->cfg.ccfg.target || q->stats.len_bytes <= q->cst.maxpkt_size) { in fqc_dodequeue()
85 q->cst.first_above_time = 0; in fqc_dodequeue()
87 if (q->cst.first_above_time == 0) { in fqc_dodequeue()
91 } else if (now >= q->cst.first_above_time) { in fqc_dodequeue()
109 cst = &q->cst; in fqc_codel_dequeue()
113 m = fqc_dodequeue(q, now, &ok_to_drop, si); in fqc_codel_dequeue()
137 fq_update_stats(q, si, 0, 1); in fqc_codel_dequeue()
159 fq_update_stats(q, si, 0, 1); in fqc_codel_dequeue()
[all …]
/f-stack/dpdk/drivers/net/cxgbe/
H A Dsge.c672 #define Q_IDXDIFF(q, idx) IDXDIFF((q)->pidx, (q)->idx, (q)->size) argument
673 #define R_IDXDIFF(q, idx) IDXDIFF((q)->cidx, (q)->idx, (q)->size) argument
713 q->db_pidx = q->pidx; in ring_tx_db()
742 q->dbidx = q->pidx; in ring_tx_db()
791 q->pidx -= q->size; in txq_advance()
876 q->equeidx = q->pidx; in ship_tx_pkt_coalesce_wr()
1388 q->full = txq_avail(&q->q) < ndesc ? 1 : 0; in ctrl_xmit()
1394 wr = (struct fw_wr_hdr *)&q->q.desc[q->q.pidx]; in ctrl_xmit()
1405 ring_tx_db(q->adapter, &q->q); in ctrl_xmit()
1662 ret = q->handler(q, q->cur_desc, NULL); in process_responses()
[all …]
/f-stack/freebsd/contrib/dev/ath/ath_hal/ar9300/
H A Dar9300_xmit.c143 int q; in ar9300_setup_tx_queue() local
166 for (q = 0; in ar9300_setup_tx_queue()
168 q++) in ar9300_setup_tx_queue()
188 qi = &ahp->ah_txq[q]; in ar9300_setup_tx_queue()
215 return q; in ar9300_setup_tx_queue()
259 qi = &ahp->ah_txq[q]; in ar9300_release_tx_queue()
672 __func__, ar9300_num_tx_pending(ah, q), q); in ar9300_stop_tx_dma()
777 __func__, ar9300_num_tx_pending(ah, q), q); in ar9300_stop_tx_dma_indv_que()
839 int i, q; in ar9300_abort_tx_dma() local
914 for (q = AR_NUM_QCU - 1; q >= 0; q--) { in ar9300_abort_tx_dma()
[all …]
/f-stack/dpdk/examples/performance-thread/common/
H A Dlthread_queue.h98 return q->tail == q->head; in _lthread_queue_empty()
109 if (q == NULL) in _lthread_queue_destroy()
115 _qnode_free(q->head); in _lthread_queue_destroy()
116 rte_free(q); in _lthread_queue_destroy()
128 *q, void *data) in _lthread_queue_insert_mp()
150 DIAG_COUNT_INC(q, wr); in _lthread_queue_insert_mp()
162 *q, void *data) in _lthread_queue_insert_sp()
176 prev = q->head; in _lthread_queue_insert_sp()
179 DIAG_COUNT_INC(q, wr); in _lthread_queue_insert_sp()
202 q->tail = next; in _lthread_queue_poll()
[all …]
/f-stack/dpdk/drivers/net/octeontx2/
H A Dotx2_ethdev_irq.c205 for (q = 0; q < eth_dev->data->nb_rx_queues; q++) { in nix_lf_q_irq()
217 for (q = 0; q < eth_dev->data->nb_rx_queues; q++) { in nix_lf_q_irq()
232 for (q = 0; q < eth_dev->data->nb_tx_queues; q++) { in nix_lf_q_irq()
277 for (q = 0; q < qs; q++) { in oxt2_nix_register_queue_irqs()
287 dev->qints_mem[q].qintx = q; in oxt2_nix_register_queue_irqs()
313 int vec, q; in oxt2_nix_unregister_queue_irqs() local
315 for (q = 0; q < dev->configured_qints; q++) { in oxt2_nix_unregister_queue_irqs()
342 for (q = 0; q < dev->configured_cints; q++) { in oxt2_nix_register_cq_irqs()
352 dev->cints_mem[q].qintx = q; in oxt2_nix_register_cq_irqs()
400 int vec, q; in oxt2_nix_unregister_cq_irqs() local
[all …]
/f-stack/app/redis-5.0.5/deps/jemalloc/test/integration/
H A Drallocx.c44 void *p, *q; in TEST_BEGIN() local
65 p = q; in TEST_BEGIN()
73 tsz = sallocx(q, 0); in TEST_BEGIN()
76 p = q; in TEST_BEGIN()
107 void *p, *q; in TEST_BEGIN() local
140 p = q; in TEST_BEGIN()
151 void *p, *q; in TEST_BEGIN() local
166 q, align); in TEST_BEGIN()
167 p = q; in TEST_BEGIN()
175 void *p, *q; in TEST_BEGIN() local
[all …]
/f-stack/dpdk/drivers/raw/octeontx2_ep/
H A Dotx2_ep_rawdev.c69 uint32_t rawdev_queues, q; in sdp_vfdev_exit() local
78 for (q = 0; q < rawdev_queues; q++) { in sdp_vfdev_exit()
93 for (q = 0; q < rawdev_queues; q++) { in sdp_vfdev_exit()
132 uint32_t rawdev_queues, q; in sdp_vfdev_init() local
147 for (q = 0; q < rawdev_queues; q++) { in sdp_vfdev_init()
155 for (q = 0; q < rawdev_queues; q++) { in sdp_vfdev_init()
169 for (q = 0; q < rawdev_queues; q++) { in sdp_vfdev_init()
187 for (q = 0; q < sdpvf->num_oqs; q++) in sdp_vfdev_init()
188 sdp_delete_oqs(sdpvf, q); in sdp_vfdev_init()
192 for (q = 0; q < sdpvf->num_iqs; q++) in sdp_vfdev_init()
[all …]
/f-stack/dpdk/drivers/net/ionic/
H A Dionic_dev.c337 struct ionic_queue *q = &qcq->q; in ionic_dev_cmd_adminq_init() local
434 q->lif = lif; in ionic_q_init()
435 q->idev = idev; in ionic_q_init()
442 q->pid = pid; in ionic_q_init()
464 writeq(IONIC_DBELL_QID(q->hw_index) | q->head_idx, q->db); in ionic_q_flush()
471 struct ionic_desc_info *head = &q->info[q->head_idx]; in ionic_q_post()
476 q->head_idx = (q->head_idx + 1) & (q->num_descs - 1); in ionic_q_post()
488 avail += q->num_descs - q->head_idx - 1; in ionic_q_space_avail()
509 desc_info = &q->info[q->tail_idx]; in ionic_q_service()
512 desc_info->cb(q, q->tail_idx, cq_desc_index, in ionic_q_service()
[all …]
H A Dionic_rxtx.c63 struct ionic_queue *q = &txq->q; in ionic_txq_info_get() local
98 q_desc_info = &q->info[q->tail_idx]; in ionic_tx_flush()
100 q->tail_idx = (q->tail_idx + 1) & (q->num_descs - 1); in ionic_tx_flush()
105 rte_prefetch0(&q->info[q->tail_idx]); in ionic_tx_flush()
496 struct ionic_queue *q = &txq->q; in ionic_xmit_pkts() local
603 struct ionic_queue *q = &rxq->q; in ionic_rxq_info_get() local
619 while (q->tail_idx != q->head_idx) { in ionic_rx_empty()
620 cur = &q->info[q->tail_idx]; in ionic_rx_empty()
624 q->tail_idx = (q->tail_idx + 1) & (q->num_descs - 1); in ionic_rx_empty()
879 struct ionic_queue *q = &rxq->q; in ionic_rx_fill() local
[all …]
/f-stack/dpdk/drivers/mempool/octeontx2/
H A Dotx2_mempool_irq.c149 uint32_t q, pool, aura; in npa_lf_q_irq() local
159 for (q = 0; q < lf->nr_pools; q++) { in npa_lf_q_irq()
164 pool = q % lf->qints; in npa_lf_q_irq()
178 for (q = 0; q < lf->nr_pools; q++) { in npa_lf_q_irq()
184 aura = q % lf->qints; in npa_lf_q_irq()
214 for (q = 0; q < qs; q++) { in npa_lf_register_queue_irqs()
224 qintmem += q; in npa_lf_register_queue_irqs()
227 qintmem->qintx = q; in npa_lf_register_queue_irqs()
250 int vec, q, qs; in npa_lf_unregister_queue_irqs() local
255 for (q = 0; q < qs; q++) { in npa_lf_unregister_queue_irqs()
[all …]
/f-stack/freebsd/netinet/
H A Dtcp_reass.c249 tcp_log_reassm(tp, q, NULL, q->tqe_start, q->tqe_len, TCP_R_LOG_DUMP, 0); in tcp_reass_log_dump()
403 q->tqe_m = m; in tcp_reass_replace()
415 q->tqe_m->m_pkthdr.len = q->tqe_len; in tcp_reass_replace()
458 if (q == NULL) { in tcp_reass_merge_forward()
468 if (SEQ_GEQ(max, (q->tqe_start + q->tqe_len))) { in tcp_reass_merge_forward()
882 q = p; in tcp_reass()
1051 KASSERT(q == NULL || SEQ_GEQ(q->tqe_start, tp->rcv_nxt), in tcp_reass()
1053 if (!q || q->tqe_start != tp->rcv_nxt) { in tcp_reass()
1069 tcp_reass_log_new_in(tp, q->tqe_start, q->tqe_len, q->tqe_m, TCP_R_LOG_READ, q); in tcp_reass()
1090 q = nq; in tcp_reass()
[all …]
/f-stack/freebsd/netinet/libalias/
H A Dalias_nbt.c435 if (q == NULL || (char *)(q + 1) > pmax) { in AliasHandleQuestion()
443 q = q + 1; in AliasHandleQuestion()
492 if (q == NULL || (char *)(q + 1) > pmax) in AliasHandleResourceNB()
565 if (q == NULL || (char *)(q + 1) > pmax) in AliasHandleResourceA()
624 if (q == NULL || (char *)(q + 1) > pmax) in AliasHandleResourceNULL()
659 if (q == NULL || (char *)(q + 1) > pmax) in AliasHandleResourceNS()
692 if (q == NULL || (char *)(q + 1) > pmax) in AliasHandleResourceNBSTAT()
719 if (q == NULL || (char *)(q + 1) > pmax) in AliasHandleResource()
729 q, in AliasHandleResource()
736 q, in AliasHandleResource()
[all …]
/f-stack/app/nginx-1.16.1/src/core/
H A Dngx_queue.c54 ngx_queue_t *q, *prev, *next; in ngx_queue_sort() local
56 q = ngx_queue_head(queue); in ngx_queue_sort()
58 if (q == ngx_queue_last(queue)) { in ngx_queue_sort()
62 for (q = ngx_queue_next(q); q != ngx_queue_sentinel(queue); q = next) { in ngx_queue_sort()
64 prev = ngx_queue_prev(q); in ngx_queue_sort()
65 next = ngx_queue_next(q); in ngx_queue_sort()
67 ngx_queue_remove(q); in ngx_queue_sort()
70 if (cmp(prev, q) <= 0) { in ngx_queue_sort()
78 ngx_queue_insert_after(prev, q); in ngx_queue_sort()
/f-stack/dpdk/drivers/baseband/fpga_lte_fec/
H A Dfpga_lte_fec.c783 q->head_free_desc = q->tail; in fpga_queue_setup()
851 q->tail = q->head_free_desc = 0; in fpga_queue_start()
921 if (q != NULL && q->q_idx == q_idx) in get_queue_id()
1074 q->tail = (q->tail + num_desc) & q->sw_ring_wrap_mask; in fpga_dma_enqueue()
1956 q->head_free_desc - q->tail - 1 : in fpga_enqueue_enc()
1957 q->ring_ctrl_reg.ring_size + q->head_free_desc - q->tail - 1; in fpga_enqueue_enc()
1988 q->head_free_desc, q->tail); in fpga_enqueue_enc()
2025 q->head_free_desc - q->tail - 1 : in fpga_enqueue_dec()
2026 q->ring_ctrl_reg.ring_size + q->head_free_desc - q->tail - 1; in fpga_enqueue_dec()
2057 q->head_free_desc, q->tail); in fpga_enqueue_dec()
[all …]

12345678910>>...19