| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/left_child_next_sibling_heap_/ |
| point_const_iterator.hpp | 54 template<typename Node, typename _Alloc>
57 left_child_next_sibling_heap_node_point_const_iterator_<Node, _Alloc>
60 template<typename Node, typename _Alloc>
64 typedef typename _Alloc::template rebind<Node>::other::pointer node_pointer;
74 typedef typename Node::value_type value_type;
|
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| LegalizeDAG.cpp | 64 /// reference to it in order to update as necessary on node deletion.
84 void LegalizeOp(SDNode *Node);
89 void LegalizeLoadOps(SDNode *Node);
90 void LegalizeStoreOps(SDNode *Node);
112 SDValue ExpandLibCall(RTLIB::Libcall LC, SDNode *Node, bool isSigned);
117 SDNode *Node, bool isSigned);
118 SDValue ExpandFPLibCall(SDNode *Node, RTLIB::Libcall Call_F32,
122 SDValue ExpandIntLibCall(SDNode *Node, bool isSigned,
128 void ExpandDivRemLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results);
129 void ExpandSinCosLibCall(SDNode *Node, SmallVectorImpl<SDValue> &Results)
[all...] |
| /external/mesa3d/src/gallium/drivers/nv50/codegen/ |
| nv50_ir_graph.cpp | 41 reinterpret_cast<Node *>(it->get())->cut();
44 void Graph::insert(Node *node)
47 root = node;
49 node->graph = this;
87 Graph::Node::Node(void *priv) : data(priv),
95 void Graph::Node::attach(Node *node, Edge::Type kind
344 Node *node = reinterpret_cast<Node *>(it->get()); local
357 Graph::Node *node; local
[all...] |
| /external/v8/src/compiler/ |
| js-inlining.cc | 16 #include "src/compiler/node-matchers.h"
17 #include "src/compiler/node-properties.h"
37 explicit JSCallAccessor(Node* call) : call_(call) {
42 Node* target() {
47 Node* receiver() {
52 Node* new_target() {
57 Node* frame_state_before() {
61 Node* frame_state_after() {
74 Node* call_;
89 Node* GetCopy(Node* orig) { return copies_[orig->id()];
[all...] |
| osr.cc | 18 #include "src/compiler/node.h"
19 #include "src/compiler/node-marker.h"
47 Zone* tmp_zone, Node* dead,
49 Node* osr_normal_entry, Node* osr_loop_entry) {
53 Node* sentinel = graph->NewNode(dead->op());
73 for (Node* node : loop_tree->HeaderNodes(outer)) {
74 mapping->at(node->id()) = dead;
75 TRACE(" ---- #%d:%s -> dead (header)\n", node->id()
[all...] |
| graph-trimmer.cc | 23 // Mark end node as live.
27 for (Node* const input : live_[i]->inputs()) MarkAsLive(input);
30 for (Node* const live : live_) {
33 Node* const user = edge.from();
|
| node-cache.h | 23 class Node;
36 // Search for node associated with {key} and return a pointer to a memory
38 // returned by this method contains a non-nullptr node, the caller can use
40 // node. Otherwise it is the responsibility of the caller to fill the entry
41 // with a new node.
44 Node** Find(Zone* zone, Key key);
47 void GetCachedNodes(ZoneVector<Node*>* nodes);
|
| /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()) {
27 const int64_t value = OpParameter<int64_t>(node);
31 const double value = OpParameter<double>(node);
39 AddressingMode GenerateMemoryOperandInputs(Node* index, int scale_exponent,
40 Node* base, Node* displacement
1511 Node* const node = value->InputAt(0); local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| TreeWalker.java | 29 import org.w3c.dom.Node;
148 * @param pos Node in the tree where to start traversal
152 public void traverse(Node pos) throws org.xml.sax.SAXException
167 * @param pos Node in the tree where to start traversal
171 public void traverseFragment(Node pos) throws org.xml.sax.SAXException
173 Node top = pos;
179 Node nextNode = pos.getFirstChild();
218 * @param pos Node in the tree where to start traversal
219 * @param top Node in the tree where to end traversal
223 public void traverse(Node pos, Node top) throws org.xml.sax.SAXExceptio
[all...] |
| /external/v8/src/compiler/x87/ |
| instruction-selector-x87.cc | 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
20 InstructionOperand UseByteRegister(Node* node) {
22 return UseFixed(node, edx);
25 InstructionOperand DefineAsByteRegister(Node* node) {
27 return DefineAsRegister(node);
34 bool CanBeImmediate(Node* node) {
1128 Node* const node = value->InputAt(0); local
[all...] |
| /libcore/ojluni/src/main/java/java/util/stream/ |
| Nodes.java | 45 * Factory methods for constructing implementations of {@link Node} and
46 * {@link Node.Builder} and their primitive specializations. Fork/Join tasks
47 * for collecting output from a {@link PipelineHelper} to a {@link Node} and
48 * flattening {@link Node}s.
67 private static final Node EMPTY_NODE = new EmptyNode.OfRef();
68 private static final Node.OfInt EMPTY_INT_NODE = new EmptyNode.OfInt();
69 private static final Node.OfLong EMPTY_LONG_NODE = new EmptyNode.OfLong();
70 private static final Node.OfDouble EMPTY_DOUBLE_NODE = new EmptyNode.OfDouble();
72 // General shape-based node creation methods
75 * Produces an empty node whose count is zero, has no children and no content
139 static <T> Node<T> node(T[] array) { method in class:Nodes
152 static <T> Node<T> node(Collection<T> c) { method in class:Nodes
192 static Node.OfInt node(int[] array) { method in class:Nodes
229 static Node.OfLong node(final long[] array) { method in class:Nodes
266 static Node.OfDouble node(final double[] array) { method in class:Nodes
328 Node<P_OUT> node = new CollectorTask.OfRef<>(helper, generator, spliterator).invoke(); local
366 Node.OfInt node = new CollectorTask.OfInt<>(helper, spliterator).invoke(); local
404 Node.OfLong node = new CollectorTask.OfLong<>(helper, spliterator).invoke(); local
442 Node.OfDouble node = new CollectorTask.OfDouble<>(helper, spliterator).invoke(); local
[all...] |
| /external/clang/lib/AST/ |
| StmtViz.cpp | 35 static std::string getNodeLabel(const Stmt* Node, const Stmt* Graph) {
41 if (Node)
42 Out << Node->getStmtClassName();
|
| /external/llvm/lib/Target/Mips/ |
| MipsISelDAGToDAG.cpp | 185 SDNode* MipsDAGToDAGISel::Select(SDNode *Node) {
186 unsigned Opcode = Node->getOpcode();
188 // Dump information about the Node being selected
189 DEBUG(errs() << "Selecting: "; Node->dump(CurDAG); errs() << "\n");
191 // If we have a custom node, we already have selected!
192 if (Node->isMachineOpcode()) {
193 DEBUG(errs() << "== "; Node->dump(CurDAG); errs() << "\n");
194 Node->setNodeId(-1);
198 // See if subclasses can handle this node.
199 std::pair<bool, SDNode*> Ret = selectNode(Node);
[all...] |
| /external/v8/test/cctest/compiler/ |
| test-multiple-return.cc | 80 Node* p0 = m.Parameter(0);
81 Node* p1 = m.Parameter(1);
82 Node* add = m.Int32Add(p0, p1);
83 Node* sub = m.Int32Sub(p0, p1);
84 Node* mul = m.Int32Mul(p0, p1);
98 Node* a = mt.Int32Constant(123);
99 Node* b = mt.Int32Constant(456);
100 Node* ret3 = mt.AddNode(mt.common()->Call(desc), mt.HeapConstant(code), a, b);
101 Node* x = mt.AddNode(mt.common()->Projection(0), ret3);
102 Node* y = mt.AddNode(mt.common()->Projection(1), ret3)
[all...] |
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_attrgetvalue1.java | 59 Node testNode;
64 Node retval;
65 Node lastChild;
|
| hc_nodeappendchildgetnodename.java | 31 * The "appendChild(newChild)" method returns the node
34 * Append a newly created node to the child list of the
66 Node employeeNode;
68 Node newChild;
69 Node appendNode;
|
| hc_nodeclonegetparentnull.java | 31 * The duplicate node returned by the "cloneNode(deep)"
36 * duplicate node returned should return null when the
65 Node employeeNode;
66 Node clonedNode;
67 Node parentNode;
|
| hc_nodeclonetruecopytext.java | 36 * duplicate node returned by the method should copy
37 * any text data contained in this node.
66 Node childNode;
67 Node clonedNode;
68 Node lastChildNode;
|
| hc_nodegetnextsiblingnull.java | 31 * If there is not a node immediately following this node the
64 Node employeeNode;
65 Node lcNode;
66 Node nsNode;
|
| hc_nodegetprevioussiblingnull.java | 31 * If there is not a node immediately preceding this node the
64 Node employeeNode;
65 Node fcNode;
66 Node psNode;
|
| hc_noderemovechild.java | 31 * The "removeChild(oldChild)" method removes the child node
37 * node returned by the "getParentNode()" method. It
68 Node childToRemove;
69 Node removedChild;
70 Node parentNode;
|
| hc_noderemovechildoldchildnonexistent.java | 33 * not a child of this node.
36 * node that is not one of its children. An attempt to
37 * remove such a node should raise the desired exception.
68 Node oldChild;
70 Node elementNode;
71 Node removedChild;
|
| nodeappendchildgetnodename.java | 31 * The "appendChild(newChild)" method returns the node
34 * Append a newly created node to the child list of the
66 Node employeeNode;
68 Node newChild;
69 Node appendNode;
|
| nodeappendchildnodeancestor.java | 32 * HIERARCHY_REQUEST_ERR DOMException if the node to
33 * append is one of this node's ancestors.
36 * an ancestor node(root node) to it.
70 Node newChild;
72 Node employeeNode;
73 Node appendedChild;
|
| nodeappendchildnomodificationallowederrEE.java | 33 * if the node is readonly.
67 Node entRef;
68 Node createdNode;
69 Node appendedNode;
|
