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

12

/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/v8/test/cctest/
H A Dtest-profile-generator.cc155 ProfileNode* node1 = helper.Walk(&entry1); local
156 CHECK_NE(NULL, node1);
157 CHECK_EQ(0, node1->total_ticks());
158 CHECK_EQ(0, node1->self_ticks());
163 CHECK_NE(node1, node2);
170 CHECK_NE(node1, node3);
176 CHECK_EQ(node1, helper.Walk(&entry1));
179 CHECK_EQ(0, node1->total_ticks());
180 CHECK_EQ(0, node1->self_ticks());
191 CHECK_EQ(node1, helpe
225 ProfileNode* node1 = helper.Walk(&entry1); local
303 ProfileNode* node1 = single_child_helper.Walk(&entry1); local
450 ProfileNode* node1 = token0_helper.Walk(&entry1); local
626 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local
[all...]
H A Dtest-heap-profiler.cc480 // -> node1
499 "node6.a.a.b = node6.b.a; // node1 -> node2\n"
500 "node6.b.a.a = node6.a.a; // node2 -> node1\n"
525 const v8::HeapGraphNode* node1 = local
527 CHECK_NE(NULL, node1);
529 CHECK_EQ(node6, node1->GetDominatorNode());
/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/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/chromium/chrome/browser/sync/glue/
H A Dbookmark_model_associator.cc48 // Compares the two given nodes and returns whether node1 should appear
50 bool operator()(const BookmarkNode* node1, argument
52 DCHECK(node1);
56 if (node1->is_folder() != node2->is_folder())
57 return node1->is_folder();
59 int result = node1->GetTitle().compare(node2->GetTitle());
63 return node1->GetURL() < node2->GetURL();
/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/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h82 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) argument
88 : node1(node1), node2(node2), costs(costs) {}
89 NodeItr getNode1() const { return node1; }
/external/libxml2/
H A Dxpath.c2878 * @node1: the first node
2887 xmlXPathCmpNodes(xmlNodePtr node1, xmlNodePtr node2) { argument
2893 if ((node1 == NULL) || (node2 == NULL))
2898 if (node1 == node2) /* trivial case */
2900 if (node1->type == XML_ATTRIBUTE_NODE) {
2902 attrNode1 = node1;
2903 node1 = node1->parent;
2910 if (node1 == node2) {
2928 if ((node1
3036 xmlXPathCmpNodesExt(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/chromium/chrome/browser/bookmarks/
H A Dbookmark_model_unittest.cc60 void Set(const BookmarkNode* node1, argument
64 this->node1 = node1;
70 void AssertEquals(const BookmarkNode* node1, argument
74 ASSERT_TRUE(this->node1 == node1);
80 const BookmarkNode* node1; member in struct:BookmarkModelTest::ObserverDetails
/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/linux-tools-perf/
H A Dbuiltin-kmem.c208 int node1, node2; local
222 node1 = cpunode_map[cpu];
224 if (node1 != node2)
/external/bluetooth/glib/gobject/
H A Dgboxed.c77 const BoxedNode *node1 = p1, *node2 = p2; local
79 return G_BSEARCH_ARRAY_CMP (node1->type, node2->type);
H A Dgsignal.c163 static gint handler_lists_cmp (gconstpointer node1,
173 static gint class_closures_cmp (gconstpointer node1,
175 static gint signal_key_cmp (gconstpointer node1,
357 class_closures_cmp (gconstpointer node1, argument
360 const ClassClosure *c1 = node1, *c2 = node2;
366 handler_lists_cmp (gconstpointer node1, argument
369 const HandlerList *hlist1 = node1, *hlist2 = node2;
756 signal_key_cmp (gconstpointer node1, argument
759 const SignalKey *key1 = node1, *key2 = node2;
/external/libxml2/include/libxml/
H A Dxpath.h450 xmlXPathCmpNodes (xmlNodePtr node1,
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp432 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); local
434 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
436 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
441 std::swap(node1, node2);
/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/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/webkit/Source/ThirdParty/ANGLE/src/compiler/
H A Dintermediate.h231 TIntermNode* node1; member in struct:TIntermNodePair
H A Dglslang.y1820 $$.node1 = $1;
1824 $$.node1 = $1;
1869 $$ = context->intermediate.addLoop(ELoopFor, $4, reinterpret_cast<TIntermTyped*>($5.node1), reinterpret_cast<TIntermTyped*>($5.node2), $7, $1.line);
1894 $$.node1 = $1;
1898 $$.node1 = $1;
H A DIntermediate.cpp596 return nodePair.node1;
601 TIntermSelection* node = new TIntermSelection(cond, nodePair.node1, nodePair.node2);

Completed in 440 milliseconds

12