/external/chromium_org/chrome/browser/sync/test/integration/ |
H A D | sync_errors_test.cc | 38 const BookmarkNode* node2 = AddFolder(0, 0, L"title2"); local 39 SetTitle(0, node2, L"new_title2"); 53 const BookmarkNode* node2 = AddFolder(0, 0, L"title2"); local 54 SetTitle(0, node2, L"new_title2"); 74 const BookmarkNode* node2 = AddFolder(0, 0, L"title2"); local 75 SetTitle(0, node2, L"new_title2"); 133 const BookmarkNode* node2 = AddFolder(0, 0, L"title2"); local 134 SetTitle(0, node2, L"new_title2");
|
/external/chromium_org/chrome/browser/bookmarks/ |
H A D | bookmark_utils_unittest.cc | 39 const BookmarkNode* node2 = model.AddURL(model.other_node(), local 59 EXPECT_TRUE(nodes[0] == node2);
|
H A D | bookmark_model_unittest.cc | 116 const BookmarkNode* node2, 120 node2_ = node2; 126 const BookmarkNode* node2, 130 EXPECT_EQ(node2_, node2); 115 Set(const BookmarkNode* node1, const BookmarkNode* node2, int index1, int index2) argument 125 ExpectEquals(const BookmarkNode* node1, const BookmarkNode* node2, int index1, int index2) argument
|
/external/apache-xml/src/main/java/org/apache/xml/utils/ |
H A D | 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) argument 234 if(node1 instanceof DOMOrder && node2 instanceof DOMOrder) 237 int index2 = ((DOMOrder) node2).getUid(); 246 return DOMHelper.isNodeAfter(node1, node2);
|
H A D | 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) argument 206 if (node1 == node2 || isNodeTheSame(node1, node2)) 213 Node parent2 = getParentOfNode(node2); 219 isNodeAfter = isNodeAfterSibling(parent1, node1, node2); 263 Node startNode1 = node1, startNode2 = node2; 339 isNodeTheSame(Node node1, Node node2) argument [all...] |
/external/libsepol/src/ |
H A D | node_record.c | 345 int sepol_node_compare2(const sepol_node_t * node, const sepol_node_t * node2) argument 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/v8/test/cctest/ |
H A D | test-profile-generator.cc | 138 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local 139 CHECK_NE(NULL, node2); 140 CHECK_NE(node1, node2); 141 CHECK_EQ(0, node2->self_ticks()); 147 CHECK_NE(node2, node3); 152 CHECK_EQ(node2, helper.Walk(&entry1, &entry2)); 155 CHECK_EQ(0, node2->self_ticks()); 166 CHECK_EQ(node2, helper.Walk(&entry1, &entry2)); 197 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local 198 CHECK_NE(NULL, node2); 274 ProfileNode* node2 = flat_helper.Walk(&entry1, &entry2); local 446 ProfileNode* node2 = top_down_test_helper.Walk(entry1, entry1); local [all...] |
/external/chromium/chrome/browser/bookmarks/ |
H A D | 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 60 Set(const BookmarkNode* node1, const BookmarkNode* node2, int index1, int index2) argument 70 AssertEquals(const BookmarkNode* node1, const BookmarkNode* node2, int index1, int index2) argument
|
/external/chromium_org/third_party/bintrees/bintrees/ |
H A D | ctrees.c | 67 ct_swap_data(node_t *node1, node_t *node2) argument 71 KEY(node1) = KEY(node2); 72 KEY(node2) = tmp; 74 VALUE(node1) = VALUE(node2); 75 VALUE(node2) = tmp;
|
/external/llvm/include/llvm/CodeGen/PBQP/ |
H A D | Graph.h | 86 NodeItr node1, node2; member in class:PBQP::Graph::EdgeEntry 92 EdgeEntry(NodeItr node1, NodeItr node2, const Matrix &costs) argument 93 : node1(node1), node2(node2), costs(costs) {} 95 NodeItr getNode2() const { return node2; }
|
/external/llvm/lib/CodeGen/ |
H A D | 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);
|
/external/lzma/C/ |
H A D | 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/v8/test/cctest/ |
H A D | test-profile-generator.cc | 161 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local 162 CHECK_NE(NULL, node2); 163 CHECK_NE(node1, node2); 164 CHECK_EQ(0, node2->total_ticks()); 165 CHECK_EQ(0, node2->self_ticks()); 171 CHECK_NE(node2, node3); 177 CHECK_EQ(node2, helper.Walk(&entry1, &entry2)); 181 CHECK_EQ(0, node2->total_ticks()); 182 CHECK_EQ(0, node2->self_ticks()); 194 CHECK_EQ(node2, helpe 231 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local 333 ProfileNode* node2 = flat_helper.Walk(&entry1, &entry2); local 478 ProfileNode* node2 = token1_helper.Walk(&entry2); local 629 ProfileNode* node2 = top_down_test_helper.Walk(entry1, entry1); local [all...] |
H A D | test-heap-profiler.cc | 484 // node6 -> node2 499 "node6.a.a.b = node6.b.a; // node1 -> node2\n" 500 "node6.b.a.a = node6.a.a; // node2 -> node1\n" 501 "node6.b.a.b = node6.b.b; // node2 -> node3\n" 502 "node6.b.b.a = node6.b.a; // node3 -> node2\n" 522 const v8::HeapGraphNode* node2 = local 524 CHECK_NE(NULL, node2); 530 CHECK_EQ(node6, node2->GetDominatorNode());
|
/external/chromium_org/third_party/libxml/src/ |
H A D | xpointer.c | 209 * @node2: the second 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/libxml2/ |
H A D | xpointer.c | 209 * @node2: the second 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/linux-tools-perf/ |
H A D | builtin-kmem.c | 208 int node1, node2; local 223 node2 = raw_field_value(event, "node", data); 224 if (node1 != node2)
|
/external/chromium_org/sync/engine/ |
H A D | syncer_unittest.cc | 4116 syncable::Id node2 = ids_.NewServerId(); local 4125 mock_server_->AddUpdateDirectory(node2, ids_.root(), "two", 1, 20, 4137 Entry n2(&trans, GET_BY_ID, node2); 4145 syncable::Id node2 = ids_.NewServerId(); local 4160 mock_server_->AddUpdateDirectory(node2, ids_.root(), "two", 1, 20, 4173 Entry n2(&trans, GET_BY_ID, node2);
|
/external/opencv/cv/src/ |
H A D | 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 [all...] |
/external/opencv/cxcore/src/ |
H A D | cxdatastructs.cpp | 2672 CvPTreeNode* node2 = (CvPTreeNode*)reader.ptr; local 2674 if( node2->element && node2 != node && 2675 is_equal( node->element, node2->element, userdata )) 2677 CvPTreeNode* root2 = node2; 2695 // Compress path from node2 to the root: 2696 while( node2->parent ) 2698 CvPTreeNode* temp = node2; 2699 node2 = node2 [all...] |
/external/chromium_org/third_party/angle/src/compiler/ |
H A D | intermediate.h | 244 TIntermNode* node2; member in struct:TIntermNodePair
|
/external/srec/srec/crec/ |
H A D | srec_context.c | 1576 FSMnode_t *node, *node2, *node3; local 1611 node node2 node3 node4 1631 node2 = &fst->FSMnode_list[ni2]; 1632 arc2 = &fst->FSMarc_list[ node2->un_ptr.first_next_arc];
|
/external/chromium_org/third_party/WebKit/Source/core/testing/ |
H A D | Internals.cpp | 440 unsigned short Internals::compareTreeScopePosition(const Node* node1, const Node* node2, ExceptionState& exceptionState) const argument 442 if (!node1 || !node2) { 448 const TreeScope* treeScope2 = node2->isDocumentNode() ? static_cast<const TreeScope*>(toDocument(node2)) : 449 node2->isShadowRoot() ? static_cast<const TreeScope*>(toShadowRoot(node2)) : 0;
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 2583 DomTreeNodeT *node2 = postDomTree->getNode(blk2); local 2589 if (node2 == NULL && blk2->succ_size() == 1) { 2593 if (node1 == NULL || node2 == NULL) { 2599 if (postDomTree->dominates(node1, node2)) {
|
/external/mesa3d/src/gallium/drivers/radeon/ |
H A D | AMDILCFGStructurizer.cpp | 2583 DomTreeNodeT *node2 = postDomTree->getNode(blk2); local 2589 if (node2 == NULL && blk2->succ_size() == 1) { 2593 if (node1 == NULL || node2 == NULL) { 2599 if (postDomTree->dominates(node1, node2)) {
|