HomeSort by relevance Sort by last modified time
    Searched refs:node2 (Results 26 - 50 of 89) sorted by null

12 3 4

  /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);
  /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();
  /external/llvm/include/llvm/CodeGen/PBQP/
Graph.h 86 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry
92 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs)
93 : node1(node1), node2(node2), costs(costs) {}
95 NodeItr getNode2() const { return node2; }
  /external/libsepol/src/
node_record.c 345 int sepol_node_compare2(const sepol_node_t * node, const sepol_node_t * node2)
350 if ((node->addr_sz < node2->addr_sz) ||
351 (node->mask_sz < node2->mask_sz))
354 else if ((node->addr_sz > node2->addr_sz) ||
355 (node->mask_sz > node2->mask_sz))
358 rc1 = memcmp(node->addr, node2->addr, node->addr_sz);
359 rc2 = memcmp(node->mask, node2->mask, node->mask_sz);
  /external/chromium_org/content/browser/accessibility/
browser_accessibility_manager.cc 228 const AccessibilityNodeData& node2 /* = AccessibilityNodeData() */,
236 if (node2.id != AccessibilityNodeData().id)
237 nodes.push_back(node2);
browser_accessibility_manager.h 154 const AccessibilityNodeData& node2 = AccessibilityNodeData(),
  /external/chromium_org/chrome/browser/sync/glue/
bookmark_model_associator.cc 65 // before node2 in strict weak ordering.
67 const BookmarkNode* node2) const {
69 DCHECK(node2);
72 if (node1->is_folder() != node2->is_folder())
75 int result = node1->GetTitle().compare(node2->GetTitle());
79 return node1->url() < node2->url();
  /external/llvm/lib/CodeGen/
RegAllocPBQP.cpp 374 PBQP::Graph::NodeItr node2 = p->getNodeForVReg(src); local
375 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
377 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
381 if (g.getEdgeNode1(edge) == node2) {
382 std::swap(node1, node2);
  /sdk/eclipse/plugins/com.android.ide.eclipse.tests/unittests/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
CanvasViewInfoTest.java 488 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
490 MergeCookie cookie2 = new MergeCookie(node2);
518 Object cookie = (i % 2) == 0 ? node1 : node2;
540 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
542 MergeCookie cookie2 = new MergeCookie(node2);
569 Object cookie = (i % 2) == 0 ? node1 : node2;
603 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
606 ViewInfo childView2 = new ViewInfo("childView2", node2, 0, 40, 50, 60);
631 UiViewElementNode node2 = createNode(rootNode, "childNode2", false); local
635 ViewInfo childView2 = new ViewInfo("childView2", node2, 0, 40, 50, 60)
    [all...]
  /external/chromium_org/third_party/libxml/src/
xpath.c     [all...]
debugXML.c     [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/lzma/C/
Ppmd7.c 186 CPpmd7_Node *node2 = NODE(n) + nu; local
187 nu += node2->NU;
188 if (node2->Stamp != 0 || nu >= 0x10000)
190 NODE(node2->Prev)->Next = node2->Next;
191 NODE(node2->Next)->Prev = node2->Prev;
  /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);
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/layout/gle2/
DomUtilities.java 74 * @param node2 the second node to test
78 public static Node getCommonAncestor(@NonNull Node node1, @NonNull Node node2) {
79 while (node2 != null) {
81 while (current != null && current != node2) {
84 if (current == node2) {
87 node2 = node2.getParentNode();
    [all...]
  /external/chromium_org/third_party/bintrees/bintrees/
ctrees.c 67 ct_swap_data(node_t *node1, node_t *node2)
71 KEY(node1) = KEY(node2);
72 KEY(node2) = tmp;
74 VALUE(node1) = VALUE(node2);
75 VALUE(node2) = tmp;
  /external/linux-tools-perf/
builtin-kmem.c 208 int node1, node2; local
223 node2 = raw_field_value(event, "node", data);
224 if (node1 != node2)
  /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/
test_uuid.py 347 node2 = uuid.getnode()
348 self.check_node(node2, "getnode2")
350 self.assertEqual(node1, node2)
  /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/
test_uuid.py 347 node2 = uuid.getnode()
348 self.check_node(node2, "getnode2")
350 self.assertEqual(node1, node2)
  /sdk/eclipse/plugins/com.android.ide.eclipse.adt/src/com/android/ide/eclipse/adt/internal/editors/uimodel/
UiElementNode.java 758 * F.ex. "node1/node2" would find a child "node1" that contains a child "node2" and
    [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/chromium_org/sync/internal_api/
sync_manager_impl_unittest.cc     [all...]
  /external/chromium_org/third_party/libxml/src/include/libxml/
xpath.h 448 xmlNodePtr node2);

Completed in 2265 milliseconds

12 3 4