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

  /src/sys/external/bsd/compiler_rt/dist/lib/fuzzer/
FuzzerUtil.h 73 inline std::pair<std::string, std::string> SplitBefore(std::string X,
  /src/external/apache2/llvm/dist/llvm/lib/Target/PowerPC/
PPCReduceCRLogicals.cpp 109 MachineInstr *SplitBefore;
118 if (!OrigBranch || !SplitBefore || !SplitCond)
121 if (SplitBefore->getParent() != MBB || SplitCond->getParent() != MBB)
131 /// Splits a MachineBasicBlock to branch before \p SplitBefore. The original
199 MachineBasicBlock::iterator InsertPoint = BSI.SplitBefore;
205 // Move everything after SplitBefore into the new block.
220 BuildMI(*ThisMBB, ThisMBB->end(), BSI.SplitBefore->getDebugLoc(),
224 BuildMI(*ThisMBB, ThisMBB->end(), BSI.SplitBefore->getDebugLoc(),
263 /// SplitBefore operand, determines whether either of the branches are to be
643 MachineInstr *SplitBefore = &*Def2It
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
RegAllocGreedy.cpp 2339 // We will split before Uses[SplitBefore] and after Uses[SplitAfter].
2340 unsigned SplitBefore = 0, SplitAfter = 1;
2342 // MaxGap should always be max(GapWeight[SplitBefore..SplitAfter-1]).
2348 const bool LiveBefore = SplitBefore != 0 || BI.LiveIn;
2351 LLVM_DEBUG(dbgs() << printReg(PhysReg, TRI) << ' ' << Uses[SplitBefore]
2363 unsigned NewGaps = LiveBefore + SplitAfter - SplitBefore + LiveAfter;
2376 Uses[SplitBefore].distance(Uses[SplitAfter]) +
2388 BestBefore = SplitBefore;
2396 if (++SplitBefore < SplitAfter) {
2399 if (GapWeight[SplitBefore - 1] >= MaxGap)
    [all...]

Completed in 36 milliseconds