Replaced most STL std::vector with btAlignedObjectArray.

Same interface but less features (push_back, pop_back, clear, size, [] etc).
To prepare for SIMD/SSE code: Added 		#define ATTRIBUTE_ALIGNED16(a) __declspec(align(16)) a

Demos/BasicDemo/BasicDemo.cpp

@@ -29,13 +29,33 @@ float	gCollisionMargin = 0.05f;
 #include "BasicDemo.h"
 #include "GL_ShapeDrawer.h"
 #include "GlutStuff.h"
+
+#include <LinearMath/btAlignedObjectArray.h>
+
 ////////////////////////////////////
 
 GLDebugDrawer debugDrawer;
 
+class myTest
+{
+
+};
+
+
+
 int main(int argc,char** argv)
 {
 
+	{
+		///btAlignedObjectArray works the same as std::vector but
+		///allows 16-byte aligned objects like SIMD vectors etc.
+		btAlignedObjectArray<btVector3>	m_points;
+		m_points.push_back(btVector3(1,2,3));
+		const btVector3& ref = m_points[0];
+		m_points[0] = btVector3(2,3,4);
+		m_points.pop_back();
+	}
+
 	BasicDemo ccdDemo;
 	ccdDemo.initPhysics();
 	ccdDemo.setCameraDistance(50.f);

Demos/BspDemo/BspConverter.cpp

@@ -53,7 +53,7 @@ void BspConverter::convertBsp(BspLoader& bspLoader,float scaling)
 	
 			for (int b=0;b<leaf.numLeafBrushes;b++)
 			{
-				std::vector<btVector3> planeEquations;
+				btAlignedObjectArray<btVector3> planeEquations;
 				
 				int brushid = bspLoader.m_dleafbrushes[leaf.firstLeafBrush+b];
 
@@ -83,7 +83,7 @@ void BspConverter::convertBsp(BspLoader& bspLoader,float scaling)
 						if (isValidBrush)
 						{
 
-							std::vector<btVector3>	vertices;
+							btAlignedObjectArray<btVector3>	vertices;
 							btGeometryUtil::getVerticesFromPlaneEquations(planeEquations,vertices);
 						
 							bool isEntity = false;
@@ -134,7 +134,7 @@ void BspConverter::convertBsp(BspLoader& bspLoader,float scaling)
 										const BSPModel& model = bspLoader.m_dmodels[modelnr];
 										for (int n=0;n<model.numBrushes;n++)
 										{
-											std::vector<btVector3> planeEquations;
+											btAlignedObjectArray<btVector3> planeEquations;
 											bool	isValidBrush = false;
 
 											//convert brush
@@ -158,7 +158,7 @@ void BspConverter::convertBsp(BspLoader& bspLoader,float scaling)
 												if (isValidBrush)
 												{
 													
-													std::vector<btVector3>	vertices;
+													btAlignedObjectArray<btVector3>	vertices;
 													btGeometryUtil::getVerticesFromPlaneEquations(planeEquations,vertices);
 
 													bool isEntity=true;

Demos/BspDemo/BspConverter.h

@@ -19,6 +19,7 @@ subject to the following restrictions:
 class BspLoader;
 #include <vector>
 #include "LinearMath/btVector3.h"
+#include "LinearMath/btAlignedObjectArray.h"
 
 ///BspConverter turns a loaded bsp level into convex parts (vertices)
 class BspConverter
@@ -31,7 +32,7 @@ class BspConverter
 		}
 
 		///this callback is called for each brush that succesfully converted into vertices
-		virtual void	addConvexVerticesCollider(std::vector<btVector3>& vertices, bool isEntity, const btVector3& entityTargetLocation) = 0;
+		virtual void	addConvexVerticesCollider(btAlignedObjectArray<btVector3>& vertices, bool isEntity, const btVector3& entityTargetLocation) = 0;
 
 };
 

Demos/BspDemo/BspDemo.cpp

@@ -56,7 +56,7 @@ public:
 	{
 	}
 
-		virtual void	addConvexVerticesCollider(std::vector<btVector3>& vertices, bool isEntity, const btVector3& entityTargetLocation)
+		virtual void	addConvexVerticesCollider(btAlignedObjectArray<btVector3>& vertices, bool isEntity, const btVector3& entityTargetLocation)
 		{
 			///perhaps we can do something special with entities (isEntity)
 			///like adding a collision Triggering (as example)

Demos/CollisionInterfaceDemo/CollisionInterfaceDemo.cpp

@@ -117,12 +117,10 @@ void CollisionInterfaceDemo::displayCallback(void) {
     glClear(GL_COLOR_BUFFER_BIT | GL_DEPTH_BUFFER_BIT); 
 	glDisable(GL_LIGHTING);
 
-	
-	btDispatcherInfo	dispatchInfo;
-	dispatchInfo.m_debugDraw = &debugDrawer;
+	collisionWorld->getDispatchInfo().m_debugDraw = &debugDrawer;
 	
 	if (collisionWorld)
-		collisionWorld->performDiscreteCollisionDetection(dispatchInfo);
+		collisionWorld->performDiscreteCollisionDetection();
 	
 	int i;
 

Demos/ConvexDecompositionDemo/ConvexDecompositionDemo.cpp

@@ -135,7 +135,7 @@ void ConvexDecompositionDemo::initPhysics(const char* filename)
 
 					//calc centroid, to shift vertices around center of mass
 					centroid.setValue(0,0,0);
-					std::vector<btVector3> vertices;
+					btAlignedObjectArray<btVector3> vertices;
 					if ( 1 )
 					{
 						//const unsigned int *src = result.mHullIndices;

Extras/SATConvexCollision/Geometry.inl

@@ -199,7 +199,7 @@ inline const Vector3 Plane::GetNormal() const
 	return Vector3(base);
 }
 
-inline const Scalar Plane::GetDistance() const
+inline const Scalar Plane::getDistance() const
 {
 	return GetW();
 }

Extras/SATConvexCollision/Hull.inl

@@ -19,7 +19,7 @@
 
 #include <assert.h>
 
-inline short Hull::GetNumVertices() const
+inline short Hull::getNumVertices() const
 {
 	return m_numVerts;
 }
@@ -29,12 +29,12 @@ inline short Hull::GetNumFaces() const
 	return m_numFaces;
 }
 
-inline short Hull::GetNumEdges() const
+inline short Hull::getNumEdges() const
 {
 	return m_numEdges;
 }
 
-inline const Point3& Hull::GetVertex(short index) const
+inline const Point3& Hull::getVertex(short index) const
 {
 	return m_pVerts[index];
 }

src/BulletCollision/CollisionDispatch/btCollisionWorld.cpp

@@ -121,8 +121,10 @@ void	btCollisionWorld::addCollisionObject(btCollisionObject* collisionObject,sho
 
 
 
-void	btCollisionWorld::performDiscreteCollisionDetection(btDispatcherInfo& dispatchInfo)
+void	btCollisionWorld::performDiscreteCollisionDetection()
 {
+	btDispatcherInfo& dispatchInfo = getDispatchInfo();
+
 	BEGIN_PROFILE("performDiscreteCollisionDetection");
 
 

src/BulletCollision/CollisionDispatch/btCollisionWorld.h

@@ -173,7 +173,7 @@ public:
 
 	struct	ClosestRayResultCallback : public RayResultCallback
 	{
-		ClosestRayResultCallback(btVector3	rayFromWorld,btVector3	rayToWorld)
+		ClosestRayResultCallback(const btVector3&	rayFromWorld,const btVector3&	rayToWorld)
 		:m_rayFromWorld(rayFromWorld),
 		m_rayToWorld(rayToWorld),
 		m_collisionObject(0)
@@ -237,7 +237,7 @@ public:
 
 	void	removeCollisionObject(btCollisionObject* collisionObject);
 
-	virtual void	performDiscreteCollisionDetection(	btDispatcherInfo&	dispatchInfo);
+	virtual void	performDiscreteCollisionDetection();
 
 	btDispatcherInfo& getDispatchInfo()
 	{

src/BulletCollision/CollisionShapes/btCompoundShape.h

@@ -23,6 +23,7 @@ subject to the following restrictions:
 #include "LinearMath/btMatrix3x3.h"
 #include <vector>
 #include "BulletCollision/CollisionShapes/btCollisionMargin.h"
+#include "LinearMath/btAlignedObjectArray.h"
 
 class btOptimizedBvh;
 
@@ -30,8 +31,8 @@ class btOptimizedBvh;
 /// This allows for concave collision objects. This is more general then the Static Concave btTriangleMeshShape.
 class btCompoundShape	: public btCollisionShape
 {
-	std::vector<btTransform>		m_childTransforms;
-	std::vector<btCollisionShape*>	m_childShapes;
+	btAlignedObjectArray<btTransform>		m_childTransforms;
+	btAlignedObjectArray<btCollisionShape*>	m_childShapes;
 	btVector3						m_localAabbMin;
 	btVector3						m_localAabbMax;
 

src/BulletCollision/CollisionShapes/btConvexHullShape.cpp

@@ -22,6 +22,7 @@ subject to the following restrictions:
 btConvexHullShape ::btConvexHullShape (const float* points,int numPoints,int stride)
 {
 	m_points.resize(numPoints);
+
 	unsigned char* pointsBaseAddress = (unsigned char*)points;
 
 	for (int i=0;i<numPoints;i++)

src/BulletCollision/CollisionShapes/btConvexHullShape.h

@@ -19,7 +19,8 @@ subject to the following restrictions:
 #include "btPolyhedralConvexShape.h"
 #include "BulletCollision/BroadphaseCollision/btBroadphaseProxy.h" // for the types
 
-#include <vector>
+
+#include "LinearMath/btAlignedObjectArray.h"
 
 ///ConvexHullShape implements an implicit (getSupportingVertex) Convex Hull of a Point Cloud (vertices)
 ///No connectivity is needed. localGetSupportingVertex iterates linearly though all vertices.
@@ -27,7 +28,7 @@ subject to the following restrictions:
 ///(memory is much slower then the cpu)
 class btConvexHullShape : public btPolyhedralConvexShape
 {
-	std::vector<btPoint3>	m_points;
+	btAlignedObjectArray<btPoint3>	m_points;
 
 public:
 	///this constructor optionally takes in a pointer to points. Each point is assumed to be 3 consecutive float (x,y,z), the striding defines the number of bytes between each point, in memory.

src/BulletCollision/CollisionShapes/btOptimizedBvh.cpp

@@ -18,6 +18,11 @@ subject to the following restrictions:
 #include "LinearMath/btAabbUtil2.h"
 
 
+btOptimizedBvh::btOptimizedBvh() :m_rootNode1(0), m_numNodes(0) 
+{ 
+
+}
+
 
 void btOptimizedBvh::build(btStridingMeshInterface* triangles)
 {

src/BulletCollision/CollisionShapes/btOptimizedBvh.h

@@ -15,9 +15,17 @@ subject to the following restrictions:
 
 #ifndef OPTIMIZED_BVH_H
 #define OPTIMIZED_BVH_H
+
+
 #include "LinearMath/btVector3.h"
+
+
+//http://msdn.microsoft.com/library/default.asp?url=/library/en-us/vclang/html/vclrf__m128.asp
+
+
 #include <vector>
 
+
 class btStridingMeshInterface;
 
 /// btOptimizedBvhNode contains both internal and leaf node information.
@@ -26,7 +34,7 @@ class btStridingMeshInterface;
 /// and storing aabbmin/max as quantized integers.
 /// 'subpart' doesn't need an integer either. It allows to re-use graphics triangle
 /// meshes stored in a non-uniform way (like batches/subparts of triangle-fans
-struct btOptimizedBvhNode
+ATTRIBUTE_ALIGNED16 (struct btOptimizedBvhNode)
 {
 
 	btVector3	m_aabbMin;
@@ -52,12 +60,23 @@ public:
 	virtual void processNode(const btOptimizedBvhNode* node) = 0;
 };
 
-typedef std::vector<btOptimizedBvhNode>	NodeArray;
+#include "LinearMath/btAlignedAllocator.h"
+#include "LinearMath/btAlignedObjectArray.h"
+
+//typedef std::vector< unsigned , allocator_type >     container_type;
+const unsigned size = (1 << 20);
+typedef btAlignedAllocator< btOptimizedBvhNode , size >  allocator_type;
+
+//typedef btAlignedObjectArray<btOptimizedBvhNode, allocator_type>	NodeArray;
+
+typedef btAlignedObjectArray<btOptimizedBvhNode>	NodeArray;
 
 
 ///OptimizedBvh store an AABB tree that can be quickly traversed on CPU (and SPU,GPU in future)
 class btOptimizedBvh
 {
+	NodeArray			m_leafNodes;
+
 	btOptimizedBvhNode*	m_rootNode1;
 	
 	btOptimizedBvhNode*	m_contiguousNodes;
@@ -65,10 +84,11 @@ class btOptimizedBvh
 
 	int					m_numNodes;
 
-	NodeArray			m_leafNodes;
+
 
 public:
-	btOptimizedBvh() :m_rootNode1(0), m_numNodes(0) { }
+	btOptimizedBvh();
+
 	virtual ~btOptimizedBvh();
 	
 	void	build(btStridingMeshInterface* triangles);

src/BulletCollision/CollisionShapes/btTriangleBuffer.h

@@ -17,7 +17,8 @@ subject to the following restrictions:
 #define BT_TRIANGLE_BUFFER_H
 
 #include "btTriangleCallback.h"
-#include <vector>
+//#include <vector>
+#include "LinearMath/btAlignedObjectArray.h"
 
 struct	btTriangle
 {
@@ -32,7 +33,7 @@ struct	btTriangle
 class btTriangleBuffer : public btTriangleCallback
 {
 
-	std::vector<btTriangle>	m_triangleBuffer;
+	btAlignedObjectArray<btTriangle>	m_triangleBuffer;
 	
 public:
 

src/BulletCollision/CollisionShapes/btTriangleIndexVertexArray.h

@@ -17,7 +17,7 @@ subject to the following restrictions:
 #define BT_TRIANGLE_INDEX_VERTEX_ARRAY_H
 
 #include "btStridingMeshInterface.h"
-#include <vector>
+#include <LinearMath/btAlignedObjectArray.h>
 
 ///IndexedMesh indexes into existing vertex and index arrays, in a similar way OpenGL glDrawElements
 ///instead of the number of indices, we pass the number of triangles
@@ -38,7 +38,7 @@ struct	btIndexedMesh
 ///So keep those arrays around during the lifetime of this btTriangleIndexVertexArray.
 class btTriangleIndexVertexArray : public btStridingMeshInterface
 {
-	std::vector<btIndexedMesh>	m_indexedMeshes;
+	btAlignedObjectArray<btIndexedMesh>	m_indexedMeshes;
 
 		
 public:

src/BulletCollision/CollisionShapes/btTriangleMesh.h

@@ -18,9 +18,8 @@ subject to the following restrictions:
 #define TRIANGLE_MESH_H
 
 #include "BulletCollision/CollisionShapes/btStridingMeshInterface.h"
-#include <vector>
 #include <LinearMath/btVector3.h>
-
+#include "LinearMath/btAlignedObjectArray.h"
 struct btMyTriangle
 {
 	btVector3	m_vert0;
@@ -31,8 +30,7 @@ struct btMyTriangle
 ///TriangleMesh provides storage for a concave triangle mesh. It can be used as data for the btTriangleMeshShape.
 class btTriangleMesh : public btStridingMeshInterface
 {
-	std::vector<btMyTriangle>	m_triangles;
-	
+	btAlignedObjectArray<btMyTriangle>	m_triangles;
 
 	public:
 		btTriangleMesh ();

src/BulletDynamics/Dynamics/btDiscreteDynamicsWorld.cpp

@@ -261,7 +261,7 @@ void	btDiscreteDynamicsWorld::internalSingleStepSimulation(float timeStep)
 	dispatchInfo.m_debugDraw = getDebugDrawer();
 
 	///perform collision detection
-	performDiscreteCollisionDetection(dispatchInfo);
+	performDiscreteCollisionDetection();
 
 	calculateSimulationIslands();
 

src/BulletDynamics/Dynamics/btRigidBody.cpp

@@ -110,16 +110,17 @@ btRigidBody::btRigidBody( float mass,const btTransform& worldTransform,btCollisi
 #endif //OBSOLETE_MOTIONSTATE_LESS
 
 
-#define EXPERIMENTAL_JITTER_REMOVAL 1
+//#define EXPERIMENTAL_JITTER_REMOVAL 1
 #ifdef EXPERIMENTAL_JITTER_REMOVAL
 //Bullet 2.20b has experimental damping code to reduce jitter just before objects fall asleep/deactivate
 //doesn't work very well yet (value 0 disabled this damping)
 //note there this influences deactivation thresholds!
 float gClippedAngvelThresholdSqr = 0.01f;
 float	gClippedLinearThresholdSqr = 0.01f;
-float	gJitterVelocityDampingFactor = 1.f;
 #endif //EXPERIMENTAL_JITTER_REMOVAL
 
+float	gJitterVelocityDampingFactor = 1.f;
+
 void btRigidBody::predictIntegratedTransform(btScalar timeStep,btTransform& predictedTransform) 
 {
 

src/BulletDynamics/Dynamics/btSimpleDynamicsWorld.cpp

@@ -46,13 +46,13 @@ int		btSimpleDynamicsWorld::stepSimulation( float timeStep,int maxSubSteps, floa
 	///apply gravity, predict motion
 	predictUnconstraintMotion(timeStep);
 
-	btDispatcherInfo	dispatchInfo;
+	btDispatcherInfo&	dispatchInfo = getDispatchInfo();
 	dispatchInfo.m_timeStep = timeStep;
 	dispatchInfo.m_stepCount = 0;
 	dispatchInfo.m_debugDraw = getDebugDrawer();
 
 	///perform collision detection
-	performDiscreteCollisionDetection(dispatchInfo );
+	performDiscreteCollisionDetection();
 
 	///solve contact constraints
 	int numManifolds = m_dispatcher1->getNumManifolds();

src/BulletDynamics/Vehicle/btRaycastVehicle.cpp

@@ -128,11 +128,10 @@ void	btRaycastVehicle::updateWheelTransform( int wheelIndex , bool interpolatedT
 void btRaycastVehicle::resetSuspension()
 {
 
-	std::vector<btWheelInfo>::iterator wheelIt;
-	for (wheelIt = m_wheelInfo.begin();
-	!(wheelIt == m_wheelInfo.end());wheelIt++)
+	int i;
+	for (i=0;i<m_wheelInfo.size();	i++)
 	{
-			btWheelInfo& wheel = *wheelIt;
+			btWheelInfo& wheel = m_wheelInfo[i];
 			wheel.m_raycastInfo.m_suspensionLength = wheel.getSuspensionRestLength();
 			wheel.m_suspensionRelativeVelocity = 0.0f;
 			
@@ -285,23 +284,21 @@ void btRaycastVehicle::updateVehicle( btScalar step )
 	//
 	// simulate suspension
 	//
-	std::vector<btWheelInfo>::iterator wheelIt;
+	
 	int i=0;
-	for (wheelIt = m_wheelInfo.begin();
-	!(wheelIt == m_wheelInfo.end());wheelIt++,i++)
+	for (i=0;i<m_wheelInfo.size();i++)
 	{
 		btScalar depth; 
-		depth = rayCast( *wheelIt );
+		depth = rayCast( m_wheelInfo[i]);
 	}
 
 	updateSuspension(step);
 
 	
-	for (wheelIt = m_wheelInfo.begin();
-	!(wheelIt == m_wheelInfo.end());wheelIt++)
+	for (i=0;i<m_wheelInfo.size();i++)
 	{
 		//apply suspension force
-		btWheelInfo& wheel = *wheelIt;
+		btWheelInfo& wheel = m_wheelInfo[i];
 		
 		float suspensionForce = wheel.m_wheelsSuspensionForce;
 		
@@ -322,10 +319,9 @@ void btRaycastVehicle::updateVehicle( btScalar step )
 	updateFriction( step);
 
 	
-	for (wheelIt = m_wheelInfo.begin();
-	!(wheelIt == m_wheelInfo.end());wheelIt++)
+	for (i=0;i<m_wheelInfo.size();i++)
 	{
-		btWheelInfo& wheel = *wheelIt;
+		btWheelInfo& wheel = m_wheelInfo[i];
 		btVector3 relpos = wheel.m_raycastInfo.m_hardPointWS - getRigidBody()->getCenterOfMassPosition();
 		btVector3 vel = getRigidBody()->getVelocityInLocalPoint( relpos );
 

src/BulletDynamics/Vehicle/btRaycastVehicle.h

@@ -15,7 +15,7 @@
 #include "BulletDynamics/ConstraintSolver/btTypedConstraint.h"
 #include "btVehicleRaycaster.h"
 class btDynamicsWorld;
-
+#include "LinearMath/btAlignedObjectArray.h"
 #include "btWheelInfo.h"
 
 class btVehicleTuning;
@@ -95,7 +95,7 @@ public:
 		return int (m_wheelInfo.size());
 	}
 	
-	std::vector<btWheelInfo>	m_wheelInfo;
+	btAlignedObjectArray<btWheelInfo>	m_wheelInfo;
 
 
 	const btWheelInfo&	getWheelInfo(int index) const;

src/LinearMath/btAlignedAllocator.h

@@ -0,0 +1,71 @@
+/*
+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_ALIGNED_ALLOCATOR
+#define BT_ALIGNED_ALLOCATOR
+
+///we probably replace this with our own aligned memory allocator
+///so we replace _aligned_malloc and _aligned_free with our own
+///that is better portable and more predictable
+#include <malloc.h>
+
+typedef int	size_type;
+
+
+template < typename T , unsigned Alignment >
+class btAlignedAllocator {
+	
+	typedef btAlignedAllocator< T , Alignment > self_type;
+	
+public:
+	//just going down a list:
+	btAlignedAllocator() {}
+	
+	btAlignedAllocator( const self_type & ) {}
+	
+	template < typename Other >
+	btAlignedAllocator( const btAlignedAllocator< Other , Alignment > & ) {}
+
+	typedef const T*         const_pointer;
+	typedef const T&         const_reference;
+	typedef T*               pointer;
+	typedef T&               reference;
+	typedef T                value_type;
+
+	pointer       address   ( reference        ref ) const                           { return &ref; }
+	const_pointer address   ( const_reference  ref ) const                           { return &ref; }
+	pointer       allocate  ( size_type        n   , const_pointer *      hint = 0 ) {
+		return reinterpret_cast< pointer >(_aligned_malloc( sizeof(value_type) * n , Alignment ));
+	}
+	void          construct ( pointer          ptr , const value_type &   value    ) { new (ptr) value_type( value ); }
+	void          deallocate( pointer          ptr ) {
+		_aligned_free( reinterpret_cast< void * >( ptr ) );
+	}
+	void          destroy   ( pointer          ptr )                                 { ptr->~value_type(); }
+	
+
+	template < typename O > struct rebind {
+		typedef btAlignedAllocator< O , Alignment > other;
+	};
+	template < typename O >
+	self_type & operator=( const btAlignedAllocator< O , Alignment > & ) { return *this; }
+
+	friend bool operator==( const self_type & , const self_type & ) { return true; }
+};
+
+
+
+#endif //BT_ALIGNED_ALLOCATOR
+

src/LinearMath/btAlignedObjectArray.h

@@ -0,0 +1,175 @@
+/*
+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_OBJECT_ARRAY__
+#define BT_OBJECT_ARRAY__
+
+#include "btScalar.h" // has definitions like SIMD_FORCE_INLINE
+#include "btAlignedAllocator.h"
+
+///btAlignedObjectArray uses a subset of the stl::vector interface for its methods
+///It is developed to replace stl::vector to avoid STL alignment issues to add SIMD/SSE data
+template <typename T> 
+//template <class T> 
+class btAlignedObjectArray
+{
+	int					m_size;
+	int					m_capacity;
+	T*					m_data;
+
+	btAlignedAllocator<T , 16>	m_allocator;
+
+	protected:
+		SIMD_FORCE_INLINE	int	allocSize(int size)
+		{
+			return (size ? size*2 : 1);
+		}
+		SIMD_FORCE_INLINE	void	copy(int start,int end, T* dest)
+		{
+			int i;
+			for (i=0;i<m_size;++i)
+				dest[i] = m_data[i];
+		}
+
+		SIMD_FORCE_INLINE	void	init()
+		{
+			m_data = 0;
+			m_size = 0;
+			m_capacity = 0;
+		}
+		SIMD_FORCE_INLINE	void	destroy(int first,int last)
+		{
+			int i;
+			for (i=0; i<m_size;i++)
+			{
+				m_data[i].~T();
+			}
+		}
+
+		SIMD_FORCE_INLINE	void* allocate(int size)
+		{
+			if (size)
+				return m_allocator.allocate(size);
+			return 0;
+		}
+
+		SIMD_FORCE_INLINE	void	deallocate()
+		{
+			if(m_data)	
+				m_allocator.deallocate(m_data);
+		}
+
+
+	public:
+		
+		btAlignedObjectArray()
+		{
+			init();
+		}
+
+		~btAlignedObjectArray()
+		{
+			clear();
+		}
+
+		SIMD_FORCE_INLINE	int capacity() const
+		{	// return current length of allocated storage
+			return m_capacity;
+		}
+		
+		SIMD_FORCE_INLINE	int size() const
+		{	// return length of sequence
+			return m_size;
+		}
+		
+		SIMD_FORCE_INLINE const T& operator[](int n) const
+		{
+			return m_data[n];
+		}
+
+		SIMD_FORCE_INLINE T& operator[](int n)
+		{
+			return m_data[n];
+		}
+		
+
+		SIMD_FORCE_INLINE	void	clear()
+		{
+			destroy(0,size());
+			
+			deallocate();
+			
+			init();
+		}
+
+		SIMD_FORCE_INLINE	void	pop_back()
+		{
+			m_size--;
+			m_data[m_size].~T();
+		}
+
+		SIMD_FORCE_INLINE	void	resize(int newsize)
+		{
+			if (newsize > size())
+			{
+				reserve(newsize);
+			}
+
+			m_size = newsize;
+		}
+	
+
+
+		SIMD_FORCE_INLINE	void push_back(const T& _Val)
+		{	
+			int sz = size();
+			if( sz == capacity() )
+			{
+				reserve( allocSize(size()) );
+			}
+			
+			m_data[size()] = _Val;
+			//::new ( m_data[m_size] ) T(_Val);
+			m_size++;
+		}
+
+	
+		
+		SIMD_FORCE_INLINE	void reserve(int _Count)
+		{	// determine new minimum length of allocated storage
+			if (capacity() < _Count)
+			{	// not enough room, reallocate
+				if (capacity() < _Count)
+				{
+					T*	s = (T*)allocate(_Count);
+
+					copy(0, size(), s);
+
+					destroy(0,size());
+
+					deallocate();
+
+					m_data = s;
+					
+					m_capacity = _Count;
+
+				}
+			}
+		}
+
+};
+
+#endif //BT_OBJECT_ARRAY__

src/LinearMath/btGeometryUtil.cpp

@@ -16,7 +16,7 @@ subject to the following restrictions:
 
 #include "btGeometryUtil.h"
 
-bool	btGeometryUtil::isPointInsidePlanes(const std::vector<btVector3>& planeEquations, const btVector3& point, float	margin)
+bool	btGeometryUtil::isPointInsidePlanes(const btAlignedObjectArray<btVector3>& planeEquations, const btVector3& point, float	margin)
 {
 	int numbrushes = planeEquations.size();
 	for (int i=0;i<numbrushes;i++)
@@ -33,7 +33,7 @@ bool	btGeometryUtil::isPointInsidePlanes(const std::vector<btVector3>& planeEqua
 }
 
 
-bool	btGeometryUtil::areVerticesBehindPlane(const btVector3& planeNormal, const std::vector<btVector3>& vertices, float	margin)
+bool	btGeometryUtil::areVerticesBehindPlane(const btVector3& planeNormal, const btAlignedObjectArray<btVector3>& vertices, float	margin)
 {
 	int numvertices = vertices.size();
 	for (int i=0;i<numvertices;i++)
@@ -48,7 +48,7 @@ bool	btGeometryUtil::areVerticesBehindPlane(const btVector3& planeNormal, const
 	return true;
 }
 
-bool notExist(const btVector3& planeEquation,const std::vector<btVector3>& planeEquations)
+bool notExist(const btVector3& planeEquation,const btAlignedObjectArray<btVector3>& planeEquations)
 {
 	int numbrushes = planeEquations.size();
 	for (int i=0;i<numbrushes;i++)
@@ -62,7 +62,7 @@ bool notExist(const btVector3& planeEquation,const std::vector<btVector3>& plane
 	return true;
 }
 
-void	btGeometryUtil::getPlaneEquationsFromVertices(std::vector<btVector3>& vertices, std::vector<btVector3>& planeEquationsOut )
+void	btGeometryUtil::getPlaneEquationsFromVertices(btAlignedObjectArray<btVector3>& vertices, btAlignedObjectArray<btVector3>& planeEquationsOut )
 {
 		const int numvertices = vertices.size();
 	// brute force:
@@ -110,7 +110,7 @@ void	btGeometryUtil::getPlaneEquationsFromVertices(std::vector<btVector3>& verti
 
 }
 
-void	btGeometryUtil::getVerticesFromPlaneEquations(const std::vector<btVector3>& planeEquations , std::vector<btVector3>& verticesOut )
+void	btGeometryUtil::getVerticesFromPlaneEquations(const btAlignedObjectArray<btVector3>& planeEquations , btAlignedObjectArray<btVector3>& verticesOut )
 {
 	const int numbrushes = planeEquations.size();
 	// brute force:

src/LinearMath/btGeometryUtil.h

@@ -15,23 +15,24 @@ subject to the following restrictions:
 
 #ifndef BT_GEOMETRY_UTIL_H
 #define BT_GEOMETRY_UTIL_H
-#include <vector>
+
 #include "btVector3.h"
+#include "btAlignedObjectArray.h"
 
 class btGeometryUtil
 {
 	public:
 	
 	
-		static void	getPlaneEquationsFromVertices(std::vector<btVector3>& vertices, std::vector<btVector3>& planeEquationsOut );
+		static void	getPlaneEquationsFromVertices(btAlignedObjectArray<btVector3>& vertices, btAlignedObjectArray<btVector3>& planeEquationsOut );
 
-		static void	getVerticesFromPlaneEquations(const std::vector<btVector3>& planeEquations , std::vector<btVector3>& verticesOut );
+		static void	getVerticesFromPlaneEquations(const btAlignedObjectArray<btVector3>& planeEquations , btAlignedObjectArray<btVector3>& verticesOut );
 	
-		static bool	isInside(const std::vector<btVector3>& vertices, const btVector3& planeNormal, float	margin);
+		static bool	isInside(const btAlignedObjectArray<btVector3>& vertices, const btVector3& planeNormal, float	margin);
 		
-		static bool	isPointInsidePlanes(const std::vector<btVector3>& planeEquations, const btVector3& point, float	margin);
+		static bool	isPointInsidePlanes(const btAlignedObjectArray<btVector3>& planeEquations, const btVector3& point, float	margin);
 
-		static bool	areVerticesBehindPlane(const btVector3& planeNormal, const std::vector<btVector3>& vertices, float	margin);
+		static bool	areVerticesBehindPlane(const btVector3& planeNormal, const btAlignedObjectArray<btVector3>& vertices, float	margin);
 
 };
 

src/LinearMath/btQuadWord.h

@@ -21,11 +21,10 @@ subject to the following restrictions:
 
 
 
-
-class	btQuadWord
+ATTRIBUTE_ALIGNED16 (class	btQuadWord)
 {
 	protected:
-		ATTRIBUTE_ALIGNED16	(btScalar	m_x);
+		btScalar	m_x;
 		btScalar	m_y;
 		btScalar	m_z;
 		btScalar	m_unusedW;

src/LinearMath/btScalar.h

@@ -34,8 +34,8 @@ subject to the following restrictions:
 			#define SIMD_FORCE_INLINE __forceinline
 		#endif //__MINGW32__
 	
-		//#define ATTRIBUTE_ALIGNED16(a) __declspec(align(16)) a
-		#define ATTRIBUTE_ALIGNED16(a) a
+		#define ATTRIBUTE_ALIGNED16(a) __declspec(align(16)) a
+		//#define ATTRIBUTE_ALIGNED16(a) a
 		#include <assert.h>
 		#define btAssert assert
 #else