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 https://bulletphysics.org
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 
17 #include "LinearMath/btQuickprof.h"
18 
20 
27 
29  : btCollisionDispatcher(config)
30 {
31  m_batchManifoldsPtr.resize(btGetTaskScheduler()->getNumThreads());
32  m_batchReleasePtr.resize(btGetTaskScheduler()->getNumThreads());
33 
34  m_batchUpdating = false;
35  m_grainSize = grainSize; // iterations per task
36 }
37 
39 {
40  //optional relative contact breaking threshold, turned on by default (use setDispatcherFlags to switch off feature for improved performance)
41 
44 
45  btScalar contactProcessingThreshold = btMin(body0->getContactProcessingThreshold(), body1->getContactProcessingThreshold());
46 
48  if (NULL == mem)
49  {
50  //we got a pool memory overflow, by default we fallback to dynamically allocate memory. If we require a contiguous contact pool then assert.
52  {
53  mem = btAlignedAlloc(sizeof(btPersistentManifold), 16);
54  }
55  else
56  {
57  btAssert(0);
58  //make sure to increase the m_defaultMaxPersistentManifoldPoolSize in the btDefaultCollisionConstructionInfo/btDefaultCollisionConfiguration
59  return 0;
60  }
61  }
62  btPersistentManifold* manifold = new (mem) btPersistentManifold(body0, body1, 0, contactBreakingThreshold, contactProcessingThreshold);
63  if (!m_batchUpdating)
64  {
65  // batch updater will update manifold pointers array after finishing, so
66  // only need to update array when not batch-updating
67  //btAssert( !btThreadsAreRunning() );
68  manifold->m_index1a = m_manifoldsPtr.size();
69  m_manifoldsPtr.push_back(manifold);
70  }
71  else
72  {
74  }
75 
76  return manifold;
77 }
78 
80 {
81  //btAssert( !btThreadsAreRunning() );
82 
83  if (!m_batchUpdating)
84  {
85  clearManifold(manifold);
86  // batch updater will update manifold pointers array after finishing, so
87  // only need to update array when not batch-updating
88  int findIndex = manifold->m_index1a;
89  btAssert(findIndex < m_manifoldsPtr.size());
90  m_manifoldsPtr.swap(findIndex, m_manifoldsPtr.size() - 1);
91  m_manifoldsPtr[findIndex]->m_index1a = findIndex;
93  } else {
95  return;
96  }
97 
98  manifold->~btPersistentManifold();
100  {
102  }
103  else
104  {
105  btAlignedFree(manifold);
106  }
107 }
108 
110 {
115 
117  {
118  mPairArray = NULL;
119  mCallback = NULL;
120  mDispatcher = NULL;
121  mInfo = NULL;
122  }
123  void forLoop(int iBegin, int iEnd) const
124  {
125  for (int i = iBegin; i < iEnd; ++i)
126  {
127  btBroadphasePair* pair = &mPairArray[i];
128  mCallback(*pair, *mDispatcher, *mInfo);
129  }
130  }
131 };
132 
134 {
135  const int pairCount = pairCache->getNumOverlappingPairs();
136  if (pairCount == 0)
137  {
138  return;
139  }
141  updater.mCallback = getNearCallback();
142  updater.mPairArray = pairCache->getOverlappingPairArrayPtr();
143  updater.mDispatcher = this;
144  updater.mInfo = &info;
145 
146  m_batchUpdating = true;
147  btParallelFor(0, pairCount, m_grainSize, updater);
148  m_batchUpdating = false;
149 
150  // merge new manifolds, if any
151  for (int i = 0; i < m_batchManifoldsPtr.size(); ++i)
152  {
154 
155  for (int j = 0; j < batchManifoldsPtr.size(); ++j)
156  {
157  m_manifoldsPtr.push_back(batchManifoldsPtr[j]);
158  }
159 
160  batchManifoldsPtr.resizeNoInitialize(0);
161  }
162 
163  // remove batched remove manifolds.
164  for (int i = 0; i < m_batchReleasePtr.size(); ++i)
165  {
167  for (int j = 0; j < batchManifoldsPtr.size(); ++j)
168  {
169  releaseManifold(batchManifoldsPtr[j]);
170  }
171  batchManifoldsPtr.resizeNoInitialize(0);
172  }
173 
174  // update the indices (used when releasing manifolds)
175  for (int i = 0; i < m_manifoldsPtr.size(); ++i)
176  {
177  m_manifoldsPtr[i]->m_index1a = i;
178  }
179 }
#define btAlignedFree(ptr)
#define btAlignedAlloc(size, alignment)
void(* btNearCallback)(btBroadphasePair &collisionPair, btCollisionDispatcher &dispatcher, const btDispatcherInfo &dispatchInfo)
user can override this nearcallback for collision filtering and more finegrained control over collisi...
btScalar gContactBreakingThreshold
const T & btMin(const T &a, const T &b)
Definition: btMinMax.h:21
float btScalar
The btScalar type abstracts floating point numbers, to easily switch between double and single floati...
Definition: btScalar.h:314
#define btAssert(x)
Definition: btScalar.h:153
btITaskScheduler * btGetTaskScheduler()
Definition: btThreads.cpp:407
unsigned int btGetCurrentThreadIndex()
Definition: btThreads.cpp:290
void btParallelFor(int iBegin, int iEnd, int grainSize, const btIParallelForBody &body)
Definition: btThreads.cpp:412
void resizeNoInitialize(int newsize)
resize changes the number of elements in the array.
int size() const
return the number of elements in the array
void resize(int newsize, const T &fillData=T())
void swap(int index0, int index1)
void push_back(const T &_Val)
btCollisionConfiguration allows to configure Bullet collision detection stack allocator size,...
btAlignedObjectArray< btAlignedObjectArray< btPersistentManifold * > > m_batchReleasePtr
virtual btPersistentManifold * getNewManifold(const btCollisionObject *body0, const btCollisionObject *body1) BT_OVERRIDE
btAlignedObjectArray< btAlignedObjectArray< btPersistentManifold * > > m_batchManifoldsPtr
virtual void dispatchAllCollisionPairs(btOverlappingPairCache *pairCache, const btDispatcherInfo &info, btDispatcher *dispatcher) BT_OVERRIDE
btCollisionDispatcherMt(btCollisionConfiguration *config, int grainSize=40)
virtual void releaseManifold(btPersistentManifold *manifold) BT_OVERRIDE
btCollisionDispatcher supports algorithms that handle ConvexConvex and ConvexConcave collision pairs.
btNearCallback getNearCallback() const
virtual void clearManifold(btPersistentManifold *manifold)
btAlignedObjectArray< btPersistentManifold * > m_manifoldsPtr
btPoolAllocator * m_persistentManifoldPoolAllocator
btCollisionObject can be used to manage collision detection objects.
btScalar getContactProcessingThreshold() const
const btCollisionShape * getCollisionShape() const
virtual btScalar getContactBreakingThreshold(btScalar defaultContactThresholdFactor) const
The btDispatcher interface class can be used in combination with broadphase to dispatch calculations ...
Definition: btDispatcher.h:77
The btOverlappingPairCache provides an interface for overlapping pair management (add,...
virtual int getNumOverlappingPairs() const =0
virtual btBroadphasePair * getOverlappingPairArrayPtr()=0
btPersistentManifold is a contact point cache, it stays persistent as long as objects are overlapping...
void freeMemory(void *ptr)
bool validPtr(void *ptr)
void * allocate(int size)
void forLoop(int iBegin, int iEnd) const
btCollisionDispatcher * mDispatcher
The btBroadphasePair class contains a pair of aabb-overlapping objects.