| /dpdk/examples/qos_sched/ |
| H A D | profile_ov.cfg | 17 tb rate = 8400000 ; Bytes per second
20 tc 0 rate = 8400000 ; Bytes per second
21 tc 1 rate = 8400000 ; Bytes per second
22 tc 2 rate = 8400000 ; Bytes per second
23 tc 3 rate = 8400000 ; Bytes per second
24 tc 4 rate = 8400000 ; Bytes per second
25 tc 5 rate = 8400000 ; Bytes per second
26 tc 6 rate = 8400000 ; Bytes per second
27 tc 7 rate = 8400000 ; Bytes per second
28 tc 8 rate = 8400000 ; Bytes per second
[all …]
|
| H A D | profile.cfg | 32 tb rate = 1250000000 ; Bytes per second
35 tc 0 rate = 1250000000 ; Bytes per second
36 tc 1 rate = 1250000000 ; Bytes per second
37 tc 2 rate = 1250000000 ; Bytes per second
38 tc 3 rate = 1250000000 ; Bytes per second
39 tc 4 rate = 1250000000 ; Bytes per second
40 tc 5 rate = 1250000000 ; Bytes per second
41 tc 6 rate = 1250000000 ; Bytes per second
42 tc 7 rate = 1250000000 ; Bytes per second
43 tc 8 rate = 1250000000 ; Bytes per second
[all …]
|
| /dpdk/doc/guides/sample_app_ug/ |
| H A D | timer.rst | 81 * The first timer (timer0) is loaded on the main lcore and expires every second.
85 * The second timer (timer1) is loaded on the next available lcore every 333 ms.
91 :start-after: Load timer0, every second, on main lcore, reloaded automatically. 8<
103 The callback for the second timer (timer1) displays a message and reloads the timer on the next lco…
|
| H A D | ipv4_multicast.rst | 195 The second approach does not make a clone, it just increments the reference counter for all input p…
199 The second approach reuses both input packet's data and metadata.
207 The advantage of the second approach is that there is less work to be done for each outgoing packet,
215 As the number of outgoing ports (and/or input segments) grows, the second approach becomes more pre…
218 either the first (with cloning) or the second (without cloning) approach is taken:
|
| H A D | flow_filtering.rst | 231 Setting the second level of the pattern IP:
235 :start-after: Setting the second level of the pattern. 8<
236 :end-before: >8 End of setting the second level of the pattern.
|
| H A D | l2_forward_job_stats.rst | 294 After first read second try is issued.
298 :start-after: Read second try. 8<
299 :end-before: >8 End of read second try.
302 This second read is important to give job stats library a feedback how many packets was processed.
|
| H A D | dma.rst | 24 The example will print out statistics each second. The stats shows
71 * i SI: set the interval, in second, between statistics prints (default is 1)
75 incoming traffic and makes a copy of each packet. The second lcore then
|
| H A D | service_cores.rst | 94 from the difference in HW / SW availability. The second feature is a flexible
|
| H A D | ip_frag.rst | 22 * The second difference is that the forwarding decision is taken
|
| /dpdk/lib/fib/ |
| H A D | trie_avx512.c | 13 __m512i *first, __m512i *second, __m512i *third, __m512i *fourth) in transpose_x16() argument
43 *second = _mm512_permutexvar_epi32(perm_idxes.z, tmp3); in transpose_x16()
52 __m512i *first, __m512i *second) in transpose_x8() argument
66 *second = _mm512_permutexvar_epi64(perm_idxes.z, tmp4); in transpose_x8()
|
| /dpdk/doc/guides/prog_guide/ |
| H A D | ring_lib.rst | 128 The second step is to modify *ring->prod_head* in ring structure to point to the same location as p…
137 Enqueue second step
181 The second step is to modify ring->cons_head in the ring structure to point to the same location as…
190 Dequeue second step
235 The second step is to modify ring->prod_head in the ring structure to point to the same location as…
251 Multiple producer enqueue second step
395 one for head update, second for tail update.
|
| H A D | generic_segmentation_offload_lib.rst | 67 first part contains a copy of the original packet's headers, while the second
85 The second part of each output segment, represents a section of data from the
88 considerably), the second part of each output segment is an indirect mbuf,
132 an additional indirect mbuf is chained to the second part of the output segment,
|
| H A D | hash_lib.rst | 126 of a given key (explained below), and an index to the second table.
128 * The second table is an array of all the keys stored in the hash table and its data associated to …
159 the second table and the index in the second table is stored in the entry of the first table.
165 Notice that despite all the entry movement in the first table, the second table is not touched, whi…
185 the first and second tables. However, in the very unlikely event that a key can't be inserted after…
|
| H A D | lpm6_lib.rst | 52 In this case, instead of using two levels, one with a tbl24 and a second with a tbl8, 14 levels are…
160 So, for example, is the depth is 34 bits, it will be performed in the third level (second tbl8-base…
186 The second limitation is in the number of tbl8s available.
197 If they share the same first 24 bits, for instance, the tbl8 at the second level will be shared.
|
| H A D | fib_lib.rst | 111 while the second table(s) ``tbl8``, is indexed using the last 8 bits of the IP address.
113 to a rule stored in the tbl24 we might need to continue the lookup process in the second level.
|
| H A D | lpm_lib.rst | 57 while the second table(s), called tbl8, is indexed using the last 8 bits of the IP address.
59 we might need to continue the lookup process in the second level.
203 The second reason is an intrinsic limitation of the algorithm.
|
| H A D | metrics_lib.rst | 215 calculated statistics. For instance if per-second statistics are
216 desired, this function should be called once a second.
|
| H A D | trace_lib.rst | 25 frequently than log messages, often in the range of thousands per second, with
109 The second argument for the ``RTE_TRACE_POINT_REGISTER`` is the name for the
|
| /dpdk/doc/guides/tools/ |
| H A D | testeventdev.rst | 354 #. Measure the number of events can be processed in a second.
399 increments the number events processed and print periodically in one second
400 to get the number of events processed in one second.
481 #. Measure the number of events can be processed in a second.
646 periodically in one second to get the number of events processed in one
647 second.
|
| H A D | testregex.rst | 33 * Performance, in gigabit per second.
|
| H A D | testbbdev.rst | 70 *turbo_dec_test1.data* file and second time based on
133 - Results are printed in million operations per second and million bits
134 per second
|
| /dpdk/buildtools/pkg-config/ |
| H A D | meson.build | 25 # in the field Libs.private. The second occurences of DPDK libraries,
|
| /dpdk/config/ppc/ |
| H A D | meson.build | 120 # will have CPUs associated with NUMA nodes 0 & 8, so ensure that the second
|
| /dpdk/doc/guides/rel_notes/ |
| H A D | release_21_05.rst | 59 to support metering traffic by packet per second (PPS),
60 in addition to the initial bytes per second (BPS) mode (value 0).
138 * Added support for ASO metering by PPS (packet per second).
|
| /dpdk/doc/guides/faq/ |
| H A D | faq.rst | 108 The first 64B chunk is mapped to node 0, the second 64B chunk is mapped to node 1, the third to nod…
154 The second role of IOMMU is to allow protection from unwanted memory access by an unsafe device tha…
|