Lines Matching full:inputs
73 // average execution time of inputs. The faster an input executes, the more
102 // Scaling to favor inputs with lower execution time. in UpdateEnergy()
172 for (auto II : Inputs) in ~InputCorpus()
175 size_t size() const { return Inputs.size(); } in size()
178 for (auto II : Inputs) in SizeInBytes()
184 for (auto II : Inputs) in NumActiveUnits()
190 for (auto II : Inputs) in MaxInputSize()
197 return std::count_if(Inputs.begin(), Inputs.end(), [](const InputInfo *II) { in NumInputsThatTouchFocusFunction()
203 return std::count_if(Inputs.begin(), Inputs.end(), [](const InputInfo *II) { in NumInputsWithDataFlowTrace()
208 bool empty() const { return Inputs.empty(); } in empty()
209 const Unit &operator[] (size_t Idx) const { return Inputs[Idx]->U; }
217 Printf("ADD_TO_CORPUS %zd NF %zd\n", Inputs.size(), NumFeatures); in AddToCorpus()
218 // Inputs.size() is cast to uint32_t below. in AddToCorpus()
219 assert(Inputs.size() < std::numeric_limits<uint32_t>::max()); in AddToCorpus()
220 Inputs.push_back(new InputInfo()); in AddToCorpus()
221 InputInfo &II = *Inputs.back(); in AddToCorpus()
275 for (auto II : Inputs) { in PrintCorpus()
304 InputInfo &II = *Inputs[ChooseUnitIdxToMutate(Rand)]; in ChooseUnitToMutate()
313 InputInfo &II = *Inputs[Rand(Inputs.size())]; in ChooseUnitToCrossOverWith()
322 assert(Idx < Inputs.size()); in ChooseUnitIdxToMutate()
327 for (size_t i = 0; i < Inputs.size(); i++) { in PrintStats()
328 const auto &II = *Inputs[i]; in PrintStats()
342 for (size_t i = 0; i < Inputs.size(); i++) in PrintFeatureSet()
343 if (size_t N = Inputs[i]->NumFeatures) in PrintFeatureSet()
354 InputInfo &II = *Inputs[Idx]; in DeleteInput()
390 for (auto II : Inputs) { in AddRareFeature()
404 for (auto II : Inputs) { in AddRareFeature()
425 InputInfo &II = *Inputs[OldIdx]; in AddFeature()
438 // Inputs.size() is guaranteed to be less than UINT32_MAX by AddToCorpus. in AddFeature()
439 SmallestElementPerFeature[Idx] = static_cast<uint32_t>(Inputs.size()); in AddFeature()
482 Inputs[SmallestElementPerFeature[Idx]]->Tmp++; in ValidateFeatureSet()
483 for (auto II: Inputs) { in ValidateFeatureSet()
494 // Hypothesis: inputs that maximize information about globally rare features
506 size_t N = Inputs.size(); in UpdateCorpusDistribution()
513 for (auto II : Inputs) { in UpdateCorpusDistribution()
520 for (auto II : Inputs) { in UpdateCorpusDistribution()
530 if (Inputs[i]->NumFeatures == 0) { in UpdateCorpusDistribution()
533 } else if (Inputs[i]->NumExecutedMutations / kMaxMutationFactor > in UpdateCorpusDistribution()
534 NumExecutedMutations / Inputs.size()) { in UpdateCorpusDistribution()
539 Weights[i] = Inputs[i]->Energy; in UpdateCorpusDistribution()
551 Inputs[i]->NumFeatures in UpdateCorpusDistribution()
553 (Inputs[i]->HasFocusFunction ? 1000 : 1)) in UpdateCorpusDistribution()
559 Printf("%zd ", Inputs[i]->NumFeatures); in UpdateCorpusDistribution()
574 std::vector<InputInfo *> Inputs; variable