| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_nodeinsertbeforedocfragment.java | 69 Node employeeNode;
71 Node refChild;
73 Node newChild1;
74 Node newChild2;
75 Node child;
77 Node appendedChild;
78 Node insertedNode;
|
| nodeinsertbeforedocfragment.java | 69 Node employeeNode;
71 Node refChild;
73 Node newChild1;
74 Node newChild2;
75 Node child;
77 Node appendedChild;
78 Node insertedNode;
|
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| InnerNodeImpl.java | 24 import org.w3c.dom.Node;
37 * <p>This class represents a Node that has a parent Node as well as
51 public Node appendChild(Node newChild) throws DOMException {
58 for (NodeImpl node : children) {
59 list.add(node);
65 public Node getFirstChild() {
69 public Node getLastChild() {
73 public Node getNextSibling()
[all...] |
| /libcore/luni/src/main/java/org/w3c/dom/ |
| Document.java | 22 * to create these objects. The <code>Node</code> objects created have a
27 public interface Document extends Node {
35 * <br>This provides direct access to the <code>DocumentType</code> node,
36 * child node of this <code>Document</code>. This node can be set at
38 * nodes manipulation methods, such as <code>Node.insertBefore</code>,
39 * or <code>Node.replaceChild</code>. Note, however, that while some
58 * node that is the document element of the document.
95 * Creates a <code>Text</code> node given the specified string.
96 * @param data The data for the node
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 113 * A node contains the expected E ("item") and links to predecessor
116 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
118 * A node p is considered "live" if it contains a non-null item
122 * At any time, there is precisely one "first" node with a null
124 * starting at a live node. Similarly there is precisely one
125 * "last" node terminating any chain of next references starting at
126 * a live node. The "first" and "last" nodes may or may not be live.
130 * next reference in the first or last node to a fresh node
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseOrderedCollectionRedBlackTreeLib/ |
| BaseOrderedCollectionRedBlackTreeLib.c | 60 Retrieve the user structure linked by the specified tree node.
64 @param[in] Node Pointer to the tree node whose associated user structure we
68 @return Pointer to user structure linked by Node.
73 IN CONST RED_BLACK_TREE_NODE *Node
76 return Node->UserStruct;
185 Look up the tree node that links the user structure that matches the
198 @return The tree node that links to the user structure matching
208 RED_BLACK_TREE_NODE *Node;
210 Node = Tree->Root;
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 108 class Node;
126 /// edges. The edges are stored in the source node and point at the target
127 /// node. This allows the edge structure itself to be a very compact data
135 explicit Edge(Node &N, Kind K);
151 /// Get the call graph node referenced by this edge.
154 Node &getNode() const;
165 PointerIntPair<Node *, 1, Kind> Value;
172 /// This typically exists entirely within the node but is exposed as
173 /// a separate type because a node doesn't initially have edges. An explicit
175 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 108 class Node;
126 /// edges. The edges are stored in the source node and point at the target
127 /// node. This allows the edge structure itself to be a very compact data
135 explicit Edge(Node &N, Kind K);
151 /// Get the call graph node referenced by this edge.
154 Node &getNode() const;
165 PointerIntPair<Node *, 1, Kind> Value;
172 /// This typically exists entirely within the node but is exposed as
173 /// a separate type because a node doesn't initially have edges. An explicit
175 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 108 class Node;
126 /// edges. The edges are stored in the source node and point at the target
127 /// node. This allows the edge structure itself to be a very compact data
135 explicit Edge(Node &N, Kind K);
151 /// Get the call graph node referenced by this edge.
154 Node &getNode() const;
165 PointerIntPair<Node *, 1, Kind> Value;
172 /// This typically exists entirely within the node but is exposed as
173 /// a separate type because a node doesn't initially have edges. An explicit
175 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4579689/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4630689/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4639204/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-4691093/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/llvm/include/llvm/Analysis/ |
| LazyCallGraph.h | 108 class Node;
126 /// edges. The edges are stored in the source node and point at the target
127 /// node. This allows the edge structure itself to be a very compact data
135 explicit Edge(Node &N, Kind K);
151 /// Get the call graph node referenced by this edge.
154 Node &getNode() const;
165 PointerIntPair<Node *, 1, Kind> Value;
172 /// This typically exists entirely within the node but is exposed as
173 /// a separate type because a node doesn't initially have edges. An explicit
175 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4393122/include/llvm/Analysis/ |
| LazyCallGraph.h | 108 class Node;
126 /// edges. The edges are stored in the source node and point at the target
127 /// node. This allows the edge structure itself to be a very compact data
135 explicit Edge(Node &N, Kind K);
151 /// Get the call graph node referenced by this edge.
154 Node &getNode() const;
165 PointerIntPair<Node *, 1, Kind> Value;
172 /// This typically exists entirely within the node but is exposed as
173 /// a separate type because a node doesn't initially have edges. An explicit
175 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4479392/include/llvm/Analysis/ |
| LazyCallGraph.h | 108 class Node;
126 /// edges. The edges are stored in the source node and point at the target
127 /// node. This allows the edge structure itself to be a very compact data
135 explicit Edge(Node &N, Kind K);
151 /// Get the call graph node referenced by this edge.
154 Node &getNode() const;
165 PointerIntPair<Node *, 1, Kind> Value;
172 /// This typically exists entirely within the node but is exposed as
173 /// a separate type because a node doesn't initially have edges. An explicit
175 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4579689/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4630689/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4639204/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /prebuilts/clang/host/linux-x86/clang-4691093/include/llvm/Analysis/ |
| LazyCallGraph.h | 114 class Node;
132 /// edges. The edges are stored in the source node and point at the target
133 /// node. This allows the edge structure itself to be a very compact data
141 explicit Edge(Node &N, Kind K);
157 /// Get the call graph node referenced by this edge.
160 Node &getNode() const;
171 PointerIntPair<Node *, 1, Kind> Value;
178 /// This typically exists entirely within the node but is exposed as
179 /// a separate type because a node doesn't initially have edges. An explicit
181 /// then cached in the node. It is also used to represent edges entering th
[all...] |
| /external/v8/src/ |
| code-stubs.cc | 337 typedef compiler::Node Node;
339 Node* left = assembler.Parameter(Descriptor::kLeft);
340 Node* right = assembler.Parameter(Descriptor::kRight);
341 Node* context = assembler.Parameter(Descriptor::kContext);
446 typedef compiler::Node Node;
449 Node* receiver = assembler.Parameter(Descriptor::kReceiver);
450 Node* key = assembler.Parameter(Descriptor::kName);
451 Node* value = assembler.Parameter(Descriptor::kValue)
[all...] |
| /device/linaro/bootloader/edk2/MdePkg/Library/UefiDevicePathLib/ |
| DevicePathUtilities.c | 3 nodes. The device path is terminated by an end node that is length
25 // Template for an end-of-device path node.
44 @retval FALSE The length of any node node in the DevicePath is less
48 @retval FALSE If PcdMaximumDevicePathNodeCount is not zero, the node
69 // Validate the input size big enough to touch the first node.
87 // Validate next node before touch it.
102 // Only return TRUE when the End Device Path node is valid.
109 Returns the Type field of a device path node.
111 Returns the Type field of the device path node specified by Node.
[all...] |
| /external/llvm/include/llvm/CodeGen/ |
| MachinePassRegistry.h | 47 /// MachinePassRegistryNode - Machine pass node stored in registration list.
107 void Add(MachinePassRegistryNode *Node);
111 void Remove(MachinePassRegistryNode *Node);
133 for (RegistryClass *Node = RegistryClass::getList();
134 Node; Node = Node->getNext()) {
135 this->addLiteralOption(Node->getName(),
136 (typename RegistryClass::FunctionPassCtor)Node->getCtor(),
137 Node->getDescription())
[all...] |
| /external/llvm/include/llvm/Support/ |
| GraphWriter.h | 37 /// \brief Get a color string for this node number. Simply round-robin selects
67 // Writes the edge labels of the node to O and returns true if there are any
69 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
70 child_iterator EI = GTraits::child_begin(Node);
71 child_iterator EE = GTraits::child_end(Node);
75 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
147 bool isNodeHidden(NodeType &Node) {
148 return isNodeHidden(&Node);
151 bool isNodeHidden(NodeType *const *Node) {
152 return isNodeHidden(*Node);
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/CodeGen/ |
| MachinePassRegistry.h | 46 /// MachinePassRegistryNode - Machine pass node stored in registration list.
105 void Add(MachinePassRegistryNode *Node);
109 void Remove(MachinePassRegistryNode *Node);
130 for (RegistryClass *Node = RegistryClass::getList();
131 Node; Node = Node->getNext()) {
132 this->addLiteralOption(Node->getName(),
133 (typename RegistryClass::FunctionPassCtor)Node->getCtor(),
134 Node->getDescription())
[all...] |
