| /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-3957855/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-3960126/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-3977809/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-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-3957855/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-3960126/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-3977809/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-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...] |
| /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
86 // Only return TRUE when the End Device Path node is valid.
92 Returns the Type field of a device path node.
94 Returns the Type field of the device path node specified by Node.
96 If Node is NULL, then ASSERT().
[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...] |
| /external/swiftshader/third_party/LLVM/include/llvm/Support/ |
| GraphWriter.h | 63 // Writes the edge labels of the node to O and returns true if there are any
65 bool getEdgeSourceLabels(raw_ostream &O, NodeType *Node) {
66 child_iterator EI = GTraits::child_begin(Node);
67 child_iterator EE = GTraits::child_end(Node);
71 std::string label = DTraits.getEdgeSourceLabel(Node, EI);
143 bool isNodeHidden(NodeType &Node) {
144 return isNodeHidden(&Node);
147 bool isNodeHidden(NodeType *const *Node) {
148 return isNodeHidden(*Node);
151 bool isNodeHidden(NodeType *Node) {
[all...] |
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/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...] |
| /prebuilts/clang/host/darwin-x86/clang-4053586/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3957855/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3960126/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-3977809/prebuilt_include/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...] |
| /prebuilts/clang/host/linux-x86/clang-4053586/prebuilt_include/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...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/locks/ |
| AbstractQueuedLongSynchronizer.java | 42 import java.util.concurrent.locks.AbstractQueuedSynchronizer.Node;
86 private transient volatile Node head;
90 * method enq to add new wait node.
92 private transient volatile Node tail;
144 * Inserts node into queue, initializing if necessary. See picture above.
145 * @param node the node to insert
146 * @return node's predecessor
148 private Node enq(Node node)
170 Node node = new Node(mode); local
449 final Node node = addWaiter(Node.EXCLUSIVE); local
480 final Node node = addWaiter(Node.EXCLUSIVE); local
511 final Node node = addWaiter(Node.SHARED); local
542 final Node node = addWaiter(Node.SHARED); local
576 final Node node = addWaiter(Node.SHARED); local
1410 Node node = new Node(Node.CONDITION); local
1528 Node node = addConditionWaiter(); local
1591 Node node = addConditionWaiter(); local
1628 Node node = addConditionWaiter(); local
1671 Node node = addConditionWaiter(); local
1715 Node node = addConditionWaiter(); local
[all...] |
| /external/v8/src/builtins/ |
| builtins-conversion.cc | 33 typedef compiler::Node Node;
36 Node* input = assembler->Parameter(Descriptor::kArgument);
37 Node* context = assembler->Parameter(Descriptor::kContext);
41 Node* to_primitive_symbol =
43 Node* exotic_to_prim =
59 Node* hint_string = assembler->HeapConstant(
61 Node* result = assembler->CallJS(callable, context, exotic_to_prim, input,
68 Node* result_instance_type = assembler->LoadInstanceType(result);
121 typedef compiler::Node Node
[all...] |
