123456789101112131415161718192021222324252627282930313233343536373839404142434445464748495051525354555657585960616263646566676869707172737475767778798081828384858687888990919293949596979899100101102103104105106107108109110111112113114115116117118119120121122123124125126127128129130131132133134135136137138139140141142143144145146147148149150151152153154155156157158159160161162163164165166167168169170171172173174 |
- #ifndef BT_HASHED_SIMPLE_PAIR_CACHE_H
- #define BT_HASHED_SIMPLE_PAIR_CACHE_H
- #include "bullet/LinearMath/btAlignedObjectArray.h"
- const int BT_SIMPLE_NULL_PAIR=0xffffffff;
- struct btSimplePair
- {
- btSimplePair(int indexA,int indexB)
- :m_indexA(indexA),
- m_indexB(indexB),
- m_userPointer(0)
- {
- }
- int m_indexA;
- int m_indexB;
- union
- {
- void* m_userPointer;
- int m_userValue;
- };
- };
- typedef btAlignedObjectArray<btSimplePair> btSimplePairArray;
- extern int gOverlappingSimplePairs;
- extern int gRemoveSimplePairs;
- extern int gAddedSimplePairs;
- extern int gFindSimplePairs;
- class btHashedSimplePairCache
- {
- btSimplePairArray m_overlappingPairArray;
-
- bool m_blockedForChanges;
-
- protected:
-
- btAlignedObjectArray<int> m_hashTable;
- btAlignedObjectArray<int> m_next;
-
- public:
- btHashedSimplePairCache();
- virtual ~btHashedSimplePairCache();
-
- void removeAllPairs();
- virtual void* removeOverlappingPair(int indexA,int indexB);
-
-
-
- virtual btSimplePair* addOverlappingPair(int indexA,int indexB)
- {
- gAddedSimplePairs++;
- return internalAddPair(indexA,indexB);
- }
-
- virtual btSimplePair* getOverlappingPairArrayPtr()
- {
- return &m_overlappingPairArray[0];
- }
- const btSimplePair* getOverlappingPairArrayPtr() const
- {
- return &m_overlappingPairArray[0];
- }
- btSimplePairArray& getOverlappingPairArray()
- {
- return m_overlappingPairArray;
- }
- const btSimplePairArray& getOverlappingPairArray() const
- {
- return m_overlappingPairArray;
- }
-
- btSimplePair* findPair(int indexA,int indexB);
- int GetCount() const { return m_overlappingPairArray.size(); }
- int getNumOverlappingPairs() const
- {
- return m_overlappingPairArray.size();
- }
- private:
-
- btSimplePair* internalAddPair(int indexA, int indexB);
- void growTables();
- SIMD_FORCE_INLINE bool equalsPair(const btSimplePair& pair, int indexA, int indexB)
- {
- return pair.m_indexA == indexA && pair.m_indexB == indexB;
- }
-
-
- SIMD_FORCE_INLINE unsigned int getHash(unsigned int indexA, unsigned int indexB)
- {
- int key = static_cast<int>(((unsigned int)indexA) | (((unsigned int)indexB) <<16));
-
- key += ~(key << 15);
- key ^= (key >> 10);
- key += (key << 3);
- key ^= (key >> 6);
- key += ~(key << 11);
- key ^= (key >> 16);
- return static_cast<unsigned int>(key);
- }
-
- SIMD_FORCE_INLINE btSimplePair* internalFindPair(int proxyIdA , int proxyIdB, int hash)
- {
-
- int index = m_hashTable[hash];
-
- while( index != BT_SIMPLE_NULL_PAIR && equalsPair(m_overlappingPairArray[index], proxyIdA, proxyIdB) == false)
- {
- index = m_next[index];
- }
- if ( index == BT_SIMPLE_NULL_PAIR )
- {
- return NULL;
- }
- btAssert(index < m_overlappingPairArray.size());
- return &m_overlappingPairArray[index];
- }
-
- };
- #endif
|