| /external/webkit/Source/JavaScriptCore/dfg/ |
| DFGAliasTracker.h | 108 Node& node2 = m_graph[op2];
109 return (node2.op == ValueToNumber || node2.op == ValueToInt32 || node2.op == NumberToInt32) && op1 == node2.child1;
|
| /external/libxml2/include/libxml/ |
| debugXML.h | 128 * @node2: a second node
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);
[all...] |
| xpath.h | 448 xmlNodePtr node2);
|
| /external/apache-xml/src/main/java/org/apache/xml/utils/ |
| DOM2Helper.java | 212 * Figure out whether node2 should be considered as being later
223 * @param node2 DOM Node to perform position comparison on .
225 * @return false if node2 comes before node1, otherwise return true.
227 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>.
229 public static boolean isNodeAfter(Node node1, Node node2)
234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder)
237 int index2 = ((DOMOrder) node2).getUid();
246 return DOMHelper.isNodeAfter(node1, node2);
|
| DOMHelper.java | 187 * Figure out whether node2 should be considered as being later
198 * @param node2 DOM Node to perform position comparison on .
200 * @return false if node2 comes before node1, otherwise return true.
202 * <code>(node1.documentOrderPosition <= node2.documentOrderPosition)</code>.
204 public static boolean isNodeAfter(Node node1, Node node2)
206 if (node1 == node2 || isNodeTheSame(node1, node2))
213 Node parent2 = getParentOfNode(node2);
219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2);
263 Node startNode1 = node1, startNode2 = node2;
[all...] |
| /external/v8/test/cctest/ |
| test-profile-generator.cc | 165 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local
166 CHECK_NE(NULL, node2);
167 CHECK_NE(node1, node2);
168 CHECK_EQ(0, node2->total_ticks());
169 CHECK_EQ(0, node2->self_ticks());
175 CHECK_NE(node2, node3);
181 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
185 CHECK_EQ(0, node2->total_ticks());
186 CHECK_EQ(0, node2->self_ticks());
198 CHECK_EQ(node2, helper.Walk(&entry1, &entry2))
235 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local
337 ProfileNode* node2 = flat_helper.Walk(&entry1, &entry2); local
482 ProfileNode* node2 = token1_helper.Walk(&entry2); local
632 ProfileNode* node2 = top_down_test_helper.Walk(entry1, entry1); local
[all...] |
| /system/core/init/ |
| parser.c | 17 struct listnode *node2;
38 list_for_each(node2, &act->commands) {
39 cmd = node_to_item(node2, struct command, clist);
|
| /external/opencv/cvaux/src/ |
| cvlee.cpp | 106 CvVoronoiNodeInt* node2; member in struct:CvVoronoiSiteInt
117 CvVoronoiNodeInt* node2; member in struct:CvVoronoiEdgeInt
[all...] |
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| DomUtilities.java | 69 * @param node2 the second node to test
72 public static Node getCommonAncestor(Node node1, Node node2) {
73 while (node2 != null) {
75 while (current != null && current != node2) {
78 if (current == node2) {
81 node2 = node2.getParentNode();
|
| /external/llvm/include/llvm/CodeGen/PBQP/ |
| Graph.h | 82 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry
87 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
88 : node1(node1), node2(node2), costs(costs) {}
90 NodeItr getNode2() const { return node2; }
|
| /ndk/sources/host-tools/nawk-20071023/ |
| parse.c | 60 Node *node2(int a, Node *b, Node *c) function
109 x = node2(a,b,c);
145 x = node2(a,b,c);
|
| proto.h | 76 extern Node *node2(int, Node *, Node *);
|
| /external/chromium/chrome/browser/sync/glue/ |
| bookmark_model_associator.cc | 49 // before node2 in strict weak ordering.
51 const BookmarkNode* node2) const {
53 DCHECK(node2);
56 if (node1->is_folder() != node2->is_folder())
59 int result = node1->GetTitle().compare(node2->GetTitle());
63 return node1->GetURL() < node2->GetURL();
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/ |
| CanvasViewInfoTest.java | 487 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
489 MergeCookie cookie2 = new MergeCookie(node2);
517 Object cookie = (i % 2) == 0 ? node1 : node2;
539 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
541 MergeCookie cookie2 = new MergeCookie(node2);
568 Object cookie = (i % 2) == 0 ? node1 : node2;
602 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
605 ViewInfo childView2 = new ViewInfo("childView2", node2, 0, 40, 50, 60);
630 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
634 ViewInfo childView2 = new ViewInfo("childView2", node2, 0, 40, 50, 60)
[all...] |
| /external/libxml2/ |
| xpath.c | [all...] |
| debugXML.c | [all...] |
| /external/chromium/chrome/browser/bookmarks/ |
| bookmark_model_unittest.cc | 61 const BookmarkNode* node2,
65 this->node2 = node2;
71 const BookmarkNode* node2,
75 ASSERT_TRUE(this->node2 == node2);
81 const BookmarkNode* node2; member in struct:BookmarkModelTest::ObserverDetails
[all...] |
| /external/apache-xml/src/main/java/org/apache/xpath/objects/ |
| XNodeSet.java | 505 int node2; local
507 while (DTM.NULL != (node2 = list2.nextNode()))
509 XMLString s2 = getStringFromNode(node2);
|
| /system/core/sdcard/ |
| sdcard.c | 445 struct node *node2; local
447 node2 = node->parent->child;
448 while (node2->next != node)
449 node2 = node2->next;
450 node2->next = node->next;
|
| /external/llvm/lib/CodeGen/ |
| RegAllocPBQP.cpp | 398 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src); local
399 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
401 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
405 if (g.getEdgeNode1(edge) == node2) {
406 std::swap(node1, node2);
|
| /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/ |
| UiElementNode.java | 755 * F.ex. "node1/node2" would find a child "node1" that contains a child "node2" and
[all...] |
| /external/bluetooth/glib/gobject/ |
| gboxed.c | 77 const BoxedNode *node1 = p1, *node2 = p2; local
79 return G_BSEARCH_ARRAY_CMP (node1->type, node2->type);
|
| gsignal.c | 164 gconstpointer node2);
174 gconstpointer node2);
176 gconstpointer node2);
358 gconstpointer node2)
360 const ClassClosure *c1 = node1, *c2 = node2;
367 gconstpointer node2)
369 const HandlerList *hlist1 = node1, *hlist2 = node2;
757 gconstpointer node2)
759 const SignalKey *key1 = node1, *key2 = node2;
[all...] |
| /external/opencv/cv/src/ |
| cvhistogram.cpp | 516 CvSparseNode *node1, *node2; local
544 for( node2 = cvInitSparseMatIterator( mat2, &iterator );
545 node2 != 0; node2 = cvGetNextSparseNode( &iterator ))
547 double v2 = *(float*)CV_NODE_VAL(mat2,node2);
548 if( !cvPtrND( mat1, CV_NODE_IDX(mat2,node2), 0, 0, &node2->hashval ))
574 for( node2 = cvInitSparseMatIterator( mat2, &iterator );
575 node2 != 0; node2 = cvGetNextSparseNode( &iterator )
[all...] |
| /external/opencv/cxcore/src/ |
| cxdatastructs.cpp | 2672 CvPTreeNode* node2 = (CvPTreeNode*)reader.ptr; local
[all...] |
