HomeSort by relevance Sort by last modified time
    Searched defs:Working (Results 1 - 3 of 3) sorted by null

  /external/llvm/lib/Analysis/
BlockFrequencyInfoImpl.cpp 247 std::vector<WorkingData>().swap(Working);
272 BlockNode Resolved = Working[Succ.Index].getResolvedNode();
293 if (Working[Resolved.Index].getContainingLoop() != OuterLoop) {
374 if (auto *Loop = Working[M.Index].getPackagedLoop())
397 BlockMass Mass = Working[Source.Index].getMass();
407 Working[W.TargetNode.Index].getMass() += Taken;
480 const auto &Working = BFI.Working[N.Index];
481 Scaled64 &F = Working.isAPackage() ? Working.getPackagedLoop()->Scal
    [all...]
  /external/clang/lib/CodeGen/
CodeGenPGO.cpp 57 uint64_t Working;
99 PGOHash() : Working(0), Count(0) {}
579 uint64_t Swapped = endian::byte_swap<uint64_t, little>(Working);
581 Working = 0;
586 Working = Working << NumBitsPerType | Type;
590 // Use Working as the hash directly if we never used MD5.
595 return Working;
597 // Check for remaining work in Working.
598 if (Working)
    [all...]
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 384 std::vector<WorkingData> Working;
409 assert(Head.Index < Working.size());
410 assert(Working[Head.Index].isLoopHeader());
411 return *Working[Head.Index].Loop;
594 BFI.Working[Node.Index].getMass() = BlockMass::getEmpty();
612 for (uint32_t Index = 0; Index < BFI.Working.size(); ++Index)
625 const auto &Working = BFI.Working[Node.Index];
627 if (Working.isAPackage())
628 for (const auto &I : Working.Loop->Exits
    [all...]

Completed in 69 milliseconds