| /dpdk/doc/guides/contributing/ |
| H A D | abi_versioning.rst | 171 Assume we have a function as follows
213 application was linked to it. To see how this is done, we start with the
298 Immediately after the function, we add the VERSION_SYMBOL macro.
334 we add the BIND_DEFAULT_SYMBOL macro.
389 defined, we add this
410 Finally, we need to indicate to the :doc:`meson/ninja build system
413 versioning, in the ``meson.build`` file we add the following
436 Assume we have an experimental function ``rte_acl_create`` as follows:
471 When we promote the symbol to the stable ABI, we simply strip the
510 symbol as before, we now add the symbol to both the ``EXPERIMENTAL``
[all …]
|
| /dpdk/lib/lpm/ |
| H A D | meson.build | 12 # since header files have different names, we can install all vector headers
13 # without worrying about which architecture we actually need
|
| /dpdk/doc/guides/howto/ |
| H A D | virtio_user_for_container_networking.rst | 39 Different virtio PCI devices we usually use as a para-virtualization I/O in the
43 in DPDK's ether layer. And to minimize the change, we reuse already-existing
56 Here we use Docker as container engine. It also applies to LXC, Rocket with
95 Note: If we run all above setup on the host, it's a shm-based IPC.
101 * Cannot work with --huge-unlink option. As we need to reopen the hugepage
|
| H A D | rte_flow.rst | 22 In this example we will create a simple rule that drops packets whose IPv4
114 In this example we will create a simple rule that drops packets whose IPv4
217 In this example we will create a rule that routes all vlan id 123 to queue 3.
|
| /dpdk/doc/guides/sample_app_ug/ |
| H A D | ptpclient.rst | 104 And than we parse application specific arguments
148 As we saw above the ``main()`` function calls an application function on the
189 There are 3 types of packets on the RX path which we must parse to create a minimal
196 When we parse the *FOLLOW UP* packet we also create and send a *DELAY_REQUEST* packet.
197 Also when we parse the *DELAY RESPONSE* packet, and all conditions are met we adjust the PTP slave …
|
| H A D | vdpa.rst | 60 and we need to bind vfio-pci to them before running vdpa sample.
65 Then we can create 2 vdpa ports in interactive cmdline.
92 After the VMs launches, we can login the VMs and configure the ip, verify the
|
| H A D | flow_filtering.rst | 84 Once the initialization is complete, we set the flow rule using the
123 For this example we are configuring number of rx and tx queues that are connected
132 In the next step we create and apply the flow rule. which is to send packets
162 As we saw above the ``main()`` function calls an application function to handle
220 number of steps. In each step we build one level of the pattern starting with
|
| H A D | ipv4_multicast.rst | 202 so we can safely modify the data pointer of the input packet.
205 For example, for N destination ports, we need to invoke mcast_out_pkt() (N-1) times.
211 we need to invoke mcast_out_pkt() (N) times.
222 :start-after: Should we use rte_pktmbuf_clone() or not. 8<
|
| /dpdk/doc/guides/prog_guide/ |
| H A D | lpm_lib.rst | 59 we might need to continue the lookup process in the second level.
61 Since every entry of the tbl24 can potentially point to a tbl8, ideally, we would have 2^24 tbl8s,
140 Hence, in this case, we copy the exact same entry to every position indexed by one of these combina…
142 By doing this we ensure that during the lookup process, if a rule matching the IP address exists,
144 depending on whether we need to move to the next table or not.
186 If the entry is not in use, then it means we don't have a rule matching this IP.
190 then we use the tbl8 index to find out the tbl8 to be checked,
192 Similarly, if the entry is not in use, then we don't have a rule matching this IP address.
206 If we exhaust tbl8s, we won't be able to add any more rules.
209 A tbl8 is consumed whenever we have a new rule with depth bigger than 24,
[all …]
|
| H A D | lpm6_lib.rst | 75 or the subsequent tbl8s we might need to continue the lookup process in deeper levels of the tree.
78 to store every possible IPv6 rule, we would need a table with 2^128 entries.
82 we can greatly reduce memory consumption while maintaining a very good lookup speed (one memory acc…
152 Hence, in this case, we copy the exact same entry to every position indexed by one of these combina…
154 By doing this we ensure that during the lookup process, if a rule matching the IP address exists,
156 depending on how many times we need to move to the next table.
168 If the entry is not in use, then it means we don't have a rule matching this IP.
171 * If it is valid and the external entry flag is set to 1, then we use the tbl8 index to find out …
173 Similarly, if the entry is not in use, then we don't have a rule matching this IP address.
176 * Repeat the process until either we find an invalid entry (lookup miss) or a valid entry with th…
[all …]
|
| H A D | reorder_lib.rst | 56 For example, assuming that we have a buffer of 200 entries with a 350 minimum
57 sequence number, and we need to insert an early mbuf with 565 sequence number.
58 That means that we would need to move the windows at least 15 positions to
|
| H A D | fib_lib.rst | 113 to a rule stored in the tbl24 we might need to continue the lookup process in the second level.
116 ideally we would have 2\ :sup:`24` tbl8s, which would be the same as having a
120 we can greatly reduce memory consumption while maintaining a very good lookup speed.
|
| H A D | generic_receive_offload_lib.rst | 86 section, we will introduce an algorithm, which is used by TCP/IPv4 GRO
107 In DPDK GRO, we use a key-based algorithm to address the two challenges.
114 fields (we call them as "key"). To process an input packet, the algorithm
190 we check IPv4 ID fields for the packets whose DF bit is 0 and
|
| /dpdk/lib/acl/ |
| H A D | meson.build | 18 # a. we have AVX supported in minimum instruction set baseline
37 # we are building 64-bit binary AND binutils can generate proper code
42 # a. we have AVX512 supported in minimum instruction set
|
| /dpdk/lib/fib/ |
| H A D | meson.build | 16 # we are building 64-bit binary AND binutils can generate proper code
19 # a. we have AVX512F supported in minimum instruction set baseline
|
| /dpdk/examples/ |
| H A D | meson.build | 78 allow_skips = true # don't flag an error if we can't build an app
81 allow_skips = false # error out if we can't build a requested app
|
| /dpdk/kernel/linux/ |
| H A D | meson.build | 51 # if we are cross-compiling we need kernel_build_dir specified
|
| /dpdk/drivers/raw/ioat/ |
| H A D | meson.build | 5 # only use ioat rawdev driver if we don't have the equivalent dmadev ones
|
| /dpdk/doc/guides/nics/ |
| H A D | memif.rst | 125 Descriptors are assigned packet buffers in order of rings creation. If we have one ring
182 With single file segments we can calculate offset from the beginning of the file
213 In this example we run two instances of testpmd application and transmit packets over memif.
279 In this example we will create 2 memif ports connected into loopback.
290 Finally we can check port stats to see the traffic::
|
| /dpdk/license/ |
| H A D | lgpl-2.1.txt | 23 can use it too, but we suggest you first think carefully about whether
27 When we speak of free software, we are referring to freedom of use,
35 To protect your rights, we need to make restrictions that forbid
41 or for a fee, you must give the recipients all the rights that we gave
48 We protect your rights with a two-step method: (1) we copyright the
49 library, and (2) we offer you this license, which gives you legal
52 To protect each distributor, we want to make it very clear that
62 restrictive license from a patent holder. Therefore, we insist that
85 are the reason we use the ordinary General Public License for many
95 software only, so we use the Lesser General Public License.
[all …]
|
| /dpdk/drivers/crypto/ipsec_mb/ |
| H A D | meson.build | 18 # version comes with quotes, so we split based on " and take the middle
|
| /dpdk/kernel/freebsd/ |
| H A D | BSDmakefile.meson | 7 # source file is passed via KMOD_SRC as relative path, we only use final
|
| H A D | meson.build | 6 # for building kernel modules, we use kernel build system using make, as
|
| /dpdk/examples/vm_power_manager/ |
| H A D | meson.build | 33 # If we're on X86, pull in the x86 code for the branch monitor algo.
|
| /dpdk/drivers/ |
| H A D | meson.build | 43 # we always need a mempool driver, and ring is default, so make it mandatory
99 # For the find_library() case (but not with dependency()) we also
143 # are never built, so we allow suppression of the
|