OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:ExitingBlock
(Results
1 - 4
of
4
) sorted by null
/external/llvm/lib/Transforms/Utils/
LoopSimplify.cpp
294
BasicBlock *
ExitingBlock
= ExitingBlocks[i];
295
if (!
ExitingBlock
->getSinglePredecessor()) continue;
296
BranchInst *BI = dyn_cast<BranchInst>(
ExitingBlock
->getTerminator());
299
if (!CI || CI->getParent() !=
ExitingBlock
) continue;
304
for (BasicBlock::iterator I =
ExitingBlock
->begin(); &*I != BI; ) {
327
<<
ExitingBlock
->getName() << "\n");
337
assert(pred_begin(
ExitingBlock
) == pred_end(
ExitingBlock
));
339
LI->removeBlock(
ExitingBlock
);
341
DomTreeNode *Node = DT->getNode(
ExitingBlock
);
[
all
...]
/external/llvm/include/llvm/Analysis/
ScalarEvolution.h
279
AssertingVH<BasicBlock>
ExitingBlock
;
283
ExitNotTakenInfo() :
ExitingBlock
(0), ExactNotTaken(0) {}
324
return ExitNotTaken.
ExitingBlock
|| !isa<SCEVCouldNotCompute>(Max);
337
const SCEV *getExact(BasicBlock *
ExitingBlock
, ScalarEvolution *SE) const;
445
ExitLimit ComputeExitLimit(const Loop *L, BasicBlock *
ExitingBlock
);
738
///
ExitingBlock
. More precisely, it is the number of times that control may
739
/// reach
ExitingBlock
before taking the branch. For loops with multiple
742
unsigned getSmallConstantTripCount(Loop *L, BasicBlock *
ExitingBlock
);
749
/// this assumes that control exits the loop via
ExitingBlock
.
750
unsigned getSmallConstantTripMultiple(Loop *L, BasicBlock *
ExitingBlock
);
[
all
...]
/external/llvm/lib/Analysis/
ScalarEvolution.cpp
[
all
...]
/external/llvm/lib/Transforms/Scalar/
LoopStrengthReduce.cpp
[
all
...]
Completed in 370 milliseconds