1c3686ca51
- fixing various race conditions throughout (usage of static vars, etc)
- addition of a few lightweight mutexes (which are compiled out by default)
- slight code rearrangement in discreteDynamicsWorld to facilitate multithreading
- PoolAllocator::allocate() can now be called when pool is full without
crashing (null pointer returned)
- PoolAllocator allocate and freeMemory, are OPTIONALLY threadsafe
(default is un-threadsafe)
- CollisionDispatcher no longer checks if the pool allocator is full
before calling allocate(), instead it just calls allocate() and
checks if the return is null -- this avoids a race condition
- SequentialImpulseConstraintSolver OPTIONALLY uses different logic in
getOrInitSolverBody() to avoid a race condition with kinematic bodies
- addition of 2 classes which together allow simulation islands to be run
in parallel:
- btSimulationIslandManagerMt
- btDiscreteDynamicsWorldMt
- MultiThreadedDemo example in the example browser demonstrating use of
OpenMP, Microsoft PPL, and Intel TBB
- use multithreading for other demos
- benchmark demo: add parallel raycasting
185 lines
9.9 KiB
C++
185 lines
9.9 KiB
C++
/*
|
|
Bullet Continuous Collision Detection and Physics Library
|
|
Copyright (c) 2003-2006 Erwin Coumans http://continuousphysics.com/Bullet/
|
|
|
|
This software is provided 'as-is', without any express or implied warranty.
|
|
In no event will the authors be held liable for any damages arising from the use of this software.
|
|
Permission is granted to anyone to use this software for any purpose,
|
|
including commercial applications, and to alter it and redistribute it freely,
|
|
subject to the following restrictions:
|
|
|
|
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.
|
|
2. Altered source versions must be plainly marked as such, and must not be misrepresented as being the original software.
|
|
3. This notice may not be removed or altered from any source distribution.
|
|
*/
|
|
|
|
#ifndef BT_SEQUENTIAL_IMPULSE_CONSTRAINT_SOLVER_H
|
|
#define BT_SEQUENTIAL_IMPULSE_CONSTRAINT_SOLVER_H
|
|
|
|
class btIDebugDraw;
|
|
class btPersistentManifold;
|
|
class btDispatcher;
|
|
class btCollisionObject;
|
|
#include "BulletDynamics/ConstraintSolver/btTypedConstraint.h"
|
|
#include "BulletDynamics/ConstraintSolver/btContactSolverInfo.h"
|
|
#include "BulletDynamics/ConstraintSolver/btSolverBody.h"
|
|
#include "BulletDynamics/ConstraintSolver/btSolverConstraint.h"
|
|
#include "BulletCollision/NarrowPhaseCollision/btManifoldPoint.h"
|
|
#include "BulletDynamics/ConstraintSolver/btConstraintSolver.h"
|
|
|
|
typedef btSimdScalar(*btSingleConstraintRowSolver)(btSolverBody&, btSolverBody&, const btSolverConstraint&);
|
|
|
|
///The btSequentialImpulseConstraintSolver is a fast SIMD implementation of the Projected Gauss Seidel (iterative LCP) method.
|
|
ATTRIBUTE_ALIGNED16(class) btSequentialImpulseConstraintSolver : public btConstraintSolver
|
|
{
|
|
protected:
|
|
btAlignedObjectArray<btSolverBody> m_tmpSolverBodyPool;
|
|
btConstraintArray m_tmpSolverContactConstraintPool;
|
|
btConstraintArray m_tmpSolverNonContactConstraintPool;
|
|
btConstraintArray m_tmpSolverContactFrictionConstraintPool;
|
|
btConstraintArray m_tmpSolverContactRollingFrictionConstraintPool;
|
|
|
|
btAlignedObjectArray<int> m_orderTmpConstraintPool;
|
|
btAlignedObjectArray<int> m_orderNonContactConstraintPool;
|
|
btAlignedObjectArray<int> m_orderFrictionConstraintPool;
|
|
btAlignedObjectArray<btTypedConstraint::btConstraintInfo1> m_tmpConstraintSizesPool;
|
|
int m_maxOverrideNumSolverIterations;
|
|
int m_fixedBodyId;
|
|
// When running solvers on multiple threads, a race condition exists for Kinematic objects that
|
|
// participate in more than one solver.
|
|
// The getOrInitSolverBody() function writes the companionId of each body (storing the index of the solver body
|
|
// for the current solver). For normal dynamic bodies it isn't an issue because they can only be in one island
|
|
// (and therefore one thread) at a time. But kinematic bodies can be in multiple islands at once.
|
|
// To avoid this race condition, this solver does not write the companionId, instead it stores the solver body
|
|
// index in this solver-local table, indexed by the uniqueId of the body.
|
|
btAlignedObjectArray<int> m_kinematicBodyUniqueIdToSolverBodyTable; // only used for multithreading
|
|
|
|
btSingleConstraintRowSolver m_resolveSingleConstraintRowGeneric;
|
|
btSingleConstraintRowSolver m_resolveSingleConstraintRowLowerLimit;
|
|
|
|
void setupFrictionConstraint( btSolverConstraint& solverConstraint, const btVector3& normalAxis,int solverBodyIdA,int solverBodyIdB,
|
|
btManifoldPoint& cp,const btVector3& rel_pos1,const btVector3& rel_pos2,
|
|
btCollisionObject* colObj0,btCollisionObject* colObj1, btScalar relaxation,
|
|
btScalar desiredVelocity=0., btScalar cfmSlip=0.);
|
|
|
|
void setupTorsionalFrictionConstraint( btSolverConstraint& solverConstraint, const btVector3& normalAxis,int solverBodyIdA,int solverBodyIdB,
|
|
btManifoldPoint& cp,btScalar combinedTorsionalFriction, const btVector3& rel_pos1,const btVector3& rel_pos2,
|
|
btCollisionObject* colObj0,btCollisionObject* colObj1, btScalar relaxation,
|
|
btScalar desiredVelocity=0., btScalar cfmSlip=0.);
|
|
|
|
btSolverConstraint& addFrictionConstraint(const btVector3& normalAxis,int solverBodyIdA,int solverBodyIdB,int frictionIndex,btManifoldPoint& cp,const btVector3& rel_pos1,const btVector3& rel_pos2,btCollisionObject* colObj0,btCollisionObject* colObj1, btScalar relaxation, btScalar desiredVelocity=0., btScalar cfmSlip=0.);
|
|
btSolverConstraint& addTorsionalFrictionConstraint(const btVector3& normalAxis,int solverBodyIdA,int solverBodyIdB,int frictionIndex,btManifoldPoint& cp,btScalar torsionalFriction, const btVector3& rel_pos1,const btVector3& rel_pos2,btCollisionObject* colObj0,btCollisionObject* colObj1, btScalar relaxation, btScalar desiredVelocity=0, btScalar cfmSlip=0.f);
|
|
|
|
|
|
void setupContactConstraint(btSolverConstraint& solverConstraint, int solverBodyIdA, int solverBodyIdB, btManifoldPoint& cp,
|
|
const btContactSolverInfo& infoGlobal,btScalar& relaxation, const btVector3& rel_pos1, const btVector3& rel_pos2);
|
|
|
|
static void applyAnisotropicFriction(btCollisionObject* colObj,btVector3& frictionDirection, int frictionMode);
|
|
|
|
void setFrictionConstraintImpulse( btSolverConstraint& solverConstraint, int solverBodyIdA,int solverBodyIdB,
|
|
btManifoldPoint& cp, const btContactSolverInfo& infoGlobal);
|
|
|
|
///m_btSeed2 is used for re-arranging the constraint rows. improves convergence/quality of friction
|
|
unsigned long m_btSeed2;
|
|
|
|
|
|
btScalar restitutionCurve(btScalar rel_vel, btScalar restitution);
|
|
|
|
virtual void convertContacts(btPersistentManifold** manifoldPtr, int numManifolds, const btContactSolverInfo& infoGlobal);
|
|
|
|
void convertContact(btPersistentManifold* manifold,const btContactSolverInfo& infoGlobal);
|
|
|
|
|
|
void resolveSplitPenetrationSIMD(
|
|
btSolverBody& bodyA,btSolverBody& bodyB,
|
|
const btSolverConstraint& contactConstraint);
|
|
|
|
void resolveSplitPenetrationImpulseCacheFriendly(
|
|
btSolverBody& bodyA,btSolverBody& bodyB,
|
|
const btSolverConstraint& contactConstraint);
|
|
|
|
//internal method
|
|
int getOrInitSolverBody(btCollisionObject& body,btScalar timeStep);
|
|
void initSolverBody(btSolverBody* solverBody, btCollisionObject* collisionObject, btScalar timeStep);
|
|
|
|
btSimdScalar resolveSingleConstraintRowGeneric(btSolverBody& bodyA,btSolverBody& bodyB,const btSolverConstraint& contactConstraint);
|
|
btSimdScalar resolveSingleConstraintRowGenericSIMD(btSolverBody& bodyA,btSolverBody& bodyB,const btSolverConstraint& contactConstraint);
|
|
btSimdScalar resolveSingleConstraintRowLowerLimit(btSolverBody& bodyA,btSolverBody& bodyB,const btSolverConstraint& contactConstraint);
|
|
btSimdScalar resolveSingleConstraintRowLowerLimitSIMD(btSolverBody& bodyA,btSolverBody& bodyB,const btSolverConstraint& contactConstraint);
|
|
|
|
protected:
|
|
|
|
|
|
virtual void solveGroupCacheFriendlySplitImpulseIterations(btCollisionObject** bodies,int numBodies,btPersistentManifold** manifoldPtr, int numManifolds,btTypedConstraint** constraints,int numConstraints,const btContactSolverInfo& infoGlobal,btIDebugDraw* debugDrawer);
|
|
virtual btScalar solveGroupCacheFriendlyFinish(btCollisionObject** bodies,int numBodies,const btContactSolverInfo& infoGlobal);
|
|
virtual btScalar solveSingleIteration(int iteration, btCollisionObject** bodies ,int numBodies,btPersistentManifold** manifoldPtr, int numManifolds,btTypedConstraint** constraints,int numConstraints,const btContactSolverInfo& infoGlobal,btIDebugDraw* debugDrawer);
|
|
|
|
virtual btScalar solveGroupCacheFriendlySetup(btCollisionObject** bodies,int numBodies,btPersistentManifold** manifoldPtr, int numManifolds,btTypedConstraint** constraints,int numConstraints,const btContactSolverInfo& infoGlobal,btIDebugDraw* debugDrawer);
|
|
virtual btScalar solveGroupCacheFriendlyIterations(btCollisionObject** bodies,int numBodies,btPersistentManifold** manifoldPtr, int numManifolds,btTypedConstraint** constraints,int numConstraints,const btContactSolverInfo& infoGlobal,btIDebugDraw* debugDrawer);
|
|
|
|
|
|
public:
|
|
|
|
BT_DECLARE_ALIGNED_ALLOCATOR();
|
|
|
|
btSequentialImpulseConstraintSolver();
|
|
virtual ~btSequentialImpulseConstraintSolver();
|
|
|
|
virtual btScalar solveGroup(btCollisionObject** bodies,int numBodies,btPersistentManifold** manifold,int numManifolds,btTypedConstraint** constraints,int numConstraints,const btContactSolverInfo& info, btIDebugDraw* debugDrawer,btDispatcher* dispatcher);
|
|
|
|
///clear internal cached data and reset random seed
|
|
virtual void reset();
|
|
|
|
unsigned long btRand2();
|
|
|
|
int btRandInt2 (int n);
|
|
|
|
void setRandSeed(unsigned long seed)
|
|
{
|
|
m_btSeed2 = seed;
|
|
}
|
|
unsigned long getRandSeed() const
|
|
{
|
|
return m_btSeed2;
|
|
}
|
|
|
|
|
|
virtual btConstraintSolverType getSolverType() const
|
|
{
|
|
return BT_SEQUENTIAL_IMPULSE_SOLVER;
|
|
}
|
|
|
|
btSingleConstraintRowSolver getActiveConstraintRowSolverGeneric()
|
|
{
|
|
return m_resolveSingleConstraintRowGeneric;
|
|
}
|
|
void setConstraintRowSolverGeneric(btSingleConstraintRowSolver rowSolver)
|
|
{
|
|
m_resolveSingleConstraintRowGeneric = rowSolver;
|
|
}
|
|
btSingleConstraintRowSolver getActiveConstraintRowSolverLowerLimit()
|
|
{
|
|
return m_resolveSingleConstraintRowLowerLimit;
|
|
}
|
|
void setConstraintRowSolverLowerLimit(btSingleConstraintRowSolver rowSolver)
|
|
{
|
|
m_resolveSingleConstraintRowLowerLimit = rowSolver;
|
|
}
|
|
|
|
///Various implementations of solving a single constraint row using a generic equality constraint, using scalar reference, SSE2 or SSE4
|
|
btSingleConstraintRowSolver getScalarConstraintRowSolverGeneric();
|
|
btSingleConstraintRowSolver getSSE2ConstraintRowSolverGeneric();
|
|
btSingleConstraintRowSolver getSSE4_1ConstraintRowSolverGeneric();
|
|
|
|
///Various implementations of solving a single constraint row using an inequality (lower limit) constraint, using scalar reference, SSE2 or SSE4
|
|
btSingleConstraintRowSolver getScalarConstraintRowSolverLowerLimit();
|
|
btSingleConstraintRowSolver getSSE2ConstraintRowSolverLowerLimit();
|
|
btSingleConstraintRowSolver getSSE4_1ConstraintRowSolverLowerLimit();
|
|
};
|
|
|
|
|
|
|
|
|
|
#endif //BT_SEQUENTIAL_IMPULSE_CONSTRAINT_SOLVER_H
|
|
|