| /external/opencv/cvaux/src/ |
| D | cvlee.cpp | 105 CvVoronoiNodeInt* node1; member
116 CvVoronoiNodeInt* node1; member
1582 Hole.x_coord = pTopSite->node1->node.x; in _cvConstuctSites()
1621 dx = pHole->node->node.x - pHole->site_top->node1->node.x; in _cvConstructSkeleton()
1622 dy = pHole->node->node.y - pHole->site_top->node1->node.y; in _cvConstructSkeleton()
1690 pHole->site_top->node1->node.x = (float)cvFloor(pHole->site_top->node1->node.x); in _cvRandomModification()
1786 while(pSite->prev_site->node1 == pSite->prev_site->node2)\ in _cvConvertSameOrientation()
1798 if(!pEdge || !pEdge->node1 || !pEdge->node2) in _cvConvertSameOrientation()
1814 pNode1->pt.x = pEdge->node1->node.x; in _cvConvertSameOrientation()
1815 pNode1->pt.y = pEdge->node1->node.y; in _cvConvertSameOrientation()
[all …]
|
| /external/libxml2/doc/examples/ |
| D | tree2.c | 29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ in main() local
75 node1 = xmlNewText(BAD_CAST in main()
77 xmlAddChild(node, node1); in main()
88 node1 = xmlNewChild(node, NULL, BAD_CAST buff, NULL); in main()
89 xmlNewProp(node1, BAD_CAST "odd", BAD_CAST((j % 2) ? "no" : "yes")); in main()
|
| /external/v8/test/cctest/ |
| D | test-profile-generator.cc | 135 ProfileNode* node1 = helper.Walk(&entry1); in TEST() local
136 CHECK_NE(NULL, node1); in TEST()
137 CHECK_EQ(0, node1->self_ticks()); in TEST()
142 CHECK_NE(node1, node2); in TEST()
148 CHECK_NE(node1, node3); in TEST()
153 CHECK_EQ(node1, helper.Walk(&entry1)); in TEST()
156 CHECK_EQ(0, node1->self_ticks()); in TEST()
165 CHECK_EQ(node1, helper.Walk(&entry1)); in TEST()
194 ProfileNode* node1 = helper.Walk(&entry1); in TEST() local
195 CHECK_NE(NULL, node1); in TEST()
[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()
236 int index1 = ((DOMOrder) node1).getUid(); in isNodeAfter()
246 return DOMHelper.isNodeAfter(node1, node2); in isNodeAfter()
|
| D | DOMHelper.java | 204 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/llvm/lib/Target/AArch64/ |
| D | AArch64PBQPRegAlloc.cpp | 174 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/v8/src/compiler/ |
| D | graph-reducer-unittest.cc | 80 Node* node1 = graph()->NewNode(&OP1, node0); in TEST_F() local
82 EXPECT_CALL(r, Reduce(node1)).WillOnce(Return(Reducer::Replace(node2))); in TEST_F()
83 ReduceNode(node1, &r); in TEST_F()
85 EXPECT_TRUE(node1->IsDead()); in TEST_F()
|
| D | machine-operator-reducer-unittest.cc | 457 Node* node1 = graph()->NewNode(machine()->Word32Or(), shl, shr); in TEST_F() local
458 Reduction reduction1 = Reduce(node1); in TEST_F()
460 EXPECT_EQ(reduction1.replacement(), node1); in TEST_F()
481 Node* node1 = graph()->NewNode(machine()->Word32Or(), shl, shr); in TEST_F() local
482 Reduction reduction1 = Reduce(node1); in TEST_F()
484 EXPECT_EQ(reduction1.replacement(), node1); in TEST_F()
|
| /external/opencv/cv/src/ |
| D | cvhistogram.cpp | 516 CvSparseNode *node1, *node2; in cvCompareHist() local
527 for( node1 = cvInitSparseMatIterator( mat1, &iterator ); in cvCompareHist()
528 node1 != 0; node1 = cvGetNextSparseNode( &iterator )) in cvCompareHist()
530 double v1 = *(float*)CV_NODE_VAL(mat1,node1); in cvCompareHist()
531 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1), 0, 0, &node1->hashval ); in cvCompareHist()
559 for( node1 = cvInitSparseMatIterator( mat1, &iterator ); in cvCompareHist()
560 node1 != 0; node1 = cvGetNextSparseNode( &iterator )) in cvCompareHist()
562 double v1 = *(float*)CV_NODE_VAL(mat1,node1); in cvCompareHist()
563 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1), in cvCompareHist()
564 0, 0, &node1->hashval ); in cvCompareHist()
[all …]
|
| /external/clang/test/SemaCXX/ |
| D | arrow-operator.cpp | 35 Node** node1; in f() local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}} in f()
|
| /external/jmonkeyengine/engine/src/test/jme3test/bullet/ |
| D | TestPhysicsCar.java | 134 Node node1 = new Node("wheel 1 node"); in buildPlayer() local
136 node1.attachChild(wheels1); in buildPlayer()
139 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff), in buildPlayer()
166 vehicleNode.attachChild(node1); in buildPlayer()
|
| D | TestAttachDriver.java | 162 Node node1 = new Node("wheel 1 node"); in buildPlayer() local
164 node1.attachChild(wheels1); in buildPlayer()
167 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff), in buildPlayer()
194 vehicleNode.attachChild(node1); in buildPlayer()
|
| /external/zopfli/src/zopfli/ |
| D | katajainen.c | 149 Node* node1 = GetFreeNode(0, maxbits, pool); in InitLists() local
151 InitNode(leaves[1].weight, 2, 0, node1); in InitLists()
154 lists[i][1] = node1; in InitLists()
|
| /external/llvm/test/Analysis/ScalarEvolution/ |
| D | load.ll | 41 …i8] } { %struct.ListNode* bitcast ({ %struct.ListNode*, i32, [4 x i8] }* @node1 to %struct.ListNod…
42 @node1 = internal constant { %struct.ListNode*, i32, [4 x i8] } { %struct.ListNode* null, i32 0, [4…
53 ; CHECK: --> %n.01{{ U: [^ ]+ S: [^ ]+}}{{ *}}Exits: @node1
|
| /external/libxml2/ |
| D | xpath.c | 151 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) { in xmlXPathCmpNodesExt() argument
158 if ((node1 == NULL) || (node2 == NULL)) in xmlXPathCmpNodesExt()
161 if (node1 == node2) in xmlXPathCmpNodesExt()
167 switch (node1->type) { in xmlXPathCmpNodesExt()
170 if ((0 > (long) node1->content) && /* TODO: Would a != 0 suffice here? */ in xmlXPathCmpNodesExt()
172 (node1->doc == node2->doc)) in xmlXPathCmpNodesExt()
174 l1 = -((long) node1->content); in xmlXPathCmpNodesExt()
186 miscNode1 = node1; in xmlXPathCmpNodesExt()
187 node1 = node1->parent; in xmlXPathCmpNodesExt()
194 miscNode1 = node1; in xmlXPathCmpNodesExt()
[all …]
|
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| D | XNodeSet.java | 496 int node1; in compare() local
499 while (DTM.NULL != (node1 = list1.nextNode())) in compare()
501 XMLString s1 = getStringFromNode(node1); in compare()
|
| /external/valgrind/include/ |
| D | pub_tool_hashtable.h | 75 typedef Word (*HT_Cmp_t) ( const void* node1, const void* node2 );
|
| /external/v8/test/cctest/compiler/ |
| D | test-js-constant-cache.cc | 242 Node* node1 = T.Constant(value); in TEST() local
245 CHECK_EQ(node1, node2); in TEST()
246 CHECK_EQ(node1, node3); in TEST()
|
| /external/valgrind/coregrind/ |
| D | m_deduppoolalloc.c | 184 static Word cmp_pool_elt (const void* node1, const void* node2 ) in cmp_pool_elt() argument
186 const ht_node* hnode1 = node1; in cmp_pool_elt()
|
| /external/mesa3d/src/gallium/drivers/radeon/ |
| D | AMDILCFGStructurizer.cpp | 2582 DomTreeNodeT *node1 = postDomTree->getNode(blk1); in findNearestCommonPostDom() local
2586 if (node1 == NULL && blk1->succ_size() == 1) { in findNearestCommonPostDom()
2593 if (node1 == NULL || node2 == NULL) { in findNearestCommonPostDom()
2597 node1 = node1->getIDom(); in findNearestCommonPostDom()
2598 while (node1) { in findNearestCommonPostDom()
2599 if (postDomTree->dominates(node1, node2)) { in findNearestCommonPostDom()
2600 return node1->getBlock(); in findNearestCommonPostDom()
2602 node1 = node1->getIDom(); in findNearestCommonPostDom()
|
| /external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/ |
| D | PhysicsSpace.java | 286 PhysicsCollisionObject node = null, node1 = null; in setContactCallbacks()
290 node1 = (PhysicsCollisionObject) rBody1.getUserPointer(); in setContactCallbacks()
291 … collisionEvents.add(eventFactory.getEvent(PhysicsCollisionEvent.TYPE_PROCESSED, node, node1, cp)); in setContactCallbacks()
|
| /external/linux-tools-perf/src/tools/perf/ |
| D | builtin-kmem.c | 237 int node1 = cpunode_map[sample->cpu], in perf_evsel__process_alloc_node_event() local
240 if (node1 != node2) in perf_evsel__process_alloc_node_event()
|
| /external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/ |
| D | PhysicsSpace.java | 325 …private void addCollisionEvent_native(PhysicsCollisionObject node, PhysicsCollisionObject node1, l… in addCollisionEvent_native() argument
327 …collisionEvents.add(eventFactory.getEvent(PhysicsCollisionEvent.TYPE_PROCESSED, node, node1, manif… in addCollisionEvent_native()
|
| /external/libxml2/include/libxml/ |
| D | xpath.h | 451 xmlXPathCmpNodes (xmlNodePtr node1,
|
| /external/libxml2/python/ |
| D | libxml.c | 3787 xmlNodePtr node1, node2; in libxml_compareNodesEqual() local
3793 node1 = PyxmlNode_Get(py_node1); in libxml_compareNodesEqual()
3795 if ( node1 == node2 ) in libxml_compareNodesEqual()
3806 xmlNodePtr node1; in libxml_nodeHash() local
3811 node1 = PyxmlNode_Get(py_node1); in libxml_nodeHash()
3813 return PyLong_FromVoidPtr(node1); in libxml_nodeHash()
|