Home
last modified time | relevance | path

Searched refs:chains (Results 1 – 25 of 214) sorted by relevance

123456789

/external/webrtc/modules/video_coding/
Dchain_diff_calculator.cc24 void ChainDiffCalculator::Reset(const std::vector<bool>& chains) { in Reset() argument
25 last_frame_in_chain_.resize(chains.size()); in Reset()
26 for (size_t i = 0; i < chains.size(); ++i) { in Reset()
27 if (chains[i]) { in Reset()
45 const std::vector<bool>& chains) { in From() argument
47 if (chains.size() != last_frame_in_chain_.size()) { in From()
51 << chains.size(); in From()
53 size_t num_chains = std::min(last_frame_in_chain_.size(), chains.size()); in From()
55 if (chains[i]) { in From()
Dchain_diff_calculator.h32 void Reset(const std::vector<bool>& chains);
36 const std::vector<bool>& chains);
/external/iptables/iptables/
Diptables-xml.c67 static struct chain chains[maxChains]; variable
184 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) in existsChain()
199 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) { in needChain()
200 openChain(chains[c].chain, chains[c].policy, in needChain()
201 &(chains[c].count), '\0'); in needChain()
204 chains[c].created = 1; in needChain()
216 chains[nextChain].chain = strdup(chain); in saveChain()
217 chains[nextChain].policy = strdup(policy); in saveChain()
218 chains[nextChain].count = *ctr; in saveChain()
219 chains[nextChain].created = 0; in saveChain()
[all …]
Dnft-cache.c157 h->cache->table[type].chains = nft_chain_list_alloc(); in fetch_table_cache()
183 return &h->cache->table[t->type].chains->names[key]; in chain_name_hlist()
226 struct nft_chain_list *clist = h->cache->table[t->type].chains; in nft_cache_add_chain()
446 struct list_head *chains) in fetch_chain_cache() argument
452 if (!chains) in fetch_chain_cache()
463 list_for_each_entry(cc, chains, head) { in fetch_chain_cache()
557 struct list_head *chains = NULL; in __nft_build_cache() local
566 chains = &req->chain_list; in __nft_build_cache()
578 fetch_chain_cache(h, t, chains); in __nft_build_cache()
678 if (c->table[i].chains) { in flush_cache()
[all …]
Dnft.c440 .chains = {
458 .chains = {
494 .chains = {
518 .chains = {
542 .chains = {
577 .chains = {
600 .chains = {
624 .chains = {
733 for (i=0; i<NF_IP_NUMHOOKS && t->chains[i].name != NULL; i++) { in nft_chain_builtin_find()
734 if (strcmp(t->chains[i].name, chain) != 0) in nft_chain_builtin_find()
[all …]
/external/iptables/libiptc/
Dlibiptc.c131 struct list_head chains; member
329 list_pos=&handle->chains; in __iptcc_bsearch_chain_index()
348 return &handle->chains; /* Be safe, return orig start pos */ in __iptcc_bsearch_chain_index()
440 pos = handle->chains.next; in iptcc_bsearch_chain_offset()
458 list_pos = &handle->chains; in iptcc_linearly_search_chain_index()
531 unsigned int chains = 0; in iptcc_chain_index_build() local
544 list_for_each_entry(c, &h->chains, list) { in iptcc_chain_index_build()
549 cindex=chains / list_length; in iptcc_chain_index_build()
557 if ((chains % list_length)== 0) { in iptcc_chain_index_build()
561 chains++; in iptcc_chain_index_build()
[all …]
/external/iptables/extensions/
Dlibxt_REDIRECT.man7 chains, and user-defined chains which are only called from those
8 chains. It redirects the packet to the machine itself by changing the
Dlibxt_physdev.man13 chains). If the interface name ends in a "+", then any
23 chains). If the interface name ends in a "+", then any
34 This is only useful in the FORWARD and POSTROUTING chains.
Dlibxt_DNAT.man7 chains, and user-defined chains which are only called from those
8 chains. It specifies that the destination address of the packet
Dlibipt_REJECT.man10 chains, and user-defined chains which are only called from those
11 chains. The following option controls the nature of the error packet
Dlibxt_SNAT.man7 chains, and user-defined chains which are only called from those
8 chains. It specifies that the source address of the packet should be
Dlibip6t_REJECT.man10 chains, and user-defined chains which are only called from those
11 chains. The following option controls the nature of the error packet
Dlibxt_TRACE.man2 the packets as those traverse the tables, chains, rules. It can only be used in
12 and "policy" for the policy of the built in chains.
Dlibxt_addrtype.man56 chains. It cannot be specified with the
67 chains. It cannot be specified with the
Dlibxt_policy.man9 chains,
13 chains.
Dlibxt_mac.man10 chains.
Dlibip6t_eui64.man10 chains.
/external/llvm/test/CodeGen/ARM/
Dcopy-cpsr.ll6 ; escape. However, for long ADCS chains (and last ditch fallback) the dependency
12 ; + We want 2 long ADCS chains
15 ; + We want both chains to write CPSR post-split (so that the copy can't be
17 ; + We want the chains to be long enough that duplicating them is expensive.
D2011-08-29-SchedCycle.ll12 ; 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/llvm-project/llvm/test/CodeGen/ARM/
Dcopy-cpsr.ll6 ; escape. However, for long ADCS chains (and last ditch fallback) the dependency
12 ; + We want 2 long ADCS chains
15 ; + We want both chains to write CPSR post-split (so that the copy can't be
17 ; + We want the chains to be long enough that duplicating them is expensive.
D2011-08-29-SchedCycle.ll12 ; 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/llvm-project/clang-tools-extra/docs/clang-tidy/checks/
Dbugprone-branch-clone.rst6 Checks for repeated branches in ``if/else if/else`` chains, consecutive
35 The check also detects repeated branches in longer ``if/else if/else`` chains
86 Unlike if statements, the check does not detect chains of conditional
/external/iproute2/examples/diffserv/
Dregression-testing29 Edge31-cb-chains
75 Edge32-cb-u32, Edge32-cb-chains
87 for chains which is roughly: 6mbps
DREADME23 CB-3(1|2)-(u32/chains)
28 and IPchains on the chains extension. CB stands for color Blind
/external/iproute2/examples/bpf/
DREADME5 - bpf_tailcall.c -> Using tail call chains

123456789