Home
last modified time | relevance | path

Searched refs:nodes_begin (Results 1 – 21 of 21) sorted by relevance

/freebsd-9-stable/contrib/llvm/tools/clang/include/clang/AST/
DStmtGraphTraits.h44 static nodes_iterator nodes_begin(clang::Stmt* S) {
71 static nodes_iterator nodes_begin(const clang::Stmt* S) {
/freebsd-9-stable/contrib/llvm/tools/clang/include/clang/Analysis/
DCFG.h746 graph_iterator nodes_begin() { return graph_iterator(Blocks.begin()); } in nodes_begin() function
748 const_graph_iterator nodes_begin() const { in nodes_begin() function
961 static nodes_iterator nodes_begin(::clang::CFG* F) { return F->nodes_begin();}
974 static nodes_iterator nodes_begin( const ::clang::CFG* F) {
975 return F->nodes_begin();
991 static nodes_iterator nodes_begin( ::clang::CFG* F) {return F->nodes_begin();}
1001 static nodes_iterator nodes_begin(const ::clang::CFG* F) {
1002 return F->nodes_begin();
DCallGraph.h210 static nodes_iterator nodes_begin(clang::CallGraph *CG) {
236 static nodes_iterator nodes_begin(const clang::CallGraph *CG) {
/freebsd-9-stable/contrib/llvm/tools/clang/include/clang/StaticAnalyzer/Core/PathSensitive/
DExplodedGraph.h336 node_iterator nodes_begin() { return Nodes.begin(); } in nodes_begin() function
340 const_node_iterator nodes_begin() const { return Nodes.begin(); } in nodes_begin() function
461 static inline nodes_iterator nodes_begin(NodeType* N) {
487 static inline nodes_iterator nodes_begin(NodeType* N) {
/freebsd-9-stable/contrib/llvm/tools/clang/include/clang/Analysis/Analyses/
DDominators.h186 static nodes_iterator nodes_begin(::clang::DomTreeNode *N) {
201 static nodes_iterator nodes_begin(::clang::DominatorTree *N) {
/freebsd-9-stable/contrib/llvm/include/llvm/Analysis/
DRegionIterator.h296 static nodes_iterator nodes_begin(RegionT* R) { \
310 static nodes_iterator nodes_begin(RegionT* R) { \
332 static nodes_iterator nodes_begin(RegionInfo* RI) {
DCallGraph.h351 static nodes_iterator nodes_begin(CallGraph *CG) {
370 static nodes_iterator nodes_begin(const CallGraph *CG) { return CG->begin(); }
DPostDominators.h97 static nodes_iterator nodes_begin(PostDominatorTree *N) {
DDominators.h678 for (typename TraitsTy::nodes_iterator I = TraitsTy::nodes_begin(&F), in recalculate()
913 static nodes_iterator nodes_begin(DomTreeNode *N) {
928 static nodes_iterator nodes_begin(DominatorTree *N) {
/freebsd-9-stable/contrib/llvm/include/llvm/CodeGen/
DMachineFunction.h479 static nodes_iterator nodes_begin(MachineFunction *F) { return F->begin(); }
491 static nodes_iterator nodes_begin(const MachineFunction *F) {
DScheduleDAG.h663 static nodes_iterator nodes_begin(ScheduleDAG *G) {
DSelectionDAG.h1193 static nodes_iterator nodes_begin(SelectionDAG *G) {
/freebsd-9-stable/contrib/llvm/include/llvm/Support/
DCFG.h329 static nodes_iterator nodes_begin(Function *F) { return F->begin(); }
339 static nodes_iterator nodes_begin(const Function *F) { return F->begin(); }
DGraphWriter.h142 for (node_iterator I = GTraits::nodes_begin(G), E = GTraits::nodes_end(G); in writeNodes()
/freebsd-9-stable/contrib/llvm/lib/Analysis/
DBlockFrequencyInfo.cpp64 static nodes_iterator nodes_begin(const BlockFrequencyInfo *G) { in nodes_begin() function
DRegionInfo.cpp280 return GraphTraits<Region*>::nodes_begin(this); in element_begin()
288 return GraphTraits<const Region*>::nodes_begin(this); in element_begin()
/freebsd-9-stable/contrib/llvm/tools/clang/lib/StaticAnalyzer/Checkers/
DAnalyzerStatsChecker.cpp55 for (ExplodedGraph::node_iterator I = G.nodes_begin(); in checkEndAnalysis()
DUnreachableCodeChecker.cpp66 for (ExplodedGraph::node_iterator I = G.nodes_begin(), E = G.nodes_end(); in checkEndAnalysis()
/freebsd-9-stable/contrib/llvm/tools/clang/lib/Serialization/
DModuleManager.cpp418 static nodes_iterator nodes_begin(const ModuleManager &Manager) { in nodes_begin() function
/freebsd-9-stable/contrib/llvm/lib/Target/R600/
DAMDILCFGStructurizer.cpp878 GraphTraits<MachineFunction *>::nodes_begin(FuncRep); in run()
901 wrapup(GraphTraits<MachineFunction *>::nodes_begin(FuncRep)); in run()
947 MachineFunction::iterator It = GTM::nodes_begin(MF), E = GTM::nodes_end(MF); in orderBlocks()
/freebsd-9-stable/contrib/llvm/lib/Transforms/IPO/
DFunctionAttrs.cpp399 static ChildIteratorType nodes_begin(ArgumentGraph *AG) { in nodes_begin() function