Home
last modified time | relevance | path

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

12345678910>>...13

/netbsd-src/external/gpl3/gcc.old/dist/gcc/
H A Dtree-predcom.c504 dump_chains (FILE *file, vec<chain_p> chains) in dump_chains() argument
509 FOR_EACH_VEC_ELT (chains, i, chain) in dump_chains()
571 release_chains (vec<chain_p> chains) in release_chains() argument
576 FOR_EACH_VEC_ELT (chains, i, chain) in release_chains()
578 chains.release (); in release_chains()
1398 vec<chain_p> *chains) in determine_roots_comp() argument
1410 chains->safe_push (chain); in determine_roots_comp()
1455 chains->safe_push (chain); in determine_roots_comp()
1476 chains->safe_push (chain); in determine_roots_comp()
1487 struct component *comps, vec<chain_p> *chains) in determine_roots() argument
[all …]
H A Dregrename.h87 struct du_chain *chains[MAX_REGS_PER_ADDRESS]; member
H A Dregrename.c196 mark_conflict (class du_head *chains, unsigned id) in mark_conflict() argument
198 while (chains) in mark_conflict()
200 bitmap_set_bit (&chains->conflicts, id); in mark_conflict()
201 chains = chains->next_chain; in mark_conflict()
220 cur_operand->chains[cur_operand->n_chains++] = this_du; in record_operand_use()
/netbsd-src/external/bsd/openpam/dist/lib/libpam/
H A Dopenpam_dispatch.c90 chain = pamh->chains[PAM_AUTH]; in openpam_dispatch()
93 chain = pamh->chains[PAM_ACCOUNT]; in openpam_dispatch()
97 chain = pamh->chains[PAM_SESSION]; in openpam_dispatch()
100 chain = pamh->chains[PAM_PASSWORD]; in openpam_dispatch()
H A Dopenpam_impl.h88 pam_chain_t *chains[PAM_NUM_FACILITIES]; member
111 pam_chain_t *chains[PAM_NUM_FACILITIES]; member
H A Dopenpam_configure.c292 for (next = &pamh->chains[fclt]; *next != NULL; in openpam_parse_chain()
471 if (pamh->chains[fclt] != NULL) in openpam_configure()
484 pam_chain_t *this = pamh->chains[PAM_AUTH]; in openpam_configure()
502 openpam_clear_chains(pamh->chains); in openpam_configure()
H A Dpam_end.c86 openpam_clear_chains(pamh->chains); in pam_end()
/netbsd-src/external/bsd/pcc/dist/pcc/f77/fcom/
H A Dmisc.c148 if(chains) { in mkchain()
149 r = chains; in mkchain()
150 chains = chains->chain.nextp; in mkchain()
436 q->chain.nextp = chains;
437 chains = *p;
/netbsd-src/external/bsd/openpam/dist/bin/openpam_dump_policy/
H A Dopenpam_dump_policy.c130 if (pamh->chains[fclt] != NULL) { in openpam_dump_policy()
133 ret = openpam_dump_chain(name, pamh->chains[fclt]); in openpam_dump_policy()
147 if (pamh->chains[fclt] != NULL) { in openpam_dump_policy()
/netbsd-src/crypto/external/bsd/openssl.old/dist/doc/man3/
H A DSSL_CTX_add1_chain_cert.pod102 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
H A DSSL_check_chain.pod60 An application wishing to support multiple certificate chains may call this
66 usable. An application supporting multiple chains with different CA signature
H A DSSL_CTX_add_extra_chain_cert.pod42 structure. Different chains for different certificates (for example if both
/netbsd-src/crypto/external/bsd/openssl/dist/doc/man3/
H A DSSL_CTX_add1_chain_cert.pod105 The chains associate with an SSL_CTX structure are copied to any SSL
107 by any chains subsequently changed in the parent SSL_CTX.
110 an RSA and a DSA certificate can (and often will) have different chains.
115 sending incorrect certificate chains often cause problems with peers.
121 Applications can issue non fatal warnings when checking chains by setting
H A DSSL_check_chain.pod60 An application wishing to support multiple certificate chains may call this
66 usable. An application supporting multiple chains with different CA signature
/netbsd-src/sys/external/bsd/drm2/dist/drm/
H A Ddrm_syncobj.c1501 struct dma_fence_chain **chains; in drm_syncobj_timeline_signal_ioctl() local
1536 chains = kmalloc_array(args->count_handles, sizeof(void *), GFP_KERNEL); in drm_syncobj_timeline_signal_ioctl()
1537 if (!chains) { in drm_syncobj_timeline_signal_ioctl()
1542 chains[i] = kzalloc(sizeof(struct dma_fence_chain), GFP_KERNEL); in drm_syncobj_timeline_signal_ioctl()
1543 if (!chains[i]) { in drm_syncobj_timeline_signal_ioctl()
1545 kfree(chains[j]); in drm_syncobj_timeline_signal_ioctl()
1554 drm_syncobj_add_point(syncobjs[i], chains[i], in drm_syncobj_timeline_signal_ioctl()
1559 kfree(chains); in drm_syncobj_timeline_signal_ioctl()
/netbsd-src/external/gpl3/gcc/dist/gcc/
H A Dtree-predcom.cc652 dump_chains (FILE *file, const vec<chain_p> &chains) in dump_chains() argument
657 FOR_EACH_VEC_ELT (chains, i, chain) in dump_chains()
2373 determine_unroll_factor (const vec<chain_p> &chains) in determine_unroll_factor() argument
2379 FOR_EACH_VEC_ELT (chains, i, chain) in determine_unroll_factor()
2450 replace_phis_by_defined_names (vec<chain_p> &chains) in replace_phis_by_defined_names() argument
2456 FOR_EACH_VEC_ELT (chains, i, chain) in replace_phis_by_defined_names()
2471 replace_names_by_phis (vec<chain_p> chains) in replace_names_by_phis() argument
2477 FOR_EACH_VEC_ELT (chains, i, chain) in replace_names_by_phis()
2492 vec<chain_p> chains; member
2506 replace_names_by_phis (dta->chains); in execute_pred_commoning_cbck()
[all …]
H A Dtree-vect-slp.cc1845 auto_vec<vec<chain_op_t> > chains (group_size); in vect_build_slp_tree_2() local
1889 chains.quick_push (chain.copy ()); in vect_build_slp_tree_2()
1892 if (chains.length () == group_size) in vect_build_slp_tree_2()
1903 chains[lane].stablesort (dt_sort_cmp, vinfo); in vect_build_slp_tree_2()
1913 get_tree_code_name (chains[lane][opnum].code), in vect_build_slp_tree_2()
1914 chains[lane][opnum].op); in vect_build_slp_tree_2()
1921 vect_def_type dt = chains[0][n].dt; in vect_build_slp_tree_2()
1924 if (chains[lane][n].dt != dt) in vect_build_slp_tree_2()
1927 && chains[lane][n].dt == vect_external_def) in vect_build_slp_tree_2()
1930 && chains[lane][n].dt == vect_constant_def) in vect_build_slp_tree_2()
[all …]
H A Dregrename.h87 struct du_chain *chains[MAX_REGS_PER_ADDRESS]; member
H A Dregrename.cc196 mark_conflict (class du_head *chains, unsigned id) in mark_conflict() argument
198 while (chains) in mark_conflict()
200 bitmap_set_bit (&chains->conflicts, id); in mark_conflict()
201 chains = chains->next_chain; in mark_conflict()
220 cur_operand->chains[cur_operand->n_chains++] = this_du; in record_operand_use()
/netbsd-src/external/ibm-public/postfix/dist/src/posttls-finger/
H A Dposttls-finger.c487 char *chains; /* TLS client certificate chain files */ member
802 chain_files = state->chains, in starttls()
1863 chain_files = state->chains, in tls_init()
1916 state->chains = mystrdup(""); in parse_options()
1990 if (*state->chains) in parse_options()
1991 tmp = concatenate(state->chains, ", ", optarg, (char *) 0); in parse_options()
1994 myfree(state->chains); in parse_options()
1995 state->chains = tmp; in parse_options()
2085 if (*state->chains && *state->certfile) in parse_options()
/netbsd-src/external/gpl3/gdb.old/dist/zlib/doc/
H A 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
/netbsd-src/external/gpl3/binutils/dist/zlib/doc/
H A 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
/netbsd-src/external/gpl3/binutils.old/dist/zlib/doc/
H A 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
/netbsd-src/external/gpl3/gdb/dist/zlib/doc/
H A 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
/netbsd-src/sys/gdbscripts/
H A Dvchain56 print vnode chains for all mount points

12345678910>>...13