HomeSort by: relevance | last modified time | path
    Searched defs:Working (Results 1 - 3 of 3) sorted by relevancy

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 283 std::vector<WorkingData>().swap(Working);
310 BlockNode Resolved = Working[Succ.Index].getResolvedNode();
331 if (Working[Resolved.Index].getContainingLoop() != OuterLoop) {
413 if (auto *Loop = Working[M.Index].getPackagedLoop())
436 BlockMass Mass = Working[Source.Index].getMass();
446 Working[W.TargetNode.Index].getMass() += Taken;
519 const auto &Working = BFI.Working[N.Index];
520 Scaled64 &F = Working.isAPackage() ? Working.getPackagedLoop()->Scal
    [all...]
  /src/external/apache2/llvm/dist/clang/lib/CodeGen/
CodeGenPGO.cpp 73 uint64_t Working;
134 : Working(0), Count(0), HashVersion(HashVersion), MD5() {}
749 uint64_t Swapped = endian::byte_swap<uint64_t, little>(Working);
751 Working = 0;
756 Working = Working << NumBitsPerType | Type;
760 // Use Working as the hash directly if we never used MD5.
765 return Working;
767 // Check for remaining work in Working.
768 if (Working) {
    [all...]
  /src/external/apache2/llvm/dist/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 422 std::vector<WorkingData> Working;
453 assert(Head.Index < Working.size());
454 assert(Working[Head.Index].isLoopHeader());
455 return *Working[Head.Index].Loop;
650 BFI.Working[Node.Index].getMass() = BlockMass::getEmpty();
670 for (uint32_t Index = 0; Index < BFI.Working.size(); ++Index)
684 const auto &Working = BFI.Working[Node.Index];
686 if (Working.isAPackage())
687 for (const auto &I : Working.Loop->Exits
    [all...]

Completed in 64 milliseconds