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) {
371 if (auto *Loop = Working[M.Index].getPackagedLoop())
381 BlockMass Mass = Working[Source.Index].getMass();
404 Working[W.TargetNode.Index].getMass() += Taken;
477 const auto &Working = BFI.Working[N.Index];
478 Scaled64 &F = Working.isAPackage() ? Working.getPackagedLoop()->Scal
    [all...]
  /external/clang/lib/CodeGen/
CodeGenPGO.cpp 95 uint64_t Working;
137 PGOHash() : Working(0), Count(0) {}
628 uint64_t Swapped = endian::byte_swap<uint64_t, little>(Working);
630 Working = 0;
635 Working = Working << NumBitsPerType | Type;
639 // Use Working as the hash directly if we never used MD5.
644 return Working;
646 // Check for remaining work in Working.
647 if (Working)
    [all...]
  /external/llvm/include/llvm/Analysis/
BlockFrequencyInfoImpl.h 373 std::vector<WorkingData> Working;
398 assert(Head.Index < Working.size());
399 assert(Working[Head.Index].isLoopHeader());
400 return *Working[Head.Index].Loop;
571 BFI.Working[Node.Index].getMass() = BlockMass::getEmpty();
589 for (uint32_t Index = 0; Index < BFI.Working.size(); ++Index)
602 const auto &Working = BFI.Working[Node.Index];
604 if (Working.isAPackage())
605 for (const auto &I : Working.Loop->Exits
    [all...]

Completed in 222 milliseconds