Lines Matching full:each

30 applying a filter to each packet that assigns it to one of a small number
31 of logical flows. Packets for each flow are steered to a separate receive
41 implementation of RSS uses a 128-entry indirection table where each entry
60 for each CPU if the device supports enough queues, or otherwise at least
61 one for each memory domain, where a memory domain is a set of CPUs that
76 Each receive queue has a separate IRQ associated with it. The NIC triggers
79 that can route each interrupt to a particular CPU. The active mapping
84 affinity of each interrupt see Documentation/core-api/irq/irq-affinity.rst. Some systems
100 interrupts (and thus work) grows with each additional queue.
103 processors with hyperthreading (HT), each hyperthread is represented as
140 Each receive hardware queue has an associated list of CPUs to which
141 RPS may enqueue packets for processing. For each received packet,
157 can be configured for each receive queue using a sysfs file entry::
177 receive queue is mapped to each CPU, then RPS is probably redundant
179 RPS might be beneficial if the rps_cpus for each queue are the ones that
213 turned on. It is implemented for each CPU independently (to avoid lock
220 Per-flow rate is calculated by hashing each packet into a hashtable
263 The CPU recorded in each entry is the one which last processed the flow.
271 Each table value is a CPU index that is updated during calls to recvmsg
278 for each flow: rps_dev_flow_table is a table specific to each hardware
279 receive queue of each device. Each table value stores a CPU index and a
288 CPU's backlog when a packet in this flow was last enqueued. Each backlog
343 For a multi-queue device, the rps_flow_cnt for each queue might be
346 are 16 configured receive queues, rps_flow_cnt for each queue might be
355 the application thread consuming the packets of each flow is running.
373 to populate the map. For each CPU, the corresponding queue in the map is
384 configured for each receive queue by the driver, so no additional
411 (contention can be eliminated completely if each CPU has its own
425 threads are not pinned to CPUs and each thread handles packets
439 queues, is computed and maintained for each network device. When
486 system, XPS is preferably configured so that each CPU maps onto one queue.
487 If there are as many queues as there are CPUs in the system, then each