| /external/pdfium/core/fxcrt/xml/ |
| D | cfx_xmlnode_unittest.cpp | 33 CFX_XMLElement node2(L"node2"); in TEST() local
36 node1.AppendLastChild(&node2); in TEST()
37 node2.AppendLastChild(&node3); in TEST()
40 EXPECT_EQ(&node1, node2.GetParent()); in TEST()
41 EXPECT_EQ(&node2, node3.GetParent()); in TEST()
46 CFX_XMLElement node2(L"node2"); in TEST() local
49 node1.AppendLastChild(&node2); in TEST()
50 node2.AppendLastChild(&node3); in TEST()
53 EXPECT_EQ(&node1, node2.GetRoot()); in TEST()
59 CFX_XMLElement node2(L"node2"); in TEST() local
[all …]
|
| D | cfx_xmlelement_unittest.cpp | 26 CFX_XMLElement node2(L"test:node2"); in TEST() local
27 EXPECT_EQ(L"node2", node2.GetLocalTagName()); in TEST()
34 CFX_XMLElement node2(L"test:node2"); in TEST() local
35 EXPECT_EQ(L"test", node2.GetNamespacePrefix()); in TEST()
45 CFX_XMLElement node2(L"test:node2"); in TEST() local
46 EXPECT_EQ(L"", node2.GetNamespaceURI()); in TEST()
48 node2.SetAttribute(L"xmlns", L"https://example.org/ns2"); in TEST()
49 EXPECT_EQ(L"", node2.GetNamespaceURI()); in TEST()
51 node2.SetAttribute(L"xmlns:test", L"https://example.org/ns2"); in TEST()
52 EXPECT_EQ(L"https://example.org/ns2", node2.GetNamespaceURI()); in TEST()
|
| /external/libchrome/mojo/public/tools/bindings/pylib/mojom_tests/parse/ |
| D | ast_unittest.py | 51 node2 = ast.NodeBase()
52 self.assertEquals(node1, node2)
53 self.assertEquals(node2, node1)
56 self.assertFalse(node1 != node2)
57 self.assertFalse(node2 != node1)
63 self.assertIsNone(node2.filename)
64 self.assertIsNone(node2.lineno)
84 node2 = _TestNode(2, filename="foo.mojom", lineno=2)
99 nodelist3 = _TestNodeList([node2]) # Contains: 2.
100 self.assertEquals(nodelist3.items, [node2])
[all …]
|
| /external/libxml2/include/libxml/ |
| D | debugXML.h | 137 xmlNodePtr node2);
148 xmlNodePtr node2);
153 xmlNodePtr node2);
158 xmlNodePtr node2);
163 xmlNodePtr node2);
171 xmlNodePtr node2);
176 xmlNodePtr node2);
181 xmlNodePtr node2);
188 xmlNodePtr node2);
194 xmlNodePtr node2);
[all …]
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/gl/compiler/ |
| D | fuse_inline.cc | 39 Node* node2 = sequence.back(); in ApplyToNodesSequence() local
43 absl::any_cast<CompiledNodeAttributes&>(node2->operation.attributes); in ApplyToNodesSequence()
46 graph->FindInputs(node2->id).size() != 1 || in ApplyToNodesSequence()
47 graph->FindOutputs(node2->id).size() != 1 || in ApplyToNodesSequence()
53 graph->FindInputs(node2->id).size()) { in ApplyToNodesSequence()
67 node1->operation.type += "+" + node2->operation.type; in ApplyToNodesSequence()
69 if (!RemoveFollowingNode(graph, node2, node1).ok()) { in ApplyToNodesSequence()
71 "Unable to remove node " + std::to_string(node2->id)}; in ApplyToNodesSequence()
|
| D | fuse_inplace.cc | 100 Node* node2 = sequence.back(); in ApplyToNodesSequence() local
104 absl::any_cast<CompiledNodeAttributes&>(node2->operation.attributes); in ApplyToNodesSequence()
106 if (graph->FindInputs(node2->id).size() != 1 || in ApplyToNodesSequence()
107 graph->FindOutputs(node2->id).size() != 1 || in ApplyToNodesSequence()
140 node1->operation.type += "+" + node2->operation.type; in ApplyToNodesSequence()
142 if (!RemoveFollowingNode(graph, node2, node1).ok()) { in ApplyToNodesSequence()
144 "Unable to remove node " + std::to_string(node2->id)}; in ApplyToNodesSequence()
|
| /external/tensorflow/tensorflow/lite/delegates/gpu/common/ |
| D | model_test.cc | 355 Node* node2 = graph.NewNode(); in TEST() local
360 ASSERT_TRUE(graph.AddConsumer(node2->id, graph_input->id).ok()); in TEST()
365 ASSERT_TRUE(graph.SetProducer(node2->id, graph_output->id).ok()); in TEST()
367 EXPECT_THAT(graph.nodes(), ElementsAre(node1, node2)); in TEST()
369 EXPECT_THAT(graph.FindInputs(node2->id), UnorderedElementsAre(graph_input)); in TEST()
371 EXPECT_THAT(graph.FindOutputs(node2->id), UnorderedElementsAre(graph_output)); in TEST()
373 UnorderedElementsAre(node1, node2)); in TEST()
374 EXPECT_THAT(graph.FindProducer(graph_output->id), ::testing::Eq(node2)); in TEST()
382 Node* node2 = graph.NewNode(); in TEST() local
388 ASSERT_TRUE(graph.AddConsumer(node2->id, value->id).ok()); in TEST()
[all …]
|
| /external/oss-fuzz/projects/libyaml/ |
| D | libyaml_dumper_fuzzer.c | 41 yaml_node_t *node2 = yaml_document_get_node(document2, index2); in nodes_equal() local
43 if (!node2) in nodes_equal()
46 if (node1->type != node2->type) in nodes_equal()
49 if (strcmp((char *)node1->tag, (char *)node2->tag) != 0) in nodes_equal()
54 if (node1->data.scalar.length != node2->data.scalar.length) in nodes_equal()
57 (char *)node2->data.scalar.value, in nodes_equal()
63 (node2->data.sequence.items.top - node2->data.sequence.items.start)) in nodes_equal()
69 document2, node2->data.sequence.items.start[k], level)) in nodes_equal()
75 (node2->data.mapping.pairs.top - node2->data.mapping.pairs.start)) in nodes_equal()
81 document2, node2->data.mapping.pairs.start[k].key, in nodes_equal()
[all …]
|
| /external/antlr/runtime/CSharp2/Sources/Antlr3.Runtime/Antlr.Runtime.Tree/ |
| D | TreePatternParser.cs | 145 object node2; in ParseNode()
146 node2 = adaptor.Create(treeNodeType, text); in ParseNode()
147 if (label != null && node2.GetType() == typeof(TreeWizard.TreePattern)) { in ParseNode()
148 ((TreeWizard.TreePattern)node2).label = label; in ParseNode()
150 if (arg != null && node2.GetType() == typeof(TreeWizard.TreePattern)) { in ParseNode()
151 ((TreeWizard.TreePattern)node2).hasTextArg = true; in ParseNode()
153 return node2; in ParseNode()
|
| /external/antlr/runtime/CSharp3/Sources/Antlr3.Runtime/Tree/ |
| D | TreePatternParser.cs | 170 object node2; in ParseNode()
171 node2 = adaptor.Create( treeNodeType, text ); in ParseNode()
172 if ( label != null && node2.GetType() == typeof( TreeWizard.TreePattern ) ) in ParseNode()
174 ( (TreeWizard.TreePattern)node2 ).label = label; in ParseNode()
176 if ( arg != null && node2.GetType() == typeof( TreeWizard.TreePattern ) ) in ParseNode()
178 ( (TreeWizard.TreePattern)node2 ).hasTextArg = true; in ParseNode()
180 return node2; in ParseNode()
|
| /external/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_test/ |
| D | cpuset_memory_testset.sh | 315 read node2
326 if [ "$node2" != "1" ]; then
327 tst_resm TFAIL "allocate memory on the Node#$node2(Expect: Node#1) after changing group."
360 read node2
371 if [ "$node2" != "1" ]; then
372 tst_resm TFAIL "allocate memory on the Node#$node2(Expect: Node#1) after changing group."
449 read node2
460 if [ "$node2" != "0" ]; then
461 tst_resm TFAIL "allocate memory on the Node#$node2(Expect: Node#0) after changing mems."
636 read node2
[all …]
|
| /external/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages02.c | 141 static void test_migrate_current_process(int node1, int node2, int cap_sys_nice) in test_migrate_current_process() argument
154 migrate_to_node(0, node2); in test_migrate_current_process()
155 check_addr_on_node(private, node2); in test_migrate_current_process()
165 migrate_to_node(0, node2); in test_migrate_current_process()
166 check_addr_on_node(shared, node2); in test_migrate_current_process()
195 check_addr_on_node(shared, node2); in test_migrate_current_process()
199 static void test_migrate_other_process(int node1, int node2, int cap_sys_nice) in test_migrate_other_process() argument
231 ret = check_addr_on_node(private, node2); in test_migrate_other_process()
245 migrate_to_node(child1, node2); in test_migrate_other_process()
|
| /external/tensorflow/tensorflow/core/grappler/graph_analyzer/ |
| D | gen_node_test.cc | 93 NodeDef node2 = MakeNodeConst("node2"); in TEST() local
94 map["node2"] = absl::make_unique<GenNode>(&node2); in TEST()
139 NodeDef node2 = MakeNodeConst("node2"); in TEST() local
140 map["node2"] = absl::make_unique<GenNode>(&node2); in TEST()
174 NodeDef node2 = MakeNodeConst("node2"); in TEST() local
175 map["node2"] = absl::make_unique<GenNode>(&node2); in TEST()
210 NodeDef node2 = MakeNodeConst("node2"); in TEST() local
211 map["node2"] = absl::make_unique<GenNode>(&node2); in TEST()
244 NodeDef node2 = MakeNodeConst("node2"); in TEST() local
245 map["node2"] = absl::make_unique<GenNode>(&node2); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/data/ |
| D | graph_utils_test.cc | 259 NodeDef* node2 = AddNode("", "A", {}, {}, &graph); in TEST() local
260 EXPECT_NE(node1->name(), node2->name()); in TEST()
264 EXPECT_NE(node2->name(), node3->name()); in TEST()
283 NodeDef* node2 = AddNode("", "A", {node1->name()}, {}, &graph); in TEST() local
285 EXPECT_EQ(GetInputNode(*node2, graph), node1); in TEST()
294 NodeDef* node2 = AddNode("", "A", {}, {}, &graph); in TEST() local
295 NodeDef* node3 = AddNode("", "A", {node1->name(), node2->name()}, {}, &graph); in TEST()
298 EXPECT_EQ(GetInputNode(*node3, graph, 1), node2); in TEST()
336 NodeDef* node2 = AddNode("node2", "Identity", {node1->name()}, {}, &graph); in TEST() local
337 NodeDef* node3 = AddNode("node3", "Identity", {node2->name()}, {}, &graph); in TEST()
[all …]
|
| /external/tensorflow/tensorflow/core/grappler/optimizers/ |
| D | common_subgraph_elimination.cc | 88 bool SameNode(const NodeDef& node1, const NodeDef& node2) const;
120 bool UniqueNodes::SameNode(const NodeDef& node1, const NodeDef& node2) const { in SameNode()
121 if (node1.op() != node2.op()) { in SameNode()
124 if (node1.device() != node2.device()) { in SameNode()
127 if (node1.input_size() != node2.input_size()) { in SameNode()
130 if (node1.attr_size() != node2.attr_size()) { in SameNode()
136 auto it2 = node2.input().begin(); in SameNode()
143 auto it = node2.attr().find(attr1.first); in SameNode()
144 if (it == node2.attr().end()) return false; in SameNode()
|
| /external/swiftshader/third_party/llvm-10.0/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint() local
179 &G.getNodeMetadata(node2).getAllowedRegs(); in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
206 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
207 std::swap(node1, node2); in addIntraChainConstraint()
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint() local
275 &G.getNodeMetadata(node2).getAllowedRegs(); in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
283 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
[all …]
|
| /external/llvm-project/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 174 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint() local
179 &G.getNodeMetadata(node2).getAllowedRegs(); in addIntraChainConstraint()
181 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
202 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
206 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
207 std::swap(node1, node2); in addIntraChainConstraint()
273 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint() local
275 &G.getNodeMetadata(node2).getAllowedRegs(); in addInterChainConstraint()
277 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
283 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
[all …]
|
| /external/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 175 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); in addIntraChainConstraint() local
180 &G.getNodeMetadata(node2).getAllowedRegs(); in addIntraChainConstraint()
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
207 if (G.getEdgeNode1Id(edge) == node2) { in addIntraChainConstraint()
208 std::swap(node1, node2); in addIntraChainConstraint()
274 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); in addInterChainConstraint() local
276 &G.getNodeMetadata(node2).getAllowedRegs(); in addInterChainConstraint()
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
284 if (G.getEdgeNode1Id(edge) == node2) { in addInterChainConstraint()
[all …]
|
| /external/rust/cxx/tests/ui/ |
| D | struct_cycle.rs | 8 node2: Node2, field
26 node2: Node2, field
30 node2: Node2, field
|
| /external/dtc/tests/ |
| D | omit-no-ref.dts | 11 node2: node2 { label
24 /omit-if-no-ref/ &node2;
|
| /external/libxml2/os400/libxmlrpg/ |
| D | debugXML.rpgle | 147 * @node2: a second node
170 d node2 value like(xmlNodePtr)
177 d node2 value like(xmlNodePtr)
184 d node2 value like(xmlNodePtr)
191 d node2 value like(xmlNodePtr)
203 d node2 value like(xmlNodePtr)
210 d node2 value like(xmlNodePtr)
217 d node2 value like(xmlNodePtr)
227 d node2 value like(xmlNodePtr)
235 d node2 value like(xmlNodePtr)
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| D | DOM2Helper.java | 229 public static boolean isNodeAfter(Node node1, Node node2) in isNodeAfter() argument
234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder) in isNodeAfter()
237 int index2 = ((DOMOrder) node2).getUid(); in isNodeAfter()
246 return DOMHelper.isNodeAfter(node1, node2); in isNodeAfter()
|
| /external/tensorflow/tensorflow/core/kernels/ |
| D | immutable_constant_op_test.cc | 100 auto node2 = in TEST() local
102 auto result = ops::MatMul(root, node1, node2); in TEST()
132 auto node2 = in TEST() local
134 auto result = ops::MatMul(root, node1, node2); in TEST()
172 auto node2 = in TEST() local
174 auto result = ops::MatMul(root, node1, node2, ops::MatMul::TransposeB(true)); in TEST()
|
| /external/ltp/testcases/kernel/syscalls/move_pages/ |
| D | move_pages12.c | 88 static unsigned int node1, node2; variable
121 nodes[j] = node2; in do_child()
255 ret = get_allowed_nodes(NH_MEMS, TEST_NODES, &node1, &node2); in setup()
274 node2, hpsz); in setup()
291 hpsz, node2, orig_hugepages_node2 + 4); in setup()
306 alloc_free_huge_on_node(node2, 4L * hpsz); in setup()
|
| /external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/internal/ |
| D | LockFreeLinkedListAtomicLFStressTest.kt | 73 val node2 = Node(index.incrementAndGet()) in <lambda>() constant
74 addTwoOp(list1, node1, list2, node2) in <lambda>()
78 tryRemoveOp(node2) in <lambda>()
122 … addTwoOp(list1: LockFreeLinkedListHead, node1: Node, list2: LockFreeLinkedListHead, node2: Node) { in <lambda>()
124 val add2 = list2.describeAddLast(node2) in <lambda>()
|