Home
last modified time | relevance | path

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

123

/external/valgrind/main/coregrind/
Dm_hashtable.c48 VgHashNode** chains; // expanding array of hash chains member
74 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz); in VG_()
94 VgHashNode** chains; in resize() local
123 chains = VG_(calloc)("hashtable.resize.1", 1, sz); in resize()
126 node = table->chains[i]; in resize()
130 node->next = chains[chain]; in resize()
131 chains[chain] = node; in resize()
136 VG_(free)(table->chains); in resize()
137 table->chains = chains; in resize()
146 node->next = table->chains[chain]; in VG_()
[all …]
/external/iptables/iptables/
Diptables-xml.c102 static struct chain chains[maxChains]; variable
269 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) in existsChain()
284 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) { in needChain()
285 openChain(chains[c].chain, chains[c].policy, in needChain()
286 &(chains[c].count), '\0'); in needChain()
289 chains[c].created = 1; in needChain()
302 chains[nextChain].chain = strdup(chain); in saveChain()
303 chains[nextChain].policy = strdup(policy); in saveChain()
304 chains[nextChain].count = *ctr; in saveChain()
305 chains[nextChain].created = 0; in saveChain()
[all …]
/external/iptables/extensions/
Dlibipt_MIRROR.man8 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
Dlibipt_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
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.
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
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_TRACE.man2 the packets as those traverse the tables, chains, rules.
9 and "policy" for the policy of the built in chains.
Dlibipt_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_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.
Dlibxt_owner.man3 POSTROUTING chains. Forwarded packets do not have any socket associated with
Dlibxt_TPROXY.man2 chain and user-defined chains which are only called from this chain. It
/external/iptables/libiptc/
Dlibiptc.c138 struct list_head chains; variable
344 list_pos=&handle->chains; in __iptcc_bsearch_chain_index()
363 return &handle->chains; /* Be safe, return orig start pos */ in __iptcc_bsearch_chain_index()
457 pos = handle->chains.next; in iptcc_bsearch_chain_offset()
475 list_pos = &handle->chains; in iptcc_linearly_search_chain_index()
548 unsigned int chains = 0; in iptcc_chain_index_build() local
561 list_for_each_entry(c, &h->chains, list) { in iptcc_chain_index_build()
566 cindex=chains / list_length; in iptcc_chain_index_build()
574 if ((chains % list_length)== 0) { in iptcc_chain_index_build()
578 chains++; in iptcc_chain_index_build()
[all …]
/external/llvm/test/CodeGen/ARM/
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/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/icu4c/layout/
DMorphTables.h48 ChainHeader chains[ANY_NUMBER]; member
DMorphTables.cpp25 const ChainHeader *chainHeader = chains; in process()
/external/linux-tools-perf/Documentation/
Dperf-report.txt85 Display call chains using type and min percent threshold.
87 - flat: single column, linear exposure of call chains.
/external/llvm/test/CodeGen/X86/
D2011-12-26-extractelement-duplicate-load.ll5 ; the chains correctly.
/external/zlib/doc/
Dalgorithm.txt27 The hash chains are searched starting with the most recent strings, to
29 The hash chains are singly linked. There are no deletions from the
30 hash chains, the algorithm simply discards matches that are too old.
32 To avoid a worst-case situation, very long hash chains are arbitrarily
/external/llvm/test/Transforms/DeadArgElim/
Dmultdeadretval.ll3 ; run instcombine to fold insert/extractvalue chains and we run dce to clean up

123