Home
last modified time | relevance | path

Searched refs:node1 (Results 1 – 25 of 100) sorted by relevance

1234

/external/pdfium/core/fxcrt/xml/
Dcfx_xmlnode_unittest.cpp32 CFX_XMLElement node1(L"node"); in TEST() local
36 node1.AppendLastChild(&node2); in TEST()
39 EXPECT_EQ(nullptr, node1.GetParent()); in TEST()
40 EXPECT_EQ(&node1, node2.GetParent()); in TEST()
45 CFX_XMLElement node1(L"node"); in TEST() local
49 node1.AppendLastChild(&node2); in TEST()
52 EXPECT_EQ(&node1, node1.GetRoot()); in TEST()
53 EXPECT_EQ(&node1, node2.GetRoot()); in TEST()
54 EXPECT_EQ(&node1, node3.GetRoot()); in TEST()
58 CFX_XMLElement node1(L"node"); in TEST() local
[all …]
Dcfx_xmlelement_unittest.cpp23 CFX_XMLElement node1(L"node1"); in TEST() local
24 EXPECT_EQ(L"node1", node1.GetLocalTagName()); in TEST()
31 CFX_XMLElement node1(L"node1"); in TEST() local
32 EXPECT_EQ(L"", node1.GetNamespacePrefix()); in TEST()
39 CFX_XMLElement node1(L"node1"); in TEST() local
40 EXPECT_EQ(L"", node1.GetNamespaceURI()); in TEST()
42 node1.SetAttribute(L"xmlns", L"https://example.org/ns1"); in TEST()
43 EXPECT_EQ(L"https://example.org/ns1", node1.GetNamespaceURI()); in TEST()
/external/libchrome/mojo/core/ports/
Dports_unittest.cc347 TestNode* node1, in CreatePortPair() argument
349 if (node0 == node1) { in CreatePortPair()
353 EXPECT_EQ(OK, node1->node().CreateUninitializedPort(port1)); in CreatePortPair()
354 EXPECT_EQ(OK, node0->node().InitializePort(*port0, node1->name(), in CreatePortPair()
356 EXPECT_EQ(OK, node1->node().InitializePort(*port1, node0->name(), in CreatePortPair()
416 TestNode node1(1); in TEST_F() local
417 AddNode(&node1); in TEST_F()
420 CreatePortPair(&node0, &x0, &node1, &x1); in TEST_F()
428 EXPECT_EQ(OK, node1.node().ClosePort(x1)); in TEST_F()
433 EXPECT_TRUE(node1.node().CanShutdownCleanly()); in TEST_F()
[all …]
/external/libchrome/mojo/public/tools/bindings/pylib/mojom_tests/parse/
Dast_unittest.py50 node1 = ast.NodeBase(filename="hello.mojom", lineno=123)
52 self.assertEquals(node1, node2)
53 self.assertEquals(node2, node1)
56 self.assertFalse(node1 != node2)
57 self.assertFalse(node2 != node1)
61 self.assertEquals(node1.filename, "hello.mojom")
62 self.assertEquals(node1.lineno, 123)
69 self.assertNotEqual(node1, node3)
70 self.assertNotEqual(node3, node1)
72 self.assertFalse(node1 == node3)
[all …]
/external/tensorflow/tensorflow/core/grappler/graph_analyzer/
Dgen_node_test.cc78 NodeDef node1 = MakeNodeConst("node1"); in TEST() local
79 map["node1"] = absl::make_unique<GenNode>(&node1); in TEST()
90 NodeDef node1 = MakeNodeConst("node1"); in TEST() local
91 map["node1"] = absl::make_unique<GenNode>(&node1); in TEST()
136 NodeDef node1 = MakeNodeConst("node1"); in TEST() local
137 map["node1"] = absl::make_unique<GenNode>(&node1); in TEST()
171 NodeDef node1 = MakeNodeConst("node1"); in TEST() local
172 map["node1"] = absl::make_unique<GenNode>(&node1); in TEST()
207 NodeDef node1 = MakeNodeConst("node1"); in TEST() local
208 map["node1"] = absl::make_unique<GenNode>(&node1); in TEST()
[all …]
Dsig_node_test.cc136 NodeDef node1 = MakeNodeConst("node1"); in TEST_F() local
140 SigNode sn1(&node1); in TEST_F()
234 NodeDef node1 = MakeNodeConst("node1"); in TEST_F() local
235 SigNode sn1(&node1); in TEST_F()
254 NodeDef node1 = MakeNodeConst("node1"); in TEST_F() local
255 SigNode sn1(&node1); in TEST_F()
274 NodeDef node1 = MakeNodeConst("node1"); in TEST_F() local
275 SigNode sn1(&node1); in TEST_F()
312 NodeDef node1 = MakeNodeConst("node1"); in TEST_F() local
313 SigNode sn1(&node1); in TEST_F()
[all …]
/external/ltp/testcases/kernel/controllers/cpuset/cpuset_memory_test/
Dcpuset_memory_testset.sh314 read node1
322 if [ "$node1" != "0" ]; then
323 tst_resm TFAIL "Allocated memory was moved to the Node#$node1(Expect: Node#0)."
359 read node1
367 if [ "$node1" != "1" ]; then
368 tst_resm TFAIL "Allocated memory was not moved to the Node#1(Result: Node#$node1)."
412 read node1
419 if [ "$node1" != "0" ]; then
420 tst_resm TFAIL "allocate memory on the Node#$node1(Expect: Node#0) after changing mems."
448 read node1
[all …]
/external/tensorflow/tensorflow/core/grappler/optimizers/data/
Dgraph_utils_test.cc258 NodeDef* node1 = AddNode("", "A", {}, {}, &graph); in TEST() local
260 EXPECT_NE(node1->name(), node2->name()); in TEST()
262 EXPECT_TRUE(graph.DeleteNodes({node1->name()}).ok()); in TEST()
282 NodeDef* node1 = AddNode("", "A", {}, {}, &graph); in TEST() local
283 NodeDef* node2 = AddNode("", "A", {node1->name()}, {}, &graph); in TEST()
285 EXPECT_EQ(GetInputNode(*node2, graph), node1); in TEST()
286 EXPECT_EQ(GetInputNode(*node1, graph), nullptr); in TEST()
293 NodeDef* node1 = AddNode("", "A", {}, {}, &graph); in TEST() local
295 NodeDef* node3 = AddNode("", "A", {node1->name(), node2->name()}, {}, &graph); in TEST()
297 EXPECT_EQ(GetInputNode(*node3, graph), node1); in TEST()
[all …]
/external/tensorflow/tensorflow/lite/delegates/gpu/gl/compiler/
Dfuse_inline.cc38 Node* node1 = sequence.front(); in ApplyToNodesSequence() local
41 absl::any_cast<CompiledNodeAttributes&>(node1->operation.attributes); in ApplyToNodesSequence()
52 graph->FindOutputs(node1->id).size() != in ApplyToNodesSequence()
58 if (node1->operation.type.find('+') == std::string::npos) { in ApplyToNodesSequence()
67 node1->operation.type += "+" + node2->operation.type; in ApplyToNodesSequence()
69 if (!RemoveFollowingNode(graph, node2, node1).ok()) { in ApplyToNodesSequence()
Dfuse_inplace.cc99 Node* node1 = sequence.front(); in ApplyToNodesSequence() local
102 absl::any_cast<CompiledNodeAttributes&>(node1->operation.attributes); in ApplyToNodesSequence()
140 node1->operation.type += "+" + node2->operation.type; in ApplyToNodesSequence()
142 if (!RemoveFollowingNode(graph, node2, node1).ok()) { in ApplyToNodesSequence()
/external/libxml2/doc/examples/
Dtree2.c29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ in main() local
74 node1 = xmlNewText(BAD_CAST in main()
76 xmlAddChild(node, node1); in main()
87 node1 = xmlNewChild(node, NULL, BAD_CAST buff, NULL); in main()
88 xmlNewProp(node1, BAD_CAST "odd", BAD_CAST((j % 2) ? "no" : "yes")); in main()
/external/ltp/testcases/kernel/syscalls/migrate_pages/
Dmigrate_pages02.c141 static void test_migrate_current_process(int node1, int node2, int cap_sys_nice) in test_migrate_current_process() argument
156 migrate_to_node(0, node1); in test_migrate_current_process()
157 check_addr_on_node(private, node1); in test_migrate_current_process()
182 migrate_to_node(0, node1); in test_migrate_current_process()
184 ret = check_addr_on_node(private, node1); in test_migrate_current_process()
193 check_addr_on_node(shared, node1); 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
216 migrate_to_node(0, node1); in test_migrate_other_process()
217 check_addr_on_node(private, node1); in test_migrate_other_process()
/external/tensorflow/tensorflow/lite/delegates/gpu/common/
Dmodel_test.cc311 Node* node1 = graph.NewNode(); in TEST() local
315 ASSERT_TRUE(graph.AddConsumer(node1->id, graph_input->id).ok()); in TEST()
316 ASSERT_TRUE(graph.SetProducer(node1->id, graph_output->id).ok()); in TEST()
324 EXPECT_THAT(graph.nodes(), UnorderedElementsAre(node1, node2)); in TEST()
325 EXPECT_THAT(graph.FindInputs(node1->id), UnorderedElementsAre(graph_input)); in TEST()
327 EXPECT_THAT(graph.FindOutputs(node1->id), UnorderedElementsAre()); in TEST()
330 UnorderedElementsAre(node1, node2)); in TEST()
338 Node* node1 = graph.NewNode(); in TEST() local
343 ASSERT_TRUE(graph.AddConsumer(node1->id, graph_input->id).ok()); in TEST()
344 ASSERT_TRUE(graph.SetProducer(node1->id, value->id).ok()); in TEST()
[all …]
/external/apache-xml/src/main/java/org/apache/xml/utils/
DDOM2Helper.java229 public static boolean isNodeAfter(Node node1, Node node2) in isNodeAfter() argument
234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder) in isNodeAfter()
236 int index1 = ((DOMOrder) node1).getUid(); in isNodeAfter()
246 return DOMHelper.isNodeAfter(node1, node2); in isNodeAfter()
DDOMHelper.java204 public static boolean isNodeAfter(Node node1, Node node2) in isNodeAfter() argument
206 if (node1 == node2 || isNodeTheSame(node1, node2)) in isNodeAfter()
212 Node parent1 = getParentOfNode(node1); in isNodeAfter()
219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2); in isNodeAfter()
263 Node startNode1 = node1, startNode2 = node2; in isNodeAfter()
339 public static boolean isNodeTheSame(Node node1, Node node2) in isNodeTheSame() argument
341 if (node1 instanceof DTMNodeProxy && node2 instanceof DTMNodeProxy) in isNodeTheSame()
342 return ((DTMNodeProxy)node1).equals((DTMNodeProxy)node2); in isNodeTheSame()
344 return (node1 == node2); in isNodeTheSame()
/external/tensorflow/tensorflow/core/kernels/
Dimmutable_constant_op_test.cc94 auto node1 = in TEST() local
98 auto result = ops::MatMul(root, node1, node2); in TEST()
126 auto node1 = in TEST() local
130 auto result = ops::MatMul(root, node1, node2); in TEST()
167 auto node1 = ops::ImmutableConst(root, DT_FLOAT, kFileTensorShape, two_file); in TEST() local
170 auto result = ops::MatMul(root, node1, node2, ops::MatMul::TransposeB(true)); in TEST()
/external/llvm/lib/Target/AArch64/
DAArch64PBQPRegAlloc.cpp174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint() local
178 &G.getNodeMetadata(node1).getAllowedRegs(); in addIntraChainConstraint()
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
208 std::swap(node1, node2); in addIntraChainConstraint()
261 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint() local
272 &G.getNodeMetadata(node1).getAllowedRegs(); in addInterChainConstraint()
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
285 std::swap(node1, node2); in addInterChainConstraint()
/external/swiftshader/third_party/llvm-7.0/llvm/lib/Target/AArch64/
DAArch64PBQPRegAlloc.cpp174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addIntraChainConstraint() local
178 &G.getNodeMetadata(node1).getAllowedRegs(); in addIntraChainConstraint()
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addIntraChainConstraint()
203 G.addEdge(node1, node2, std::move(costs)); in addIntraChainConstraint()
208 std::swap(node1, node2); in addIntraChainConstraint()
261 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); in addInterChainConstraint() local
272 &G.getNodeMetadata(node1).getAllowedRegs(); in addInterChainConstraint()
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2); in addInterChainConstraint()
285 std::swap(node1, node2); in addInterChainConstraint()
/external/ltp/testcases/kernel/syscalls/move_pages/
Dmove_pages12.c88 static unsigned int node1, node2; variable
119 nodes[j] = node1; in do_child()
255 ret = get_allowed_nodes(NH_MEMS, TEST_NODES, &node1, &node2); in setup()
270 node1, hpsz); in setup()
281 hpsz, node1, orig_hugepages_node1 + 4); in setup()
305 alloc_free_huge_on_node(node1, 4L * hpsz); in setup()
/external/kotlinx.coroutines/kotlinx-coroutines-core/jvm/test/internal/
DLockFreeLinkedListAtomicLFStressTest.kt71 val node1 = IntNode(threadId) in <lambda>() constant
73 addTwoOp(list1, node1, list2, node2) in <lambda>()
75 tryRemoveOp(node1) in <lambda>()
121 …private fun addTwoOp(list1: LockFreeLinkedListHead, node1: IntNode, list2: LockFreeLinkedListHead,… in <lambda>()
122 val add1 = list1.describeAddLast(node1) in <lambda>()
/external/tensorflow/tensorflow/python/debug/cli/
Dprofile_analyzer_cli_test.py85 node1 = step_stats_pb2.NodeExecStats(
100 device1.node_stats.extend([node1, node2])
121 node1 = step_stats_pb2.NodeExecStats(
130 device1.node_stats.extend([node1])
134 device2.node_stats.extend([node1])
180 node1 = step_stats_pb2.NodeExecStats(
197 device1.node_stats.extend([node1, node2])
232 node1 = step_stats_pb2.NodeExecStats(
249 device1.node_stats.extend([node1, node2])
286 node1 = step_stats_pb2.NodeExecStats(
[all …]
/external/dtc/tests/
Dmultilabel_merge.dts9 n1: node1 {
16 ref = <&{/node1}>; /* reference after target */
46 nx: node1 {
/external/bcc/tools/
Ddeadlock_detector.py86 def attributes(self, node1, node2): argument
87 return self.attributes_map[(node1, node2)]
89 def add_edge(self, node1, node2, **kwargs): argument
90 if node1 not in self.adjacency_map:
91 self.adjacency_map[node1] = set()
94 self.adjacency_map[node1].add(node2)
95 self.attributes_map[(node1, node2)] = kwargs
/external/snakeyaml/src/test/java/org/pyyaml/
DPyStructureTest.java124 private void compareNodes(Node node1, Node node2) { in compareNodes() argument
125 assertEquals(node1.getClass(), node2.getClass()); in compareNodes()
126 if (node1 instanceof ScalarNode) { in compareNodes()
127 ScalarNode scalar1 = (ScalarNode) node1; in compareNodes()
132 if (node1 instanceof SequenceNode) { in compareNodes()
133 SequenceNode seq1 = (SequenceNode) node1; in compareNodes()
143 MappingNode seq1 = (MappingNode) node1; in compareNodes()
/external/grpc-grpc-java/context/src/main/java/io/grpc/
DPersistentHashArrayMappedTrie.java262 Node<K,V> node1, int hash1, Node<K,V> node2, int hash2, int bitsConsumed) { in combine() argument
267 Node<K,V> node = combine(node1, hash1, node2, hash2, bitsConsumed + BITS); in combine()
274 Node<K,V> nodeCopy = node1; in combine()
275 node1 = node2; in combine()
279 Node<K,V>[] values = (Node<K,V>[]) new Node<?,?>[] {node1, node2}; in combine()
280 return new CompressedIndex<K,V>(indexBit1 | indexBit2, values, node1.size() + node2.size()); in combine()

1234