for for btBvhTriangleMeshShape with short int indices serialization

disable bvh serialization, it has issues (needs testing)
This commit is contained in:
erwin.coumans
2010-02-27 09:16:42 +00:00
parent aab5652e7d
commit d5ea1d569f
13 changed files with 607 additions and 594 deletions

View File

@@ -40,7 +40,7 @@
#include "bullet_btPositionAndRadius.h" #include "bullet_btPositionAndRadius.h"
#include "bullet_btMultiSphereShapeData.h" #include "bullet_btMultiSphereShapeData.h"
#include "bullet_btIntIndexData.h" #include "bullet_btIntIndexData.h"
#include "bullet_btShortIntIndexData.h" #include "bullet_btShortIntIndexTripletData.h"
#include "bullet_btMeshPartData.h" #include "bullet_btMeshPartData.h"
#include "bullet_btStridingMeshInterfaceData.h" #include "bullet_btStridingMeshInterfaceData.h"
#include "bullet_btTriangleMeshShapeData.h" #include "bullet_btTriangleMeshShapeData.h"

View File

@@ -47,7 +47,7 @@ namespace Bullet {
class btPositionAndRadius; class btPositionAndRadius;
class btMultiSphereShapeData; class btMultiSphereShapeData;
class btIntIndexData; class btIntIndexData;
class btShortIntIndexData; class btShortIntIndexTripletData;
class btMeshPartData; class btMeshPartData;
class btStridingMeshInterfaceData; class btStridingMeshInterfaceData;
class btTriangleMeshShapeData; class btTriangleMeshShapeData;

View File

@@ -33,9 +33,7 @@ namespace Bullet {
public: public:
int m_rootNodeIndex; int m_rootNodeIndex;
int m_subtreeSize; int m_subtreeSize;
short int;
short m_quantizedAabbMin[3]; short m_quantizedAabbMin[3];
short int;
short m_quantizedAabbMax[3]; short m_quantizedAabbMax[3];
}; };
} }

View File

@@ -34,7 +34,7 @@ namespace Bullet {
btVector3FloatData *m_vertices3f; btVector3FloatData *m_vertices3f;
btVector3DoubleData *m_vertices3d; btVector3DoubleData *m_vertices3d;
btIntIndexData *m_indices32; btIntIndexData *m_indices32;
btShortIntIndexData *m_indices16; btShortIntIndexTripletData *m_3indices16;
int m_numTriangles; int m_numTriangles;
int m_numVertices; int m_numVertices;
}; };

View File

@@ -31,11 +31,9 @@ namespace Bullet {
class btQuantizedBvhNodeData class btQuantizedBvhNodeData
{ {
public: public:
int m_escapeIndexOrTriangleIndex;
short int;
short m_quantizedAabbMin[3]; short m_quantizedAabbMin[3];
short int;
short m_quantizedAabbMax[3]; short m_quantizedAabbMax[3];
int m_escapeIndexOrTriangleIndex;
}; };
} }

View File

@@ -17,8 +17,8 @@
* 3. This notice may not be removed or altered from any source distribution. * 3. This notice may not be removed or altered from any source distribution.
*/ */
// Auto generated from makesdna dna.c // Auto generated from makesdna dna.c
#ifndef __BULLET_BTSHORTINTINDEXDATA__H__ #ifndef __BULLET_BTSHORTINTINDEXTRIPLETDATA__H__
#define __BULLET_BTSHORTINTINDEXDATA__H__ #define __BULLET_BTSHORTINTINDEXTRIPLETDATA__H__
// -------------------------------------------------- // // -------------------------------------------------- //
@@ -28,13 +28,13 @@ namespace Bullet {
// ---------------------------------------------- // // ---------------------------------------------- //
class btShortIntIndexData class btShortIntIndexTripletData
{ {
public: public:
short int; short m_values[3];
short m_value; char m_pad[2];
}; };
} }
#endif//__BULLET_BTSHORTINTINDEXDATA__H__ #endif//__BULLET_BTSHORTINTINDEXTRIPLETDATA__H__

View File

@@ -23,6 +23,8 @@ subject to the following restrictions:
#define MAX_ARRAY_LENGTH 512 #define MAX_ARRAY_LENGTH 512
using namespace bParse; using namespace bParse;
//this define will force traversal of structures, to check backward (and forward) compatibility
//#define TEST_BACKWARD_FORWARD_COMPATIBILITY
int numallocs = 0; int numallocs = 0;
@@ -260,7 +262,11 @@ char* bFile::readStruct(char *head, bChunkInd& dataChunk)
#ifdef TEST_BACKWARD_FORWARD_COMPATIBILITY
if (1)
#else
if (!mFileDNA->flagEqual(dataChunk.dna_nr)) if (!mFileDNA->flagEqual(dataChunk.dna_nr))
#endif
{ {
// Ouch! need to rebuild the struct // Ouch! need to rebuild the struct
short *oldStruct,*curStruct; short *oldStruct,*curStruct;
@@ -938,7 +944,11 @@ void bFile::resolvePointers(bool verboseDumpAllBlocks)
{ {
const bChunkInd& dataChunk = m_chunks.at(i); const bChunkInd& dataChunk = m_chunks.at(i);
#ifdef TEST_BACKWARD_FORWARD_COMPATIBILITY
if (1)
#else
if (!mFileDNA || fileDna->flagEqual(dataChunk.dna_nr)) if (!mFileDNA || fileDna->flagEqual(dataChunk.dna_nr))
#endif
{ {
//dataChunk.len //dataChunk.len
short int* oldStruct = fileDna->getStruct(dataChunk.dna_nr); short int* oldStruct = fileDna->getStruct(dataChunk.dna_nr);

View File

@@ -106,8 +106,8 @@ btTriangleIndexVertexArray* btBulletWorldImporter::createMeshInterface(btStridin
} else } else
{ {
meshPart.m_indexType = PHY_SHORT; meshPart.m_indexType = PHY_SHORT;
meshPart.m_triangleIndexStride = 3*sizeof(short int); meshPart.m_triangleIndexStride = sizeof(btShortIntIndexTripletData);
meshPart.m_triangleIndexBase = (const unsigned char*)meshData.m_meshPartsPtr[i].m_indices16; meshPart.m_triangleIndexBase = (const unsigned char*)meshData.m_meshPartsPtr[i].m_3indices16;
} }
if (meshData.m_meshPartsPtr[i].m_vertices3f) if (meshData.m_meshPartsPtr[i].m_vertices3f)
@@ -344,7 +344,7 @@ btCollisionShape* btBulletWorldImporter::convertCollisionShape( btCollisionShap
btOptimizedBvh* bvh = 0; btOptimizedBvh* bvh = 0;
#if 1
if (trimesh->m_quantizedFloatBvh) if (trimesh->m_quantizedFloatBvh)
{ {
btOptimizedBvh** bvhPtr = m_bvhMap.find(trimesh->m_quantizedFloatBvh); btOptimizedBvh** bvhPtr = m_bvhMap.find(trimesh->m_quantizedFloatBvh);
@@ -369,6 +369,7 @@ btCollisionShape* btBulletWorldImporter::convertCollisionShape( btCollisionShap
bvh->deSerializeDouble(*trimesh->m_quantizedDoubleBvh); bvh->deSerializeDouble(*trimesh->m_quantizedDoubleBvh);
} }
} }
#endif
btBvhTriangleMeshShape* trimeshShape = createBvhTriangleMeshShape(meshInterface,bvh); btBvhTriangleMeshShape* trimeshShape = createBvhTriangleMeshShape(meshInterface,bvh);
@@ -481,7 +482,10 @@ bool btBulletWorldImporter::loadFileFromMemory( bParse::btBulletFile* bulletFil
btCollisionShapeData* shapeData = (btCollisionShapeData*)bulletFile2->m_collisionShapes[i]; btCollisionShapeData* shapeData = (btCollisionShapeData*)bulletFile2->m_collisionShapes[i];
btCollisionShape* shape = convertCollisionShape(shapeData); btCollisionShape* shape = convertCollisionShape(shapeData);
if (shape) if (shape)
{
// printf("shapeMap.insert(%x,%x)\n",shapeData,shape);
shapeMap.insert(shapeData,shape); shapeMap.insert(shapeData,shape);
}
if (shape&& shapeData->m_name) if (shape&& shapeData->m_name)
{ {

View File

@@ -1321,7 +1321,8 @@ const char* btQuantizedBvh::serialize(void* dataBuffer, btSerializer* serializer
} }
quantizedData->m_numQuantizedContiguousNodes = m_quantizedContiguousNodes.size(); quantizedData->m_numQuantizedContiguousNodes = m_quantizedContiguousNodes.size();
quantizedData->m_quantizedContiguousNodesPtr = (btQuantizedBvhNodeData*) (m_quantizedContiguousNodes.size() ? &m_quantizedContiguousNodes[0] : 0); // printf("quantizedData->m_numQuantizedContiguousNodes=%d\n",quantizedData->m_numQuantizedContiguousNodes);
quantizedData->m_quantizedContiguousNodesPtr =(btQuantizedBvhNodeData*) (m_quantizedContiguousNodes.size() ? &m_quantizedContiguousNodes[0] : 0);
if (quantizedData->m_quantizedContiguousNodesPtr) if (quantizedData->m_quantizedContiguousNodesPtr)
{ {
int sz = sizeof(btQuantizedBvhNodeData); int sz = sizeof(btQuantizedBvhNodeData);

View File

@@ -502,8 +502,8 @@ struct btBvhSubtreeInfoData
{ {
int m_rootNodeIndex; int m_rootNodeIndex;
int m_subtreeSize; int m_subtreeSize;
unsigned short int m_quantizedAabbMin[3]; unsigned short m_quantizedAabbMin[3];
unsigned short int m_quantizedAabbMax[3]; unsigned short m_quantizedAabbMax[3];
}; };
struct btOptimizedBvhNodeFloatData struct btOptimizedBvhNodeFloatData
@@ -511,9 +511,9 @@ struct btOptimizedBvhNodeFloatData
btVector3FloatData m_aabbMinOrg; btVector3FloatData m_aabbMinOrg;
btVector3FloatData m_aabbMaxOrg; btVector3FloatData m_aabbMaxOrg;
int m_escapeIndex; int m_escapeIndex;
int m_subPart; int m_subPart;
int m_triangleIndex; int m_triangleIndex;
char m_pad[4];
}; };
struct btOptimizedBvhNodeDoubleData struct btOptimizedBvhNodeDoubleData
@@ -521,17 +521,17 @@ struct btOptimizedBvhNodeDoubleData
btVector3DoubleData m_aabbMinOrg; btVector3DoubleData m_aabbMinOrg;
btVector3DoubleData m_aabbMaxOrg; btVector3DoubleData m_aabbMaxOrg;
int m_escapeIndex; int m_escapeIndex;
int m_subPart; int m_subPart;
int m_triangleIndex; int m_triangleIndex;
char m_pad[4];
}; };
struct btQuantizedBvhNodeData struct btQuantizedBvhNodeData
{ {
unsigned short m_quantizedAabbMin[3];
unsigned short m_quantizedAabbMax[3];
int m_escapeIndexOrTriangleIndex; int m_escapeIndexOrTriangleIndex;
unsigned short int m_quantizedAabbMin[3];
unsigned short int m_quantizedAabbMax[3];
}; };
struct btQuantizedBvhFloatData struct btQuantizedBvhFloatData
@@ -545,10 +545,10 @@ struct btQuantizedBvhFloatData
int m_numQuantizedContiguousNodes; int m_numQuantizedContiguousNodes;
btOptimizedBvhNodeFloatData *m_contiguousNodesPtr; btOptimizedBvhNodeFloatData *m_contiguousNodesPtr;
btQuantizedBvhNodeData *m_quantizedContiguousNodesPtr; btQuantizedBvhNodeData *m_quantizedContiguousNodesPtr;
btBvhSubtreeInfoData *m_subTreeInfoPtr;
int m_traversalMode; int m_traversalMode;
int m_numSubtreeHeaders; int m_numSubtreeHeaders;
btBvhSubtreeInfoData *m_subTreeInfoPtr;
}; };
struct btQuantizedBvhDoubleData struct btQuantizedBvhDoubleData

View File

@@ -221,7 +221,7 @@ const char* btStridingMeshInterface::serialize(void* dataBuffer, btSerializer* s
memPtr->m_numTriangles = numtriangles;//indices = 3*numtriangles memPtr->m_numTriangles = numtriangles;//indices = 3*numtriangles
memPtr->m_numVertices = numverts; memPtr->m_numVertices = numverts;
memPtr->m_indices32 = 0; memPtr->m_indices32 = 0;
memPtr->m_indices16 = 0; memPtr->m_3indices16 = 0;
memPtr->m_vertices3f = 0; memPtr->m_vertices3f = 0;
memPtr->m_vertices3d = 0; memPtr->m_vertices3d = 0;
@@ -249,23 +249,21 @@ const char* btStridingMeshInterface::serialize(void* dataBuffer, btSerializer* s
} }
case PHY_SHORT: case PHY_SHORT:
{ {
int numindices = numtriangles*3; if (numtriangles)
if (numindices)
{ {
btChunk* chunk = serializer->allocate(sizeof(btShortIntIndexData),numindices); btChunk* chunk = serializer->allocate(sizeof(btShortIntIndexTripletData),numtriangles);
btShortIntIndexData* tmpIndices = (btShortIntIndexData*)chunk->m_oldPtr; btShortIntIndexTripletData* tmpIndices = (btShortIntIndexTripletData*)chunk->m_oldPtr;
memPtr->m_indices16 = tmpIndices; memPtr->m_3indices16 = tmpIndices;
for (gfxindex=0;gfxindex<numtriangles;gfxindex++) for (gfxindex=0;gfxindex<numtriangles;gfxindex++)
{ {
unsigned short int* tri_indices= (unsigned short int*)(indexbase+gfxindex*indexstride); unsigned short int* tri_indices= (unsigned short int*)(indexbase+gfxindex*indexstride);
tmpIndices[gfxindex*3].m_value = tri_indices[0]; tmpIndices[gfxindex].m_values[0] = tri_indices[0];
tmpIndices[gfxindex*3+1].m_value = tri_indices[1]; tmpIndices[gfxindex].m_values[1] = tri_indices[1];
tmpIndices[gfxindex*3+2].m_value = tri_indices[2]; tmpIndices[gfxindex].m_values[2] = tri_indices[2];
} }
serializer->finalizeChunk(chunk,"btShortIntIndexData",BT_ARRAY_CODE,(void*)chunk->m_oldPtr); serializer->finalizeChunk(chunk,"btShortIntIndexTripletData",BT_ARRAY_CODE,(void*)chunk->m_oldPtr);
} }
break; break;
} }
default: default:
{ {

View File

@@ -104,9 +104,12 @@ struct btIntIndexData
int m_value; int m_value;
}; };
struct btShortIntIndexData
struct btShortIntIndexTripletData
{ {
short int m_value; short m_values[3];
char m_pad[2];
}; };
///do not change those serialization structures, it requires an updated sBulletDNAstr/sBulletDNAstr64 ///do not change those serialization structures, it requires an updated sBulletDNAstr/sBulletDNAstr64
@@ -115,9 +118,10 @@ struct btMeshPartData
btVector3FloatData *m_vertices3f; btVector3FloatData *m_vertices3f;
btVector3DoubleData *m_vertices3d; btVector3DoubleData *m_vertices3d;
btIntIndexData *m_indices32; btIntIndexData *m_indices32;
btShortIntIndexData *m_indices16; btShortIntIndexTripletData *m_3indices16;
int m_numTriangles;//length of m_indices = 3*m_numTriangles
int m_numTriangles;//length of m_indices = m_numTriangles
int m_numVertices; int m_numVertices;
}; };

File diff suppressed because it is too large Load Diff