Searched refs:DFT (Results 1 - 7 of 7) sorted by relevance
/openbsd-current/gnu/usr.sbin/mkhybrid/src/ |
H A D | desktop.c | 34 #define DFT "DTFL" macro 125 strcpy(ent.type, DFT); /* type */
|
/openbsd-current/gnu/llvm/compiler-rt/lib/fuzzer/ |
H A D | FuzzerDataFlowTrace.cpp | 96 // Give higher weight if the function has a DFT. 118 static void DFTStringAppendToVector(std::vector<uint8_t> *DFT, 120 assert(DFT->size() == DFTString.size()); 121 for (size_t I = 0, Len = DFT->size(); I < Len; I++) 122 (*DFT)[I] = DFTString[I] == '1'; 127 std::vector<uint8_t> DFT(DFTString.size()); 128 DFTStringAppendToVector(&DFT, DFTString); 129 return DFT; 189 // * reads the coverage data from the DFT files. 266 // Function number => DFT [all...] |
H A D | FuzzerInternal.h | 138 DataFlowTrace DFT; member in class:fuzzer::Fuzzer
|
H A D | FuzzerLoop.cpp | 544 TimeOfUnit, UniqFeatureSetTmp, DFT, II); 860 /*TimeOfUnit=*/duration_cast<microseconds>(0s), {0}, DFT, 867 DFT.Init(Options.DataFlowTrace, &FocusFunctionOrAuto, CorporaFiles, 871 DFT.Clear(); // No need for DFT any more.
|
H A D | FuzzerCorpus.h | 213 const DataFlowTrace &DFT, const InputInfo *BaseII) { 237 if (auto V = DFT.Get(Sha1Str)) 240 // Ideally, when we add an element to a corpus we need to know its DFT. 241 // But if we don't, we'll use the DFT of its base input. 209 AddToCorpus(const Unit &U, size_t NumFeatures, bool MayDeleteFile, bool HasFocusFunction, bool NeverReduce, std::chrono::microseconds TimeOfUnit, const std::vector<uint32_t> &FeatureSet, const DataFlowTrace &DFT, const InputInfo *BaseII) argument
|
/openbsd-current/gnu/llvm/compiler-rt/lib/fuzzer/tests/ |
H A D | FuzzerUnittest.cpp | 631 DataFlowTrace DFT; local 642 /*FeatureSet*/ {}, DFT, 656 DataFlowTrace DFT; local 665 /*FeatureSet*/ {}, DFT, 672 /*FeatureSet*/ {}, DFT, 1076 TEST(DFT, BlockCoverage) { 1140 TEST(DFT, FunctionWeights) { 1160 // A function with DFT gets more weight than the function w/o DFT.
|
/openbsd-current/gnu/llvm/llvm/lib/Transforms/Utils/ |
H A D | SimplifyCFG.cpp | 710 SmallVector<Value *, 8> DFT; 715 DFT.push_back(V); 717 while (!DFT.empty()) { 718 V = DFT.pop_back_val(); 726 DFT.push_back(Op1); 728 DFT.push_back(Op0);
|
Completed in 288 milliseconds