| /external/v8/src/compiler/mips64/ |
| instruction-selector-mips64.cc | 8 #include "src/compiler/node-matchers.h"
9 #include "src/compiler/node-properties.h"
27 InstructionOperand UseOperand(Node* node, InstructionCode opcode) {
28 if (CanBeImmediate(node, opcode)) {
29 return UseImmediate(node);
31 return UseRegister(node);
34 // Use the zero register if the node has the immediate value zero, otherwise
36 InstructionOperand UseRegisterOrImmediateZero(Node* node) {
2276 Node* const node = value->InputAt(0); local
[all...] |
| /libcore/ojluni/src/main/java/java/util/concurrent/ |
| LinkedBlockingDeque.java | 86 * keep all Nodes GC-reachable from a predecessor dequeued Node.
90 * a Node was tenured while live, which generational GCs have a
95 * linking a Node that has just been dequeued to itself. Such a
109 /** Doubly-linked list node class */
110 static final class Node<E> {
112 * The item, or null if this node has been removed.
118 * - the real predecessor Node
119 * - this Node, meaning the predecessor is tail
122 Node<E> prev;
126 * - the real successor Node
343 Node<E> node = new Node<E>(e); local
358 Node<E> node = new Node<E>(e); local
374 Node<E> node = new Node<E>(e); local
391 Node<E> node = new Node<E>(e); local
409 Node<E> node = new Node<E>(e); local
432 Node<E> node = new Node<E>(e); local
[all...] |
| LinkedBlockingQueue.java | 101 * enqueued Node by either acquiring the putLock (via fullyLock)
106 * keep all Nodes GC-reachable from a predecessor dequeued Node.
110 * a Node was tenured while live, which generational GCs have a
115 * linking a Node that has just been dequeued to itself. Such a
120 * Linked list node class.
122 static class Node<E> {
127 * - the real successor Node
128 * - this Node, meaning the successor is head.next
129 * - null, meaning there is no successor (this is the last node)
131 Node<E> next
336 Node<E> node = new Node<E>(e); local
416 Node<E> node = new Node<E>(e); local
812 Node<E> node = lastRet; local
[all...] |
| /frameworks/base/core/java/android/animation/ |
| AnimatorSet.java | 74 private ArrayList<Node> mPlayingSet = new ArrayList<Node>();
79 * to a single node representing that Animator, not create a new Node
82 private ArrayMap<Animator, Node> mNodeMap = new ArrayMap<Animator, Node>();
94 private ArrayList<Node> mNodes = new ArrayList<Node>();
118 private Node mRootNode = new Node(mDelayAnim)
[all...] |
| /external/apache-xml/src/main/java/org/apache/xalan/transformer/ |
| MsgMgr.java | 29 import org.w3c.dom.Node;
115 * @param styleNode Stylesheet node
116 * @param sourceNode Source tree node
124 public void warn(SourceLocator srcLctr, Node styleNode, Node sourceNode, String msg)
133 * @param styleNode Stylesheet node
134 * @param sourceNode Source tree node
143 public void warn(SourceLocator srcLctr, Node styleNode, Node sourceNode, String msg, Object args[])
269 * @param styleNode Stylesheet node
[all...] |
| XalanTransformState.java | 30 import org.w3c.dom.Node;
40 Node m_node = null;
45 Node m_currentNode = null;
52 * @see org.apache.xml.serializer.TransformStateSetter#setCurrentNode(Node)
54 public void setCurrentNode(Node n) {
88 public Node getCurrentNode() {
120 public Node getMatchedNode() {
|
| /external/skia/src/gpu/ccpr/ |
| GrCCPRAtlas.cpp | 20 class GrCCPRAtlas::Node {
22 Node(std::unique_ptr<Node> previous, int l, int t, int r, int b)
27 Node* previous() const { return fPrevious.get(); }
41 const std::unique_ptr<Node> fPrevious;
55 fTopNode = skstd::make_unique<Node>(nullptr, 0, 0, initialSize, initialSize);
77 for (Node* node = fTopNode.get(); node; node = node->previous())
[all...] |
| /device/linaro/bootloader/edk2/MdeModulePkg/Universal/Network/IScsiDxe/ |
| IScsiExtScsiPassThru.c | 157 Used to allocate and build a device path node for a SCSI device on a SCSI channel.
161 Target ID of the SCSI device for which a device path node is to be
166 @param[in] Lun The LUN of the SCSI device for which a device path node is to be
168 @param[in, out] DevicePath A pointer to a single device path node that describes the SCSI device
174 @retval EFI_SUCCESS The device path node that describes the SCSI device specified by
196 EFI_DEV_PATH *Node;
217 Node = AllocatePool (DevPathNodeLen);
218 if (Node == NULL) {
222 Node->DevPath.Type = MESSAGING_DEVICE_PATH;
223 Node->DevPath.SubType = MSG_ISCSI_DP;
[all...] |
| /device/linaro/bootloader/edk2/NetworkPkg/IScsiDxe/ |
| IScsiExtScsiPassThru.c | 181 Allocate and build a device path node for a SCSI device on a SCSI channel.
185 device path node is to be allocated and built.
187 path node is to be allocated and built.
188 @param[in, out] DevicePath A pointer to a single device path node that
196 @retval EFI_SUCCESS The device path node that describes the SCSI
219 EFI_DEV_PATH *Node;
240 Node = AllocateZeroPool (DevPathNodeLen);
241 if (Node == NULL) {
245 Node->DevPath.Type = MESSAGING_DEVICE_PATH;
246 Node->DevPath.SubType = MSG_ISCSI_DP;
[all...] |
| /external/llvm/include/llvm/ADT/ |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
76 // First element is node pointer, second is the 'next child' to visit
81 inline df_iterator(NodeType *Node) {
82 this->Visited.insert(Node);
84 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node)));
89 inline df_iterator(NodeType *Node, SetType &S)
91 if (!S.count(Node)) {
93 std::make_pair(PointerIntTy(Node, 0), GT::child_begin(Node)))
[all...] |
| /external/swiftshader/third_party/LLVM/include/llvm/ADT/ |
| DepthFirstIterator.h | 14 // * Normal depth-first iteration - visit a node and then all of its children.
20 // * Normal depth-first iteration - visit a node and then all of its children.
76 // First element is node pointer, second is the 'next child' to visit
80 inline df_iterator(NodeType *Node) {
81 this->Visited.insert(Node);
82 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
83 GT::child_begin(Node)));
88 inline df_iterator(NodeType *Node, SetType &S)
90 if (!S.count(Node)) {
91 VisitStack.push_back(std::make_pair(PointerIntTy(Node, 0),
[all...] |
| /libcore/ojluni/src/test/java/util/stream/boottest/java/util/stream/ |
| NodeTest.java | 48 List<Node<Integer>> nodes = new ArrayList<>();
49 nodes.add(Nodes.node(array));
50 nodes.add(Nodes.node(Arrays.asList(array)));
52 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l.toArray(new Integer[l.size()]))));
53 nodes.add(tree(Arrays.asList(array), l -> Nodes.node(l)));
66 Node<Integer> fill(Integer[] array, Node.Builder<Integer> nb) {
75 Node<Integer> degenerateTree(Iterator<Integer> it) {
77 return Nodes.node(Collections.emptyList());
82 return new Nodes.ConcNode<Integer>(Nodes.node(new Integer[] {i}), degenerateTree(it))
[all...] |
| /libcore/ojluni/src/main/java/java/util/stream/ |
| Node.java | 38 * <p>A {@code Node} contains a fixed number of elements, which can be accessed
40 * {@link #asArray}, or {@link #copyInto} methods. A {@code Node} may have zero
41 * or more child {@code Node}s; if it has no children (accessed via
44 * <em>internal</em> node. The size of an internal node is the sum of sizes of
48 * <p>A {@code Node} typically does not store the elements directly, but instead
51 * {@code Node}s. Commonly {@code Node}s are formed into a tree whose shape
53 * contained in the leaf nodes. The use of {@code Node} within the stream
61 public interface Node<T>
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/manifest/model/ |
| UiElementNodeTest.java | 28 import org.w3c.dom.Node;
75 * Check initialization values for ui node
101 MockXmlNode root = new MockXmlNode(null /* namespace */, "manifest", Node.ELEMENT_NODE,
103 new MockXmlNode(null /* namespace */, "application", Node.ELEMENT_NODE, null)
118 * loadFrom() does nothing if the root node doesn't match what's expected
122 MockXmlNode root = new MockXmlNode(null /* namespace */, "blah", Node.ELEMENT_NODE, null);
128 * UiElementNode.loadFrom should be used to populate an empty ui node from an
129 * existing XML node tree.
132 MockXmlNode root = new MockXmlNode(null /* namespace */, "manifest", Node.ELEMENT_NODE,
134 new MockXmlNode(null /* namespace */, "application", Node.ELEMENT_NODE, null
[all...] |
| /external/v8/src/compiler/x64/ |
| instruction-selector-x64.cc | 9 #include "src/compiler/node-matchers.h"
10 #include "src/compiler/node-properties.h"
22 bool CanBeImmediate(Node* node) {
23 switch (node->opcode()) {
28 const int64_t value = OpParameter<int64_t>(node);
32 const double value = OpParameter<double>(node);
40 int32_t GetImmediateIntegerValue(Node* node) {
41 DCHECK(CanBeImmediate(node));
1940 Node* const node = value->InputAt(0); local
[all...] |
| /device/linaro/bootloader/edk2/ArmVirtPkg/Library/FdtPL011SerialPortLib/ |
| EarlyFdtPL011SerialPortLib.c | 66 INT32 Node, Prev;
83 for (Prev = 0;; Prev = Node) {
84 Node = fdt_next_node (DeviceTreeBase, Prev, NULL);
85 if (Node < 0) {
89 Compatible = fdt_getprop (DeviceTreeBase, Node, "compatible", &Len);
101 RegProperty = fdt_getprop (DeviceTreeBase, Node, "reg", &Len);
|
| /external/llvm/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 82 pred_iterator_ty pred_begin(change_ty Node) {
83 assert(Predecessors.count(Node) && "Invalid node!");
84 return Predecessors[Node].begin();
86 pred_iterator_ty pred_end(change_ty Node) {
87 assert(Predecessors.count(Node) && "Invalid node!");
88 return Predecessors[Node].end();
91 pred_closure_iterator_ty pred_closure_begin(change_ty Node) {
92 assert(PredClosure.count(Node) && "Invalid node!")
[all...] |
| /external/swiftshader/third_party/LLVM/lib/Support/ |
| DAGDeltaAlgorithm.cpp | 83 pred_iterator_ty pred_begin(change_ty Node) {
84 assert(Predecessors.count(Node) && "Invalid node!");
85 return Predecessors[Node].begin();
87 pred_iterator_ty pred_end(change_ty Node) {
88 assert(Predecessors.count(Node) && "Invalid node!");
89 return Predecessors[Node].end();
92 pred_closure_iterator_ty pred_closure_begin(change_ty Node) {
93 assert(PredClosure.count(Node) && "Invalid node!")
[all...] |
| /external/v8/src/interpreter/ |
| interpreter.h | 28 class Node;
157 void BuildForInPrepareResult(compiler::Node* output_register,
158 compiler::Node* cache_type,
159 compiler::Node* cache_array,
160 compiler::Node* cache_length,
164 compiler::Node* BuildUnaryOp(Callable callable,
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| nodeinsertbefore.java | 32 * node "newChild" before the node "refChild".
34 * Insert a newly created Element node before the eigth
65 Node employeeNode;
67 Node refChild;
68 Node newChild;
69 Node child;
72 Node insertedNode;
119 child = (Node) childList.item(indexN100DC);
|
| nodeinsertbeforenewchildexists.java | 35 * Insert a node Element ("employeeId") that is already
36 * present in the tree. The existing node should be
37 * removed first and the new one inserted. The node is
68 Node employeeNode;
70 Node refChild;
71 Node newChild;
72 Node child;
75 Node insertedNode;
121 child = (Node) childList.item(indexN100DD);
|
| nodereplacechildnewchildexists.java | 64 Node employeeNode;
66 Node oldChild = null;
68 Node newChild = null;
71 Node childNode;
98 Node replacedChild;
118 childNode = (Node) childList.item(indexN100DE);
|
| /prebuilts/clang/host/darwin-x86/clang-3957855/prebuilt_include/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 57 // First element is the node reference, second is the next child to visit.
68 inline bf_iterator(NodeRef Node) {
69 this->Visited.insert(Node);
72 // Also, insert a dummy node as marker.
73 VisitQueue.push(QueueElement(Node, None));
82 NodeRef Node = H.first;
86 ChildIt.emplace(GT::child_begin(Node));
87 while (*ChildIt != GT::child_end(Node)) {
130 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/darwin-x86/clang-3960126/prebuilt_include/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 57 // First element is the node reference, second is the next child to visit.
68 inline bf_iterator(NodeRef Node) {
69 this->Visited.insert(Node);
72 // Also, insert a dummy node as marker.
73 VisitQueue.push(QueueElement(Node, None));
82 NodeRef Node = H.first;
86 ChildIt.emplace(GT::child_begin(Node));
87 while (*ChildIt != GT::child_end(Node)) {
130 // time so that you can actually call methods on the node, because the
|
| /prebuilts/clang/host/darwin-x86/clang-3977809/prebuilt_include/llvm/include/llvm/ADT/ |
| BreadthFirstIterator.h | 57 // First element is the node reference, second is the next child to visit.
68 inline bf_iterator(NodeRef Node) {
69 this->Visited.insert(Node);
72 // Also, insert a dummy node as marker.
73 VisitQueue.push(QueueElement(Node, None));
82 NodeRef Node = H.first;
86 ChildIt.emplace(GT::child_begin(Node));
87 while (*ChildIt != GT::child_end(Node)) {
130 // time so that you can actually call methods on the node, because the
|
