Home
last modified time | relevance | path

Searched refs:df_begin (Results 1 – 11 of 11) sorted by relevance

/external/clang/include/clang/AST/
DStmtGraphTraits.h45 return df_begin(S);
72 return df_begin(S);
/external/clang/include/clang/Analysis/Analyses/
DDominators.h186 return df_begin(getEntryNode(N));
201 return df_begin(getEntryNode(N));
/external/llvm/include/llvm/IR/
DDominators.h156 return df_begin(getEntryNode(N)); in nodes_begin()
180 return df_begin(getEntryNode(N));
/external/llvm/lib/Analysis/
DIteratedDominanceFrontier.cpp24 for (auto DFI = df_begin(DT.getRootNode()), DFE = df_end(DT.getRootNode()); in calculate()
/external/llvm/include/llvm/Analysis/
DPostDominators.h105 return df_begin(getEntryNode(N));
DRegionInfo.h573 : super(df_begin(Entry)) {
/external/llvm/include/llvm/ADT/
DDepthFirstIterator.h201 df_iterator<T> df_begin(const T& G) { in df_begin() function
213 return make_range(df_begin(G), df_end(G)); in depth_first()
/external/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h461 return df_begin(N);
487 return df_begin(N);
/external/llvm/lib/Target/PowerPC/
DPPCLoopDataPrefetch.cpp116 for (auto L = df_begin(*I), LE = df_end(*I); L != LE; ++L) in runOnFunction()
DPPCLoopPreIncPrep.cpp156 for (auto L = df_begin(*I), LE = df_end(*I); L != LE; ++L) in runOnFunction()
/external/llvm/lib/Target/AMDGPU/
DSIAnnotateControlFlow.cpp327 for (df_iterator<BasicBlock *> I = df_begin(&F.getEntryBlock()), in runOnFunction()