HomeSort by relevance Sort by last modified time
    Searched full:chains (Results 1 - 25 of 440) sorted by null

1 2 3 4 5 6 7 8 91011>>

  /external/iptables/extensions/
libipt_MIRROR.man 8 chains, and user-defined chains which are only called from those
9 chains. Note that the outgoing packets are
11 seen by any packet filtering chains, connection tracking or NAT, to
libxt_TRACE.man 2 the packets as those traverse the tables, chains, rules.
9 and "policy" for the policy of the built in chains.
libxt_mac.man 10 chains.
libip6t_eui64.man 10 chains.
libip6t_REJECT.man 10 chains, and user-defined chains which are only called from those
11 chains. The following option controls the nature of the error packet
libipt_REJECT.man 10 chains, and user-defined chains which are only called from those
11 chains. The following option controls the nature of the error packet
libxt_REDIRECT.man 7 chains, and user-defined chains which are only called from those
8 chains. It redirects the packet to the machine itself by changing the
libxt_DNAT.man 7 chains, and user-defined chains which are only called from those
8 chains. It specifies that the destination address of the packet
libxt_physdev.man 13 chains). If the interface name ends in a "+", then any
24 chains). If the interface name ends in a "+", then any
28 chains one cannot match on the bridge output port, however one can in the
42 This is only useful in the FORWARD and POSTROUTING chains.
libxt_SNAT.man 7 chains, and user-defined chains which are only called from those
8 chains. It specifies that the source address of the packet should be
libxt_addrtype.man 56 chains. It cannot be specified with the
67 chains. It cannot be specified with the
  /external/valgrind/main/coregrind/
m_hashtable.c 48 VgHashNode** chains; // expanding array of hash chains member in struct:_VgHashTable
74 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
94 VgHashNode** chains; local
123 chains = VG_(calloc)("hashtable.resize.1", 1, sz);
126 node = table->chains[i];
130 node->next = chains[chain];
131 chains[chain] = node;
136 VG_(free)(table->chains);
137 table->chains = chains
    [all...]
  /external/chromium_org/net/url_request/
fraudulent_certificate_reporter.h 15 // reporting certificate chains that fail the certificate pinning
  /external/iproute2/include/libiptc/
ipt_kernel_headers.h 1 /* This is the userspace/kernel interface for Generic IP Chains,
  /external/google-tv-pairing-protocol/java/src/com/google/polo/ssl/
DummyTrustManager.java 31 // Does not throw CertificateException: all chains trusted
36 // Does not throw CertificateException: all chains trusted
  /external/llvm/test/CodeGen/ARM/
2011-08-29-SchedCycle.ll 12 ; If the libcalls are not serialized (i.e. both have chains which are dag
28 ; The right solution is to fix LegalizeType too chains the libcalls together.
  /external/iptables/libiptc/
libiptc.c 5 * Chains go INPUT, FORWARD, OUTPUT then user chains.
7 * Every chain ends with an unconditional jump: a RETURN for user chains,
138 struct list_head chains; member in struct:xtc_handle
143 unsigned int num_chains; /* number of user defined chains */
148 int sorted_offsets; /* if chains are received sorted from kernel,
311 * chains in chain list don't change the correctness of the chain
316 * CHAIN_INDEX_INSERT_MAX chains has been added.
344 list_pos=&handle->chains;
346 /* Check for empty array, e.g. no user defined chains */
546 unsigned int chains = 0; local
    [all...]
  /external/iptables/include/libiptc/
ipt_kernel_headers.h 1 /* This is the userspace/kernel interface for Generic IP Chains,
  /external/llvm/test/CodeGen/X86/
2011-12-26-extractelement-duplicate-load.ll 5 ; the chains correctly.
  /external/chromium_org/net/quic/crypto/
proof_source.h 16 // chains and signatures that prove its identity.
35 // The number of certificate chains is expected to be small and fixed thus
  /external/proguard/src/proguard/classfile/util/
MethodLinker.java 32 * Chains of links that have been created in previous invocations are merged
33 * with new chains of links, in order to create a consistent set of chains.
106 // Get the last methods in the both chains.
110 // Check if both link chains aren't already ending in the same element.
113 // Merge the two chains, with the library members last.
  /external/iptables/iptables/
iptables-xml.c 97 #define maxChains 10240 /* max chains per table */
98 static struct chain chains[maxChains]; variable in typeref:struct:chain
265 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0)
280 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) {
281 openChain(chains[c].chain, chains[c].policy,
282 &(chains[c].count), '\0');
285 chains[c].created = 1
    [all...]
ip6tables.8.in 60 chains and may also contain user-defined chains.
105 the built-in chains \fBINPUT\fP (for packets destined to local sockets),
118 2.4.17 it had two built-in chains: \fBPREROUTING\fP
121 Since kernel 2.4.18, three other built-in chains are also supported:
130 IP tables. It provides the following built-in chains: \fBPREROUTING\fP
140 before MAC rules. This table provides the following built-in chains:
187 chains are listed. Like every other ip6tables command, it applies to the
202 chains are printed like ip6tables-save. Like every other ip6tables command,
206 Flush the selected chain (all the chains in the table if none is given)
    [all...]
iptables.8.in 59 chains and may also contain user-defined chains.
104 the built-in chains \fBINPUT\fP (for packets destined to local sockets),
117 2.4.17 it had two built-in chains: \fBPREROUTING\fP
120 Since kernel 2.4.18, three other built-in chains are also supported:
129 IP tables. It provides the following built-in chains: \fBPREROUTING\fP
139 before MAC rules. This table provides the following built-in chains:
186 chains are listed. Like every other iptables command, it applies to the
203 chains are printed like iptables-save. Like every other iptables command,
207 Flush the selected chain (all the chains in the table if none is given)
    [all...]
  /external/icu/icu4c/source/layout/
MorphTables.cpp 26 LEReferenceTo<ChainHeader> chainHeader(base, success, chains); // moving header
27 LEReferenceToArrayOf<ChainHeader> chainHeaderArray(base, success, chains, chainCount);

Completed in 1120 milliseconds

1 2 3 4 5 6 7 8 91011>>