Home
last modified time | relevance | path

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

/external/iptables/
Diptables-xml.c107 static chain chains[maxChains]; variable
274 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) in existsChain()
289 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) { in needChain()
290 openChain(chains[c].chain, chains[c].policy, in needChain()
291 &(chains[c].count), '\0'); in needChain()
294 chains[c].created = 1; in needChain()
307 chains[nextChain].chain = strdup(chain); in saveChain()
308 chains[nextChain].policy = strdup(policy); in saveChain()
309 chains[nextChain].count = *ctr; in saveChain()
310 chains[nextChain].created = 0; in saveChain()
[all …]
Dip6tables.c1602 char *chains; in for_each_chain() local
1611 chains = fw_malloc(sizeof(ip6t_chainlabel) * chaincount); in for_each_chain()
1615 strcpy(chains + i*sizeof(ip6t_chainlabel), chain); in for_each_chain()
1622 && ip6tc_builtin(chains + i*sizeof(ip6t_chainlabel), in for_each_chain()
1625 ret &= fn(chains + i*sizeof(ip6t_chainlabel), verbose, handle); in for_each_chain()
1628 free(chains); in for_each_chain()
Diptables.c1671 char *chains; in for_each_chain() local
1680 chains = fw_malloc(sizeof(ipt_chainlabel) * chaincount); in for_each_chain()
1684 strcpy(chains + i*sizeof(ipt_chainlabel), chain); in for_each_chain()
1691 && iptc_builtin(chains + i*sizeof(ipt_chainlabel), in for_each_chain()
1694 ret &= fn(chains + i*sizeof(ipt_chainlabel), verbose, handle); in for_each_chain()
1697 free(chains); in for_each_chain()
/external/elfcopy/
Dhash.c26 Elf32_Word *chains = ++buckets + nbuckets; in add_to_hash() local
41 while (chains[last_chain_index] != STN_UNDEF) { in add_to_hash()
43 last_chain_index = chains[last_chain_index]; in add_to_hash()
46 chains[last_chain_index] = symindex; in add_to_hash()
60 Elf32_Word *chains = hash_data + nbuckets; in hash_lookup() local
72 index = chains[index]; in hash_lookup()
/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
Dlibip6t_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.
Dlibipt_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.
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
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_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_policy.man9 chains,
13 chains.
Dlibip6t_policy.man9 chains,
13 chains.
Dlibip6t_mac.man10 chains.
Dlibipt_mac.man10 chains.
Dlibip6t_eui64.man10 chains.
/external/iptables/libiptc/
Dlibiptc.c130 struct list_head chains; variable
312 if (list_empty(&handle->chains)) in iptcc_find_chain_by_offset()
315 list_for_each(pos, &handle->chains) { in iptcc_find_chain_by_offset()
329 if (list_empty(&handle->chains)) in iptcc_find_label()
332 list_for_each(pos, &handle->chains) { in iptcc_find_label()
401 list_for_each_entry(tmp, &h->chains, list) { in iptc_insert_chain()
410 list_add_tail(&c->list, &h->chains); in iptc_insert_chain()
550 list_for_each_entry(c, &h->chains, list) { in parse_table()
718 list_for_each_entry(c, &h->chains, list) { in iptcc_compile_table_prep()
740 list_for_each_entry(c, &h->chains, list) { in iptcc_compile_table()
[all …]
/external/icu4c/layout/
DMorphTables.h48 ChainHeader chains[ANY_NUMBER]; member
DMorphTables.cpp25 const ChainHeader *chainHeader = chains; in process()
/external/zlib/
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/jpeg/
Dinstall.doc618 cluster chains that are allocated but not used by a file. This should not
/external/webkit/JavaScriptCore/
DChangeLog-2002-12-03292 - pave the way to separate the argument lists from scope chains
DChangeLog-2008-08-109598 generate full scope chains for its sake.
10770 Update ExecState::m_scopeChain when switching scope chains inside the
31319 containing function objects in the scope chains of nested functions.
DChangeLog2296 within some odd modified scope chains.
22567 activation records, profiling, and full scope chains.
/external/dropbear/libtomcrypt/
Dchanges1376 so you can easily build the library with other tool chains