| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/ext/pb_ds/detail/bin_search_tree_/ |
| node_iterators.hpp | 51 bin_search_tree_const_node_it_<Node, Const_Iterator, Iterator, _Alloc>
53 /// Const node iterator.
54 template<typename Node,
63 Node>::other::pointer
83 typedef typename Node::metadata_type metadata_type;
105 /// Returns the __const node iterator associated with the left node.
110 /// Returns the __const node iterator associated with the right node.
129 bin_search_tree_node_it_<Node, Const_Iterator, Iterator, _Alloc
[all...] |
| /prebuilts/ndk/current/sources/cxx-stl/gnu-libstdc++/4.9/include/ext/pb_ds/detail/bin_search_tree_/ |
| node_iterators.hpp | 51 bin_search_tree_const_node_it_<Node, Const_Iterator, Iterator, _Alloc>
53 /// Const node iterator.
54 template<typename Node,
63 Node>::other::pointer
83 typedef typename Node::metadata_type metadata_type;
105 /// Returns the __const node iterator associated with the left node.
110 /// Returns the __const node iterator associated with the right node.
129 bin_search_tree_node_it_<Node, Const_Iterator, Iterator, _Alloc
[all...] |
| /external/snakeyaml/src/main/java/org/yaml/snakeyaml/representer/ |
| BaseRepresenter.java | 30 import org.yaml.snakeyaml.nodes.Node;
51 protected final Map<Object, Node> representedObjects = new IdentityHashMap<Object, Node>() {
54 public Node put(Object key, Node value) {
63 public Node represent(Object data) {
64 Node node = representData(data); local
67 return node;
70 protected final Node representData(Object data)
74 Node node = representedObjects.get(objectToRepresent); local
80 Node node = nullRepresenter.representData(null); local
84 Node node; local
115 Node node = new ScalarNode(tag, value, null, null, style); local
129 SequenceNode node = new SequenceNode(tag, value, flowStyle); local
151 MappingNode node = new MappingNode(tag, value, flowStyle); local
[all...] |
| /external/v8/test/unittests/compiler/ |
| change-lowering-unittest.cc | 9 #include "src/compiler/node-properties.h"
13 #include "test/unittests/compiler/node-test-utils.h"
40 Reduction Reduce(Node* node) {
46 return reducer.Reduce(node);
51 Matcher<Node*> IsAllocateHeapNumber(const Matcher<Node*>& effect_matcher,
52 const Matcher<Node*>& control_matcher) {
57 Matcher<Node*> IsChangeInt32ToSmi(const Matcher<Node*>& value_matcher)
368 Node* node = graph()->NewNode(simplified()->ChangeInt32ToTagged(), value); local
399 Node* node = graph()->NewNode(simplified()->ChangeTaggedToFloat64(), value); local
424 Node* node = graph()->NewNode(simplified()->ChangeTaggedToInt32(), value); local
447 Node* node = graph()->NewNode(simplified()->ChangeTaggedToUint32(), value); local
470 Node* node = graph()->NewNode(simplified()->ChangeUint32ToTagged(), value); local
513 Node* node = graph()->NewNode(simplified()->ChangeInt32ToTagged(), value); local
525 Node* node = graph()->NewNode(simplified()->ChangeTaggedToFloat64(), value); local
550 Node* node = graph()->NewNode(simplified()->ChangeTaggedToInt32(), value); local
574 Node* node = graph()->NewNode(simplified()->ChangeTaggedToUint32(), value); local
598 Node* node = graph()->NewNode(simplified()->ChangeUint32ToTagged(), value); local
[all...] |
| graph-reducer-unittest.cc | 7 #include "src/compiler/node.h"
8 #include "src/compiler/node-properties.h"
56 MOCK_METHOD1(Reduce, Reduction(Node*));
63 Reduction Reduce(Node* node) final {
64 switch (node->op()->opcode()) {
66 EXPECT_EQ(0, node->InputCount());
67 NodeProperties::ChangeOp(node, &kOpB0);
68 return Replace(node);
70 EXPECT_EQ(1, node->InputCount())
293 Node* node = graph()->NewNode(&kMockOperator); local
310 Node* node = graph()->NewNode(&kMockOpEffect, start); local
329 Node* node = graph()->NewNode(&kMockOpControl, start); local
349 Node* node = graph()->NewNode(&kMockOpControl, start); local
373 Node* node = graph()->NewNode(&kMockOpControl, start); local
[all...] |
| graph-trimmer-unittest.cc | 21 void TrimGraph(Node* root) {
22 Node* const roots[1] = {root};
44 Node* const start = graph()->NewNode(common()->Start(0));
45 Node* const end = graph()->NewNode(common()->End(1), start);
56 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start());
65 Node* const dead0 = graph()->NewNode(&kDead0, graph()->start());
66 Node* const live0 = graph()->NewNode(&kLive0, graph()->start());
76 Node* const live0 = graph()->NewNode(&kLive0, graph()->start());
77 Node* const live1 = graph()->NewNode(&kLive0, graph()->start());
|
| node-cache-unittest.cc | 5 #include "src/compiler/node-cache.h"
22 Node** pos = cache.Find(zone(), i);
25 Node** npos = cache.Find(zone(), i);
35 Node* nodes[arraysize(constants)];
39 Node* node = graph()->NewNode(common()->Int32Constant(k)); local
40 *cache.Find(zone(), k) = nodes[i] = node;
53 Node** nodes = zone()->NewArray<Node*>(kSize);
64 Node** pos = cache.Find(zone(), v)
[all...] |
| /external/llvm/lib/CodeGen/SelectionDAG/ |
| InstrEmitter.cpp | 44 unsigned InstrEmitter::CountResults(SDNode *Node) {
45 unsigned N = Node->getNumValues();
46 while (N && Node->getValueType(N - 1) == MVT::Glue)
48 if (N && Node->getValueType(N - 1) == MVT::Other)
60 static unsigned countOperands(SDNode *Node, unsigned NumExpUses,
62 unsigned N = Node->getNumOperands();
63 while (N && Node->getOperand(N - 1).getValueType() == MVT::Glue)
65 if (N && Node->getOperand(N - 1).getValueType() == MVT::Other)
71 if (isa<RegisterMaskSDNode>(Node->getOperand(I - 1)))
73 if (RegisterSDNode *RN = dyn_cast<RegisterSDNode>(Node->getOperand(I - 1))
[all...] |
| /external/v8/src/compiler/ |
| js-builtin-reducer.cc | 7 #include "src/compiler/node-matchers.h"
8 #include "src/compiler/node-properties.h"
22 explicit JSCallReduction(Node* node) : node_(node) {}
24 // Determines whether the node is a JSCallFunction operation that targets a
68 Node* left() { return GetJSCallInput(0); }
69 Node* right() { return GetJSCallInput(1); }
77 Node* GetJSCallInput(int index) {
85 Node* node_
[all...] |
| js-context-relaxation.cc | 8 #include "src/compiler/node.h"
9 #include "src/compiler/node-properties.h"
15 Reduction JSContextRelaxation::Reduce(Node* node) {
16 switch (node->opcode()) {
19 Node* frame_state = NodeProperties::GetFrameStateInput(node, 0);
20 Node* outer_frame = frame_state;
21 Node* original_context = NodeProperties::GetContextInput(node);
[all...] |
| /external/v8/src/ |
| splay-tree.h | 60 // true if a node was inserted, otherwise false. If found the locator
65 // otherwise false. If the node is found the locator is enabled and
83 // Move the node from one key to another.
86 // Remove the node with the given key from the tree.
94 // Perform the splay operation for the given key. Moves the node with
95 // the given key to the top of the tree. If no node has the given
96 // key, the last node on the search path is moved to the top of the
100 class Node {
102 Node(const Key& key, const Value& value)
122 Node* left() { return left_;
[all...] |
| /external/v8/src/compiler/ia32/ |
| instruction-selector-ia32.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);
30 bool CanBeImmediate(Node* node) {
1111 Node* const node = value->InputAt(0); local
[all...] |
| /external/apache-xml/src/main/java/org/apache/xml/serializer/dom3/ |
| DOMLocatorImpl.java | 25 import org.w3c.dom.Node;
57 /** related data node*/
58 private final Node fRelatedNode;
113 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri ){
121 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
123 DOMLocatorImpl (int lineNumber, int columnNumber, int byteoffset, Node relatedData, String uri, int utf16Offset ){
130 } // DOMLocatorImpl (int lineNumber, int columnNumber, int offset, Node errorNode, String uri )
158 public Node getRelatedNode(){
|
| /libcore/dom/src/test/java/org/w3c/domts/level1/core/ |
| hc_attrinsertbefore1.java | 31 * Appends a text node to an attribute and checks if the value of
61 Node testNode;
66 Node retval;
67 Node firstChild;
68 Node lastChild;
69 Node refChild = null;
|
| hc_attrinsertbefore2.java | 31 * Prepends a text node to an attribute and checks if the value of
61 Node testNode;
66 Node retval;
67 Node lastChild;
68 Node firstChild;
69 Node refChild;
|
| hc_nodeinsertbeforerefchildnull.java | 33 * node "newChild" at the end of the list of children.
40 * node of the list should be "newChild".
69 Node employeeNode;
71 Node refChild = null;
73 Node newChild;
74 Node child;
76 Node insertedNode;
|
| hc_nodereplacechild.java | 32 * the node "oldChild" with the node "newChild".
35 * a newly created Element node. Check the first position
66 Node employeeNode;
68 Node oldChild;
69 Node newChild;
70 Node child;
72 Node replacedNode;
|
| nodeappendchildchildexists.java | 67 Node childNode;
68 Node newChild;
69 Node lchild;
70 Node fchild;
73 Node appendedChild;
|
| nodeappendchildnomodificationallowederr.java | 33 * if the node is readonly.
70 Node genderNode;
71 Node entRef;
72 Node entElement;
73 Node createdNode;
74 Node appendedNode;
|
| nodeinsertbeforerefchildnull.java | 33 * node "newChild" at the end of the list of children.
40 * node of the list should be "newChild".
69 Node employeeNode;
71 Node refChild = null;
73 Node newChild;
74 Node child;
76 Node insertedNode;
|
| nodereplacechild.java | 32 * the node "oldChild" with the node "newChild".
35 * a newly created Element node. Check the first position
66 Node employeeNode;
68 Node oldChild;
69 Node newChild;
70 Node child;
72 Node replacedNode;
|
| nodereplacechildnomodificationallowederr.java | 33 * if the node is readonly.
71 Node genderNode;
72 Node entRef;
73 Node entElement;
74 Node createdNode;
75 Node replacedChild;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.11-4.8/x86_64-linux/include/c++/4.8/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;
|
| /prebuilts/gcc/linux-x86/host/x86_64-linux-glibc2.15-4.8/x86_64-linux/include/c++/4.8/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;
|
| /prebuilts/gcc/linux-x86/host/x86_64-w64-mingw32-4.8/x86_64-w64-mingw32/include/c++/4.8.3/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;
|
