OpenGrok
Home
Sort by relevance
Sort by last modified time
Full Search
Definition
Symbol
File Path
History
|
|
Help
Searched
refs:isReachableFromEntry
(Results
1 - 21
of
21
) sorted by null
/external/llvm/lib/IR/
Dominators.cpp
105
if (!
isReachableFromEntry
(UseBB))
109
if (!
isReachableFromEntry
(DefBB))
141
if (!
isReachableFromEntry
(UseBB))
145
if (!
isReachableFromEntry
(DefBB))
252
if (!
isReachableFromEntry
(UseBB))
256
if (!
isReachableFromEntry
(DefBB))
289
bool DominatorTree::
isReachableFromEntry
(const Use &U) const {
298
return
isReachableFromEntry
(PN->getIncomingBlock(U));
301
return
isReachableFromEntry
(I->getParent());
Verifier.cpp
[
all
...]
/external/llvm/unittests/IR/
DominatorTreeTest.cpp
56
EXPECT_TRUE(DT->
isReachableFromEntry
(BB0));
57
EXPECT_TRUE(DT->
isReachableFromEntry
(BB1));
58
EXPECT_TRUE(DT->
isReachableFromEntry
(BB2));
59
EXPECT_FALSE(DT->
isReachableFromEntry
(BB3));
60
EXPECT_TRUE(DT->
isReachableFromEntry
(BB4));
/external/llvm/include/llvm/Analysis/
Dominators.h
191
assert(
isReachableFromEntry
(B));
192
assert(
isReachableFromEntry
(A));
261
DT.
isReachableFromEntry
(ND)) {
272
if (DT.
isReachableFromEntry
(PredBlocks[i])) {
284
if (DT.
isReachableFromEntry
(PredBlocks[i]))
363
///
isReachableFromEntry
- Return true if A is dominated by the entry
365
bool
isReachableFromEntry
(const NodeT* A) const {
368
return
isReachableFromEntry
(getNode(const_cast<NodeT *>(A)));
371
inline bool
isReachableFromEntry
(const DomTreeNodeBase<NodeT> *A) const {
385
if (!
isReachableFromEntry
(B)
[
all
...]
LoopInfoImpl.h
381
if (!DomTree.
isReachableFromEntry
(PredBB))
539
&& DomTree.
isReachableFromEntry
(Backedge)) {
/external/clang/include/clang/Analysis/Analyses/
Dominators.h
138
bool
isReachableFromEntry
(const CFGBlock *A) {
139
return DT->
isReachableFromEntry
(A);
/external/llvm/include/llvm/CodeGen/
MachineDominators.h
163
///
isReachableFromEntry
- Return true if A is dominated by the entry
165
bool
isReachableFromEntry
(const MachineBasicBlock *A) {
166
return DT->
isReachableFromEntry
(A);
/external/llvm/lib/Analysis/
AliasAnalysis.cpp
380
if (BeforeHere != I && !DT->
isReachableFromEntry
(BB))
395
if (BeforeHere != I && !DT->
isReachableFromEntry
(BB))
CFG.cpp
185
if (DT && !DT->
isReachableFromEntry
(StopBB))
LoopInfo.cpp
200
DT.
isReachableFromEntry
(UserBB))
MemoryDependenceAnalysis.cpp
[
all
...]
InstructionSimplify.cpp
107
if (!DT->
isReachableFromEntry
(P->getParent()))
109
if (!DT->
isReachableFromEntry
(I->getParent()))
[
all
...]
ScalarEvolution.cpp
[
all
...]
/external/llvm/lib/Transforms/Scalar/
Sink.cpp
126
if (!DT->
isReachableFromEntry
(&BB)) return false;
DeadStoreElimination.cpp
66
if (DT->
isReachableFromEntry
(I))
650
if (DT->
isReachableFromEntry
(Pred))
GVN.cpp
[
all
...]
/external/llvm/lib/CodeGen/
StackProtector.cpp
356
if (DT && DT->
isReachableFromEntry
(BB)) {
MachineSink.cpp
257
if (!DT->
isReachableFromEntry
(&MBB)) return false;
/external/llvm/lib/Transforms/ObjCARC/
ObjCARCContract.cpp
461
if (DT->
isReachableFromEntry
(U) && DT->dominates(Inst, U)) {
/external/llvm/lib/Target/PowerPC/
PPCCTRLoops.cpp
621
if (!MDT->
isReachableFromEntry
(MBB))
/external/llvm/lib/Transforms/Vectorize/
BBVectorize.cpp
391
if (!DT->
isReachableFromEntry
(&BB)) {
[
all
...]
Completed in 369 milliseconds