HomeSort by relevance Sort by last modified time
    Searched defs:NodeA (Results 1 - 8 of 8) sorted by null

  /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]
  /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Support/
GenericDomTree.h 474 DomTreeNodeBase<NodeT> *NodeA = getNode(A);
477 if (!NodeA || !NodeB) return nullptr;
481 while (NodeA && NodeA != NodeB) {
482 if (NodeA->getLevel() < NodeB->getLevel()) std::swap(NodeA, NodeB);
484 NodeA = NodeA->IDom;
487 return NodeA ? NodeA->getBlock() : nullptr
    [all...]

Completed in 555 milliseconds