| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/containers/associative/ |
| tree_right_rotate.pass.cpp | 20 struct Node
22 Node* __left_;
23 Node* __right_;
24 Node* __parent_;
26 Node() : __left_(), __right_(), __parent_() {}
32 Node root;
33 Node x;
34 Node y;
57 Node root;
58 Node x
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/nodes/ |
| SequenceNode.java | 29 final private List<Node> value;
31 public SequenceNode(Tag tag, boolean resolved, List<Node> value, Mark startMark, Mark endMark,
35 throw new NullPointerException("value in a Node is required.");
41 public SequenceNode(Tag tag, List<Node> value, Boolean flowStyle) {
55 public List<Node> getValue() {
60 for (Node node : value) {
61 node.setType(listType);
|
| /external/v8/src/compiler/ |
| js-generic-lowering.h | 30 Reduction Reduce(Node* node) final;
33 #define DECLARE_LOWER(x) void Lower##x(Node* node);
39 void ReplaceWithCompareIC(Node* node, Token::Value token, Strength strength);
40 void ReplaceWithStubCall(Node* node, Callable c, CallDescriptor::Flags flags);
41 void ReplaceWithRuntimeCall(Node* node, Runtime::FunctionId f, int args = -1)
[all...] |
| node-properties.cc | 8 #include "src/compiler/node-properties.h"
18 int NodeProperties::PastValueIndex(Node* node) {
19 return FirstValueIndex(node) + node->op()->ValueInputCount();
24 int NodeProperties::PastContextIndex(Node* node) {
25 return FirstContextIndex(node) +
26 OperatorProperties::GetContextInputCount(node->op());
31 int NodeProperties::PastFrameStateIndex(Node* node)
86 Node* const node = edge.from(); local
94 Node* const node = edge.from(); local
102 Node* const node = edge.from(); local
110 Node* const node = edge.from(); local
118 Node* const node = edge.from(); local
[all...] |
| scheduler.h | 9 #include "src/compiler/node.h"
42 // Placement of a node changes during scheduling. The placement state
55 // Per-node data tracked during scheduling.
58 int unscheduled_count_; // Number of unscheduled uses of this node.
59 Placement placement_; // Whether the node is fixed, schedulable,
60 // coupled to another node, or not yet known.
69 ZoneQueue<Node*> schedule_queue_; // Worklist of schedulable nodes.
70 ZoneVector<SchedulerData> node_data_; // Per-node data for all nodes.
78 inline SchedulerData* GetData(Node* node);
[all...] |
| control-builders.h | 9 #include "src/compiler/node.h"
33 Node* the_hole() const { return builder_->jsgraph()->TheHoleConstant(); }
48 void If(Node* condition, BranchHint hint = BranchHint::kNone);
78 void BreakUnless(Node* condition);
79 void BreakWhen(Node* condition);
100 void BeginLabel(int index, Node* condition);
135 void BreakWhen(Node* condition, BranchHint = BranchHint::kNone);
136 void BreakUnless(Node* condition, BranchHint hint = BranchHint::kNone);
154 void Throw(Node* exception);
159 Node* GetExceptionNode() const { return exception_node_;
[all...] |
| /external/v8/test/unittests/compiler/ |
| graph-unittest.cc | 7 #include "src/compiler/node-properties.h"
10 #include "test/unittests/compiler/node-test-utils.h"
25 Node* GraphTest::Parameter(int32_t index) {
30 Node* GraphTest::Float32Constant(volatile float value) {
35 Node* GraphTest::Float64Constant(volatile double value) {
40 Node* GraphTest::Int32Constant(int32_t value) {
45 Node* GraphTest::Int64Constant(int64_t value) {
50 Node* GraphTest::NumberConstant(volatile double value) {
55 Node* GraphTest::HeapConstant(const Handle<HeapObject>& value) {
56 Node* node = graph()->NewNode(common()->HeapConstant(value)) local
111 Node* node = GraphTest::Parameter(index); local
[all...] |
| js-typed-lowering-unittest.cc | 11 #include "src/compiler/node-properties.h"
16 #include "test/unittests/compiler/node-test-utils.h"
82 Reduction Reduce(Node* node) {
92 return reducer.Reduce(node);
95 Node* FrameState(Handle<SharedFunctionInfo> shared, Node* outer_frame_state) {
96 Node* state_values = graph()->NewNode(common()->StateValues(0));
113 Matcher<Node*> IsIntPtrConstant(intptr_t value) {
225 Node* input = Parameter(Type::Boolean(), 0)
728 Node* node = graph()->NewNode(op, base, key, value, vector, context, local
772 Node* node = graph()->NewNode(op, base, key, value, vector, context, local
822 Node* node = graph()->NewNode(op, base, key, value, vector, context, local
[all...] |
| loop-peeling-unittest.cc | 11 #include "src/compiler/node.h"
12 #include "src/compiler/node-properties.h"
15 #include "test/unittests/compiler/node-test-utils.h"
28 Node* loop;
29 Node* branch;
30 Node* if_true;
31 Node* exit;
37 Node* branch;
38 Node* if_true;
39 Node* if_false
[all...] |
| /external/valgrind/memcheck/tests/ |
| leak-tree.c | 24 } Node;
26 Node* mk(void)
28 Node *x = malloc(sizeof(Node));
35 Node* t;
|
| /external/v8/test/cctest/compiler/ |
| test-osr.cc | 22 static int CheckInputs(Node* node, Node* i0 = NULL, Node* i1 = NULL,
23 Node* i2 = NULL, Node* i3 = NULL) {
29 CHECK_EQ(count, node->InputCount());
30 if (i0 != NULL) CHECK_EQ(i0, node->InputAt(0));
31 if (i1 != NULL) CHECK_EQ(i1, node->InputAt(1));
32 if (i2 != NULL) CHECK_EQ(i2, node->InputAt(2))
[all...] |
| test-node.cc | 8 #include "src/compiler/node.h"
16 #define NONE reinterpret_cast<Node*>(1)
27 #define CHECK_USES(node, ...) \
29 Node* __array[] = {__VA_ARGS__}; \
32 CheckUseChain(node, __array, __size); \
38 typedef std::multiset<Node*, std::less<Node*>> NodeMSet;
41 void CheckUseChain(Node* node, Node** uses, int use_count)
[all...] |
| /packages/apps/UnifiedEmail/src/org/apache/james/mime4j/field/address/parser/ |
| SimpleNode.java | 5 public class SimpleNode extends org.apache.james.mime4j.field.address.parser.BaseNode implements Node {
6 protected Node parent;
7 protected Node[] children;
26 public void jjtSetParent(Node n) { parent = n; }
27 public Node jjtGetParent() { return parent; }
29 public void jjtAddChild(Node n, int i) {
31 children = new Node[i + 1];
33 Node c[] = new Node[i + 1];
40 public Node jjtGetChild(int i)
[all...] |
| /packages/services/Telephony/src/org/apache/james/mime4j/field/address/parser/ |
| SimpleNode.java | 5 public class SimpleNode extends org.apache.james.mime4j.field.address.parser.BaseNode implements Node {
6 protected Node parent;
7 protected Node[] children;
26 public void jjtSetParent(Node n) { parent = n; }
27 public Node jjtGetParent() { return parent; }
29 public void jjtAddChild(Node n, int i) {
31 children = new Node[i + 1];
33 Node c[] = new Node[i + 1];
40 public Node jjtGetChild(int i)
[all...] |
| /external/zopfli/src/zopfli/ |
| katajainen.c | 30 typedef struct Node Node;
35 struct Node {
37 Node* tail; /* Previous node(s) of this chain, or 0 if none. */
46 Node* nodes; /* The pool. */
47 Node* next; /* Pointer to a possibly free node in the pool. */
52 Initializes a chain node with the given values and marks it as in use.
54 static void InitNode(size_t weight, int count, Node* tail, Node* node)
77 Node* node; local
164 Node* node; local
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.h | 39 /// EmitCopyFromReg - Generate machine code for an CopyFromReg node or an
41 void EmitCopyFromReg(SDNode *Node, unsigned ResNo,
47 /// node is a CopyToReg, return its destination register. Return 0 otherwise.
48 unsigned getDstOfOnlyCopyToRegUse(SDNode *Node,
51 void CreateVirtualRegisters(SDNode *Node,
58 /// of the specified node.
73 /// specifies the instruction information for the node, and IIOpNum is the
91 void EmitSubregNode(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap,
98 void EmitCopyToRegClassNode(SDNode *Node,
103 void EmitRegSequence(SDNode *Node, DenseMap<SDValue, unsigned> &VRBaseMap
[all...] |
| /libcore/luni/src/main/java/org/apache/harmony/xml/dom/ |
| TextImpl.java | 20 import org.w3c.dom.Node;
46 return Node.TEXT_NODE;
54 Node refNode = getNextSibling();
89 Node parent = getParentNode();
95 // ...except the current node if we have content for it
102 Node toRemove = n; // because removeChild() detaches siblings
112 * Returns the first text or CDATA node in the current sequence of text and
117 for (Node p = getPreviousSibling(); p != null; p = p.getPreviousSibling()) {
119 if (nodeType == Node.TEXT_NODE || nodeType == Node.CDATA_SECTION_NODE)
[all...] |
| 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...] |
| /external/apache-xml/src/main/java/org/apache/xpath/jaxp/ |
| JAXPPrefixResolver.java | 22 import org.w3c.dom.Node;
77 * Given a prefix and a Context Node, get the corresponding namespace.
79 * is an attribute node.
81 * @param namespaceContext Node from which to start searching for a
87 org.w3c.dom.Node namespaceContext) {
88 Node parent = namespaceContext;
97 && (((type = parent.getNodeType()) == Node.ELEMENT_NODE)
98 || (type == Node.ENTITY_REFERENCE_NODE))) {
100 if (type == Node.ELEMENT_NODE) {
104 Node attr = nnm.item(i)
[all...] |
| /external/llvm/lib/CodeGen/ |
| ScheduleDAGPrinter.cpp | 42 static bool isNodeHidden(const SUnit *Node) {
43 return (Node->NumPreds > 10 || Node->NumSuccs > 10);
46 static std::string getNodeIdentifierLabel(const SUnit *Node,
50 OS << static_cast<const void *>(Node);
56 static std::string getEdgeAttributes(const SUnit *Node,
67 std::string getNodeLabel(const SUnit *Node, const ScheduleDAG *Graph);
|
| /external/snakeyaml/src/test/java/org/yaml/snakeyaml/constructor/ |
| AbstractConstructTest.java | 20 import org.yaml.snakeyaml.nodes.Node;
30 public Object construct(Node node) {
34 Node node = new SequenceNode(Tag.SEQ, true, new ArrayList<Node>(), null, null, false); local
36 abstractConstruct.construct2ndStep(node, "");
39 assertEquals("Unexpected recursive structure for Node: <org.yaml.snakeyaml.nodes.SequenceNode (tag=tag:yaml.org,2002:seq, value=[])>", e.getMessage());
46 public Object construct(Node node) {
50 Node node = new SequenceNode(Tag.SEQ, true, new ArrayList<Node>(), null, null, false); local
[all...] |
| /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/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/luni/src/main/java/java/util/concurrent/ |
| ConcurrentLinkedDeque.java | 84 * A node contains the expected E ("item") and links to predecessor
87 * class Node<E> { volatile Node<E> prev, next; volatile E item; }
89 * A node p is considered "live" if it contains a non-null item
93 * At any time, there is precisely one "first" node with a null
95 * starting at a live node. Similarly there is precisely one
96 * "last" node terminating any chain of next references starting at
97 * a live node. The "first" and "last" nodes may or may not be live.
101 * next reference in the first or last node to a fresh node
[all...] |
