| /third_party/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 …]
|
| /third_party/gettext/gnulib-local/lib/libxml/ |
| D | debugXML.in.h | 166 xmlNodePtr node2);
177 xmlNodePtr node2);
182 xmlNodePtr node2);
187 xmlNodePtr node2);
192 xmlNodePtr node2);
200 xmlNodePtr node2);
205 xmlNodePtr node2);
210 xmlNodePtr node2);
217 xmlNodePtr node2);
223 xmlNodePtr node2);
[all …]
|
| /third_party/mindspore/mindspore/ccsrc/utils/ |
| D | convert_utils.cc | 108 bool SameNode(const AnfNodePtr &node1, const AnfNodePtr &node2, FuncGraphPairMapEquiv *equiv_func_g…
110 bool SameNodeShallow(const AnfNodePtr &node1, const AnfNodePtr &node2, FuncGraphPairMapEquiv *equiv… in SameNodeShallow() argument
116 if (equiv_node->count(node1) > 0 && (*equiv_node)[node1] == node2) { in SameNodeShallow()
119 if (IsValueNode<FuncGraph>(node1) && IsValueNode<FuncGraph>(node2)) { in SameNodeShallow()
120 …return Isomorphic(GetValueNode<FuncGraphPtr>(node1), GetValueNode<FuncGraphPtr>(node2), equiv_func… in SameNodeShallow()
123 if (node1->isa<ValueNode>() && node2->isa<ValueNode>()) { in SameNodeShallow()
125 auto a2 = GetValueNode(node2); in SameNodeShallow()
134 if (node1->isa<Parameter>() && node2->isa<Parameter>()) { in SameNodeShallow()
136 auto para2 = node2->cast<ParameterPtr>(); in SameNodeShallow()
143 if (node1->isa<CNode>() && node2->isa<CNode>()) { in SameNodeShallow()
[all …]
|
| /third_party/PyYAML/tests/lib/ |
| D | test_structure.py | 110 def _compare_nodes(node1, node2): argument
111 assert node1.__class__ == node2.__class__, (node1, node2)
112 assert node1.tag == node2.tag, (node1, node2)
114 assert node1.value == node2.value, (node1, node2)
116 assert len(node1.value) == len(node2.value), (node1, node2)
117 for item1, item2 in zip(node1.value, node2.value):
133 for node1, node2 in zip(nodes1, nodes2):
134 _compare_nodes(node1, node2)
|
| D | test_resolver.py | 68 for node1, node2 in zip(nodes1, nodes2):
70 data2 = _convert_node(node2)
88 for node1, node2 in zip(nodes1, nodes2):
90 data2 = _convert_node(node2)
|
| /third_party/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 …]
|
| /third_party/boost/boost/intrusive/ |
| D | bstree_algorithms.hpp | 280 static void swap_nodes(node_ptr node1, node_ptr node2) in swap_nodes() argument
282 if(node1 == node2) in swap_nodes()
285 node_ptr header1(base_type::get_header(node1)), header2(base_type::get_header(node2)); in swap_nodes()
286 swap_nodes(node1, header1, node2, header2); in swap_nodes()
304 static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) in swap_nodes() argument
306 if(node1 == node2) in swap_nodes()
314 NodeTraits::set_left(header1, node2); in swap_nodes()
318 NodeTraits::set_right(header1, node2); in swap_nodes()
322 NodeTraits::set_parent(header1, node2); in swap_nodes()
326 if(node2 == NodeTraits::get_left(header2)){ in swap_nodes()
[all …]
|
| D | rbtree_algorithms.hpp | 208 static void swap_nodes(node_ptr node1, node_ptr node2) in swap_nodes() argument
210 if(node1 == node2) in swap_nodes()
213 node_ptr header1(bstree_algo::get_header(node1)), header2(bstree_algo::get_header(node2)); in swap_nodes()
214 swap_nodes(node1, header1, node2, header2); in swap_nodes()
218 static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) in swap_nodes() argument
220 if(node1 == node2) return; in swap_nodes()
222 bstree_algo::swap_nodes(node1, header1, node2, header2); in swap_nodes()
225 NodeTraits::set_color(node1, NodeTraits::get_color(node2)); in swap_nodes()
226 NodeTraits::set_color(node2, c); in swap_nodes()
|
| D | avltree_algorithms.hpp | 184 static void swap_nodes(node_ptr node1, node_ptr node2) in swap_nodes() argument
186 if(node1 == node2) in swap_nodes()
189 node_ptr header1(bstree_algo::get_header(node1)), header2(bstree_algo::get_header(node2)); in swap_nodes()
190 swap_nodes(node1, header1, node2, header2); in swap_nodes()
194 static void swap_nodes(node_ptr node1, node_ptr header1, node_ptr node2, node_ptr header2) in swap_nodes() argument
196 if(node1 == node2) return; in swap_nodes()
198 bstree_algo::swap_nodes(node1, header1, node2, header2); in swap_nodes()
201 NodeTraits::set_balance(node1, NodeTraits::get_balance(node2)); in swap_nodes()
202 NodeTraits::set_balance(node2, c); in swap_nodes()
|
| /third_party/ltp/testcases/kernel/syscalls/migrate_pages/ |
| D | migrate_pages02.c | 136 static void test_migrate_current_process(int node1, int node2, int cap_sys_nice) in test_migrate_current_process() argument
149 migrate_to_node(0, node2); in test_migrate_current_process()
150 check_addr_on_node(private, node2); in test_migrate_current_process()
160 migrate_to_node(0, node2); in test_migrate_current_process()
161 check_addr_on_node(shared, node2); in test_migrate_current_process()
190 check_addr_on_node(shared, node2); in test_migrate_current_process()
194 static void test_migrate_other_process(int node1, int node2, int cap_sys_nice) in test_migrate_other_process() argument
226 ret = check_addr_on_node(private, node2); in test_migrate_other_process()
240 migrate_to_node(child1, node2); in test_migrate_other_process()
|
| /third_party/boost/boost/multi_index/detail/ |
| D | duplicates_iterator.hpp | 84 for(Node* node2=node;node!=end;node=node2){ in advance() local
85 Node::increment(node2); in advance()
86 if(node2!=end&&!pred(node->value(),node2->value()))break; in advance()
|
| /third_party/typescript/src/testRunner/unittests/services/ |
| D | organizeImports.ts | 969 function assertEqual(node1?: Node, node2?: Node) {
971 assert.isUndefined(node2);
974 else if (node2 === undefined) {
979 assert.equal(node1.kind, node2.kind);
984 const decl2 = node2 as ImportDeclaration;
990 const clause2 = node2 as ImportClause;
996 const nsi2 = node2 as NamespaceImport;
1001 const ni2 = node2 as NamedImports;
1006 const is2 = node2 as ImportSpecifier;
1012 const ed2 = node2 as ExportDeclaration;
[all …]
|
| /third_party/skia/third_party/externals/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 …]
|
| /third_party/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 …]
|
| /third_party/typescript/src/harness/ |
| D | harnessUtils.ts | 288 export function assertStructuralEquals(node1: ts.Node, node2: ts.Node) {
289 if (node1 === node2) {
294 assert(node2, "node2");
295 assert.equal(node1.pos, node2.pos, "node1.pos !== node2.pos");
296 assert.equal(node1.end, node2.end, "node1.end !== node2.end");
297 assert.equal(node1.kind, node2.kind, "node1.kind !== node2.kind");
301 assert.equal(ts.containsParseError(node1), ts.containsParseError(node2));
302 …assert.equal(node1.flags & ~ts.NodeFlags.ReachabilityAndEmitFlags, node2.flags & ~ts.NodeFlags.Rea…
307 const child2: ts.Node = (<any>node2)[childName];
313 const array2: ts.NodeArray<ts.Node> = (<any>node2)[childName];
|
| /third_party/ltp/testcases/kernel/syscalls/move_pages/ |
| D | move_pages12.c | 99 static unsigned int node1, node2; variable
132 nodes[j] = node2; in do_child()
266 ret = get_allowed_nodes(NH_MEMS, TEST_NODES, &node1, &node2); in setup()
285 node2, hpsz); in setup()
302 hpsz, node2, orig_hugepages_node2 + 4); in setup()
317 alloc_free_huge_on_node(node2, 4L * hpsz); in setup()
|
| /third_party/mindspore/mindspore/ccsrc/backend/optimizer/pass/ |
| D | eliminate_redundant_op.cc | 72 bool CastEliminateCondition(const CNodePtr &node1, const CNodePtr &node2) { in CastEliminateCondition() argument
73 return HasSymmetricalKernelInfo(node1, node2); in CastEliminateCondition()
76 bool TransDataOpEliminateCondition(const CNodePtr &node1, const CNodePtr &node2) { in TransDataOpEliminateCondition() argument
77 return AnfAlgo::GetInputFormat(node1, 0) == AnfAlgo::GetOutputFormat(node2, 0) && in TransDataOpEliminateCondition()
78 AnfAlgo::GetOutputFormat(node1, 0) == AnfAlgo::GetInputFormat(node2, 0) && in TransDataOpEliminateCondition()
79 …kernel::IsSameShape(AnfAlgo::GetInputDeviceShape(node2, 0), AnfAlgo::GetOutputDeviceShape(node1, 0… in TransDataOpEliminateCondition()
|
| /third_party/node/deps/npm/node_modules/node-gyp/gyp/tools/ |
| D | pretty_vcproj.py | 252 def MergeAttributes(node1, node2): argument
254 if not node2.attributes:
257 for (name, value2) in node2.attributes.items():
277 def MergeProperties(node1, node2): argument
278 MergeAttributes(node1, node2)
279 for child2 in node2.childNodes:
|
| /third_party/node/tools/gyp/tools/ |
| D | pretty_vcproj.py | 258 def MergeAttributes(node1, node2): argument
260 if not node2.attributes:
263 for (name, value2) in node2.attributes.items():
283 def MergeProperties(node1, node2): argument
284 MergeAttributes(node1, node2)
285 for child2 in node2.childNodes:
|
| /third_party/ffmpeg/libavutil/tests/ |
| D | tree.c | 94 AVTreeNode *node2 = NULL; in main() local
96 av_tree_insert(&root, (void *)(j + 1), cmp, &node2); in main()
100 av_free(node2); in main()
|
| /third_party/boost/boost/heap/ |
| D | skew_heap.hpp | 857 node_pointer merge_nodes(node_pointer node1, node_pointer node2, node_pointer new_parent) in merge_nodes() argument
860 if (node2) in merge_nodes()
861 node2->set_parent(new_parent); in merge_nodes()
862 return node2; in merge_nodes()
864 if (node2 == NULL) { in merge_nodes()
869 node_pointer merged = merge_nodes_recursive(node1, node2, new_parent); in merge_nodes()
881 …node_pointer merge_nodes_recursive(node_pointer node1, node_pointer node2, node_pointer new_parent) in merge_nodes_recursive() argument
883 if (super_t::operator()(node1->value, node2->value)) in merge_nodes_recursive()
884 std::swap(node1, node2); in merge_nodes_recursive()
887 node * child = node2; in merge_nodes_recursive()
|
| /third_party/boost/libs/ptr_container/test/ |
| D | tree_test.cpp | 246 inner_node node2( "node 2" ); in test_tree() local
247 node2.add_child( new leaf<float>( 42.0f ) ); in test_tree()
248 node2.add_child( new leaf<string>( "leaf 4" ) ); in test_tree()
252 root.add_child( node2.release() ); in test_tree()
|
| /third_party/boost/libs/hana/example/misc/ |
| D | tree.cpp | 43 static constexpr auto apply(Node1 node1, Node2 node2) { in apply()
45 hana::equal(node1.value, node2.value), in apply()
46 hana::equal(node1.subforest, node2.subforest) in apply()
|
| /third_party/boost/libs/variant/test/ |
| D | issue42.cpp | 46 >::type node2; in main() typedef
48 node2 x2 = 1; in main()
|
| /third_party/selinux/libsepol/src/ |
| D | node_record.c | 332 int sepol_node_compare2(const sepol_node_t * node, const sepol_node_t * node2) in sepol_node_compare2() argument
337 if ((node->addr_sz < node2->addr_sz) || in sepol_node_compare2()
338 (node->mask_sz < node2->mask_sz)) in sepol_node_compare2()
341 else if ((node->addr_sz > node2->addr_sz) || in sepol_node_compare2()
342 (node->mask_sz > node2->mask_sz)) in sepol_node_compare2()
345 rc1 = memcmp(node->addr, node2->addr, node->addr_sz); in sepol_node_compare2()
346 rc2 = memcmp(node->mask, node2->mask, node->mask_sz); in sepol_node_compare2()
|