| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/ADT/ |
| BreadthFirstIterator.h | 56 // First element is the node reference, second is the next child to visit.
67 inline bf_iterator(NodeRef Node) {
68 this->Visited.insert(Node);
71 // Also, insert a dummy node as marker.
72 VisitQueue.push(QueueElement(Node, None));
81 NodeRef Node = H.first;
85 ChildIt.emplace(GT::child_begin(Node));
86 while (*ChildIt != GT::child_end(Node)) {
129 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| CFGPrinter.h | 63 static std::string getSimpleNodeLabel(const BasicBlock *Node,
65 if (!Node->getName().empty())
66 return Node->getName().str();
71 Node->printAsOperand(OS, false);
75 static std::string getCompleteNodeLabel(const BasicBlock *Node,
81 if (Node->getName().empty()) {
82 Node->printAsOperand(OS, false);
86 OS << *Node;
120 std::string getNodeLabel(const BasicBlock *Node,
123 return getSimpleNodeLabel(Node, Graph)
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/clang/AST/ |
| StmtVisitor.h | 168 RetTy VisitStmt(PTR(Stmt) Node, ParamTys... P) { return RetTy(); }
215 RetTy VisitOMPClause(PTR(OMPClause) Node) { return RetTy(); }
|
