| /external/iptables/extensions/ |
| libipt_TTL.man | 2 how many hops (routers) a packet can traverse until it's time to live is
|
| /external/kernel-headers/original/linux/netfilter_ipv6/ |
| ip6t_rt.h | 15 struct in6_addr addrs[IP6T_RT_HOPS]; /* Hops */
|
| /prebuilt/linux-x86/toolchain/i686-linux-glibc2.7-4.4.3/sysroot/usr/include/linux/netfilter_ipv6/ |
| ip6t_rt.h | 15 struct in6_addr addrs[IP6T_RT_HOPS]; /* Hops */
|
| /external/tcpdump/ |
| aodv.h | 40 u_int8_t rreq_hops; /* number of hops from originator */
52 u_int8_t rreq_hops; /* number of hops from originator */
63 u_int8_t rreq_hops; /* number of hops from originator */
83 u_int8_t rrep_hops; /* number of hops from o to d */
94 u_int8_t rrep_hops; /* number of hops from o to d */
104 u_int8_t rrep_hops; /* number of hops from o to d */
|
| print-stp.c | 164 * 1 - byte CIST Remaining Hops
174 * 1 - byte MSTI Remaining Hops
248 printf("\n\tCIST remaining-hops %d", ptr[MST_BPDU_CIST_REMAIN_HOPS_OFFSET]);
269 printf("\n\t\tMSTI bridge-prio %d, port-prio %d, hops %d",
|
| print-decnet.c | 72 int dst, src, hops; local
138 hops = EXTRACT_LE_8BITS(rhp->rh_long.lg_visits);
146 hops = (EXTRACT_LE_8BITS(rhp->rh_short.sh_visits) & VIS_MASK)+1;
165 (void)printf("%d hops ", hops);
348 (void)printf("{ids %d-%d cost %d hops %d} ", id, id + count,
378 (void)printf("{areas %d-%d cost %d hops %d} ", area, area + count,
|
| print-igrp.c | 67 printf(" d=%d b=%d r=%d l=%d M=%d mtu=%d in %d hops",
|
| print-aodv.c | 131 printf(" rrep %u %s%sprefix %u hops %u\n"
237 printf(" rrep %u %s%sprefix %u hops %u\n"
346 printf(" rrep %u %s%sprefix %u hops %u\n"
|
| bootp.h | 27 u_int8_t bp_hops; /* gateway hops */
|
| /external/apache-http/src/org/apache/http/conn/routing/ |
| RouteInfo.java | 99 * Obtains the number of hops in this route.
100 * A direct route has one hop. A route through a proxy has two hops.
101 * A route through a chain of <i>n</i> proxies has <i>n+1</i> hops.
103 * @return the number of hops in this route
112 * the target of previous hops is the respective proxy in the chain.
|
| RouteTracker.java | 228 int hops = 0; local
231 hops = 1;
233 hops = proxyChain.length + 1;
235 return hops;
|
| /libcore/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedQueue.java | 106 * (fewer CASes). This is controlled by local "hops" variables
242 * HOPS links from "true" location. We assume that volatile
245 private static final int HOPS = 1;
279 for (int hops = 0; ; hops++) {
282 if (hops > HOPS && t != tail)
286 if (hops >= HOPS)
299 for (int hops = 0; ; hops++)
[all...] |
| ConcurrentLinkedDeque.java | 327 private final static int HOPS = 2;
366 int hops = 1; local
369 for (Node<E> p = prev;; ++hops) {
390 for (Node<E> p = next;; ++hops) {
411 if (hops < HOPS
446 for (int hops = 0;; ++hops) {
449 if (hops >= HOPS) {
[all...] |
| /system/core/libnetutils/ |
| dhcpmsg.c | 33 msg->hops = 0;
|
| dhcpmsg.h | 40 uint8_t hops; /* client set to 0 */ member in struct:dhcp_msg
|
| dhcpclient.c | 290 LOGD("op = %s (%d), htype = %d, hlen = %d, hops = %d",
291 name, msg->op, msg->htype, msg->hlen, msg->hops);
|
| /external/dnsmasq/contrib/wrt/ |
| dhcp_lease_time.c | 62 u8 op, htype, hlen, hops; member in struct:dhcp_packet
|
| dhcp_release.c | 67 u8 op, htype, hlen, hops; member in struct:dhcp_packet
|
| /external/nist-sip/java/gov/nist/javax/sip/stack/ |
| HopImpl.java | 41 * Routing algorithms return a list of hops to which the request is
|
| /external/ping/ |
| ping_common.h | 198 extern int gather_statistics(__u8 *ptr, int cc, __u16 seq, int hops,
|
| ping.c | 715 int gather_statistics(__u8 *ptr, int cc, __u16 seq, int hops,
783 if (hops >= 0)
784 printf(" ttl=%d", hops);
[all...] |
| /external/dhcpcd/ |
| dhcp.c | 386 int count = 0, l, hops; local
391 hops = 0;
404 hops++;
405 if (hops > 255)
|
| /external/netcat/ |
| netcat.c | 693 If we want to route A -> B via hops C and D, we must add C, D, *and* B to the
696 the outbound packet gets sent to C. If B wasn't also in the hops list, the
720 and gatesidx is now the *number* of hops */
721 if (gatesidx) { /* if we wanted any srcrt hops ... */
742 /* calculate length of whole option mess, which is (3 + [hops] + [final] + 1),
[all...] |
| /external/libpng/scripts/ |
| makefile.sco | 2 # Contributed by Mike Hopkirk (hops@sco.com) modified from Makefile.lnx
|
| /external/dnsmasq/src/ |
| rfc1035.c | 34 unsigned int j, l, hops = 0; local
85 hops++; /* break malicious infinite loops */
86 if (hops > 255)
[all...] |
