Searched refs:node1 (Results 1 - 25 of 32) sorted by relevance

12

/external/libxml2/doc/examples/
H A Dtree2.c29 xmlNodePtr root_node = NULL, node = NULL, node1 = NULL;/* node pointers */ local
52 xmlNewChild(root_node, NULL, BAD_CAST "node1",
75 node1 = xmlNewText(BAD_CAST
77 xmlAddChild(node, node1);
88 node1 = xmlNewChild(node, NULL, BAD_CAST buff, NULL);
89 xmlNewProp(node1, BAD_CAST "odd", BAD_CAST((j % 2) ? "no" : "yes"));
/external/clang/test/SemaCXX/
H A Darrow-operator.cpp35 Node** node1; local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}}
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DDOM2Helper.java213 * in the document than node1, in Document Order as defined
222 * @param node1 DOM Node to perform position comparison on.
225 * @return false if node2 comes before node1, otherwise return true.
227 * <code>(node1.documentOrderPosition &lt;= node2.documentOrderPosition)</code>.
229 public static boolean isNodeAfter(Node node1, Node node2) argument
234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder)
236 int index1 = ((DOMOrder) node1).getUid();
246 return DOMHelper.isNodeAfter(node1, node2);
H A DDOMHelper.java188 * in the document than node1, in Document Order as defined
197 * @param node1 DOM Node to perform position comparison on.
200 * @return false if node2 comes before node1, otherwise return true.
202 * <code>(node1.documentOrderPosition &lt;= node2.documentOrderPosition)</code>.
204 public static boolean isNodeAfter(Node node1, Node node2) argument
206 if (node1 == node2 || isNodeTheSame(node1, node2))
212 Node parent1 = getParentOfNode(node1);
219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2);
263 Node startNode1 = node1, startNode
339 isNodeTheSame(Node node1, Node node2) argument
[all...]
/external/opencv/cvaux/src/
H A Dcvlee.cpp105 CvVoronoiNodeInt* node1; member in struct:CvVoronoiSiteInt
116 CvVoronoiNodeInt* node1; member in struct:CvVoronoiEdgeInt
674 (this marked point is pEdge1->node1->node).
695 (this marked point is pEdge1->node1->node).
717 (this marked point is pEdge1->node1->node).
739 (this marked point is pEdge1->node1->node).
761 (this marked point is pEdge1->node1->node).
783 (this marked point is pEdge1->node1->node).
804 (this marked point is pEdge1->node1->node).
826 (this marked point is pEdge1->node1
[all...]
/external/v8/src/compiler/
H A Dgraph-reducer-unittest.cc80 Node* node1 = graph()->NewNode(&OP1, node0); local
82 EXPECT_CALL(r, Reduce(node1)).WillOnce(Return(Reducer::Replace(node2)));
83 ReduceNode(node1, &r);
85 EXPECT_TRUE(node1->IsDead());
H A Dmachine-operator-reducer-unittest.cc457 Node* node1 = graph()->NewNode(machine()->Word32Or(), shl, shr); local
458 Reduction reduction1 = Reduce(node1);
460 EXPECT_EQ(reduction1.replacement(), node1);
481 Node* node1 = graph()->NewNode(machine()->Word32Or(), shl, shr); local
482 Reduction reduction1 = Reduce(node1);
484 EXPECT_EQ(reduction1.replacement(), node1);
/external/valgrind/include/
H A Dpub_tool_hashtable.h75 typedef Word (*HT_Cmp_t) ( const void* node1, const void* node2 );
/external/v8/test/cctest/
H A Dtest-profile-generator.cc135 ProfileNode* node1 = helper.Walk(&entry1); local
136 CHECK_NE(NULL, node1);
137 CHECK_EQ(0, node1->self_ticks());
142 CHECK_NE(node1, node2);
148 CHECK_NE(node1, node3);
153 CHECK_EQ(node1, helper.Walk(&entry1));
156 CHECK_EQ(0, node1->self_ticks());
165 CHECK_EQ(node1, helper.Walk(&entry1));
194 ProfileNode* node1 = helper.Walk(&entry1); local
195 CHECK_NE(NULL, node1);
254 ProfileNode* node1 = single_child_helper.Walk(&entry1); local
445 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local
[all...]
/external/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp174 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); local
178 &G.getNodeMetadata(node1).getAllowedRegs();
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
203 G.addEdge(node1, node2, std::move(costs));
208 std::swap(node1, node2);
261 PBQPRAGraph::NodeId node1 = G.getMetadata().getNodeIdForVReg(Rd); local
272 &G.getNodeMetadata(node1).getAllowedRegs();
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
285 std::swap(node1, node2);
/external/jmonkeyengine/engine/src/test/jme3test/bullet/
H A DTestPhysicsCar.java134 Node node1 = new Node("wheel 1 node");
136 node1.attachChild(wheels1);
139 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff),
166 vehicleNode.attachChild(node1);
H A DTestAttachDriver.java162 Node node1 = new Node("wheel 1 node");
164 node1.attachChild(wheels1);
167 vehicle.addWheel(node1, new Vector3f(-xOff, yOff, zOff),
194 vehicleNode.attachChild(node1);
/external/zopfli/src/zopfli/
H A Dkatajainen.c149 Node* node1 = GetFreeNode(0, maxbits, pool); local
151 InitNode(leaves[1].weight, 2, 0, node1);
154 lists[i][1] = node1;
/external/opencv/cv/src/
H A Dcvhistogram.cpp516 CvSparseNode *node1, *node2; local
527 for( node1 = cvInitSparseMatIterator( mat1, &iterator );
528 node1 != 0; node1 = cvGetNextSparseNode( &iterator ))
530 double v1 = *(float*)CV_NODE_VAL(mat1,node1);
531 uchar* node2_data = cvPtrND( mat2, CV_NODE_IDX(mat1,node1), 0, 0, &node1->hashval );
559 for( node1 = cvInitSparseMatIterator( mat1, &iterator );
560 node1 != 0; node1
[all...]
/external/libxml2/
H A Dxpath.c141 * @node1: the first node
151 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) { argument
158 if ((node1 == NULL) || (node2 == NULL))
161 if (node1 == node2)
167 switch (node1->type) {
170 if ((0 > (long) node1->content) && /* TODO: Would a != 0 suffice here? */
172 (node1->doc == node2->doc))
174 l1 = -((long) node1->content);
186 miscNode1 = node1;
187 node1
3274 xmlXPathCmpNodes(xmlNodePtr node1, xmlNodePtr node2) argument
[all...]
H A Dxpointer.c207 * @node1: the first node
218 xmlXPtrCmpPoints(xmlNodePtr node1, int index1, xmlNodePtr node2, int index2) { argument
219 if ((node1 == NULL) || (node2 == NULL))
224 if (node1 == node2) {
231 return(xmlXPathCmpNodes(node1, node2));
/external/apache-xml/src/main/java/org/apache/xpath/objects/
H A DXNodeSet.java496 int node1;
499 while (DTM.NULL != (node1 = list1.nextNode()))
501 XMLString s1 = getStringFromNode(node1);
/external/v8/test/cctest/compiler/
H A Dtest-js-constant-cache.cc242 Node* node1 = T.Constant(value); local
245 CHECK_EQ(node1, node2);
246 CHECK_EQ(node1, node3);
/external/valgrind/coregrind/
H A Dm_deduppoolalloc.c184 static Word cmp_pool_elt (const void* node1, const void* node2 ) argument
186 const ht_node* hnode1 = node1;
/external/libxml2/include/libxml/
H A Dxpath.h451 xmlXPathCmpNodes (xmlNodePtr node1,
/external/jmonkeyengine/engine/src/bullet/com/jme3/bullet/
H A DPhysicsSpace.java306 // PhysicsCollisionObject node = null, node1 = null;
310 // node1 = (PhysicsCollisionObject) rBody1.getUserPointer();
311 // collisionEvents.add(eventFactory.getEvent(PhysicsCollisionEvent.TYPE_PROCESSED, node, node1, cp));
325 private void addCollisionEvent_native(PhysicsCollisionObject node, PhysicsCollisionObject node1, long manifoldPointObjectId) { argument
326 // System.out.println("addCollisionEvent:"+node.getObjectId()+" "+ node1.getObjectId());
327 collisionEvents.add(eventFactory.getEvent(PhysicsCollisionEvent.TYPE_PROCESSED, node, node1, manifoldPointObjectId));
/external/linux-tools-perf/src/tools/perf/
H A Dbuiltin-kmem.c237 int node1 = cpunode_map[sample->cpu], local
240 if (node1 != node2)
/external/jmonkeyengine/engine/src/jbullet/com/jme3/bullet/
H A DPhysicsSpace.java286 PhysicsCollisionObject node = null, node1 = null;
290 node1 = (PhysicsCollisionObject) rBody1.getUserPointer();
291 collisionEvents.add(eventFactory.getEvent(PhysicsCollisionEvent.TYPE_PROCESSED, node, node1, cp));
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDILCFGStructurizer.cpp2582 DomTreeNodeT *node1 = postDomTree->getNode(blk1); local
2586 if (node1 == NULL && blk1->succ_size() == 1) {
2593 if (node1 == NULL || node2 == NULL) {
2597 node1 = node1->getIDom();
2598 while (node1) {
2599 if (postDomTree->dominates(node1, node2)) {
2600 return node1->getBlock();
2602 node1 = node1
[all...]
/external/selinux/libsepol/cil/src/
H A Dcil_binary.c1091 ebitmap_node_t *node1, *node2; local
1106 ebitmap_for_each_bit(&src_bitmap, node1, i) {
1152 ebitmap_node_t *node1, *node2; local
1179 ebitmap_for_each_bit(&src_bitmap, node1, i) {
1962 ebitmap_node_t *node1, *node2; local
1971 ebitmap_for_each_bit(&src_bitmap, node1, i) {
2644 ebitmap_node_t *node1, *node2; local
2657 ebitmap_for_each_bit(&src_bitmap, node1, i) {

Completed in 2055 milliseconds

12