Searched refs:algorithm (Results 351 - 375 of 817) sorted by relevance

<<11121314151617181920>>

/freebsd-12-stable/crypto/openssl/crypto/x509/
H A Dx509_cmp.c317 * Check a suite B algorithm is permitted: pass in a public key and the NID
336 * Check signature algorithm is consistent with curve.
378 * pointer. All we need to do is check the leaf key algorithm.
435 sign_nid = OBJ_obj2nid(crl->crl.sig_alg.algorithm);
/freebsd-12-stable/crypto/openssl/include/openssl/
H A Dpkcs7.h76 X509_ALGOR *algorithm; member in struct:pkcs7_enc_content_st
/freebsd-12-stable/crypto/openssl/crypto/bn/asm/
H A Dbn-c64xplus.asm220 ;; Not really Comba algorithm, just straightforward NxM... Dedicated
309 ;; algorithm implementation that operates at n*(n+1)+12, or
/freebsd-12-stable/crypto/openssl/crypto/cms/
H A Dcms_kari.c85 *pubalg = oik->d.originatorKey->algorithm;
338 /* If a suitable wrap algorithm is already set nothing to do */
382 /* Initialise wrap algorithm parameters */
396 /* Initialise KDF algorithm */
H A Dcms_env.c378 const EVP_CIPHER *ciph = EVP_get_cipherbyobj(calg->algorithm);
703 wrap_nid = OBJ_obj2nid(kekri->keyEncryptionAlgorithm->algorithm);
/freebsd-12-stable/usr.bin/dtc/
H A Dfdt.hh37 #include <algorithm>
/freebsd-12-stable/tools/tools/mctest/
H A Dmctest.cc42 #include <algorithm>
/freebsd-12-stable/contrib/bmake/unit-tests/
H A Dvarmod-edge.mk116 # Str_Match uses a recursive algorithm for matching the * patterns.
/freebsd-12-stable/crypto/openssl/crypto/ts/
H A Dts_rsp_sign.c470 md_alg_id = OBJ_obj2nid(md_alg->algorithm);
478 "Message digest algorithm is "
917 if (alg->algorithm == NULL)
/freebsd-12-stable/contrib/wpa/src/utils/
H A Dhttp_curl.c488 res = OBJ_obj2txt(txt, sizeof(txt), hash->hashAlg->algorithm, 1);
559 hash->hashAlg->algorithm, 1);
612 i2a_ASN1_OBJECT(out, hash->hashAlg->algorithm);
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/
H A DGlobalMerge.cpp93 #include <algorithm>
H A DLiveRangeCalc.cpp30 #include <algorithm>
480 // This is essentially the same iterative algorithm that SSAUpdater uses,
H A DScheduleDAG.cpp30 #include <algorithm>
439 // The idea of the algorithm is taken from
442 // This is the MNR algorithm, which was first introduced by
446 // Short description of the algorithm:
458 // The algorithm first computes a topological ordering for the DAG by
462 // On insertion of the edge X->Y, the algorithm first marks by calling DFS
H A DStackMaps.cpp32 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/
H A DFunctionLoweringInfo.cpp40 #include <algorithm>
H A DSelectionDAGBuilder.h37 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/DWARF/
H A DDWARFDebugFrame.cpp22 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/MSF/
H A DMappedBlockStream.cpp17 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/llvm/lib/DebugInfo/Symbolize/
H A DSymbolize.cpp34 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/llvm/lib/ExecutionEngine/Orc/
H A DOrcCBindingsStack.h33 #include <algorithm>
H A DOrcMCJITReplacement.h40 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/llvm/lib/IR/
H A DModule.cpp49 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/lldb/source/Plugins/Process/minidump/
H A DMinidumpParser.cpp19 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/lldb/source/Symbol/
H A DLineTable.cpp15 #include <algorithm>
/freebsd-12-stable/contrib/llvm-project/lldb/source/Target/
H A DThreadList.cpp11 #include <algorithm>

Completed in 318 milliseconds

<<11121314151617181920>>