Home
last modified time | relevance | path

Searched full:hop (Results 1 – 25 of 276) sorted by relevance

12345678910>>...12

/freebsd/sys/contrib/dpdk_rte_lpm/
H A Drte_lpm.h73 * Stores Next hop (tbl8 or tbl24 when valid_group is not set) or
82 * - valid_group == 0: entry stores a next hop
114 uint32_t next_hop; /**< Rule next hop. */
203 * Next hop of the rule to be added to the LPM table
212 * and provide its next hop if it is.
221 * Next hop of the rule (valid only if it is found)
266 * Next hop of the most specific rule found for IP (valid on lookup hit only)
313 * Next hop of the most specific rule found for IP (valid on lookup hit only).
317 * actual next hop.
373 * @param hop
[all …]
H A Drte_lpm6.h99 * Next hop of the rule to be added to the LPM table
109 * and provide its next hop if it is.
118 * Next hop of the rule (valid only if it is found)
177 * Next hop of the most specific rule found for IP (valid on lookup hit only)
192 * Next hop of the most specific rule found for IP (valid on lookup hit only).
193 * This is an array of two byte values. The next hop will be stored on
/freebsd/share/man/man4/
H A Dip6.479 uint8_t ip6_un1_hlim; /* hop limit */
107 specifies the hop limit.
146 Get or set the default hop limit header field for outgoing unicast
167 Get or set the default hop limit header field for outgoing multicast
171 Datagrams with a hop limit of 1 are not forwarded beyond the local
173 Multicast datagrams with a hop limit of zero will not be transmitted on
177 Multicast datagrams with a hop limit greater than 1 may be forwarded to
194 A multicast datagram sent with an initial hop limit greater than 1 may
263 Get or set whether the hop limit header field from subsequent packets
271 .\" Get or set whether the address of the next hop for subsequent
[all …]
/freebsd/contrib/tcpdump/
H A Dprint-ip6.c145 * "should appear after hop-by-hop, routing, and in ip6_finddst()
269 * to *find* a Jumbo Payload hop-by-hop option and, when we've in ip6_print()
336 * The Hop-by-Hop Options header, when present, in ip6_print()
340 ND_PRINT("[The Hop-by-Hop Options header was already found]"); in ip6_print()
345 ND_PRINT("[The Hop-by-Hop Options header don't follow the IPv6 header]"); in ip6_print()
351 ND_PRINT("[No valid Jumbo Payload Hop-by-Hop option found]"); in ip6_print()
H A Dprint-ip6opts.c152 /* Not a hop-by-hop option - not valid */ in ip6_opt_process()
154 ND_PRINT("(jumbo: %u - not a hop-by-hop option) ", jumbolen); in ip6_opt_process()
161 * This is a hop-by-hop option, and Payload length in ip6_opt_process()
249 * The Jumbo Payload option is a hop-by-hop option; we don't in dstopt_process()
/freebsd/usr.sbin/traceroute6/
H A Dtraceroute6.878 utility uses the IPv6 protocol hop limit field to elicit an ICMPv6
90 Turn on AS# lookups for each hop encountered.
101 and report if the hop has bleached
137 Set the number of probe per hop count to
195 This is printed if the hop limit is <= 1 on a port unreachable message.
196 This means that the packet got to the destination, but that the reply had a hop
/freebsd/lib/libc/net/
H A Dinet6_option_space.341 .Nd IPv6 Hop-by-Hop and Destination Option Manipulation
48 IPv6 Hop-by-Hop and Destination options.
H A Dinet6_opt_init.342 .Nd IPv6 Hop-by-Hop and Destination Options manipulation
64 Building and parsing the Hop-by-Hop and Destination options is
67 help applications create and manipulate Hop-by-Hop and Destination
H A Dip6opt.c76 * contain either Hop-by-Hop or Destination options. It returns 0 on
97 * This function appends a Hop-by-Hop option or a Destination option
163 * This function appends a Hop-by-Hop option or a Destination option
228 * This function processes the next Hop-by-Hop option or Destination
/freebsd/contrib/ofed/opensm/opensm/
H A Dosm_ucast_dnup.c40 * Implementation of Up Down Algorithm using ranking & Min Hop
102 * This function does the bfs of min hop table calculation by guid index
160 /* Check hop count if better insert into list && update in dnup_bfs_by_node()
161 the remote node Min Hop Table */ in dnup_bfs_by_node()
199 "Invalid value returned from set min hop is: %d\n", in dnup_bfs_by_node()
306 /* Go over all the switches in the subnet - for each init their Min Hop in dnup_set_min_hop_table()
309 "Init Min Hop Table of all switches [\n"); in dnup_set_min_hop_table()
315 /* Clear Min Hop Table */ in dnup_set_min_hop_table()
320 "Init Min Hop Table of all switches ]\n"); in dnup_set_min_hop_table()
379 /* After multiple ranking need to set Min Hop Table by DnUp algorithm */ in dnup_build_lid_matrices()
[all …]
H A Dosm_port.c326 uint8_t hop; in physp_get_dr_physp_set() local
345 start after the first dummy hop and stop just before the in physp_get_dr_physp_set()
348 for (hop = 1; hop < p_path->hop_count - 1; hop++) { in physp_get_dr_physp_set()
350 p_physp = osm_node_get_physp_ptr(p_node, p_path->path[hop]); in physp_get_dr_physp_set()
355 "DR Traversal stopped on invalid port at hop:%u\n", in physp_get_dr_physp_set()
356 hop); in physp_get_dr_physp_set()
362 if (hop > 1) in physp_get_dr_physp_set()
369 p_path->path[hop]); in physp_get_dr_physp_set()
373 "DR Traversal stopped on missing remote physp at hop:%u\n", in physp_get_dr_physp_set()
374 hop); in physp_get_dr_physp_set()
H A Dosm_ucast_updn.c39 * Implementation of Up Down Algorithm using ranking & Min Hop
108 * This function does the bfs of min hop table calculation by guid index
177 /* Check hop count if better insert into list && update in updn_bfs_by_node()
178 the remote node Min Hop Table */ in updn_bfs_by_node()
188 "Invalid value returned from set min hop is: %d\n", in updn_bfs_by_node()
309 /* Go over all the switches in the subnet - for each init their Min Hop in updn_set_min_hop_table()
312 "Init Min Hop Table of all switches [\n"); in updn_set_min_hop_table()
318 /* Clear Min Hop Table */ in updn_set_min_hop_table()
326 "Init Min Hop Table of all switches ]\n"); in updn_set_min_hop_table()
377 /* After multiple ranking need to set Min Hop Table by UpDn algorithm */ in updn_build_lid_matrices()
[all …]
H A Dosm_req.c73 uint8_t hop; in req_determine_mkey() local
96 for (hop = 2; p_physp && hop <= p_path->hop_count; hop++) { in req_determine_mkey()
101 p_physp = osm_node_get_physp_ptr(p_node, p_path->path[hop]); in req_determine_mkey()
105 last hop, or NULL if we don't know it. in req_determine_mkey()
/freebsd/sys/netinet6/
H A Dip6_fastfwd.c124 * Jumbograms must have hop-by-hop header and go via in ip6_tryforward()
145 * Hop limit. in ip6_tryforward()
172 * that new destination or next hop is our local address. in ip6_tryforward()
234 * that new destination or next hop is our local address. in ip6_tryforward()
242 * XXX: we did one hop and should decrement hop limit. But in ip6_tryforward()
H A Din6.h419 #define IPV6_2292HOPLIMIT 20 /* bool; hop limit */
420 #define IPV6_2292NEXTHOP 21 /* bool; next hop addr */
421 #define IPV6_2292HOPOPTS 22 /* bool; hop-by-hop option */
447 #define IPV6_RECVHOPLIMIT 37 /* bool; recv hop limit */
449 #define IPV6_RECVHOPOPTS 39 /* bool; recv hop-by-hop option */
467 #define IPV6_HOPLIMIT 47 /* int; send hop limit */
468 #define IPV6_NEXTHOP 48 /* sockaddr; next hop addr */
469 #define IPV6_HOPOPTS 49 /* ip6_hbh; send hop-by-hop option */
514 #define IPV6_RTHDR_LOOSE 0 /* this hop need not be a neighbor. XXX old spec */
515 #define IPV6_RTHDR_STRICT 1 /* this hop must be a neighbor. XXX old spec */
[all …]
H A Dip6_input.c416 * indicates Hop-by-Hop Options header, then a Jumbo Payload in ip6_input_hbh()
837 * Process Hop-by-Hop options header if it's contained. in ip6_input()
850 * ICMPv6 layer, as hop-by-hop options have been stripped. in ip6_input()
951 * Hop-by-Hop options header processing. If a valid jumbo payload option is in ip6_hopopts_input()
999 * Search header for all Hop-by-hop option in ip6_process_hopopts()
[all...]
/freebsd/usr.sbin/traceroute/
H A Dtraceroute.860 Turn on AS# lookups for each hop encountered.
73 By default, only one probe per hop is sent with this option.
84 and report if the hop has bleached
118 The default is 1, i.e., start with the first hop.
120 Print hop addresses numerically rather than symbolically and numerically
149 Set the number of probes per hop (default is 3, unless
172 Print a summary of how many probes were not answered for each hop.
199 Note that checksums are usually required for the last hop when using ICMP ECHO
255 This is due to a buggy kernel on the 2nd hop system \- lilac-dmc.Berkeley.EDU \-
/freebsd/sys/ofed/drivers/infiniband/core/
H A Dib_smi.c88 /* C14-9:5 -- Fail unreasonable hop pointer */ in __smi_handle_dr_smp_send()
122 /* C14-13:5 -- Check for unreasonable hop pointer */ in __smi_handle_dr_smp_send()
176 /* C14-9:2 -- intermediate hop */ in __smi_handle_dr_smp_recv()
199 /* C14-9:5 -- fail unreasonable hop pointer */ in __smi_handle_dr_smp_recv()
233 /* C14-13:5 -- Check for unreasonable hop pointer */ in __smi_handle_dr_smp_recv()
278 /* C14-9:2 -- intermediate hop */ in __smi_check_forward_dr_smp()
291 /* C14-13:2 -- intermediate hop */ in __smi_check_forward_dr_smp()
H A Dopa_smi.h58 /* C14-9:4 -- Hop Pointer = Hop Count + 1 -> give to SMA/SM */ in opa_smi_check_local_smp()
73 /* C14-13:4 -- Hop Pointer == 0 -> give to SM */ in opa_smi_check_local_returning_smp()
H A Dsmi.h70 /* C14-9:4 -- Hop Pointer = Hop Count + 1 -> give to SMA/SM */ in smi_check_local_smp()
85 /* C14-13:4 -- Hop Pointer == 0 -> give to SM */ in smi_check_local_returning_smp()
/freebsd/sbin/ipf/ippool/
H A Dippool.5178 list must have a name associated with it and a next hop selection policy.
189 the next hop is chosen by random selection from the list available
195 next hop address is used
201 next hop address is used
207 next hop address is used
219 to be the next hop. When all hosts have the same connection count,
/freebsd/sys/netgraph/netflow/
H A Dnetflow.h92 uint32_t next_hop; /* Next hop IP address */
114 uint32_t next_hop; /* Next hop IP address */
162 #define NETFLOW_V9_FIELD_IPV4_NEXT_HOP 15 /* IPv4 address of the next-hop router. 4 */
165 #define NETFLOW_V9_FIELD_BGP_IPV4_NEXT_HOP 18 /* Next-hop router's IP address in the BGP domain. 4 …
200 #define NETFLOW_V9_FIELD_IPV6_NEXT_HOP 62 /* IPv6 address of the next-hop router. 16 */
201 #define NETFLOW_V9_FIELD_BGP_IPV6_NEXT_HOP 63 /* Next-hop router in the BGP domain. 16 */
/freebsd/contrib/ofed/opensm/man/
H A Dopensm.8157 This option chooses routing engine(s) to use instead of Min Hop
161 routing engines fail, OpenSM will always attempt to route with Min Hop
245 to make. A reverse hop is the use of a switch the wrong way around.
307 This option provides weighting factors per port representing a hop cost in
875 1. Min Hop Algorithm - based on the minimum hops to each node where the
900 6. DOR Unicast routing algorithm - based on the Min Hop algorithm, but
932 (min hop) or Up/Down.
934 min hop from every destination LID through neighbor switches
977 (this uses min hop tables).
980 Min Hop Algorithm
[all …]
/freebsd/share/dtrace/
H A Dipfw.d73 inline int IPFW_ARGS_NH4 = 0x00020000; /* IPv4 next hop in hopstore */
75 inline int IPFW_ARGS_NH6 = 0x00040000; /* IPv6 next hop in hopstore */
77 inline int IPFW_ARGS_NH4PTR = 0x00080000; /* IPv4 next hop in next_hop */
79 inline int IPFW_ARGS_NH6PTR = 0x00100000; /* IPv6 next hop in next_hop6 */
/freebsd/contrib/ofed/opensm/include/opensm/
H A Dosm_path.h124 * [in] Hop count needed to reach this node.
166 * [in] Hop count needed to reach this node.
183 * Adds a new hop to a path.

12345678910>>...12