| /external/valgrind/coregrind/ |
| m_hashtable.c | 50 VgHashNode** chains; // expanding array of hash chains member in struct:_VgHashTable
76 table->chains = VG_(calloc)("hashtable.Hc.2", 1, sz);
96 VgHashNode** chains; local
125 chains = VG_(calloc)("hashtable.resize.1", 1, sz);
128 node = table->chains[i];
132 node->next = chains[chain];
133 chains[chain] = node;
138 VG_(free)(table->chains);
139 table->chains = chains
[all...] |
| /art/sigchainlib/ |
| sigchain.cc | 289 static SignalChain chains[_NSIG + 1]; member in namespace:art
295 for (const auto& handler : chains[signo].special_handlers_) {
321 int handler_flags = chains[signo].action_.sa_flags;
325 sigorset(&mask, &ucontext->uc_sigmask64, &chains[signo].action_.sa_mask);
328 sigorset(&mask, &ucontext->uc_sigmask, &chains[signo].action_.sa_mask);
341 chains[signo].action_.sa_sigaction(signo, siginfo, ucontext_raw);
343 auto handler = chains[signo].action_.sa_handler;
368 if (chains[signal].IsClaimed()) {
369 SigactionType saved_action = chains[signal].GetAction<SigactionType>();
371 chains[signal].SetAction(new_action)
[all...] |
| /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
266 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0)
281 if (chains[c].chain && strcmp(chains[c].chain, chain) == 0) {
282 openChain(chains[c].chain, chains[c].policy,
283 &(chains[c].count), '\0');
286 chains[c].created = 1
[all...] |
| xtables-config-parser.y | 120 table : T_TABLE T_STRING '{' chains '}'
128 chains : chain label
129 | chains chain
214 * the reverse order that chains appear in the
|
| nft.c | 318 .chains = {
335 .chains = {
370 .chains = {
393 .chains = {
416 .chains = {
450 .chains = {
478 .chains = {
501 .chains = {
661 for (i=0; i<NF_IP_NUMHOOKS && t->chains[i].name != NULL; i++) {
662 if (strcmp(t->chains[i].name, chain) != 0
2770 struct builtin_chain *chains; local
[all...] |
| nft.h | 24 struct builtin_chain chains[NF_INET_NUMHOOKS]; member in struct:builtin_table
65 * Operations with chains.
|
| ip6tables.c | 227 " List the rules in a chain or all chains\n"
229 " Print the rules in a chain or all chains\n"
230 " --flush -F [chain] Delete all rules in chain or all chains\n"
232 " Zero counters in chain or all chains\n"
862 char *chains; local
871 chains = xtables_malloc(sizeof(xt_chainlabel) * chaincount);
875 strcpy(chains + i*sizeof(xt_chainlabel), chain);
882 && ip6tc_builtin(chains + i*sizeof(xt_chainlabel),
885 ret &= fn(chains + i*sizeof(xt_chainlabel), verbose, handle);
888 free(chains);
[all...] |
| iptables.c | 221 " List the rules in a chain or all chains\n"
223 " Print the rules in a chain or all chains\n"
224 " --flush -F [chain] Delete all rules in chain or all chains\n"
226 " Zero counters in chain or all chains\n"
846 char *chains; local
855 chains = xtables_malloc(sizeof(xt_chainlabel) * chaincount);
859 strcpy(chains + i*sizeof(xt_chainlabel), chain);
866 && iptc_builtin(chains + i*sizeof(xt_chainlabel),
869 ret &= fn(chains + i*sizeof(xt_chainlabel), verbose, handle);
872 free(chains);
[all...] |
| /prebuilts/go/darwin-x86/src/crypto/x509/ |
| root_plan9.go | 19 func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
|
| root_windows.go | 142 // to build certificate chains and verify them.
143 func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
193 // continues building additional simple chains until the first
218 chain, err := extractSimpleChain(chainCtx.Chains, int(chainCtx.ChainCount))
223 chains = append(chains, chain)
225 return chains, nil
|
| root_unix.go | 34 func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
|
| verify.go | 621 // the CN as a hostname. Chains modern enough to be
776 // Verify attempts to verify c by building one or more chains from c to a
778 // needed. If successful, it returns one or more chains where the first
795 func (c *Certificate) Verify(opts VerifyOptions) (chains [][]*Certificate, err error) {
882 func (c *Certificate) buildChains(cache map[int][][]*Certificate, currentChain []*Certificate, opts *VerifyOptions) (chains [][]*Certificate, err error) {
898 chains = append(chains, appendToFreshChain(currentChain, root))
920 chains = append(chains, childChains...)
923 if len(chains) > 0
[all...] |
| verify_test.go | 473 chains, err := leaf.Verify(opts)
488 if len(chains) != len(test.expectedChains) {
489 t.Errorf("#%d: wanted %d chains, got %d", i, len(test.expectedChains), len(chains))
494 // two chains.
495 seenChains := make([]bool, len(chains))
497 for _, chain := range chains {
[all...] |
| /prebuilts/go/linux-x86/src/crypto/x509/ |
| root_plan9.go | 19 func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
|
| root_windows.go | 142 // to build certificate chains and verify them.
143 func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
193 // continues building additional simple chains until the first
218 chain, err := extractSimpleChain(chainCtx.Chains, int(chainCtx.ChainCount))
223 chains = append(chains, chain)
225 return chains, nil
|
| root_unix.go | 34 func (c *Certificate) systemVerify(opts *VerifyOptions) (chains [][]*Certificate, err error) {
|
| verify.go | 621 // the CN as a hostname. Chains modern enough to be
776 // Verify attempts to verify c by building one or more chains from c to a
778 // needed. If successful, it returns one or more chains where the first
795 func (c *Certificate) Verify(opts VerifyOptions) (chains [][]*Certificate, err error) {
882 func (c *Certificate) buildChains(cache map[int][][]*Certificate, currentChain []*Certificate, opts *VerifyOptions) (chains [][]*Certificate, err error) {
898 chains = append(chains, appendToFreshChain(currentChain, root))
920 chains = append(chains, childChains...)
923 if len(chains) > 0
[all...] |
| verify_test.go | 473 chains, err := leaf.Verify(opts)
488 if len(chains) != len(test.expectedChains) {
489 t.Errorf("#%d: wanted %d chains, got %d", i, len(test.expectedChains), len(chains))
494 // two chains.
495 seenChains := make([]bool, len(chains))
497 for _, chain := range chains {
[all...] |
| /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...] |
| /frameworks/base/services/tests/servicestests/src/com/android/server/ |
| NetworkManagementInternalTest.java | 74 // No firewall chains enabled
117 final int[] chains = { local
132 for (int chain : chains) {
|
| /packages/apps/Browser2/test/resources/ |
| js-test.js | 34 // not only own properties but also properties on prototype chains.
|
| /prebuilts/go/darwin-x86/test/ |
| torture.go | 163 // A chains of type assertions.
315 // Chains of divisions. See issue 4201.
|
| /prebuilts/go/linux-x86/test/ |
| torture.go | 163 // A chains of type assertions.
315 // Chains of divisions. See issue 4201.
|
| /device/linaro/bootloader/edk2/ |
| edksetup.bat | 156 @echo potential side effect of changing tool chains used for a
|
| /prebuilts/go/darwin-x86/doc/codewalk/ |
| markov.go | 127 c.Build(os.Stdin) // Build chains from standard input.
|
