Searched defs:node0 (Results 1 - 14 of 14) sorted by relevance

/external/v8/test/unittests/compiler/
H A Dschedule-unittest.cc101 Node* node0 = Node::New(zone(), 0, &kDummyOperator, 0, nullptr, false); local
102 EXPECT_EQ(nullptr, schedule.block(node0));
103 schedule.AddNode(start, node0);
104 EXPECT_EQ(start, schedule.block(node0));
105 EXPECT_THAT(*start, ElementsAre(node0));
111 EXPECT_THAT(*start, ElementsAre(node0, node1));
113 EXPECT_TRUE(schedule.SameBasicBlock(node0, node1));
H A Dgraph-reducer-unittest.cc243 Node* node0 = graph()->NewNode(&kOpA0); local
244 Node* node1 = graph()->NewNode(&kOpA1, node0);
245 EXPECT_CALL(e, Replace(node0, node0));
247 EXPECT_FALSE(r.Reduce(node0).Changed());
262 Node* node0 = graph()->NewNode(&kOpA0); local
263 Node* node1 = graph()->NewNode(&kOpA1, node0);
264 EXPECT_CALL(e, Revisit(node0));
266 EXPECT_FALSE(r.Reduce(node0).Changed());
458 Node* node0 local
472 Node* node0 = graph()->NewNode(&kOpA0); local
482 Node* node0 = graph()->NewNode(&kOpA0); local
[all...]
/external/zopfli/src/zopfli/
H A Dkatajainen.c148 Node* node0 = GetFreeNode(0, maxbits, pool); local
150 InitNode(leaves[0].weight, 1, 0, node0);
153 lists[i][0] = node0;
/external/freetype/src/cache/
H A Dftccache.c224 ftc_node_hash_unlink( FTC_Node node0, argument
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash );
241 if ( node == node0 )
247 *pnode = node0->link;
248 node0->link = NULL;
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/
H A DbtGImpactBvh.cpp360 int node0 ,int node1, bool complete_primitive_tests)
363 boxset0->getNodeBound(node0,box0);
379 int node0, int node1, bool complete_primitive_tests)
386 node0,node1,complete_primitive_tests) ==false) return;//avoid colliding internal nodes
388 if(boxset0->isLeafNode(node0))
394 boxset0->getNodeData(node0),boxset1->getNodeData(node1));
405 node0,boxset1->getLeftNode(node1),false);
411 node0,boxset1->getRightNode(node1),false);
425 boxset0->getLeftNode(node0),node1,false);
433 boxset0->getRightNode(node0),node
375 _find_collision_pairs_recursive( btGImpactBvh * boxset0, btGImpactBvh * boxset1, btPairSet * collision_pairs, const BT_BOX_BOX_TRANSFORM_CACHE & trans_cache_1to0, int node0, int node1, bool complete_primitive_tests) argument
[all...]
H A DbtGImpactQuantizedBvh.cpp389 int node0 ,int node1, bool complete_primitive_tests)
392 boxset0->getNodeBound(node0,box0);
408 int node0, int node1, bool complete_primitive_tests)
415 node0,node1,complete_primitive_tests) ==false) return;//avoid colliding internal nodes
417 if(boxset0->isLeafNode(node0))
423 boxset0->getNodeData(node0),boxset1->getNodeData(node1));
434 node0,boxset1->getLeftNode(node1),false);
440 node0,boxset1->getRightNode(node1),false);
454 boxset0->getLeftNode(node0),node1,false);
462 boxset0->getRightNode(node0),node
404 _find_quantized_collision_pairs_recursive( const btGImpactQuantizedBvh * boxset0, const btGImpactQuantizedBvh * boxset1, btPairSet * collision_pairs, const BT_BOX_BOX_TRANSFORM_CACHE & trans_cache_1to0, int node0, int node1, bool complete_primitive_tests) argument
[all...]
H A Dgim_box_set.h494 SIMD_FORCE_INLINE void retrieve_node0_triangle(GUINT node0) argument
497 m_boxset0->getNodeTriangle(node0,m_tri0);
520 SIMD_FORCE_INLINE void retrieve_node0_info(GUINT node0) argument
522 if(node0 == current_node0) return;
523 m_boxset0->getNodeBound(node0,m_box0);
524 node0_is_leaf = m_boxset0->isLeafNode(node0);
526 current_node0 = node0;
538 SIMD_FORCE_INLINE bool node_collision(GUINT node0 ,GUINT node1)
540 retrieve_node0_info(node0);
548 retrieve_node0_triangle(node0);
591 GUINT node0 = stack_collisions.back().m_index1; local
[all...]
/external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/
H A Dftccache.c224 ftc_node_hash_unlink( FTC_Node node0, argument
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash );
241 if ( node == node0 )
247 *pnode = node0->link;
248 node0->link = NULL;
/external/v8/src/compiler/
H A Djs-inlining.cc192 Node* node0 = jsgraph_->graph()->NewNode(op0); local
201 return jsgraph_->graph()->NewNode(op, params_node, node0, node0,
230 Node* node0 = jsgraph_->graph()->NewNode(op0); local
231 return jsgraph_->graph()->NewNode(op, node0, node0, node0,
/external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/
H A DbtSoftBodyHelpers.cpp541 btSoftBody::Node *node0 = &(psb->m_nodes[0]); local
572 ar = (lr->m_n[0] - node0)/(node1 - node0);
573 br = (lr->m_n[1] - node0)/(node1 - node0);
H A DbtSoftBody.cpp131 bool btSoftBody::checkLink(int node0,int node1) const argument
133 return(checkLink(&m_nodes[node0],&m_nodes[node1]));
137 bool btSoftBody::checkLink(const Node* node0,const Node* node1) const argument
139 const Node* n[]={node0,node1};
153 bool btSoftBody::checkFace(int node0,int node1,int node2) const argument
155 const Node* n[]={ &m_nodes[node0],
271 void btSoftBody::appendLink( int node0, argument
276 appendLink(&m_nodes[node0],&m_nodes[node1],mat,bcheckexist);
280 void btSoftBody::appendLink( Node* node0, argument
285 if((!bcheckexist)||(!checkLink(node0,node
308 appendFace(int node0,int node1,int node2,Material* mat) argument
343 appendTetra(int node0, int node1, int node2, int node3, Material* mat) argument
1636 cutLink(const Node* node0,const Node* node1,btScalar position) argument
1642 cutLink(int node0,int node1,btScalar position) argument
[all...]
/external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/
H A DbtSoftBody.java3803 public boolean checkLink(int node0, int node1) { argument
3804 return SoftbodyJNI.btSoftBody_checkLink__SWIG_0(swigCPtr, this, node0, node1);
3807 public boolean checkLink(btSoftBody.Node node0, btSoftBody.Node node1) { argument
3808 return SoftbodyJNI.btSoftBody_checkLink__SWIG_1(swigCPtr, this, btSoftBody.Node.getCPtr(node0), node0, btSoftBody.Node.getCPtr(node1), node1);
3811 public boolean checkFace(int node0, int node1, int node2) { argument
3812 return SoftbodyJNI.btSoftBody_checkFace(swigCPtr, this, node0, node1, node2);
3872 public void appendLink(int node0, int node1, btSoftBody.Material mat, boolean bcheckexist) { argument
3873 SoftbodyJNI.btSoftBody_appendLink__SWIG_3(swigCPtr, this, node0, node1, btSoftBody.Material.getCPtr(mat), mat, bcheckexist);
3876 public void appendLink(int node0, in argument
3880 appendLink(int node0, int node1) argument
3884 appendLink(btSoftBody.Node node0, btSoftBody.Node node1, btSoftBody.Material mat, boolean bcheckexist) argument
3888 appendLink(btSoftBody.Node node0, btSoftBody.Node node1, btSoftBody.Material mat) argument
3892 appendLink(btSoftBody.Node node0, btSoftBody.Node node1) argument
3908 appendFace(int node0, int node1, int node2, btSoftBody.Material mat) argument
3912 appendFace(int node0, int node1, int node2) argument
3920 appendTetra(int node0, int node1, int node2, int node3, btSoftBody.Material mat) argument
3924 appendTetra(int node0, int node1, int node2, int node3) argument
4148 cutLink(int node0, int node1, float position) argument
4152 cutLink(btSoftBody.Node node0, btSoftBody.Node node1, float position) argument
[all...]
/external/dagger2/lib/
H A Dgoogle-java-format-0.1-20151017.042846-2.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/googlejavaformat/ com/google/googlejavaformat/CloseOp ...
/external/libgdx/backends/gdx-backends-gwt/libs/
H A Dgwt-dev.jarMETA-INF/ META-INF/MANIFEST.MF com/ com/google/ com/google/gwt/ com/google/gwt/core/ ...

Completed in 1866 milliseconds