Home
last modified time | relevance | path

Searched refs:hop (Results 1 – 18 of 18) sorted by relevance

/f-stack/dpdk/lib/librte_lpm/
H A Drte_lpm_sse.h18 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], in rte_lpm_lookupx4()
77 *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES; in rte_lpm_lookupx4()
78 *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES; in rte_lpm_lookupx4()
111 hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
112 hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
113 hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
114 hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
H A Drte_lpm_neon.h19 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], in rte_lpm_lookupx4()
76 *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES; in rte_lpm_lookupx4()
77 *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES; in rte_lpm_lookupx4()
110 hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
111 hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
112 hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
113 hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
H A Drte_lpm_altivec.h19 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4], in rte_lpm_lookupx4()
83 *(uint64_t *)hop = pt & RTE_LPM_MASKX4_RES; in rte_lpm_lookupx4()
84 *(uint64_t *)(hop + 2) = pt2 & RTE_LPM_MASKX4_RES; in rte_lpm_lookupx4()
117 hop[0] = (tbl[0] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[0] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
118 hop[1] = (tbl[1] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[1] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
119 hop[2] = (tbl[2] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[2] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
120 hop[3] = (tbl[3] & RTE_LPM_LOOKUP_SUCCESS) ? tbl[3] & 0x00FFFFFF : defv; in rte_lpm_lookupx4()
H A Drte_lpm.h401 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
/f-stack/dpdk/app/test/
H A Dtest_lpm.c317 uint32_t hop[4]; in test7() local
339 TEST_LPM_ASSERT(hop[0] == next_hop_add); in test7()
340 TEST_LPM_ASSERT(hop[1] == UINT32_MAX); in test7()
341 TEST_LPM_ASSERT(hop[2] == UINT32_MAX); in test7()
342 TEST_LPM_ASSERT(hop[3] == next_hop_add); in test7()
368 uint32_t hop[4]; in test8() local
401 TEST_LPM_ASSERT(hop[0] == UINT32_MAX); in test8()
403 TEST_LPM_ASSERT(hop[2] == UINT32_MAX); in test8()
435 TEST_LPM_ASSERT(hop[2] == UINT32_MAX); in test8()
436 TEST_LPM_ASSERT(hop[3] == UINT32_MAX); in test8()
[all …]
/f-stack/dpdk/doc/guides/prog_guide/
H A Dlpm_lib.rst19 In this implementation, the user data is 1-byte long and is called next hop,
20 in correlation with its main use of storing the ID of the next hop in a routing table entry.
26 …If a rule with the same prefix is already present in the table, the next hop of the rule is update…
76 * next hop / index to the tbl8
85 or the next hop itself if the longest prefix match has already been found.
92 * next hop
100 Next hop and depth contain the same information as in the tbl24.
103 …r main data structure is a table containing the main information about the rules (IP and next hop).
120 * If the entry is invalid (i.e. it doesn't already contain a rule) then set its next hop to its v…
187 If it is valid and the external entry flag is set to 0, then the next hop is returned.
[all …]
H A Dlpm6_lib.rst29 In this implementation, the user data is 21-bits long and is called "next hop",
30 which corresponds to its main use of storing the ID of the next hop in a routing table entry.
36 …If a rule with the same prefix is already present in the table, the next hop of the rule is update…
43 …ts the rule that represents the best match for the given key and returns the next hop of that rule.
92 * next hop / index to the tbl8
103 or the next hop itself if the longest prefix match has already been found.
110 …data structure is a table containing the main information about the rules (IP, next hop and depth).
127 * If the entry is invalid (i.e. it doesn't already contain a rule) then set its next hop to its v…
145 and fill it with the next hop, setting the next entry flag to 0.
169 If it is valid and the external entry flag is set to 0, then the next hop is returned.
[all …]
H A Dgraph_lib.rst376 ``next-hop`` id with which the packet needs to be further processed.
385 This node gets packets from ``ip4_lookup`` node with next-hop id for each
389 ``rte_node_ip4_rewrite_add()`` is control path API to add next-hop info.
H A Dpacket_framework.rst40 as well as the next hop for the packet, which can be either another table, an output port or packet…
355 …ed for an IP packet (so the output interface and the IP address of the next hop station are known),
356 the MAC address of the next hop station is needed in order to send this packet onto the next leg of…
358 The MAC address of the next hop station becomes the destination MAC address of the outgoing Etherne…
366 *Key value (key data):* MAC address of the next hop station (6 bytes).
976 #. The table connectivity to other tables or to output ports is regulated by the next hop actions …
1011 …handle the user-defined actions, while the reserved actions (e.g. the next hop actions) are handle…
1019 A special category of the reserved actions is represented by the next hop actions, which regulate t…
1021 :numref:`table_qos_33` lists the next hop actions.
1028 …| # | Next hop action | Description …
/f-stack/dpdk/examples/ipsec-secgw/
H A Dipsec_worker.c131 uint32_t hop; in route4_pkt() local
138 ret = rte_lpm_lookup((struct rte_lpm *)rt_ctx, dst_ip, &hop); in route4_pkt()
142 return hop; in route4_pkt()
156 uint32_t hop; in route6_pkt() local
163 ret = rte_lpm6_lookup((struct rte_lpm6 *)rt_ctx, dst_ip, &hop); in route6_pkt()
167 return hop; in route6_pkt()
H A Dipsec-secgw.c928 uint32_t hop[MAX_PKT_BURST * 2]; in route4_pkts() local
954 rte_lpm_lookup_bulk((struct rte_lpm *)rt_ctx, dst_ip, hop, lpm_pkts); in route4_pkts()
964 pkt_hop = hop[lpm_pkts++]; in route4_pkts()
978 int32_t hop[MAX_PKT_BURST * 2]; in route6_pkts() local
1005 rte_lpm6_lookup_bulk_func((struct rte_lpm6 *)rt_ctx, dst_ip, hop, in route6_pkts()
1016 pkt_hop = hop[lpm_pkts++]; in route6_pkts()
/f-stack/freebsd/contrib/dpdk_rte_lpm/
H A Drte_lpm.h387 rte_lpm_lookupx4(const struct rte_lpm *lpm, xmm_t ip, uint32_t hop[4],
/f-stack/freebsd/contrib/device-tree/Bindings/net/dsa/
H A Ddsa.yaml63 full routing information must be given, not just the one hop
/f-stack/dpdk/doc/guides/sample_app_ug/
H A Dl3_forward_graph.rst28 The ID of the output interface for the input packet is the next hop returned by
288 /* Add next hop for a given destination */
311 as per next-hop data and transmit the packet via port 'Z' by enqueuing
H A Dl3_forward.rst34 The LPM object is used as the routing table to identify the next hop for each input packet at runti…
37 The ID of the output interface for the input packet is the next hop returned by the LPM lookup.
/f-stack/freebsd/contrib/device-tree/Bindings/
H A Dnuma.txt74 if relative distance for each hop is 20,
/f-stack/dpdk/doc/guides/nics/
H A Dsfc_efx.rst209 traffic class, hop limit)
/f-stack/dpdk/doc/guides/testpmd_app_ug/
H A Dtestpmd_funcs.rst3620 - ``hop {unsigned}``: hop limit.