Searched defs:node1 (Results 1 - 25 of 36) sorted by relevance

12

/external/chromium_org/chrome/browser/sync/test/integration/
H A Dsync_errors_test.cc32 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local
33 SetTitle(0, node1, L"new_title1");
47 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local
48 SetTitle(0, node1, L"new_title1");
62 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local
63 SetTitle(0, node1, L"new_title1");
121 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local
122 SetTitle(0, node1, L"new_title1");
156 const BookmarkNode* node1 = AddFolder(0, 0, L"title1"); local
157 SetTitle(0, node1,
[all...]
/external/chromium_org/chrome/browser/bookmarks/
H A Dbookmark_utils_unittest.cc35 const BookmarkNode* node1 = model.AddURL(model.other_node(), local
53 EXPECT_TRUE(nodes[1] == node1);
65 EXPECT_TRUE(nodes[0] == node1);
H A Dbookmark_model_unittest.cc115 void Set(const BookmarkNode* node1, argument
119 node1_ = node1;
125 void ExpectEquals(const BookmarkNode* node1, argument
129 EXPECT_EQ(node1_, node1);
/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/clang/test/SemaCXX/
H A Darrow-operator.cpp35 Node** node1; local
36 Line_Segment(node1->Location()); // expected-error {{not a structure or union}}
/external/chromium_org/content/browser/accessibility/
H A Dbrowser_accessibility_manager.cc239 const AccessibilityNodeData& node1,
247 nodes.push_back(node1);
238 UpdateNodesForTesting( const AccessibilityNodeData& node1, const AccessibilityNodeData& node2 , const AccessibilityNodeData& node3 , const AccessibilityNodeData& node4 , const AccessibilityNodeData& node5 , const AccessibilityNodeData& node6 , const AccessibilityNodeData& node7 ) argument
/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/chromium_org/v8/test/cctest/
H A Dtest-profile-generator.cc133 ProfileNode* node1 = helper.Walk(&entry1); local
134 CHECK_NE(NULL, node1);
135 CHECK_EQ(0, node1->self_ticks());
140 CHECK_NE(node1, node2);
146 CHECK_NE(node1, node3);
151 CHECK_EQ(node1, helper.Walk(&entry1));
154 CHECK_EQ(0, node1->self_ticks());
163 CHECK_EQ(node1, helper.Walk(&entry1));
192 ProfileNode* node1 = helper.Walk(&entry1); local
193 CHECK_NE(NULL, node1);
252 ProfileNode* node1 = single_child_helper.Walk(&entry1); local
443 ProfileNode* node1 = top_down_test_helper.Walk(entry1); local
[all...]
/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/chromium_org/chrome/browser/sync/glue/
H A Dbookmark_model_associator.cc64 // Compares the two given nodes and returns whether node1 should appear
66 bool operator()(const BookmarkNode* node1, argument
68 DCHECK(node1);
72 if (node1->is_folder() != node2->is_folder())
73 return node1->is_folder();
75 int result = node1->GetTitle().compare(node2->GetTitle());
79 return node1->url() < node2->url();
/external/chromium_org/third_party/bintrees/bintrees/
H A Dctrees.c67 ct_swap_data(node_t *node1, node_t *node2) argument
70 tmp = KEY(node1);
71 KEY(node1) = KEY(node2);
73 tmp = VALUE(node1);
74 VALUE(node1) = VALUE(node2);
/external/llvm/include/llvm/CodeGen/PBQP/
H A DGraph.h86 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) {}
94 NodeItr getNode1() const { return node1; }
/external/llvm/lib/CodeGen/
H A DRegAllocPBQP.cpp373 PBQP::Graph::NodeItr node1 = p->getNodeForVReg(dst); local
375 PBQP::Graph::EdgeItr edge = g.findEdge(node1, node2);
377 edge = g.addEdge(node1, node2, PBQP::Matrix(allowed1->size() + 1,
382 std::swap(node1, node2);
/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/chromium_org/third_party/libxml/src/
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/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/libxml2/
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/linux-tools-perf/
H A Dbuiltin-kmem.c208 int node1, node2; local
222 node1 = cpunode_map[cpu];
224 if (node1 != node2)
/external/chromium_org/sync/engine/
H A Dsyncer_unittest.cc4115 syncable::Id node1 = ids_.NewServerId(); local
4119 mock_server_->AddUpdateDirectory(node1, ids_.root(), "one", 1, 10,
4133 Entry n1(&trans, GET_BY_ID, node1);
4144 syncable::Id node1 = ids_.NewServerId(); local
4154 mock_server_->AddUpdateDirectory(node1, ids_.root(), "one", 1, 10,
4168 Entry n1(&trans, GET_BY_ID, 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/chromium_org/third_party/angle/src/compiler/
H A Dintermediate.h243 TIntermNode* node1; member in struct:TIntermNodePair
/external/chromium_org/third_party/WebKit/Source/core/testing/
H A DInternals.cpp440 unsigned short Internals::compareTreeScopePosition(const Node* node1, const Node* node2, ExceptionState& exceptionState) const argument
442 if (!node1 || !node2) {
446 const TreeScope* treeScope1 = node1->isDocumentNode() ? static_cast<const TreeScope*>(toDocument(node1)) :
447 node1->isShadowRoot() ? static_cast<const TreeScope*>(toShadowRoot(node1)) : 0;
/external/chromium_org/third_party/mesa/src/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...]

Completed in 899 milliseconds

12