| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletCollision/Gimpact/ |
| D | gim_box_set.h | 494 SIMD_FORCE_INLINE void retrieve_node0_triangle(GUINT node0) in retrieve_node0_triangle() argument
497 m_boxset0->getNodeTriangle(node0,m_tri0); in retrieve_node0_triangle()
520 SIMD_FORCE_INLINE void retrieve_node0_info(GUINT node0) in retrieve_node0_info() argument
522 if(node0 == current_node0) return; in retrieve_node0_info()
523 m_boxset0->getNodeBound(node0,m_box0); in retrieve_node0_info()
524 node0_is_leaf = m_boxset0->isLeafNode(node0); in retrieve_node0_info()
526 current_node0 = node0; in retrieve_node0_info()
538 SIMD_FORCE_INLINE bool node_collision(GUINT node0 ,GUINT node1) in node_collision() argument
540 retrieve_node0_info(node0); in node_collision()
548 retrieve_node0_triangle(node0); in node_collision()
[all …]
|
| D | btGImpactBvh.cpp | 360 int node0 ,int node1, bool complete_primitive_tests) in _node_collision() argument
363 boxset0->getNodeBound(node0,box0); in _node_collision()
379 int node0, int node1, bool complete_primitive_tests) in _find_collision_pairs_recursive() argument
386 node0,node1,complete_primitive_tests) ==false) return;//avoid colliding internal nodes in _find_collision_pairs_recursive()
388 if(boxset0->isLeafNode(node0)) in _find_collision_pairs_recursive()
394 boxset0->getNodeData(node0),boxset1->getNodeData(node1)); in _find_collision_pairs_recursive()
405 node0,boxset1->getLeftNode(node1),false); in _find_collision_pairs_recursive()
411 node0,boxset1->getRightNode(node1),false); in _find_collision_pairs_recursive()
425 boxset0->getLeftNode(node0),node1,false); in _find_collision_pairs_recursive()
433 boxset0->getRightNode(node0),node1,false); in _find_collision_pairs_recursive()
[all …]
|
| D | btGImpactQuantizedBvh.cpp | 389 int node0 ,int node1, bool complete_primitive_tests) in _quantized_node_collision() argument
392 boxset0->getNodeBound(node0,box0); in _quantized_node_collision()
408 int node0, int node1, bool complete_primitive_tests) in _find_quantized_collision_pairs_recursive() argument
415 node0,node1,complete_primitive_tests) ==false) return;//avoid colliding internal nodes in _find_quantized_collision_pairs_recursive()
417 if(boxset0->isLeafNode(node0)) in _find_quantized_collision_pairs_recursive()
423 boxset0->getNodeData(node0),boxset1->getNodeData(node1)); in _find_quantized_collision_pairs_recursive()
434 node0,boxset1->getLeftNode(node1),false); in _find_quantized_collision_pairs_recursive()
440 node0,boxset1->getRightNode(node1),false); in _find_quantized_collision_pairs_recursive()
454 boxset0->getLeftNode(node0),node1,false); in _find_quantized_collision_pairs_recursive()
462 boxset0->getRightNode(node0),node1,false); in _find_quantized_collision_pairs_recursive()
[all …]
|
| /external/v8/test/unittests/compiler/ |
| D | graph-reducer-unittest.cc | 243 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F() local
244 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
245 EXPECT_CALL(e, Replace(node0, node0)); in TEST_F()
247 EXPECT_FALSE(r.Reduce(node0).Changed()); in TEST_F()
262 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F() local
263 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
264 EXPECT_CALL(e, Revisit(node0)); in TEST_F()
266 EXPECT_FALSE(r.Reduce(node0).Changed()); in TEST_F()
458 Node* node0 = graph()->NewNode(&kOpA0); in TEST_F() local
459 Node* node1 = graph()->NewNode(&kOpA1, node0); in TEST_F()
[all …]
|
| D | schedule-unittest.cc | 101 Node* node0 = Node::New(zone(), 0, &kDummyOperator, 0, nullptr, false); in TEST_F() local
102 EXPECT_EQ(nullptr, schedule.block(node0)); in TEST_F()
103 schedule.AddNode(start, node0); in TEST_F()
104 EXPECT_EQ(start, schedule.block(node0)); in TEST_F()
105 EXPECT_THAT(*start, ElementsAre(node0)); in TEST_F()
111 EXPECT_THAT(*start, ElementsAre(node0, node1)); in TEST_F()
113 EXPECT_TRUE(schedule.SameBasicBlock(node0, node1)); in TEST_F()
|
| /external/libgdx/extensions/gdx-freetype/jni/freetype-2.6.2/src/cache/ |
| D | ftccache.c | 224 ftc_node_hash_unlink( FTC_Node node0, in ftc_node_hash_unlink() argument
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash ); in ftc_node_hash_unlink()
241 if ( node == node0 ) in ftc_node_hash_unlink()
247 *pnode = node0->link; in ftc_node_hash_unlink()
248 node0->link = NULL; in ftc_node_hash_unlink()
|
| /external/freetype/src/cache/ |
| D | ftccache.c | 224 ftc_node_hash_unlink( FTC_Node node0, in ftc_node_hash_unlink() argument
227 FTC_Node *pnode = FTC_NODE__TOP_FOR_HASH( cache, node0->hash ); in ftc_node_hash_unlink()
241 if ( node == node0 ) in ftc_node_hash_unlink()
247 *pnode = node0->link; in ftc_node_hash_unlink()
248 node0->link = NULL; in ftc_node_hash_unlink()
|
| /external/libgdx/extensions/gdx-bullet/jni/src/bullet/BulletSoftBody/ |
| D | btSoftBody.h | 710 bool checkLink( int node0,
712 bool checkLink( const Node* node0,
715 bool checkFace( int node0,
741 void appendLink( int node0,
745 void appendLink( Node* node0,
751 void appendFace( int node0,
757 void appendTetra(int node0,
861 bool cutLink(int node0,int node1,btScalar position);
862 bool cutLink(const Node* node0,const Node* node1,btScalar position);
|
| D | btSoftBody.cpp | 131 bool btSoftBody::checkLink(int node0,int node1) const in checkLink() argument
133 return(checkLink(&m_nodes[node0],&m_nodes[node1])); in checkLink()
137 bool btSoftBody::checkLink(const Node* node0,const Node* node1) const in checkLink() argument
139 const Node* n[]={node0,node1}; in checkLink()
153 bool btSoftBody::checkFace(int node0,int node1,int node2) const in checkFace() argument
155 const Node* n[]={ &m_nodes[node0], in checkFace()
271 void btSoftBody::appendLink( int node0, in appendLink() argument
276 appendLink(&m_nodes[node0],&m_nodes[node1],mat,bcheckexist); in appendLink()
280 void btSoftBody::appendLink( Node* node0, in appendLink() argument
285 if((!bcheckexist)||(!checkLink(node0,node1))) in appendLink()
[all …]
|
| D | btSoftBodyHelpers.cpp | 541 btSoftBody::Node *node0 = &(psb->m_nodes[0]); in ReoptimizeLinkOrder() local
572 ar = (lr->m_n[0] - node0)/(node1 - node0); in ReoptimizeLinkOrder()
573 br = (lr->m_n[1] - node0)/(node1 - node0); in ReoptimizeLinkOrder()
|
| /external/zopfli/src/zopfli/ |
| D | katajainen.c | 148 Node* node0 = GetFreeNode(0, maxbits, pool); in InitLists() local
150 InitNode(leaves[0].weight, 1, 0, node0); in InitLists()
153 lists[i][0] = node0; in InitLists()
|
| /external/libgdx/extensions/gdx-bullet/jni/swig-src/softbody/com/badlogic/gdx/physics/bullet/softbody/ |
| D | btSoftBody.java | 3803 public boolean checkLink(int node0, int node1) { in checkLink() argument
3804 return SoftbodyJNI.btSoftBody_checkLink__SWIG_0(swigCPtr, this, node0, node1); in checkLink()
3807 public boolean checkLink(btSoftBody.Node node0, btSoftBody.Node node1) { in checkLink() argument
3808 ….btSoftBody_checkLink__SWIG_1(swigCPtr, this, btSoftBody.Node.getCPtr(node0), node0, btSoftBody.No… in checkLink()
3811 public boolean checkFace(int node0, int node1, int node2) { in checkFace() argument
3812 return SoftbodyJNI.btSoftBody_checkFace(swigCPtr, this, node0, node1, node2); in checkFace()
3872 public void appendLink(int node0, int node1, btSoftBody.Material mat, boolean bcheckexist) { in appendLink() argument
3873 …SoftbodyJNI.btSoftBody_appendLink__SWIG_3(swigCPtr, this, node0, node1, btSoftBody.Material.getCPt… in appendLink()
3876 public void appendLink(int node0, int node1, btSoftBody.Material mat) { in appendLink() argument
3877 …SoftbodyJNI.btSoftBody_appendLink__SWIG_4(swigCPtr, this, node0, node1, btSoftBody.Material.getCPt… in appendLink()
[all …]
|
| /external/v8/src/compiler/ |
| D | js-inlining.cc | 252 Node* node0 = jsgraph_->graph()->NewNode(op0); in CreateArtificialFrameState() local
261 return jsgraph_->graph()->NewNode(op, params_node, node0, node0, in CreateArtificialFrameState()
|