Searched defs:node2 (Results 1 - 25 of 35) sorted by relevance

12

/external/v8/test/unittests/compiler/
H A Dstate-values-utils-unittest.cc141 Node* node2 = builder.GetNodeForValues( local
145 EXPECT_EQ(node1, node2);
H A Dmachine-operator-reducer-unittest.cc727 Node* node2 = graph()->NewNode(machine()->Word32Or(), shr_l, shl_l); local
728 Reduction reduction2 = Reduce(node2);
730 EXPECT_EQ(reduction2.replacement(), node2);
770 Node* node2 = graph()->NewNode(machine()->Word32Or(), shr, shl); local
771 Reduction reduction2 = Reduce(node2);
773 EXPECT_EQ(reduction2.replacement(), node2);
H A Dgraph-reducer-unittest.cc460 Node* node2 = graph()->NewNode(&kOpA1, node0); local
462 EXPECT_CALL(r, Reduce(node1)).WillOnce(Return(Reducer::Replace(node2)));
466 EXPECT_FALSE(node2->IsDead());
/external/apache-xml/src/main/java/org/apache/xml/utils/
H A DDOM2Helper.java212 * 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 &lt;= 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 DDOMHelper.java187 * 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 &lt;= 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/snakeyaml/src/test/java/org/pyyaml/
H A DPyStructureTest.java124 private void compareNodes(Node node1, Node node2) { argument
125 assertEquals(node1.getClass(), node2.getClass());
128 ScalarNode scalar2 = (ScalarNode) node2;
134 SequenceNode seq2 = (SequenceNode) node2;
144 MappingNode seq2 = (MappingNode) node2;
/external/webrtc/webrtc/modules/rtp_rtcp/source/
H A Dvp8_partition_aggregator_unittest.cc23 PartitionTreeNode* node2 = local
26 delete node2;
/external/llvm/lib/Target/AArch64/
H A DAArch64PBQPRegAlloc.cpp175 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(Ra); local
180 &G.getNodeMetadata(node2).getAllowedRegs();
182 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
203 G.addEdge(node1, node2, std::move(costs));
207 if (G.getEdgeNode1Id(edge) == node2) {
208 std::swap(node1, node2);
274 PBQPRAGraph::NodeId node2 = G.getMetadata().getNodeIdForVReg(r); local
276 &G.getNodeMetadata(node2).getAllowedRegs();
278 PBQPRAGraph::EdgeId edge = G.findEdge(node1, node2);
284 if (G.getEdgeNode1Id(edge) == node2) {
[all...]
/external/selinux/libsepol/src/
H A Dnode_record.c345 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/v8/test/cctest/compiler/
H A Dtest-js-constant-cache.cc249 Node* node2 = T.Constant(num); local
251 CHECK_EQ(node1, node2);
/external/guava/guava/src/com/google/common/util/concurrent/
H A DCycleDetectingLockFactory.java527 ExampleStackTrace(LockGraphNode node1, LockGraphNode node2) { argument
528 super(node1.getLockName() + " -> " + node2.getLockName());
575 LockGraphNode node2,
577 super(node1, node2);
573 PotentialDeadlockException( LockGraphNode node1, LockGraphNode node2, ExampleStackTrace conflictingStackTrace) argument
/external/v8/test/cctest/
H A Dtest-profile-generator.cc144 ProfileNode* node2 = helper.Walk(&entry1, &entry2); local
145 CHECK(node2);
146 CHECK_NE(node1, node2);
147 CHECK_EQ(0u, node2->self_ticks());
153 CHECK_NE(node2, node3);
158 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
161 CHECK_EQ(0u, node2->self_ticks());
172 CHECK_EQ(node2, helper.Walk(&entry1, &entry2));
221 ProfileNode* node2 = flat_helper.Walk(&entry1, &entry2); local
222 CHECK(node2);
392 ProfileNode* node2 = top_down_test_helper.Walk(entry1, entry1); local
[all...]
H A Dtest-heap-profiler.cc2985 auto node2 = FindAllocationProfileNode(*profile, ArrayVector(names2)); local
2986 CHECK(node2);
/external/lzma/C/
H A DPpmd7.c188 CPpmd7_Node *node2 = NODE(n) + nu; local
189 nu += node2->NU;
190 if (node2->Stamp != 0 || nu >= 0x10000)
192 NODE(node2->Prev)->Next = node2->Next;
193 NODE(node2->Next)->Prev = node2->Prev;
/external/freetype/src/truetype/
H A Dttgload.c1676 FT_ListNode node, node2; local
1689 for ( node2 = node; node2; node2 = node2->next )
1690 node2->data = (void*)ULONG_MAX;
/external/libxml2/
H A Dxpointer.c209 * @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));
H A Dxpath.c142 * @node2: the second node
151 xmlXPathCmpNodesExt(xmlNodePtr node1, xmlNodePtr node2) { argument
158 if ((node1 == NULL) || (node2 == NULL))
161 if (node1 == node2)
169 if (node2->type == XML_ELEMENT_NODE) {
171 (0 > (long) node2->content) &&
172 (node1->doc == node2->doc))
175 l2 = -((long) node2->content);
238 switch (node2->type) {
243 miscNode2 = node2;
3274 xmlXPathCmpNodes(xmlNodePtr node1, xmlNodePtr node2) argument
[all...]
/external/opencv/cv/src/
H A Dcvhistogram.cpp516 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 Dcxdatastructs.cpp2672 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/v8/src/compiler/
H A Descape-analysis.cc405 bool IsEquivalentPhi(Node* node1, Node* node2) { argument
406 if (node1 == node2) return true;
407 if (node1->opcode() != IrOpcode::kPhi || node2->opcode() != IrOpcode::kPhi ||
408 node1->op()->ValueInputCount() != node2->op()->ValueInputCount()) {
413 Node* input2 = NodeProperties::GetValueInput(node2, i);
/external/libxml2/python/
H A Dlibxml.c3787 xmlNodePtr node1, node2; local
3794 node2 = PyxmlNode_Get(py_node2);
3795 if ( node1 == node2 )
/external/dng_sdk/source/
H A Ddng_image_writer.cpp3394 LZWCompressorNode *node2 = &fTable [nextCode]; local
3411 node2->final = (int16) k;
3412 node2->son0 = -1;
3413 node2->son1 = -1;
3414 node2->brother = (int16) oldSon;
/external/mesa3d/src/gallium/drivers/radeon/
H A DAMDILCFGStructurizer.cpp2583 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/opencv/cvaux/src/
H A Dcvlee.cpp106 CvVoronoiNodeInt* node2; member in struct:CvVoronoiSiteInt
117 CvVoronoiNodeInt* node2; member in struct:CvVoronoiEdgeInt
1786 while(pSite->prev_site->node1 == pSite->prev_site->node2)\
1798 if(!pEdge || !pEdge->node1 || !pEdge->node2)
1817 pNode2->pt.x = pEdge->node2->node.x;
1818 pNode2->pt.y = pEdge->node2->node.y;
1819 pNode2->radius = pEdge->node2->radius;
1883 if(pSite->node1 == pSite->node2 && pSite != pSite->next_site && pNewEdge1->node[0] != pNewEdge1->node[1])
1976 while(pSite->next_site->node1 == pSite->next_site->node2)\
1989 if(!pEdge || !pEdge->node1 || !pEdge->node2)
[all...]
/external/selinux/libsepol/cil/src/
H A Dcil_binary.c1065 ebitmap_node_t *node1, *node2; local
1086 ebitmap_for_each_bit(&tgt_bitmap, node2, j) {
1126 ebitmap_node_t *node1, *node2; local
1159 ebitmap_for_each_bit(&tgt_bitmap, node2, j) {
2241 ebitmap_node_t *node1, *node2; local
2256 ebitmap_for_each_bit(&tgt_bitmap, node2, j) {
2941 ebitmap_node_t *node1, *node2; local
2960 ebitmap_for_each_bit(&tgt_bitmap, node2, j) {

Completed in 832 milliseconds

12