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

  /src/external/apache2/llvm/dist/llvm/lib/Analysis/
Interval.cpp 34 for (const BasicBlock *Predecessor : Predecessors)
35 OS << *Predecessor << "\n";
  /src/external/apache2/llvm/dist/llvm/lib/Target/ARM/
ARMBlockPlacement.cpp 70 /// Find t2WhileLoopStartLR in the loop predecessor BB or otherwise in its only
71 /// predecessor. If found, returns (BB, WLS Instr) pair, otherwise a null pair.
73 MachineBasicBlock *Predecessor = ML->getLoopPredecessor();
74 if (!Predecessor)
76 MachineInstr *WlsInstr = findWLSInBlock(Predecessor);
79 if (Predecessor->pred_size() == 1)
80 return findWLSInBlock(*Predecessor->pred_begin());
85 /// This requires checking the predecessor (ie. preheader or it's predecessor)
87 /// If moving the predecessor won't convert a WLS (to the predecessor) fro
    [all...]
  /src/external/apache2/llvm/dist/llvm/lib/CodeGen/
HardwareLoops.cpp 388 // the loop header, so also check if it has a single predecessor.
399 BasicBlock *Predecessor = BB->getSinglePredecessor();
402 if (!isSafeToExpandAt(TripCount, Predecessor->getTerminator(), SE))
405 BB = Predecessor;
MachinePipeliner.cpp 870 // predecessor.
891 // predecessor.
1361 // (since USE is a predecessor), implies, the COPY/ REG_SEQUENCE is scheduled
1778 // Create a new node set with the connected nodes of any predecessor of a node
1788 // has no predecessor.
1810 SUnit *Predecessor = PI.getSUnit();
1811 if (!PI.isArtificial() && NodesAdded.count(Predecessor) == 0)
1812 addConnectedNodes(Predecessor, NewSet, NodesAdded);
2475 /// depends on any predecessor or successor nodes scheduled already.
2481 // is a predecessor or successor of the specified instruction
    [all...]
  /src/external/apache2/llvm/dist/clang/utils/TableGen/
MveEmitter.cpp 471 Ptr Predecessor;
496 // be computed before this one. That method divides into the 'predecessor',
505 if (Predecessor)
506 ToRet.push_back(Predecessor);
515 // because it already has a predecessor. Instead, walk the chain
520 while (r->Predecessor)
521 r = r->Predecessor.get();
522 r->Predecessor = p;
  /src/external/apache2/llvm/dist/llvm/lib/Transforms/Utils/
SimplifyCFG.cpp 176 "Number of value comparisons folded into predecessor basic blocks");
178 "Number of branches folded into predecessor basic block");
326 /// will be the same as those coming in from ExistPred, an existing predecessor
735 // predecessors unless there is only one predecessor.
844 /// only have a single predecessor block, check to see if that predecessor is
852 return false; // Not a value comparison in predecessor.
1065 // If we have bonus instructions, clone them into the predecessor block.
1066 // Note that there may be multiple predecessor blocks, so we cannot move
1067 // bonus instructions to a predecessor block
    [all...]

Completed in 36 milliseconds