Bullet Collision Detection & Physics Library
btCollisionDispatcherMt.cpp
Go to the documentation of this file.
1 /*
2 Bullet Continuous Collision Detection and Physics Library
3 Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/
4 
5 This software is provided 'as-is', without any express or implied warranty.
6 In no event will the authors be held liable for any damages arising from the use of this software.
7 Permission is granted to anyone to use this software for any purpose,
8 including commercial applications, and to alter it and redistribute it freely,
9 subject to the following restrictions:
10 
11 1. The origin of this software must not be misrepresented; you must not claim that you wrote the original software. If you use this software in a product, an acknowledgment in the product documentation would be appreciated but is not required.
12 2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
13 3. This notice may not be removed or altered from any source distribution.
14 */
15 
16 
17 
19 #include "LinearMath/btQuickprof.h"
20 
22 
29 
30 
32  : btCollisionDispatcher( config )
33 {
34  m_batchUpdating = false;
35  m_grainSize = grainSize; // iterations per task
36 }
37 
38 
40 {
41  //optional relative contact breaking threshold, turned on by default (use setDispatcherFlags to switch off feature for improved performance)
42 
46 
47  btScalar contactProcessingThreshold = btMin( body0->getContactProcessingThreshold(), body1->getContactProcessingThreshold() );
48 
50  if ( NULL == mem )
51  {
52  //we got a pool memory overflow, by default we fallback to dynamically allocate memory. If we require a contiguous contact pool then assert.
54  {
55  mem = btAlignedAlloc( sizeof( btPersistentManifold ), 16 );
56  }
57  else
58  {
59  btAssert( 0 );
60  //make sure to increase the m_defaultMaxPersistentManifoldPoolSize in the btDefaultCollisionConstructionInfo/btDefaultCollisionConfiguration
61  return 0;
62  }
63  }
64  btPersistentManifold* manifold = new( mem ) btPersistentManifold( body0, body1, 0, contactBreakingThreshold, contactProcessingThreshold );
65  if ( !m_batchUpdating )
66  {
67  // batch updater will update manifold pointers array after finishing, so
68  // only need to update array when not batch-updating
69  //btAssert( !btThreadsAreRunning() );
70  manifold->m_index1a = m_manifoldsPtr.size();
71  m_manifoldsPtr.push_back( manifold );
72  }
73 
74  return manifold;
75 }
76 
78 {
79  clearManifold( manifold );
80  //btAssert( !btThreadsAreRunning() );
81  if ( !m_batchUpdating )
82  {
83  // batch updater will update manifold pointers array after finishing, so
84  // only need to update array when not batch-updating
85  int findIndex = manifold->m_index1a;
86  btAssert( findIndex < m_manifoldsPtr.size() );
87  m_manifoldsPtr.swap( findIndex, m_manifoldsPtr.size() - 1 );
88  m_manifoldsPtr[ findIndex ]->m_index1a = findIndex;
90  }
91 
92  manifold->~btPersistentManifold();
94  {
96  }
97  else
98  {
99  btAlignedFree( manifold );
100  }
101 }
102 
104 {
109 
111  {
112  mPairArray = NULL;
113  mCallback = NULL;
114  mDispatcher = NULL;
115  mInfo = NULL;
116  }
117  void forLoop( int iBegin, int iEnd ) const
118  {
119  for ( int i = iBegin; i < iEnd; ++i )
120  {
121  btBroadphasePair* pair = &mPairArray[ i ];
122  mCallback( *pair, *mDispatcher, *mInfo );
123  }
124  }
125 };
126 
127 
129 {
130  int pairCount = pairCache->getNumOverlappingPairs();
131  if ( pairCount == 0 )
132  {
133  return;
134  }
136  updater.mCallback = getNearCallback();
137  updater.mPairArray = pairCache->getOverlappingPairArrayPtr();
138  updater.mDispatcher = this;
139  updater.mInfo = &info;
140 
141  m_batchUpdating = true;
142  btParallelFor( 0, pairCount, m_grainSize, updater );
143  m_batchUpdating = false;
144 
145  // reconstruct the manifolds array to ensure determinism
147 
148  btBroadphasePair* pairs = pairCache->getOverlappingPairArrayPtr();
149  for ( int i = 0; i < pairCount; ++i )
150  {
151  if (btCollisionAlgorithm* algo = pairs[ i ].m_algorithm)
152  {
153  algo->getAllContactManifolds( m_manifoldsPtr );
154  }
155  }
156 
157  // update the indices (used when releasing manifolds)
158  for ( int i = 0; i < m_manifoldsPtr.size(); ++i )
159  {
160  m_manifoldsPtr[ i ]->m_index1a = i;
161  }
162 }
163 
164 
void forLoop(int iBegin, int iEnd) const
btPersistentManifold is a contact point cache, it stays persistent as long as objects are overlapping...
void(* btNearCallback)(btBroadphasePair &collisionPair, btCollisionDispatcher &dispatcher, const btDispatcherInfo &dispatchInfo)
user can override this nearcallback for collision filtering and more finegrained control over collisi...
void push_back(const T &_Val)
btCollisionDispatcherMt(btCollisionConfiguration *config, int grainSize=40)
btCollisionDispatcher * mDispatcher
void resizeNoInitialize(int newsize)
resize changes the number of elements in the array.
#define btAssert(x)
Definition: btScalar.h:131
btCollisionConfiguration allows to configure Bullet collision detection stack allocator size...
virtual btPersistentManifold * getNewManifold(const btCollisionObject *body0, const btCollisionObject *body1) BT_OVERRIDE
btCollisionDispatcher supports algorithms that handle ConvexConvex and ConvexConcave collision pairs...
btScalar getContactProcessingThreshold() const
bool validPtr(void *ptr)
void swap(int index0, int index1)
The btOverlappingPairCache provides an interface for overlapping pair management (add, remove, storage), used by the btBroadphaseInterface broadphases.
int size() const
return the number of elements in the array
btAlignedObjectArray< btPersistentManifold * > m_manifoldsPtr
virtual btScalar getContactBreakingThreshold(btScalar defaultContactThresholdFactor) const
#define btAlignedFree(ptr)
btCollisionObject can be used to manage collision detection objects.
virtual void clearManifold(btPersistentManifold *manifold)
virtual void releaseManifold(btPersistentManifold *manifold) BT_OVERRIDE
virtual int getNumOverlappingPairs() const =0
void * allocate(int size)
#define btAlignedAlloc(size, alignment)
virtual void dispatchAllCollisionPairs(btOverlappingPairCache *pairCache, const btDispatcherInfo &info, btDispatcher *dispatcher) BT_OVERRIDE
void btParallelFor(int iBegin, int iEnd, int grainSize, const btIParallelForBody &body)
Definition: btThreads.cpp:429
void freeMemory(void *ptr)
virtual btBroadphasePair * getOverlappingPairArrayPtr()=0
btNearCallback getNearCallback() const
The btDispatcher interface class can be used in combination with broadphase to dispatch calculations ...
Definition: btDispatcher.h:77
const T & btMin(const T &a, const T &b)
Definition: btMinMax.h:23
btCollisionAlgorithm is an collision interface that is compatible with the Broadphase and btDispatche...
const btCollisionShape * getCollisionShape() const
btPoolAllocator * m_persistentManifoldPoolAllocator
btScalar gContactBreakingThreshold
float btScalar
The btScalar type abstracts floating point numbers, to easily switch between double and single floati...
Definition: btScalar.h:292
The btBroadphasePair class contains a pair of aabb-overlapping objects.