Home
last modified time | relevance | path

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

12345

/openbsd-src/regress/lib/libcrypto/x509/
H A Dcallback.c113 const char *bundle_file, int *chains, int mode) in verify_cert() argument
121 *chains = 0; in verify_cert()
155 *chains = 1; /* XXX */ in verify_cert()
354 int chains; in verify_cert_test() local
372 verify_cert(roots_dir, roots_file, bundle_file, &chains, mode); in verify_cert_test()
373 if ((mode == MODE_VERIFY && chains == vct->want_chains) || in verify_cert_test()
374 (chains == 0 && vct->want_chains == 0) || in verify_cert_test()
375 (chains == 1 && vct->want_chains > 0)) { in verify_cert_test()
376 fprintf(output, "INFO: Succeeded with %d chains%s\n", in verify_cert_test()
377 chains, vc in verify_cert_test()
[all...]
H A Dcallbackfailures.c118 const char *bundle_file, const char*bundle_file2, int *chains, int mode) in verify_cert() argument
126 *chains = 0; in verify_cert()
164 *chains = 1; /* XXX */ in verify_cert()
222 int chains; in verify_cert_test() local
244 verify_cert(roots_dir, roots_file, bundle_file, bundle_file2, &chains, mode); in verify_cert_test()
245 if (chains == 0 && vct->want_chains == 0) { in verify_cert_test()
258 if ((mode == MODE_VERIFY && chains == vct->want_chains) || in verify_cert_test()
259 (chains == 0 && vct->want_chains == 0) || in verify_cert_test()
260 (chains == 1 && vct->want_chains > 0)) { in verify_cert_test()
261 fprintf(stderr, "INFO: Succeeded with %d chains in verify_cert_test()
[all...]
H A Dverify.c107 const char *bundle_file, int *chains, int *error, int *error_depth, in verify_cert() argument
117 *chains = 0; in verify_cert()
160 *chains = 1; /* XXX */ in verify_cert()
179 verify_cert_new(const char *roots_file, const char *bundle_file, int *chains) in verify_cert_new() argument
186 *chains = 0; in verify_cert_new()
210 if ((*chains = x509_verify(ctx, leaf, NULL)) == 0) { in verify_cert_new()
217 for (c = 0; verbose && c < *chains; c++) { in verify_cert_new()
473 int chains, error, error_depth; in verify_cert_test() local
494 verify_cert_new(roots_file, bundle_file, &chains); in verify_cert_test()
496 verify_cert(roots_dir, roots_file, bundle_file, &chains, in verify_cert_test()
[all...]
H A Dexpirecallback.c116 const char *bundle_file, int *chains, int *error, int *error_depth, in verify_cert() argument
126 *chains = 0; in verify_cert()
170 *chains = 1; /* XXX */ in verify_cert()
234 int chains, error, error_depth; in verify_cert_test() local
251 verify_cert(roots_dir, roots_file, bundle_file, &chains, &error, in verify_cert_test()
254 if ((mode == MODE_VERIFY && chains == vct->want_chains) || in verify_cert_test()
255 (chains == 0 && vct->want_chains == 0) || in verify_cert_test()
256 (chains == 1 && vct->want_chains > 0)) { in verify_cert_test()
257 fprintf(stderr, "INFO: Succeeded with %d chains%s\n", in verify_cert_test()
258 chains, vc in verify_cert_test()
[all...]
/openbsd-src/regress/lib/libcrypto/certs/
H A Dverify_test.go93 chains, err := cert.Verify(opts)
100 t.Logf("Found %d chains", len(chains))
101 if got, want := len(chains), test.wantChains; got != want {
104 for i, chain := range chains {
H A DREADME1 This directory contains tools for building certificate chains to
35 signed by two root certificates (should verify with two chains).
49 two chains).
59 is signed by a second root (should verify with two chains).
77 with two chains).
80 with two chains).
83 with two chains).
/openbsd-src/regress/lib/libcrypto/x509/policy/
H A Dpolicy.c120 const char *leaf_file, int *chains, int *error, int *error_depth, in verify_cert() argument
130 *chains = 0; in verify_cert()
180 *chains = 1; /* XXX */ in verify_cert()
591 * chains and legacy verifier horror)
603 int chains, error, error_depth; in verify_cert_test() local
619 vct->leaf_file, &chains, &error, &error_depth, in verify_cert_test()
622 if ((chains == 0 && vct->want_chains == 0) || in verify_cert_test()
623 (chains == 1 && vct->want_chains > 0)) { in verify_cert_test()
624 fprintf(stderr, "INFO: Succeeded with %d chains%s\n", in verify_cert_test()
625 chains, vc in verify_cert_test()
[all...]
/openbsd-src/libexec/ld.so/
H A Dresolve.h185 const Elf_Hash_Word *chains; member
190 const Elf_Word *chains; member
198 #define chains_elf hash_u.u_elf.chains
200 #define chains_gnu hash_u.u_gnu.chains
/openbsd-src/lib/libcrypto/x509/
H A Dx509_verify.c211 x509_verify_chain_free(ctx->chains[i]); in x509_verify_ctx_reset()
227 free(ctx->chains); in x509_verify_ctx_clear()
508 if ((ctx->chains[ctx->chains_count] = x509_verify_chain_dup(chain)) == in x509_verify_ctx_add_chain()
1008 if ((ctx->chains = calloc(X509_VERIFY_MAX_CHAINS, in x509_verify_ctx_new()
1009 sizeof(*ctx->chains))) == NULL) in x509_verify_ctx_new()
1090 return ctx->chains[i]->certs; in STACK_OF()
1233 if (!x509_verify_ctx_set_xsc_chain(ctx, ctx->chains[0], 1, 1)) in x509_verify()
H A Dx509_internal.h69 struct x509_verify_chain **chains; /* Validated chains */ member
/openbsd-src/sys/dev/pci/drm/
H A Ddrm_syncobj.c1611 struct dma_fence_chain **chains; in drm_syncobj_timeline_signal_ioctl()
1646 chains = kmalloc_array(args->count_handles, sizeof(void *), GFP_KERNEL); in drm_syncobj_timeline_signal_ioctl()
1647 if (!chains) { in drm_syncobj_timeline_signal_ioctl()
1652 chains[i] = dma_fence_chain_alloc(); in drm_syncobj_timeline_signal_ioctl()
1653 if (!chains[i]) { in drm_syncobj_timeline_signal_ioctl()
1655 dma_fence_chain_free(chains[j]); in drm_syncobj_timeline_signal_ioctl()
1664 drm_syncobj_add_point(syncobjs[i], chains[i], in drm_syncobj_timeline_signal_ioctl()
1669 kfree(chains); in drm_syncobj_query_ioctl()
1602 struct dma_fence_chain **chains; drm_syncobj_timeline_signal_ioctl() local
/openbsd-src/lib/libz/
H A Dalgorithm.doc27 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
236 The hash chains are searched starting with the most recent strings, to
238 The hash chains are singly linked. There are no deletions from the
239 hash chains, the algorithm simply discards matches that are too old.
241 To avoid a worst-case situation, very long hash chains are arbitrarily
445 The hash chains are searched starting with the most recent strings, to
447 The hash chains are singly linked. There are no deletions from the
[all …]
/openbsd-src/gnu/usr.bin/gcc/gcc/
H A Dregrename.c989 dump_def_use_chain (chains) in dump_def_use_chain() argument
990 struct du_chain *chains; in dump_def_use_chain()
992 while (chains)
994 struct du_chain *this = chains;
1005 chains = chains->next_chain;
/openbsd-src/gnu/llvm/clang/docs/
H A DDataFlowSanitizerDesign.rst141 An origin tracking trace is a list of chains. Each chain has a stack trace
154 chains.
162 Other instructions do not create new chains, but simply propagate origin trace
H A DDriverInternals.rst321 tool chains to perform their own translation of the argument list (into
393 The gcc driver has no direct understanding of tool chains. Each gcc
H A DClangOffloadBundler.rst24 non-heterogeneous tool chains. The bundled code object contains the code objects
/openbsd-src/gnu/gcc/gcc/
H A Dregrename.c997 dump_def_use_chain (struct du_chain *chains) in dump_def_use_chain() argument
999 while (chains) in dump_def_use_chain()
1001 struct du_chain *this = chains; in dump_def_use_chain()
1012 chains = chains->next_chain; in dump_def_use_chain()
/openbsd-src/gnu/llvm/llvm/docs/
H A DLexicon.rst252 also `def/use chains <ProgrammersManual.html#iterating-over-def-use-use-def-chains>`_.
H A DOpaquePointers.rst83 deal with bitcasts. When looking up through def-use chains for pointers it's
85 pointer obfuscated by bitcasts. And when looking down through def-use chains
H A DMemorySSA.rst22 form for memory, complete with def-use and use-def chains, which
284 other accesses writing to memory. This is needed for walking Def chains.
/openbsd-src/lib/libelf/
H A Dlibelf_convert.m4759 uint32_t *buckets, *chains;
825 chains = (uint32_t *) (uintptr_t) dst;
831 *chains++ = t32;
901 /* Copy out the hash chains. */
/openbsd-src/regress/bin/ksh/
H A Dobsd-regress.t288 The -e flag within an if statement should terminate && chains on
299 The -e flag within a for statement should terminate && or || chains on
310 The -e flag within a while statement should terminate && or || chains on
/openbsd-src/gnu/llvm/llvm/docs/CommandGuide/
H A Dllvm-dwarfdump.rst150 compile unit chains, DIE relationships graph, address
/openbsd-src/gnu/gcc/gcc/doc/
H A Dtree-ssa.texi1374 need only to patch use-def and def-def chains for virtuals
1391 virtual names to the generic updater. Since FUD chains are
1436 @subsection Walking use-def chains
1440 Walks use-def chains starting at the @code{SSA_NAME} node @var{var}.
1453 @item Walk the use-def chains for @var{arg}.
1545 This phase walks the use-def chains in the SSA web looking for
/openbsd-src/sys/dev/pci/
H A Dif_iwx.c3577 uint8_t chains, sco, vht_chan_width; in iwx_phy_ctxt_task()
3588 chains = iwx_mimo_enabled(sc) ? 2 : 1; in iwx_phy_ctxt_task()
3604 in->in_phyctxt->channel, chains, chains, 0, sco, in iwx_phy_ctxt_task()
8167 cfg_cmd.chains = IWX_TLC_MNG_CHAIN_A_MSK | IWX_TLC_MNG_CHAIN_B_MSK; in iwx_auth()
8235 cfg_cmd.chains = IWX_TLC_MNG_CHAIN_A_MSK | IWX_TLC_MNG_CHAIN_B_MSK; in iwx_run()
8593 /* Configure Rx chains for MIMO and configure 40 MHz channel. */ in iwx_newstate_task()
8595 uint8_t chains = iwx_mimo_enabled(sc) ? 2 : 1; in iwx_newstate_task()
8597 in->in_phyctxt->channel, chains, chains, in iwx_newstate_task()
3571 uint8_t chains, sco, vht_chan_width; iwx_phy_ctxt_task() local
8241 uint8_t chains = iwx_mimo_enabled(sc) ? 2 : 1; iwx_run() local
8251 uint8_t chains = iwx_mimo_enabled(sc) ? 2 : 1; iwx_run() local
[all...]

12345