Searched defs:Nodes (Results 1 - 25 of 141) sorted by relevance

123456

/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h92 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
101 bool isSingular() const { return Nodes.size() == 1; }
102 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h48 Nodes.push_back(Header);
53 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
70 for (BasicBlock *Node : Nodes)
75 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/
H A DCallGraphSCCPass.h92 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
101 bool isSingular() const { return Nodes.size() == 1; }
102 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
/prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/
H A DCallGraphSCCPass.h92 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
101 bool isSingular() const { return Nodes.size() == 1; }
102 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
/prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/
H A DCallGraphSCCPass.h92 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
101 bool isSingular() const { return Nodes.size() == 1; }
102 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
/prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/
H A DCallGraphSCCPass.h92 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
101 bool isSingular() const { return Nodes.size() == 1; }
102 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
/prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/
H A DCallGraphSCCPass.h92 std::vector<CallGraphNode*> Nodes; member in class:llvm::CallGraphSCC
98 Nodes.assign(NewNodes.begin(), NewNodes.end());
101 bool isSingular() const { return Nodes.size() == 1; }
102 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
/prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/
H A DCallGraphSCCPass.h91 std::vector<CallGraphNode *> Nodes; member in class:llvm::CallGraphSCC
97 Nodes.assign(NewNodes.begin(), NewNodes.end());
100 bool isSingular() const { return Nodes.size() == 1; }
101 unsigned size() const { return Nodes.size(); }
109 iterator begin() const { return Nodes.begin(); }
110 iterator end() const { return Nodes.end(); }
H A DInterval.h49 Nodes.push_back(Header);
54 /// Nodes - The basic blocks in this interval.
55 std::vector<BasicBlock*> Nodes; member in class:llvm::Interval
68 for (BasicBlock *Node : Nodes)
73 //return find(Nodes.begin(), Nodes.end(), BB) != Nodes.end();
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/clang/include/clang/ASTMatchers/
H A DASTMatchFinder.h26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
81 const BoundNodes Nodes; member in struct:clang::ast_matchers::MatchFinder::MatchResult
280 Nodes.push_back(Result.Nodes);
282 SmallVector<BoundNodes, 1> Nodes; member in class:clang::ast_matchers::internal::CollectMatchesCallback
294 return std::move(Callback.Nodes);
310 return std::move(Callback.Nodes);
/prebuilts/clang/host/darwin-x86/clang-4393122/include/clang/ASTMatchers/
H A DASTMatchFinder.h26 // Result.Nodes.GetDeclAs<CXXRecordDecl>("id");
76 MatchResult(const BoundNodes &Nodes, clang::ASTContext *Context);
81 const BoundNodes Nodes; member in struct:clang::ast_matchers::MatchFinder::MatchResult
280 Nodes.push_back(Result.Nodes);
282 SmallVector<BoundNodes, 1> Nodes; member in class:clang::ast_matchers::internal::CollectMatchesCallback
294 return std::move(Callback.Nodes);
310 return std::move(Callback.Nodes);

Completed in 1033 milliseconds

123456