/external/swiftshader/third_party/llvm-subzero/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/external/v8/src/builtins/ |
builtins-internal.cc | 62 typedef compiler::Node Node; 66 Node* object = assembler.Parameter(Descriptor::kObject); 69 Node* source = assembler.LoadObjectField(object, JSObject::kElementsOffset); 72 Node* length = assembler.TaggedToParameter( 86 Node* target = assembler.AllocateFixedArray(kind, length, mode); 95 Node* target = assembler.AllocateFixedArray(kind, length, mode, 107 typedef compiler::Node Node; 111 Node* object = assembler.Parameter(Descriptor::kObject) [all...] |
/hardware/interfaces/tests/pointer/1.0/ |
IGraph.hal | 21 struct Node { 25 ref<Node> left; 26 ref<Node> right; 29 vec<Node> nodes; 47 passANode(Node n);
|
/libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
DocumentImpl.java | 32 import org.w3c.dom.Node; 68 * <p>Attaching user data directly to the corresponding node would cost a 69 * field per node. Under the assumption that user data is rarely needed, we 118 * Returns a shallow copy of the given node. If the node is an element node, 121 * @param node a node belonging to any document or DOM implementation. 124 * responsibility to notify user data handlers of the returned node. 125 * @return a new node whose document is this document and whose DO [all...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Support/ |
YAMLParser.h | 29 // yaml::Node *n = di->getRoot(); 58 class Node; 95 void printError(Node *N, const Twine &Msg); 105 class Node { 119 Node(unsigned int Type, std::unique_ptr<Document> &, StringRef Anchor, 122 /// \brief Get the value of the anchor attached to this node. If it does not 130 /// \brief Get the verbatium tag for a given Node. This performs tag resoluton 140 Node *parseBlockNode(); 165 ~Node() = default; 178 class NullNode final : public Node { [all...] |
/external/llvm/include/llvm/Analysis/ |
RegionIterator.h | 53 PointerIntPair<NodeType*, 2, ItMode> Node; 58 // advanceRegionSucc - A region node has only one successor. It reaches end 61 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 62 Node.setInt(ItRgEnd); 65 NodeType* getNode() const{ return Node.getPointer(); } 68 bool isRegionMode() const { return Node.getInt() != ItBB; } 81 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 95 inline RNSuccIterator(NodeType* node) 96 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/external/testng/src/main/java/org/testng/internal/ |
Graph.java | 22 private Map<T, Node<T>> m_nodes = Maps.newLinkedHashMap(); 25 // A map of nodes that are not the predecessors of any node 28 private Map<T, Node<T>> m_independentNodes = null; 31 ppp("ADDING NODE " + tm + " " + tm.hashCode()); 32 m_nodes.put(tm, new Node<>(tm)); 36 public Set<T> getPredecessors(T node) { 37 return findNode(node).getPredecessors().keySet(); 44 private Node<T> findNode(T object) { 49 Node<T> node = findNode(tm) local 135 Node<T> node = findNodeWithNoPredecessors(nodes2); local 166 m_independentNodes.put(node.getObject(), node); local 212 Node<T> node = findNode(o); local [all...] |
/prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
RegionIterator.h | 59 PointerIntPair<NodeRef, 2, ItMode> Node; 64 // advanceRegionSucc - A region node has only one successor. It reaches end 67 assert(Node.getInt() == ItRgBegin && "Cannot advance region successor!"); 68 Node.setInt(ItRgEnd); 71 NodeRef getNode() const { return Node.getPointer(); } 74 bool isRegionMode() const { return Node.getInt() != ItBB; } 87 assert(Node.getInt() == ItRgBegin && "Cannot get the region successor!"); 101 inline RNSuccIterator(NodeRef node) 102 : Node(node, node->isSubRegion() ? ItRgBegin : ItBB) [all...] |
/external/v8/src/compiler/ |
control-equivalence.cc | 6 #include "src/compiler/node-properties.h" 17 void ControlEquivalence::Run(Node* exit) { 29 void ControlEquivalence::VisitPre(Node* node) { 30 TRACE("CEQ: Pre-visit of #%d:%s\n", node->id(), node->op()->mnemonic()); 33 SetNumber(node, NewDFSNumber()); 34 TRACE(" Assigned DFS number is %zu\n", GetNumber(node)); 38 void ControlEquivalence::VisitMid(Node* node, DFSDirection direction) 99 Node* node = entry.node; local 182 Node* node = queue.front(); local [all...] |
escape-analysis-reducer.cc | 34 Reduction EscapeAnalysisReducer::ReduceNode(Node* node) { 35 if (node->id() < static_cast<NodeId>(fully_reduced_.length()) && 36 fully_reduced_.Contains(node->id())) { 40 switch (node->opcode()) { 43 return ReduceLoad(node); 46 return ReduceStore(node); 48 return ReduceAllocate(node); 50 return ReduceFinishRegion(node); 52 return ReduceReferenceEqual(node); [all...] |
/sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/mock/ |
MockXmlNode.java | 22 import org.w3c.dom.Node; 30 * A mock XML node with only a minimal set of information. 32 public class MockXmlNode implements Node { 44 // namespace stuff only set in the root node 49 * Constructs a node from a given children list. 51 * @param namespace The namespace of the node or null if none 52 * @param localName The XML local node name. 53 * @param node_type One of Node.xxx_NODE constants, e.g. Node.ELEMENT_NODE 66 * Constructs an attribute node 99 MockXmlNode node = mAttributes.addAttribute(namespaceURI, localName, value); local [all...] |