| /third_party/iptables/iptables/ |
| D | iptables-xml.c | 67 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 …]
|
| D | nft-cache.c | 157 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 …]
|
| D | nft.c | 440 .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 …]
|
| /third_party/glib/glib/ |
| D | update-gtranslit.py | 230 chains = {} variable
234 if name not in chains:
235 chains[name] = Chain(name)
237 return chains[name]
269 self.chains = []
283 if chain in self.chains:
284 chain_id = self.chains.index(chain)
286 chain_id = len(self.chains)
287 self.chains.append(chain)
369 for chain in self.chains:
[all …]
|
| /third_party/gstreamer/gstreamer/docs/random/wtay/ |
| D | eos-19012001 | 34 chains: at plan generation, the bin will find the elements it has to
57 the chains. This procedure continues until a bin/thread has no more
58 chains left to schedule, at which point it will fire the EOS signal.
63 the gst_bin_iterate_func will only schedule those chains that have
77 have their own chains and use the same iterate_func, they will eventually
78 fire EOS on their own when they run out of schedulable chains.
82 Combining the EOS providers list and the chains, the bin will fire
83 and EOS signal when 1) it has no more chains to schedule, 2) all its
96 propagate downstream and effectively causes all chains and threads
104 the bins and chains are not performed.
|
| D | eos3 | 29 no more chains are being scheduled so the bin fires EOS.
58 signal eos. the parent will take chain1 out if its scheduled chains.
65 chains. there are no more chains to schedule, the thread fires EOS.
67 The bin now has no more scheduled chains and no more pending subbins,
108 The bin now has no more scheduled chains and no more pending subbins,
157 The bin now has no more scheduled chains and no more pending subbins,
184 two chains are detected: disksrc1-effect-mixer-audiosink,
197 and the bin fires EOS because there are no more chains to schedule.
241 because it does not have any chains to schedule.
|
| D | eos5 | 20 just two scheduled chains in a single bin.
24 we have two chains here fs1-i1-fsk1 and fs2-i2-fsk2
36 has no chains to schedule and so it fires EOS.
60 we have two chains here ds1-mpg1-ask1 and ds2-mpg2-ask2
|
| D | eos4 | 20 just two scheduled chains in a single bin.
24 we have two chains here fs1-i1-fsk1 and fs2-i2-fsk2
42 has no chains to schedule and so it fires EOS.
66 we have two chains here ds1-mpg1-ask1 and ds2-mpg2-ask2
|
| /third_party/boost/boost/graph/ |
| D | transitive_closure.hpp | 144 std::vector< std::vector< cg_vertex > > chains; in transitive_closure() local
153 chains.resize(chains.size() + 1); in transitive_closure()
154 std::vector< cg_vertex >& chain = chains.back(); in transitive_closure()
172 for (size_type i = 0; i < chains.size(); ++i) in transitive_closure()
173 for (size_type j = 0; j < chains[i].size(); ++j) in transitive_closure()
175 cg_vertex v = chains[i][j]; in transitive_closure()
182 CG_vec.size(), std::vector< cg_vertex >(chains.size(), inf)); in transitive_closure()
207 for (size_type j = 0; j < chains.size(); ++j) in transitive_closure()
213 for (size_type k = pos_in_chain[v]; k < chains[j].size(); ++k) in transitive_closure()
214 CG_vec[i].push_back(chains[j][k]); in transitive_closure()
|
| /third_party/iptables/libiptc/ |
| D | libiptc.c | 131 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 …]
|
| /third_party/iptables/extensions/ |
| D | 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
|
| D | libxt_physdev.man | 13 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.
|
| D | 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
|
| D | 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
|
| D | 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
|
| D | 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
|
| D | libxt_TRACE.man | 2 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.
|
| D | libxt_addrtype.man | 56 chains. It cannot be specified with the
67 chains. It cannot be specified with the
|
| D | libxt_policy.man | 9 chains,
13 chains.
|
| D | libxt_mac.man | 10 chains.
|
| D | libip6t_eui64.man | 10 chains.
|
| /third_party/boost/libs/graph/doc/ |
| D | transitive_closure.w | 286 $G$ are partitioned into chains $Z_1, ..., Z_k$, where each chain
289 collection of intersections with the chains, i.e., $S =
317 topological number and then decompose the graph into chains. Once
325 @<Decompose the condensation graph into chains@>
350 order and we will be adding vertices to the chains from the out-edge
384 Now we are ready to decompose the condensation graph into chains. The
387 These lists will be stored in the \code{chains} vector below. To
388 create the chains we consider each vertex in the graph in topological
393 @d Decompose the condensation graph into chains
395 std::vector< std::vector<cg_vertex> > chains;
[all …]
|
| /third_party/openssl/doc/man3/ |
| D | SSL_CTX_add1_chain_cert.pod | 102 The chains associate with an SSL_CTX structure are copied to any SSL
104 by any chains subsequently changed in the parent SSL_CTX.
107 an RSA and a DSA certificate can (and often will) have different chains.
112 sending incorrect certificate chains often cause problems with peers.
118 Applications can issue non fatal warnings when checking chains by setting
|
| /third_party/typescript_eslint/packages/eslint-plugin/docs/rules/ |
| D | prefer-optional-chain.md | 41 …only_ chains when the property value is `null` or `undefined`, it is much safer than relying upon …
|
| /third_party/boost/libs/asio/doc/overview/ |
| D | allocation.qbk | 14 Furthermore, programs typically contain easily identifiable chains of
17 by sends). A full duplex protocol implementation would have two chains
|