| /f-stack/dpdk/drivers/mempool/ring/ |
| H A D | rte_mempool_ring.c | 149 .enqueue = common_ring_mp_enqueue, 158 .enqueue = common_ring_sp_enqueue, 167 .enqueue = common_ring_mp_enqueue, 176 .enqueue = common_ring_sp_enqueue, 186 .enqueue = rts_ring_mp_enqueue, 196 .enqueue = hts_ring_mp_enqueue,
|
| /f-stack/dpdk/doc/guides/prog_guide/ |
| H A D | ring_lib.rst | 22 * Multi-producer or single-producer enqueue 144 The enqueue operation is finished. 229 Multiple producer enqueue first step 251 Multiple producer enqueue second step 266 Multiple producer enqueue third step 295 Multiple producer enqueue last step 422 * enqueue/dequeue start 424 * enqueue/dequeue finish 428 before actual enqueue. 464 * enqueue/dequeue start [all …]
|
| H A D | compressdev.rst | 196 mbuf-chain and enqueue it for processing or, alternatively, it can 230 Operation status after enqueue / dequeue 300 complete. Application can enqueue multiple stateless ops in a single burst 428 A Stateful operation in DPDK compression means application invokes enqueue 440 Unlike stateless, application can enqueue only one stateful op from 579 devices the enqueue burst API will place the operations to be processed 581 operations is usually completed during the enqueue call to the compression 586 enqueue call. 604 area with reordering information so that it can determine enqueue order at 614 The burst enqueue API uses a compression device identifier and a queue pair [all …]
|
| H A D | cryptodev_lib.rst | 308 enqueue call. 345 The burst enqueue API uses a Crypto device identifier and a queue pair 358 The dequeue API uses the same format as the enqueue API of processed but 654 user more control to the enqueue and dequeue operations, including the 655 capability of precious enqueue/dequeue count, abandoning enqueue or dequeue 674 ready for enqueue and dequeue operation. There are two different enqueue 675 functions: ``rte_cryptodev_raw_enqueue`` to enqueue single raw data 692 enqueue status values are: 700 - The negative integer: error occurred during enqueue. 703 set as 0 twice without the enqueue function returning or setting enqueue status [all …]
|
| H A D | event_ethernet_rx_adapter.rst | 12 the ethdev port using ethdev poll mode APIs and enqueue these as events to the 147 it was not able to enqueue to the event device. 183 enqueue packets to the event device. The application may also use some other 187 to register a callback that selects which packets to enqueue to the event
|
| H A D | qos_framework.rst | 207 The port scheduler enqueue API is very similar to the API of the DPDK PMD TX function. 250 /* Hierarchical scheduler enqueue */ 347 The enqueue and dequeue of the same port are run by the same thread. 409 thus resulting in a pipelined implementation for the enqueue operation. 425 packet priority in order to yield the enqueue/drop decision for a specific packet 1210 * * Enqueue (make a decision to enqueue or drop an arriving packet) 1215 the enqueue operation is explained in :ref:`Section 2.23.3.2 <Enqueue_Operation>` 1328 * *s* = typical time between successive enqueue operations on this queue 1428 * Makes a random decision to enqueue or drop an arriving packet 1648 The syntax of the enqueue API is as follows: [all …]
|
| /f-stack/freebsd/sys/ |
| H A D | taskqueue.h | 76 taskqueue_enqueue_fn enqueue, 151 #define TASKQUEUE_DEFINE(name, enqueue, context, init) \ argument 159 taskqueue_create(#name, M_WAITOK, (enqueue), (context)); \ 175 #define TASKQUEUE_FAST_DEFINE(name, enqueue, context, init) \ argument 183 taskqueue_create_fast(#name, M_WAITOK, (enqueue), \ 219 taskqueue_enqueue_fn enqueue,
|
| /f-stack/dpdk/lib/librte_ring/ |
| H A D | rte_ring_peek_c11_mem.h | 54 uint32_t num, uint32_t enqueue) in __rte_ring_st_set_head_tail() argument 58 RTE_SET_USED(enqueue); in __rte_ring_st_set_head_tail() 98 uint32_t num, uint32_t enqueue) in __rte_ring_hts_set_head_tail() argument 102 RTE_SET_USED(enqueue); in __rte_ring_hts_set_head_tail()
|
| H A D | rte_ring_generic.h | 15 uint32_t single, uint32_t enqueue) in update_tail() argument 17 if (enqueue) in update_tail()
|
| H A D | rte_ring_c11_mem.h | 15 uint32_t single, uint32_t enqueue) in update_tail() argument 17 RTE_SET_USED(enqueue); in update_tail()
|
| H A D | rte_ring_hts_c11_mem.h | 26 uint32_t num, uint32_t enqueue) in __rte_ring_hts_update_tail() argument 30 RTE_SET_USED(enqueue); in __rte_ring_hts_update_tail()
|
| /f-stack/freebsd/kern/ |
| H A D | subr_taskqueue.c | 134 taskqueue_enqueue_fn enqueue, void *context, in _taskqueue_create() argument 154 queue->tq_enqueue = enqueue; in _taskqueue_create() 159 if (enqueue == taskqueue_fast_enqueue || in _taskqueue_create() 160 enqueue == taskqueue_swi_enqueue || in _taskqueue_create() 161 enqueue == taskqueue_swi_giant_enqueue || in _taskqueue_create() 162 enqueue == taskqueue_thread_enqueue) in _taskqueue_create() 171 taskqueue_enqueue_fn enqueue, void *context) in taskqueue_create() argument 174 return _taskqueue_create(name, mflags, enqueue, context, in taskqueue_create() 860 taskqueue_enqueue_fn enqueue, void *context) in taskqueue_create_fast() argument 862 return _taskqueue_create(name, mflags, enqueue, context, in taskqueue_create_fast()
|
| H A D | subr_gtaskqueue.c | 127 taskqueue_enqueue_fn enqueue, void *context, in _gtaskqueue_create() argument 147 queue->tq_enqueue = enqueue; in _gtaskqueue_create() 152 if (enqueue == gtaskqueue_thread_enqueue) in _gtaskqueue_create() 586 taskqueue_enqueue_fn enqueue, void *context) in gtaskqueue_create_fast() argument 588 return _gtaskqueue_create(name, mflags, enqueue, context, in gtaskqueue_create_fast()
|
| /f-stack/dpdk/doc/guides/eventdevs/ |
| H A D | dlb.rst | 222 worth of credits. For example, if an eventdev contains four ports with enqueue 227 retaining their initial credit allocation; in short, all ports must enqueue in 230 If a port attempts to enqueue and has no credits available, the enqueue 231 operation will fail and the application must retry the enqueue. Credits are 254 A port will fail to enqueue if the number of events in the system exceeds its 256 to enqueue if it lacks enough hardware credits to enqueue; load-balanced 258 used to enqueue to a directed queue. 262 If enqueue fails, DLB PMD sets rte_errno as follows: 269 to enqueue an event, and it must dequeue an event before it can recover the 270 credit. If the worker thread retries its enqueue indefinitely, it will not [all …]
|
| H A D | dsw.rst | 48 work, the application must perform enqueue and/or dequeue operations 51 Producer-only ports which currently have no events to enqueue should 67 of enqueue and/or dequeue operations.
|
| H A D | dlb2.rst | 213 worth of credits. For example, if an eventdev contains four ports with enqueue 218 retaining their initial credit allocation; in short, all ports must enqueue in 221 If a port attempts to enqueue and has no credits available, the enqueue 222 operation will fail and the application must retry the enqueue. Credits are 245 A port will fail to enqueue if the number of events in the system exceeds its 247 to enqueue if it lacks enough hardware credits to enqueue; load-balanced 249 used to enqueue to a directed queue. 253 If enqueue fails, DLB2 PMD sets rte_errno as follows: 260 to enqueue an event, and it must dequeue an event before it can recover the 261 credit. If the worker thread retries its enqueue indefinitely, it will not [all …]
|
| /f-stack/freebsd/x86/iommu/ |
| H A D | intel_fault.c | 131 bool enqueue; in dmar_fault_intr() local 134 enqueue = false; in dmar_fault_intr() 157 enqueue = true; in dmar_fault_intr() 183 if (enqueue) { in dmar_fault_intr()
|
| /f-stack/dpdk/drivers/mempool/stack/ |
| H A D | rte_mempool_stack.c | 82 .enqueue = stack_enqueue, 91 .enqueue = stack_enqueue,
|
| /f-stack/dpdk/lib/librte_mempool/ |
| H A D | rte_mempool_ops.c | 39 if (h->alloc == NULL || h->enqueue == NULL || in rte_mempool_register_ops() 60 ops->enqueue = h->enqueue; in rte_mempool_register_ops()
|
| /f-stack/dpdk/doc/guides/tools/ |
| H A D | testbbdev.rst | 82 Specifies operations enqueue/dequeue burst size. If not specified burst_size is 102 - Performs full operation of enqueue and dequeue 108 - Measures the CPU cycles consumed from the receipt of a user enqueue 111 (a) *SW Enq Offload Cost*: Software only enqueue offload cost, the cycle 112 counts and time (us) from the point the enqueue API is called until 116 from enqueue. 123 - Measures the time consumed from the first enqueue until the first 129 - Performs full operation of enqueue and dequeue 137 - Performs full operation of enqueue and dequeue 260 set to 300s and operations enqueue/dequeue burst size is set to 32. [all …]
|
| /f-stack/dpdk/doc/guides/howto/ |
| H A D | debug_troubleshoot.rst | 185 * If the desired burst dequeue falls behind the actual dequeue, the enqueue 188 * Extreme stall in the enqueue will lead to ``rte_ring_empty`` to be true. 257 #. Performance issue isolation for enqueue 259 * Ensure cryptodev, resources and enqueue is running on NUMA cores. 263 * Parallelize enqueue thread for varied multiple queue pair. 366 * If the failure is on the enqueue stage for events, check if queue depth 369 #. If there are performance drops in the enqueue stage 375 * Check the in-flight events for the desired queue for enqueue and dequeue.
|
| /f-stack/dpdk/lib/librte_regexdev/ |
| H A D | rte_regexdev.h | 1470 RTE_FUNC_PTR_OR_ERR_RET(*dev->enqueue, -ENOTSUP); in rte_regexdev_enqueue_burst() 1476 return (*dev->enqueue)(dev, qp_id, ops, nb_ops); in rte_regexdev_enqueue_burst()
|
| /f-stack/dpdk/doc/guides/nics/ |
| H A D | dpaa2.rst | 215 DPIO (Datapath I/O): provides interfaces to enqueue and dequeue 219 enqueue/dequeue packets. To enqueue something a descriptor is written 222 CPUs to simultaneously perform enqueue/dequeued operations. DPIOs are 314 . | |<enqueue, . 359 other drivers such as the Ethernet driver to enqueue and dequeue data for 364 - Hardware queuing operations (enqueue and dequeue of data) 373 performance, allowing different CPUs to simultaneously enqueue
|
| /f-stack/freebsd/netpfil/ipfw/ |
| H A D | dn_sched_fifo.c | 117 _SI( .enqueue = ) fifo_enqueue,
|
| H A D | dn_aqm.h | 103 int (*enqueue)(struct dn_queue *, struct mbuf *); member
|