HomeSort by: relevance | last modified time | path
    Searched refs:pcq_put (Results 1 - 18 of 18) sorted by relevancy

  /src/sys/sys/
pcq.h 43 bool pcq_put(pcq_t *, void *);
  /src/sys/kern/
subr_pcq.c 35 * Summary of the producer algorithm in pcq_put (may run many in
77 * Theorem 1. For pcq_put call that leads into pcq_get:
79 * item at C6, so items placed by pcq_put can be safely used by
100 * Theorem 2. For pcq_get call followed by pcq_put: Nulling out
176 * pcq_put: place an item at the end of the queue.
179 pcq_put(pcq_t *pcq, void *item) function
250 * or wakeup) being generated after the producer's pcq_put(),
267 * to pcq_items[c] by pcq_put().
  /src/sys/net/
pktqueue.c 426 if (__predict_false(!pcq_put(pktq_pcq(pq, ci), m))) {
497 while (!pcq_put(q, PKTQ_MARKER)) {
660 while (!pcq_put(q, m)) {
if_gre.c 209 if (!pcq_put(bq->bq_q, m)) {
  /src/share/man/man9/
Makefile 773 pcq.9 pcq_put.9
  /src/sys/dev/
sequencer.c 1431 pcq_put(sc->pcq, qi.qi_ptr);
  /src/sys/dev/pci/
if_vioif.c 843 if (__predict_false(!pcq_put(txc->txc_intrq, m))) {
if_ena.c 3042 ret = pcq_put(tx_ring->br, m);
if_vmx.c 3321 if (__predict_false(!pcq_put(txq->vxtxq_interq, m))) {
if_aq.c 5879 if (__predict_false(!pcq_put(txring->txr_pcq, m))) {
if_iavf.c 3158 if (__predict_false(!pcq_put(txr->txr_intrq, m))) {
if_ixl.c 2895 if (__predict_false(!pcq_put(txr->txr_intrq, m))) {
if_wm.c 8906 if (__predict_false(!pcq_put(txq->txq_interq, m))) {
9513 if (__predict_false(!pcq_put(txq->txq_interq, m))) {
if_mcx.c 7978 if (__predict_false(!pcq_put(tx->tx_pcq, m))) {
  /src/sys/dev/pci/ixgbe/
ix_txrx.c 253 if (__predict_false(!pcq_put(txr->txr_interq, m))) {
  /src/sys/net/lagg/
if_lagg_lacp.c 1265 if (pcq_put(lsc->lsc_du_q, (void *)m)) {
  /src/sys/dev/pci/igc/
if_igc.c 1659 if (__predict_false(!pcq_put(txr->txr_interq, m))) {
  /src/sys/dev/hyperv/
if_hvn.c 1205 if (__predict_false(!pcq_put(txr->txr_interq, m))) {

Completed in 67 milliseconds