test: removed indexer coverage regression tests for Cxx
Currently the output of these tests depends on the c++ standard library that is installed on the executing machine. So for some machines these tests would pass while they fail on other machines.
This commit is contained in:
mlangkabel
-3524
File diff suppressed because it is too large
Load Diff
-3141
File diff suppressed because it is too large
Load Diff
-3237
File diff suppressed because it is too large
Load Diff
-3958
File diff suppressed because it is too large
Load Diff
-3971
File diff suppressed because it is too large
Load Diff
-3324
File diff suppressed because it is too large
Load Diff
-4785
File diff suppressed because it is too large
Load Diff
-3496
File diff suppressed because it is too large
Load Diff
-3471
File diff suppressed because it is too large
Load Diff
-4605
File diff suppressed because it is too large
Load Diff
-5077
File diff suppressed because it is too large
Load Diff
-4287
File diff suppressed because it is too large
Load Diff
-567
@@ -1,567 +0,0 @@
|
||||
FILE: b2BlockAllocator.cpp
|
||||
FILE: b2BlockAllocator.h
|
||||
FILE: b2Settings.h
|
||||
FILE: stddef.h non-indexed
|
||||
FILE: corecrt.h non-indexed
|
||||
FILE: vcruntime.h non-indexed
|
||||
FILE: sal.h non-indexed
|
||||
FILE: concurrencysal.h non-indexed
|
||||
FILE: vadefs.h non-indexed
|
||||
FILE: assert.h non-indexed
|
||||
FILE: float.h non-indexed
|
||||
FILE: limits.h non-indexed
|
||||
FILE: string.h non-indexed
|
||||
FILE: corecrt_memory.h non-indexed
|
||||
FILE: corecrt_memcpy_s.h non-indexed
|
||||
FILE: errno.h non-indexed
|
||||
FILE: vcruntime_string.h non-indexed
|
||||
FILE: corecrt_wstring.h non-indexed
|
||||
SYMBOL_MACRO: B2_BLOCK_ALLOCATOR_H [b2BlockAllocator.h <20:9 20:28>]
|
||||
SYMBOL_MACRO: B2_SETTINGS_H [b2Settings.h <20:9 20:21>]
|
||||
SYMBOL_MACRO: b2DEBUG [b2Settings.h <27:10 27:16>]
|
||||
SYMBOL_MACRO: B2_NOT_USED [b2Settings.h <30:9 <30:9 30:19> 30:33>]
|
||||
SYMBOL_MACRO: b2Assert [b2Settings.h <31:9 <31:9 31:16> 31:28>]
|
||||
SYMBOL_MACRO: b2_maxFloat [b2Settings.h <42:9 <42:9 42:19> 42:21>]
|
||||
SYMBOL_MACRO: b2_epsilon [b2Settings.h <43:9 <43:9 43:18> 43:20>]
|
||||
SYMBOL_MACRO: b2_pi [b2Settings.h <44:9 <44:9 44:13> 44:16>]
|
||||
SYMBOL_MACRO: b2_maxManifoldPoints [b2Settings.h <54:9 <54:9 54:28> 54:29>]
|
||||
SYMBOL_MACRO: b2_maxPolygonVertices [b2Settings.h <58:9 <58:9 58:29> 58:30>]
|
||||
SYMBOL_MACRO: b2_aabbExtension [b2Settings.h <63:9 <63:9 63:24> 63:26>]
|
||||
SYMBOL_MACRO: b2_aabbMultiplier [b2Settings.h <68:9 <68:9 68:25> 68:27>]
|
||||
SYMBOL_MACRO: b2_linearSlop [b2Settings.h <72:9 <72:9 72:21> 72:24>]
|
||||
SYMBOL_MACRO: b2_angularSlop [b2Settings.h <76:9 <76:9 76:22> 76:47>]
|
||||
SYMBOL_MACRO: b2_polygonRadius [b2Settings.h <81:9 <81:9 81:24> 81:47>]
|
||||
SYMBOL_MACRO: b2_maxSubSteps [b2Settings.h <84:9 <84:9 84:22> 84:25>]
|
||||
SYMBOL_MACRO: b2_maxTOIContacts [b2Settings.h <90:9 <90:9 90:25> 90:28>]
|
||||
SYMBOL_MACRO: b2_velocityThreshold [b2Settings.h <94:9 <94:9 94:28> 94:30>]
|
||||
SYMBOL_MACRO: b2_maxLinearCorrection [b2Settings.h <98:9 <98:9 98:30> 98:32>]
|
||||
SYMBOL_MACRO: b2_maxAngularCorrection [b2Settings.h <102:9 <102:9 102:31> 102:55>]
|
||||
SYMBOL_MACRO: b2_maxTranslation [b2Settings.h <106:9 <106:9 106:25> 106:28>]
|
||||
SYMBOL_MACRO: b2_maxTranslationSquared [b2Settings.h <107:9 <107:9 107:32> 107:71>]
|
||||
SYMBOL_MACRO: b2_maxRotation [b2Settings.h <111:9 <111:9 111:22> 111:39>]
|
||||
SYMBOL_MACRO: b2_maxRotationSquared [b2Settings.h <112:9 <112:9 112:29> 112:63>]
|
||||
SYMBOL_MACRO: b2_baumgarte [b2Settings.h <117:9 <117:9 117:20> 117:24>]
|
||||
SYMBOL_MACRO: b2_toiBaugarte [b2Settings.h <118:9 <118:9 118:22> 118:26>]
|
||||
SYMBOL_MACRO: b2_timeToSleep [b2Settings.h <124:9 <124:9 124:22> 124:26>]
|
||||
SYMBOL_MACRO: b2_linearSleepTolerance [b2Settings.h <127:9 <127:9 127:31> 127:33>]
|
||||
SYMBOL_MACRO: b2_angularSleepTolerance [b2Settings.h <130:9 <130:9 130:32> 130:55>]
|
||||
SYMBOL_TYPEDEF: int8 [b2Settings.h <33:21 33:24>]
|
||||
SYMBOL_BUILTIN_TYPE: signed char
|
||||
SYMBOL_TYPEDEF: int16 [b2Settings.h <34:22 34:26>]
|
||||
SYMBOL_BUILTIN_TYPE: short
|
||||
SYMBOL_TYPEDEF: int32 [b2Settings.h <35:20 35:24>]
|
||||
SYMBOL_BUILTIN_TYPE: int
|
||||
SYMBOL_TYPEDEF: uint8 [b2Settings.h <36:23 36:27>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned char
|
||||
SYMBOL_TYPEDEF: uint16 [b2Settings.h <37:24 37:29>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned short
|
||||
SYMBOL_TYPEDEF: uint32 [b2Settings.h <38:22 38:27>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned int
|
||||
SYMBOL_TYPEDEF: float32 [b2Settings.h <39:15 39:21>]
|
||||
SYMBOL_BUILTIN_TYPE: float
|
||||
SYMBOL_TYPEDEF: float64 [b2Settings.h <40:16 40:22>]
|
||||
SYMBOL_BUILTIN_TYPE: double
|
||||
SYMBOL_FUNCTION: void * b2Alloc(int32) [b2Settings.h <135:1 <135:7 135:13> 135:25>]
|
||||
SYMBOL_BUILTIN_TYPE: void
|
||||
SYMBOL_FUNCTION: void b2Free(void *) [b2Settings.h <138:1 <138:6 138:11> 138:22>]
|
||||
SYMBOL_FUNCTION: void b2Log(const char *) [b2Settings.h <141:1 <141:6 141:10> 141:35>]
|
||||
SYMBOL_BUILTIN_TYPE: char
|
||||
SYMBOL_STRUCT: b2Version [b2Settings.h <145:1 <145:8 145:16> 150:1>]
|
||||
SYMBOL_FIELD: public int32 b2Version::major [b2Settings.h <147:8 147:12>]
|
||||
SYMBOL_FIELD: public int32 b2Version::minor [b2Settings.h <148:8 148:12>]
|
||||
SYMBOL_FIELD: public int32 b2Version::revision [b2Settings.h <149:8 149:15>]
|
||||
SYMBOL_GLOBAL_VARIABLE: b2Version b2_version [b2Settings.h <153:18 153:27>]
|
||||
SYMBOL_GLOBAL_VARIABLE: const int32 b2_chunkSize [b2BlockAllocator.h <24:13 24:24>]
|
||||
SYMBOL_GLOBAL_VARIABLE: const int32 b2_maxBlockSize [b2BlockAllocator.h <25:13 25:27>]
|
||||
SYMBOL_GLOBAL_VARIABLE: const int32 b2_blockSizes [b2BlockAllocator.h <26:13 26:25>]
|
||||
SYMBOL_GLOBAL_VARIABLE: const int32 b2_chunkArrayIncrement [b2BlockAllocator.h <27:13 27:34>]
|
||||
SYMBOL_STRUCT: b2Block [b2BlockAllocator.cpp <50:1 <50:8 50:14> 53:1>]
|
||||
SYMBOL_STRUCT: b2Block [b2BlockAllocator.h <29:8 29:14>]
|
||||
SYMBOL_STRUCT: b2Chunk [b2BlockAllocator.cpp <44:1 <44:8 44:14> 48:1>]
|
||||
SYMBOL_STRUCT: b2Chunk [b2BlockAllocator.h <30:8 30:14>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <24:7 24:22>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <41:7 41:22>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <42:6 42:21>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <55:1 55:16>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <87:1 87:16>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <97:7 97:22>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <155:6 155:21>]
|
||||
QUALIFIER: b2BlockAllocator [b2BlockAllocator.cpp <204:6 204:21>]
|
||||
SYMBOL_CLASS: b2BlockAllocator [b2BlockAllocator.h <35:1 <35:7 35:22> 60:1>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::b2BlockAllocator() [b2BlockAllocator.cpp <55:1 <55:19 55:34> 85:1>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::b2BlockAllocator() [b2BlockAllocator.h <38:2 <38:2 38:17> 38:19>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::~b2BlockAllocator() [b2BlockAllocator.cpp <87:1 <87:19 87:35> 95:1>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::~b2BlockAllocator() [b2BlockAllocator.h <39:2 <39:2 39:18> 39:20>]
|
||||
SYMBOL_METHOD: public void * b2BlockAllocator::Allocate(int32) [b2BlockAllocator.cpp <97:1 <97:25 97:32> 153:1>]
|
||||
SYMBOL_METHOD: public void * b2BlockAllocator::Allocate(int32) [b2BlockAllocator.h <42:2 <42:8 42:15> 42:27>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::Free(void *, int32) [b2BlockAllocator.cpp <155:1 <155:24 155:27> 202:1>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::Free(void *, int32) [b2BlockAllocator.h <45:2 <45:7 45:10> 45:31>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::Clear() [b2BlockAllocator.cpp <204:1 <204:24 204:28> 215:1>]
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::Clear() [b2BlockAllocator.h <47:2 <47:7 47:11> 47:13>]
|
||||
SYMBOL_FIELD: private b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.h <51:11 51:18>]
|
||||
SYMBOL_FIELD: private int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.h <52:8 52:19>]
|
||||
SYMBOL_FIELD: private int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.h <53:8 53:19>]
|
||||
SYMBOL_FIELD: private b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.h <55:11 55:21>]
|
||||
SYMBOL_FIELD: private static int32 [] b2BlockAllocator::s_blockSizes [b2BlockAllocator.cpp <24:25 24:36>]
|
||||
SYMBOL_FIELD: private static int32 [] b2BlockAllocator::s_blockSizes [b2BlockAllocator.h <57:15 57:26>]
|
||||
SYMBOL_FIELD: private static uint8 [] b2BlockAllocator::s_blockSizeLookup [b2BlockAllocator.cpp <41:25 41:41>]
|
||||
SYMBOL_FIELD: private static uint8 [] b2BlockAllocator::s_blockSizeLookup [b2BlockAllocator.h <58:15 58:31>]
|
||||
SYMBOL_FIELD: private static bool b2BlockAllocator::s_blockSizeLookupInitialized [b2BlockAllocator.cpp <42:24 42:51>]
|
||||
SYMBOL_FIELD: private static bool b2BlockAllocator::s_blockSizeLookupInitialized [b2BlockAllocator.h <59:14 59:41>]
|
||||
SYMBOL_BUILTIN_TYPE: bool
|
||||
SYMBOL_METHOD: public void b2BlockAllocator::b2BlockAllocator(const b2BlockAllocator &) [b2BlockAllocator.h <35:7 <35:7 35:22> 35:22>]
|
||||
SYMBOL_FIELD: public int32 b2Chunk::blockSize [b2BlockAllocator.cpp <46:8 46:16>]
|
||||
SYMBOL_FIELD: public b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <47:11 47:16>]
|
||||
SYMBOL_FIELD: public b2Block * b2Block::next [b2BlockAllocator.cpp <52:11 52:14>]
|
||||
SYMBOL_FUNCTION: void _wassert(const wchar_t *, const wchar_t *, unsigned int)
|
||||
SYMBOL_FUNCTION: void * memset(void *, int, size_t)
|
||||
SYMBOL_FUNCTION: void * memcpy(void *, const void *, size_t)
|
||||
REFERENCE_INCLUDE: b2BlockAllocator.cpp -> b2BlockAllocator.h [b2BlockAllocator.cpp <19:10 19:42>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.h -> B2_BLOCK_ALLOCATOR_H [b2BlockAllocator.h <19:9 19:28>]
|
||||
REFERENCE_INCLUDE: b2BlockAllocator.h -> b2Settings.h [b2BlockAllocator.h <22:10 22:36>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> B2_SETTINGS_H [b2Settings.h <19:9 19:21>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> stddef.h [b2Settings.h <22:10 22:19>]
|
||||
REFERENCE_INCLUDE: stddef.h -> corecrt.h [stddef.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt.h -> vcruntime.h [corecrt.h <10:10 10:22>]
|
||||
REFERENCE_INCLUDE: vcruntime.h -> sal.h [vcruntime.h <47:10 47:16>]
|
||||
REFERENCE_INCLUDE: sal.h -> concurrencysal.h [sal.h <2990:10 2990:27>]
|
||||
REFERENCE_INCLUDE: vcruntime.h -> vadefs.h [vcruntime.h <48:10 48:19>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> assert.h [b2Settings.h <23:10 23:19>]
|
||||
REFERENCE_INCLUDE: assert.h -> corecrt.h [assert.h <12:10 12:20>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> float.h [b2Settings.h <24:10 24:18>]
|
||||
REFERENCE_INCLUDE: float.h -> corecrt.h [float.h <12:10 12:20>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> NDEBUG [b2Settings.h <26:14 26:19>]
|
||||
REFERENCE_INCLUDE: b2BlockAllocator.cpp -> limits.h [b2BlockAllocator.cpp <20:10 20:19>]
|
||||
REFERENCE_INCLUDE: limits.h -> vcruntime.h [limits.h <11:10 11:22>]
|
||||
REFERENCE_INCLUDE: b2BlockAllocator.cpp -> string.h [b2BlockAllocator.cpp <21:10 21:19>]
|
||||
REFERENCE_INCLUDE: string.h -> corecrt.h [string.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: string.h -> corecrt_memory.h [string.h <12:10 12:27>]
|
||||
REFERENCE_INCLUDE: corecrt_memory.h -> corecrt.h [corecrt_memory.h <13:10 13:20>]
|
||||
REFERENCE_INCLUDE: corecrt_memory.h -> corecrt_memcpy_s.h [corecrt_memory.h <14:10 14:29>]
|
||||
REFERENCE_INCLUDE: corecrt_memcpy_s.h -> corecrt.h [corecrt_memcpy_s.h <10:10 10:20>]
|
||||
REFERENCE_INCLUDE: corecrt_memcpy_s.h -> errno.h [corecrt_memcpy_s.h <11:10 11:18>]
|
||||
REFERENCE_INCLUDE: errno.h -> corecrt.h [errno.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt_memcpy_s.h -> vcruntime_string.h [corecrt_memcpy_s.h <12:10 12:29>]
|
||||
REFERENCE_INCLUDE: vcruntime_string.h -> vcruntime.h [vcruntime_string.h <10:10 10:22>]
|
||||
REFERENCE_INCLUDE: corecrt_memory.h -> vcruntime_string.h [corecrt_memory.h <15:10 15:29>]
|
||||
REFERENCE_INCLUDE: string.h -> corecrt_wstring.h [string.h <13:10 13:28>]
|
||||
REFERENCE_INCLUDE: corecrt_wstring.h -> corecrt.h [corecrt_wstring.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt_wstring.h -> vcruntime_string.h [corecrt_wstring.h <12:10 12:29>]
|
||||
REFERENCE_INCLUDE: string.h -> vcruntime_string.h [string.h <14:10 14:29>]
|
||||
REFERENCE_INCLUDE: b2BlockAllocator.cpp -> stddef.h [b2BlockAllocator.cpp <22:10 22:19>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <57:2 57:9>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <71:4 71:11>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <102:2 102:9>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <110:2 110:9>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <138:3 138:10>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <162:2 162:9>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> b2Assert [b2BlockAllocator.cpp <171:2 171:9>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> UCHAR_MAX [b2BlockAllocator.cpp <57:27 57:35>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> assert [b2Settings.h <31:21 31:26>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> _DEBUG [b2BlockAllocator.cpp <132:13 132:18>]
|
||||
REFERENCE_MACRO_USAGE: b2BlockAllocator.cpp -> _DEBUG [b2BlockAllocator.cpp <173:8 173:13>]
|
||||
REFERENCE_TYPE_USAGE: int8 -> signed char [b2Settings.h <33:9 33:14>]
|
||||
REFERENCE_TYPE_USAGE: int16 -> short [b2Settings.h <34:9 34:14>]
|
||||
REFERENCE_TYPE_USAGE: int32 -> int [b2Settings.h <35:9 35:14>]
|
||||
REFERENCE_TYPE_USAGE: uint8 -> unsigned char [b2Settings.h <36:9 36:16>]
|
||||
REFERENCE_TYPE_USAGE: uint16 -> unsigned short [b2Settings.h <37:9 37:16>]
|
||||
REFERENCE_TYPE_USAGE: uint32 -> unsigned int [b2Settings.h <38:9 38:16>]
|
||||
REFERENCE_TYPE_USAGE: float32 -> float [b2Settings.h <39:9 39:13>]
|
||||
REFERENCE_TYPE_USAGE: float64 -> double [b2Settings.h <40:9 40:14>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> void [b2Settings.h <135:1 135:4>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> int32 [b2Settings.h <135:15 135:19>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.h <138:1 138:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.h <138:13 138:16>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> void [b2Settings.h <141:1 141:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> char [b2Settings.h <141:18 141:21>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::major -> int32 [b2Settings.h <147:2 147:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::minor -> int32 [b2Settings.h <148:2 148:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::revision -> int32 [b2Settings.h <149:2 149:6>]
|
||||
REFERENCE_TYPE_USAGE: b2Version b2_version -> b2Version [b2Settings.h <153:8 153:16>]
|
||||
REFERENCE_TYPE_USAGE: const int32 b2_chunkSize -> int32 [b2BlockAllocator.h <24:7 24:11>]
|
||||
REFERENCE_TYPE_USAGE: const int32 b2_maxBlockSize -> int32 [b2BlockAllocator.h <25:7 25:11>]
|
||||
REFERENCE_TYPE_USAGE: const int32 b2_blockSizes -> int32 [b2BlockAllocator.h <26:7 26:11>]
|
||||
REFERENCE_TYPE_USAGE: const int32 b2_chunkArrayIncrement -> int32 [b2BlockAllocator.h <27:7 27:11>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> void [b2BlockAllocator.cpp <97:1 97:4>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> void [b2BlockAllocator.cpp <102:2 102:9>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> void [b2BlockAllocator.cpp <110:2 110:9>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> void [b2BlockAllocator.cpp <138:3 138:10>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> void [b2BlockAllocator.h <42:2 42:5>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 [b2BlockAllocator.cpp <97:34 97:38>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 [b2BlockAllocator.cpp <109:2 109:6>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 [b2BlockAllocator.cpp <135:3 135:7>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 [b2BlockAllocator.cpp <137:3 137:7>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 [b2BlockAllocator.cpp <139:8 139:12>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 [b2BlockAllocator.h <42:17 42:21>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> void [b2BlockAllocator.cpp <155:1 155:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> void [b2BlockAllocator.cpp <155:29 155:32>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> void [b2BlockAllocator.cpp <162:2 162:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> void [b2BlockAllocator.cpp <171:2 171:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> void [b2BlockAllocator.h <45:2 45:5>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> void [b2BlockAllocator.h <45:12 45:15>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> int32 [b2BlockAllocator.cpp <155:38 155:42>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> int32 [b2BlockAllocator.cpp <170:2 170:6>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> int32 [b2BlockAllocator.h <45:21 45:25>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Clear() -> void [b2BlockAllocator.cpp <204:1 204:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Clear() -> void [b2BlockAllocator.h <47:2 47:5>]
|
||||
REFERENCE_TYPE_USAGE: b2Chunk * b2BlockAllocator::m_chunks -> b2Chunk [b2BlockAllocator.h <51:2 51:8>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2BlockAllocator::m_chunkCount -> int32 [b2BlockAllocator.h <52:2 52:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2BlockAllocator::m_chunkSpace -> int32 [b2BlockAllocator.h <53:2 53:6>]
|
||||
REFERENCE_TYPE_USAGE: b2Block * [] b2BlockAllocator::m_freeLists -> b2Block [b2BlockAllocator.h <55:2 55:8>]
|
||||
REFERENCE_USAGE: b2Block * [] b2BlockAllocator::m_freeLists -> const int32 b2_blockSizes [b2BlockAllocator.h <55:23 55:35>]
|
||||
REFERENCE_TYPE_USAGE: static int32 [] b2BlockAllocator::s_blockSizes -> int32 [b2BlockAllocator.cpp <24:1 24:5>]
|
||||
REFERENCE_TYPE_USAGE: static int32 [] b2BlockAllocator::s_blockSizes -> int32 [b2BlockAllocator.h <57:9 57:13>]
|
||||
REFERENCE_USAGE: static int32 [] b2BlockAllocator::s_blockSizes -> const int32 b2_blockSizes [b2BlockAllocator.cpp <24:38 24:50>]
|
||||
REFERENCE_USAGE: static int32 [] b2BlockAllocator::s_blockSizes -> const int32 b2_blockSizes [b2BlockAllocator.h <57:28 57:40>]
|
||||
REFERENCE_TYPE_USAGE: static uint8 [] b2BlockAllocator::s_blockSizeLookup -> uint8 [b2BlockAllocator.cpp <41:1 41:5>]
|
||||
REFERENCE_TYPE_USAGE: static uint8 [] b2BlockAllocator::s_blockSizeLookup -> uint8 [b2BlockAllocator.h <58:9 58:13>]
|
||||
REFERENCE_USAGE: static uint8 [] b2BlockAllocator::s_blockSizeLookup -> const int32 b2_maxBlockSize [b2BlockAllocator.cpp <41:43 41:57>]
|
||||
REFERENCE_USAGE: static uint8 [] b2BlockAllocator::s_blockSizeLookup -> const int32 b2_maxBlockSize [b2BlockAllocator.h <58:33 58:47>]
|
||||
REFERENCE_TYPE_USAGE: static bool b2BlockAllocator::s_blockSizeLookupInitialized -> bool [b2BlockAllocator.cpp <42:1 42:4>]
|
||||
REFERENCE_TYPE_USAGE: static bool b2BlockAllocator::s_blockSizeLookupInitialized -> bool [b2BlockAllocator.h <59:9 59:12>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Chunk::blockSize -> int32 [b2BlockAllocator.cpp <46:2 46:6>]
|
||||
REFERENCE_TYPE_USAGE: b2Block * b2Chunk::blocks -> b2Block [b2BlockAllocator.cpp <47:2 47:8>]
|
||||
REFERENCE_TYPE_USAGE: b2Block * b2Block::next -> b2Block [b2BlockAllocator.cpp <52:2 52:8>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> void [b2BlockAllocator.cpp <57:2 57:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> void [b2BlockAllocator.cpp <71:4 71:11>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> const int32 b2_blockSizes [b2BlockAllocator.cpp <57:11 57:23>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> const int32 b2_blockSizes [b2BlockAllocator.cpp <71:17 71:29>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::b2BlockAllocator() -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <57:2 57:9>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::b2BlockAllocator() -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <71:4 71:11>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> unsigned int [b2BlockAllocator.cpp <57:2 57:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> unsigned int [b2BlockAllocator.cpp <71:4 71:11>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <59:2 59:13>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <61:31 61:42>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <63:22 63:33>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> const int32 b2_chunkArrayIncrement [b2BlockAllocator.cpp <59:17 59:38>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <60:2 60:13>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <61:2 61:9>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <63:9 63:16>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Chunk [b2BlockAllocator.cpp <61:14 61:20>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Chunk [b2BlockAllocator.cpp <61:53 61:59>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Chunk [b2BlockAllocator.cpp <63:44 63:50>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::b2BlockAllocator() -> void * b2Alloc(int32) [b2BlockAllocator.cpp <61:23 61:29>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::b2BlockAllocator() -> void * memset(void *, int, size_t) [b2BlockAllocator.cpp <63:2 63:7>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::b2BlockAllocator() -> void * memset(void *, int, size_t) [b2BlockAllocator.cpp <64:2 64:7>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <64:9 64:19>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <64:32 64:42>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> static bool b2BlockAllocator::s_blockSizeLookupInitialized [b2BlockAllocator.cpp <66:6 66:33>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> static bool b2BlockAllocator::s_blockSizeLookupInitialized [b2BlockAllocator.cpp <83:3 83:30>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> int32 [b2BlockAllocator.cpp <68:3 68:7>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> int32 [b2BlockAllocator.cpp <69:8 69:12>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> const int32 b2_maxBlockSize [b2BlockAllocator.cpp <69:26 69:40>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> static int32 [] b2BlockAllocator::s_blockSizes [b2BlockAllocator.cpp <72:13 72:24>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> static uint8 [] b2BlockAllocator::s_blockSizeLookup [b2BlockAllocator.cpp <74:5 74:21>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> static uint8 [] b2BlockAllocator::s_blockSizeLookup [b2BlockAllocator.cpp <79:5 79:21>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> uint8 [b2BlockAllocator.cpp <74:29 74:33>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::b2BlockAllocator() -> uint8 [b2BlockAllocator.cpp <79:29 79:33>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::~b2BlockAllocator() -> int32 [b2BlockAllocator.cpp <89:7 89:11>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::~b2BlockAllocator() -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <89:24 89:35>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::~b2BlockAllocator() -> void b2Free(void *) [b2BlockAllocator.cpp <91:3 91:8>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::~b2BlockAllocator() -> void b2Free(void *) [b2BlockAllocator.cpp <94:2 94:7>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::~b2BlockAllocator() -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <91:22 91:27>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::~b2BlockAllocator() -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <91:10 91:17>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::~b2BlockAllocator() -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <94:9 94:16>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <102:2 102:9>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <110:2 110:9>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <138:3 138:10>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> unsigned int [b2BlockAllocator.cpp <102:2 102:9>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> unsigned int [b2BlockAllocator.cpp <110:2 110:9>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> unsigned int [b2BlockAllocator.cpp <138:3 138:10>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_maxBlockSize [b2BlockAllocator.cpp <104:13 104:27>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void * b2Alloc(int32) [b2BlockAllocator.cpp <106:10 106:16>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void * b2Alloc(int32) [b2BlockAllocator.cpp <124:25 124:31>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void * b2Alloc(int32) [b2BlockAllocator.cpp <131:29 131:35>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> static uint8 [] b2BlockAllocator::s_blockSizeLookup [b2BlockAllocator.cpp <109:16 109:32>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_blockSizes [b2BlockAllocator.cpp <110:33 110:45>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <112:6 112:16>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <114:20 114:30>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <115:3 115:13>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <148:3 148:13>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <114:3 114:9>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <131:20 131:26>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <141:4 141:10>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <141:22 141:28>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <142:4 142:10>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <142:21 142:27>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <145:3 145:9>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block [b2BlockAllocator.cpp <145:20 145:26>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Block::next [b2BlockAllocator.cpp <115:31 115:34>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Block::next [b2BlockAllocator.cpp <143:11 143:14>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Block::next [b2BlockAllocator.cpp <146:9 146:12>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Block::next [b2BlockAllocator.cpp <148:39 148:42>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <120:7 120:18>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <125:32 125:43>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <126:22 126:33>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <130:31 130:42>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <149:5 149:16>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <120:23 120:34>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <123:4 123:15>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <124:33 124:44>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk [b2BlockAllocator.cpp <122:4 122:10>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk [b2BlockAllocator.cpp <124:16 124:22>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk [b2BlockAllocator.cpp <124:55 124:61>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk [b2BlockAllocator.cpp <125:54 125:60>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk [b2BlockAllocator.cpp <126:71 126:77>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk [b2BlockAllocator.cpp <130:3 130:9>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <122:25 122:32>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <124:4 124:11>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <125:11 125:18>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <126:11 126:18>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <130:20 130:27>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_chunkArrayIncrement [b2BlockAllocator.cpp <123:20 123:41>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_chunkArrayIncrement [b2BlockAllocator.cpp <126:39 126:60>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void * memcpy(void *, const void *, size_t) [b2BlockAllocator.cpp <125:4 125:9>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void * memset(void *, int, size_t) [b2BlockAllocator.cpp <126:4 126:9>]
|
||||
REFERENCE_CALL: void * b2BlockAllocator::Allocate(int32) -> void b2Free(void *) [b2BlockAllocator.cpp <127:4 127:9>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <131:10 131:15>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <141:46 141:51>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <142:45 142:50>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <145:44 145:49>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <148:31 148:36>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <151:17 151:22>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_chunkSize [b2BlockAllocator.cpp <131:37 131:48>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_chunkSize [b2BlockAllocator.cpp <137:22 137:33>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> const int32 b2_chunkSize [b2BlockAllocator.cpp <138:38 138:49>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> static int32 [] b2BlockAllocator::s_blockSizes [b2BlockAllocator.cpp <135:21 135:32>]
|
||||
REFERENCE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int32 b2Chunk::blockSize [b2BlockAllocator.cpp <136:10 136:18>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int8 [b2BlockAllocator.cpp <141:33 141:36>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int8 [b2BlockAllocator.cpp <142:32 142:35>]
|
||||
REFERENCE_TYPE_USAGE: void * b2BlockAllocator::Allocate(int32) -> int8 [b2BlockAllocator.cpp <145:31 145:34>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::Free(void *, int32) -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <162:2 162:9>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::Free(void *, int32) -> void _wassert(const wchar_t *, const wchar_t *, unsigned int) [b2BlockAllocator.cpp <171:2 171:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> unsigned int [b2BlockAllocator.cpp <162:2 162:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> unsigned int [b2BlockAllocator.cpp <171:2 171:9>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Free(void *, int32) -> const int32 b2_maxBlockSize [b2BlockAllocator.cpp <164:13 164:27>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::Free(void *, int32) -> void b2Free(void *) [b2BlockAllocator.cpp <166:3 166:8>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Free(void *, int32) -> static uint8 [] b2BlockAllocator::s_blockSizeLookup [b2BlockAllocator.cpp <170:16 170:32>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Free(void *, int32) -> const int32 b2_blockSizes [b2BlockAllocator.cpp <171:33 171:45>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> b2Block [b2BlockAllocator.cpp <199:2 199:8>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Free(void *, int32) -> b2Block [b2BlockAllocator.cpp <199:20 199:26>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Free(void *, int32) -> b2Block * b2Block::next [b2BlockAllocator.cpp <200:9 200:12>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Free(void *, int32) -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <200:16 200:26>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Free(void *, int32) -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <201:2 201:12>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Clear() -> int32 [b2BlockAllocator.cpp <206:7 206:11>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <206:24 206:35>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> int32 b2BlockAllocator::m_chunkCount [b2BlockAllocator.cpp <211:2 211:13>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::Clear() -> void b2Free(void *) [b2BlockAllocator.cpp <208:3 208:8>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> b2Block * b2Chunk::blocks [b2BlockAllocator.cpp <208:22 208:27>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <208:10 208:17>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> b2Chunk * b2BlockAllocator::m_chunks [b2BlockAllocator.cpp <212:9 212:16>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::Clear() -> void * memset(void *, int, size_t) [b2BlockAllocator.cpp <212:2 212:7>]
|
||||
REFERENCE_CALL: void b2BlockAllocator::Clear() -> void * memset(void *, int, size_t) [b2BlockAllocator.cpp <214:2 214:7>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> int32 b2BlockAllocator::m_chunkSpace [b2BlockAllocator.cpp <212:22 212:33>]
|
||||
REFERENCE_TYPE_USAGE: void b2BlockAllocator::Clear() -> b2Chunk [b2BlockAllocator.cpp <212:44 212:50>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <214:9 214:19>]
|
||||
REFERENCE_USAGE: void b2BlockAllocator::Clear() -> b2Block * [] b2BlockAllocator::m_freeLists [b2BlockAllocator.cpp <214:32 214:42>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<105:2> [b2BlockAllocator.cpp <105:2 105:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<105:2> [b2BlockAllocator.cpp <107:2 107:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <109:8 109:12>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <110:16 110:20>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <110:25 110:29>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <112:18 112:22>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <114:32 114:36>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <115:15 115:19>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <135:34 135:38>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<109:8> [b2BlockAllocator.cpp <148:15 148:19>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<113:2> [b2BlockAllocator.cpp <113:2 113:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<113:2> [b2BlockAllocator.cpp <117:2 117:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<114:12> [b2BlockAllocator.cpp <114:12 114:16>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<114:12> [b2BlockAllocator.cpp <115:24 115:28>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<114:12> [b2BlockAllocator.cpp <116:10 116:14>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<119:2> [b2BlockAllocator.cpp <119:2 119:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<119:2> [b2BlockAllocator.cpp <152:2 152:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<121:3> [b2BlockAllocator.cpp <121:3 121:3>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<121:3> [b2BlockAllocator.cpp <128:3 128:3>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<122:13> [b2BlockAllocator.cpp <122:13 122:21>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<122:13> [b2BlockAllocator.cpp <125:21 125:29>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<122:13> [b2BlockAllocator.cpp <127:11 127:19>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <130:12 130:16>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <131:3 131:7>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <136:3 136:7>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <141:39 141:43>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <142:38 142:42>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <145:37 145:41>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <148:24 148:28>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<130:12> [b2BlockAllocator.cpp <151:10 151:14>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <135:9 135:17>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <136:22 136:30>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <137:37 137:45>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <138:25 138:33>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <141:55 141:63>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <142:54 142:62>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<135:9> [b2BlockAllocator.cpp <145:53 145:61>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<137:9> [b2BlockAllocator.cpp <137:9 137:18>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<137:9> [b2BlockAllocator.cpp <138:12 138:21>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<137:9> [b2BlockAllocator.cpp <139:25 139:34>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<137:9> [b2BlockAllocator.cpp <145:66 145:75>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<139:14> [b2BlockAllocator.cpp <139:14 139:14>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<139:14> [b2BlockAllocator.cpp <139:21 139:21>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<139:14> [b2BlockAllocator.cpp <139:43 139:43>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<139:14> [b2BlockAllocator.cpp <141:67 141:67>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<139:14> [b2BlockAllocator.cpp <142:67 142:67>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<140:3> [b2BlockAllocator.cpp <140:3 140:3>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<140:3> [b2BlockAllocator.cpp <144:3 144:3>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<141:13> [b2BlockAllocator.cpp <141:13 141:17>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<141:13> [b2BlockAllocator.cpp <143:4 143:8>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<142:13> [b2BlockAllocator.cpp <142:13 142:16>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<142:13> [b2BlockAllocator.cpp <143:18 143:21>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<145:12> [b2BlockAllocator.cpp <145:12 145:15>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<145:12> [b2BlockAllocator.cpp <146:3 146:6>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:35> [b2BlockAllocator.cpp <155:35 155:35>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:35> [b2BlockAllocator.cpp <166:10 166:10>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:35> [b2BlockAllocator.cpp <199:29 199:29>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:44> [b2BlockAllocator.cpp <155:44 155:47>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:44> [b2BlockAllocator.cpp <157:6 157:9>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:44> [b2BlockAllocator.cpp <162:15 162:18>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:44> [b2BlockAllocator.cpp <164:6 164:9>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<155:44> [b2BlockAllocator.cpp <170:34 170:37>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<156:1> [b2BlockAllocator.cpp <156:1 156:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<156:1> [b2BlockAllocator.cpp <202:1 202:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<158:2> [b2BlockAllocator.cpp <158:2 158:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<158:2> [b2BlockAllocator.cpp <160:2 160:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<165:2> [b2BlockAllocator.cpp <165:2 165:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<165:2> [b2BlockAllocator.cpp <168:2 168:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<170:8> [b2BlockAllocator.cpp <170:8 170:12>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<170:8> [b2BlockAllocator.cpp <171:16 171:20>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<170:8> [b2BlockAllocator.cpp <171:25 171:29>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<170:8> [b2BlockAllocator.cpp <200:28 200:32>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<170:8> [b2BlockAllocator.cpp <201:14 201:18>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<199:11> [b2BlockAllocator.cpp <199:11 199:15>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<199:11> [b2BlockAllocator.cpp <200:2 200:6>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<199:11> [b2BlockAllocator.cpp <201:23 201:27>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<205:1> [b2BlockAllocator.cpp <205:1 205:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<205:1> [b2BlockAllocator.cpp <215:1 215:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<206:13> [b2BlockAllocator.cpp <206:13 206:13>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<206:13> [b2BlockAllocator.cpp <206:20 206:20>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<206:13> [b2BlockAllocator.cpp <206:40 206:40>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<206:13> [b2BlockAllocator.cpp <208:19 208:19>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<207:2> [b2BlockAllocator.cpp <207:2 207:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<207:2> [b2BlockAllocator.cpp <209:2 209:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<25:1> [b2BlockAllocator.cpp <25:1 25:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<25:1> [b2BlockAllocator.cpp <40:1 40:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<45:1> [b2BlockAllocator.cpp <45:1 45:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<45:1> [b2BlockAllocator.cpp <48:1 48:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<51:1> [b2BlockAllocator.cpp <51:1 51:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<51:1> [b2BlockAllocator.cpp <53:1 53:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<56:1> [b2BlockAllocator.cpp <56:1 56:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<56:1> [b2BlockAllocator.cpp <85:1 85:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<67:2> [b2BlockAllocator.cpp <67:2 67:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<67:2> [b2BlockAllocator.cpp <84:2 84:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<68:9> [b2BlockAllocator.cpp <68:9 68:9>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<68:9> [b2BlockAllocator.cpp <71:13 71:13>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<68:9> [b2BlockAllocator.cpp <72:26 72:26>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<68:9> [b2BlockAllocator.cpp <74:35 74:35>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<68:9> [b2BlockAllocator.cpp <78:7 78:7>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<68:9> [b2BlockAllocator.cpp <79:35 79:35>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<69:14> [b2BlockAllocator.cpp <69:14 69:14>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<69:14> [b2BlockAllocator.cpp <69:21 69:21>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<69:14> [b2BlockAllocator.cpp <69:45 69:45>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<69:14> [b2BlockAllocator.cpp <72:8 72:8>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<69:14> [b2BlockAllocator.cpp <74:23 74:23>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<69:14> [b2BlockAllocator.cpp <79:23 79:23>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<70:3> [b2BlockAllocator.cpp <70:3 70:3>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<70:3> [b2BlockAllocator.cpp <81:3 81:3>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<73:4> [b2BlockAllocator.cpp <73:4 73:4>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<73:4> [b2BlockAllocator.cpp <75:4 75:4>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<77:4> [b2BlockAllocator.cpp <77:4 77:4>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<77:4> [b2BlockAllocator.cpp <80:4 80:4>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<88:1> [b2BlockAllocator.cpp <88:1 88:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<88:1> [b2BlockAllocator.cpp <95:1 95:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<89:13> [b2BlockAllocator.cpp <89:13 89:13>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<89:13> [b2BlockAllocator.cpp <89:20 89:20>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<89:13> [b2BlockAllocator.cpp <89:40 89:40>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<89:13> [b2BlockAllocator.cpp <91:19 91:19>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<90:2> [b2BlockAllocator.cpp <90:2 90:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<90:2> [b2BlockAllocator.cpp <92:2 92:2>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<97:40> [b2BlockAllocator.cpp <97:40 97:43>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<97:40> [b2BlockAllocator.cpp <99:6 99:9>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<97:40> [b2BlockAllocator.cpp <102:15 102:18>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<97:40> [b2BlockAllocator.cpp <104:6 104:9>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<97:40> [b2BlockAllocator.cpp <106:18 106:21>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<97:40> [b2BlockAllocator.cpp <109:34 109:37>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<98:1> [b2BlockAllocator.cpp <98:1 98:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.cpp<98:1> [b2BlockAllocator.cpp <153:1 153:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.h<36:1> [b2BlockAllocator.h <36:1 36:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.h<36:1> [b2BlockAllocator.h <60:1 60:1>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.h<42:23> [b2BlockAllocator.h <42:23 42:26>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.h<45:18> [b2BlockAllocator.h <45:18 45:18>]
|
||||
LOCAL_SYMBOL: b2BlockAllocator.h<45:27> [b2BlockAllocator.h <45:27 45:30>]
|
||||
LOCAL_SYMBOL: b2Settings.h<135:21> [b2Settings.h <135:21 135:24>]
|
||||
LOCAL_SYMBOL: b2Settings.h<138:19> [b2Settings.h <138:19 138:21>]
|
||||
LOCAL_SYMBOL: b2Settings.h<141:24> [b2Settings.h <141:24 141:29>]
|
||||
LOCAL_SYMBOL: b2Settings.h<146:1> [b2Settings.h <146:1 146:1>]
|
||||
LOCAL_SYMBOL: b2Settings.h<146:1> [b2Settings.h <150:1 150:1>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <1:1 17:3>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <26:7 26:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <27:7 27:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <28:7 28:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <29:7 29:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <30:7 30:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <31:7 31:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <32:7 32:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <33:7 33:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <34:7 34:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <35:7 35:11>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <36:7 36:12>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <37:7 37:12>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <38:7 38:12>]
|
||||
COMMENT: comment [b2BlockAllocator.cpp <39:7 39:12>]
|
||||
COMMENT: comment [b2BlockAllocator.h <1:1 17:3>]
|
||||
COMMENT: comment [b2BlockAllocator.h <32:1 32:63>]
|
||||
COMMENT: comment [b2BlockAllocator.h <33:1 33:54>]
|
||||
COMMENT: comment [b2BlockAllocator.h <34:1 34:72>]
|
||||
COMMENT: comment [b2BlockAllocator.h <41:2 41:88>]
|
||||
COMMENT: comment [b2BlockAllocator.h <44:2 44:83>]
|
||||
COMMENT: comment [b2Settings.h <1:1 17:3>]
|
||||
COMMENT: comment [b2Settings.h <46:1 46:10>]
|
||||
COMMENT: comment [b2Settings.h <47:1 47:75>]
|
||||
COMMENT: comment [b2Settings.h <48:1 48:4>]
|
||||
COMMENT: comment [b2Settings.h <50:1 50:13>]
|
||||
COMMENT: comment [b2Settings.h <52:1 52:71>]
|
||||
COMMENT: comment [b2Settings.h <53:1 53:27>]
|
||||
COMMENT: comment [b2Settings.h <56:1 56:76>]
|
||||
COMMENT: comment [b2Settings.h <57:1 57:70>]
|
||||
COMMENT: comment [b2Settings.h <60:1 60:74>]
|
||||
COMMENT: comment [b2Settings.h <61:1 61:68>]
|
||||
COMMENT: comment [b2Settings.h <62:1 62:23>]
|
||||
COMMENT: comment [b2Settings.h <65:1 65:78>]
|
||||
COMMENT: comment [b2Settings.h <66:1 66:59>]
|
||||
COMMENT: comment [b2Settings.h <67:1 67:40>]
|
||||
COMMENT: comment [b2Settings.h <70:1 70:79>]
|
||||
COMMENT: comment [b2Settings.h <71:1 71:70>]
|
||||
COMMENT: comment [b2Settings.h <74:1 74:78>]
|
||||
COMMENT: comment [b2Settings.h <75:1 75:70>]
|
||||
COMMENT: comment [b2Settings.h <78:1 78:83>]
|
||||
COMMENT: comment [b2Settings.h <79:1 79:91>]
|
||||
COMMENT: comment [b2Settings.h <80:1 80:64>]
|
||||
COMMENT: comment [b2Settings.h <83:1 83:78>]
|
||||
COMMENT: comment [b2Settings.h <87:1 87:12>]
|
||||
COMMENT: comment [b2Settings.h <89:1 89:68>]
|
||||
COMMENT: comment [b2Settings.h <92:1 92:86>]
|
||||
COMMENT: comment [b2Settings.h <93:1 93:64>]
|
||||
COMMENT: comment [b2Settings.h <96:1 96:88>]
|
||||
COMMENT: comment [b2Settings.h <97:1 97:23>]
|
||||
COMMENT: comment [b2Settings.h <100:1 100:89>]
|
||||
COMMENT: comment [b2Settings.h <101:1 101:23>]
|
||||
COMMENT: comment [b2Settings.h <104:1 104:80>]
|
||||
COMMENT: comment [b2Settings.h <105:1 105:70>]
|
||||
COMMENT: comment [b2Settings.h <109:1 109:81>]
|
||||
COMMENT: comment [b2Settings.h <110:1 110:70>]
|
||||
COMMENT: comment [b2Settings.h <114:1 114:88>]
|
||||
COMMENT: comment [b2Settings.h <115:1 115:89>]
|
||||
COMMENT: comment [b2Settings.h <116:1 116:18>]
|
||||
COMMENT: comment [b2Settings.h <121:1 121:9>]
|
||||
COMMENT: comment [b2Settings.h <123:1 123:67>]
|
||||
COMMENT: comment [b2Settings.h <126:1 126:72>]
|
||||
COMMENT: comment [b2Settings.h <129:1 129:73>]
|
||||
COMMENT: comment [b2Settings.h <132:1 132:21>]
|
||||
COMMENT: comment [b2Settings.h <134:1 134:62>]
|
||||
COMMENT: comment [b2Settings.h <137:1 137:71>]
|
||||
COMMENT: comment [b2Settings.h <140:1 140:22>]
|
||||
COMMENT: comment [b2Settings.h <143:1 143:30>]
|
||||
COMMENT: comment [b2Settings.h <144:1 144:57>]
|
||||
COMMENT: comment [b2Settings.h <147:16 147:40>]
|
||||
COMMENT: comment [b2Settings.h <148:16 148:40>]
|
||||
COMMENT: comment [b2Settings.h <149:19 149:33>]
|
||||
COMMENT: comment [b2Settings.h <152:1 152:21>]
|
||||
-2306
File diff suppressed because it is too large
Load Diff
-2386
File diff suppressed because it is too large
Load Diff
-231
@@ -1,231 +0,0 @@
|
||||
FILE: b2Settings.cpp
|
||||
FILE: b2Settings.h
|
||||
FILE: stddef.h non-indexed
|
||||
FILE: corecrt.h non-indexed
|
||||
FILE: vcruntime.h non-indexed
|
||||
FILE: sal.h non-indexed
|
||||
FILE: concurrencysal.h non-indexed
|
||||
FILE: vadefs.h non-indexed
|
||||
FILE: assert.h non-indexed
|
||||
FILE: float.h non-indexed
|
||||
FILE: stdio.h non-indexed
|
||||
FILE: corecrt_wstdio.h non-indexed
|
||||
FILE: corecrt_stdio_config.h non-indexed
|
||||
FILE: stdarg.h non-indexed
|
||||
FILE: stdlib.h non-indexed
|
||||
FILE: corecrt_malloc.h non-indexed
|
||||
FILE: corecrt_search.h non-indexed
|
||||
FILE: corecrt_wstdlib.h non-indexed
|
||||
FILE: limits.h non-indexed
|
||||
SYMBOL_MACRO: B2_SETTINGS_H [b2Settings.h <20:9 20:21>]
|
||||
SYMBOL_MACRO: b2DEBUG [b2Settings.h <27:10 27:16>]
|
||||
SYMBOL_MACRO: B2_NOT_USED [b2Settings.h <30:9 <30:9 30:19> 30:33>]
|
||||
SYMBOL_MACRO: b2Assert [b2Settings.h <31:9 <31:9 31:16> 31:28>]
|
||||
SYMBOL_MACRO: b2_maxFloat [b2Settings.h <42:9 <42:9 42:19> 42:21>]
|
||||
SYMBOL_MACRO: b2_epsilon [b2Settings.h <43:9 <43:9 43:18> 43:20>]
|
||||
SYMBOL_MACRO: b2_pi [b2Settings.h <44:9 <44:9 44:13> 44:16>]
|
||||
SYMBOL_MACRO: b2_maxManifoldPoints [b2Settings.h <54:9 <54:9 54:28> 54:29>]
|
||||
SYMBOL_MACRO: b2_maxPolygonVertices [b2Settings.h <58:9 <58:9 58:29> 58:30>]
|
||||
SYMBOL_MACRO: b2_aabbExtension [b2Settings.h <63:9 <63:9 63:24> 63:26>]
|
||||
SYMBOL_MACRO: b2_aabbMultiplier [b2Settings.h <68:9 <68:9 68:25> 68:27>]
|
||||
SYMBOL_MACRO: b2_linearSlop [b2Settings.h <72:9 <72:9 72:21> 72:24>]
|
||||
SYMBOL_MACRO: b2_angularSlop [b2Settings.h <76:9 <76:9 76:22> 76:47>]
|
||||
SYMBOL_MACRO: b2_polygonRadius [b2Settings.h <81:9 <81:9 81:24> 81:47>]
|
||||
SYMBOL_MACRO: b2_maxSubSteps [b2Settings.h <84:9 <84:9 84:22> 84:25>]
|
||||
SYMBOL_MACRO: b2_maxTOIContacts [b2Settings.h <90:9 <90:9 90:25> 90:28>]
|
||||
SYMBOL_MACRO: b2_velocityThreshold [b2Settings.h <94:9 <94:9 94:28> 94:30>]
|
||||
SYMBOL_MACRO: b2_maxLinearCorrection [b2Settings.h <98:9 <98:9 98:30> 98:32>]
|
||||
SYMBOL_MACRO: b2_maxAngularCorrection [b2Settings.h <102:9 <102:9 102:31> 102:55>]
|
||||
SYMBOL_MACRO: b2_maxTranslation [b2Settings.h <106:9 <106:9 106:25> 106:28>]
|
||||
SYMBOL_MACRO: b2_maxTranslationSquared [b2Settings.h <107:9 <107:9 107:32> 107:71>]
|
||||
SYMBOL_MACRO: b2_maxRotation [b2Settings.h <111:9 <111:9 111:22> 111:39>]
|
||||
SYMBOL_MACRO: b2_maxRotationSquared [b2Settings.h <112:9 <112:9 112:29> 112:63>]
|
||||
SYMBOL_MACRO: b2_baumgarte [b2Settings.h <117:9 <117:9 117:20> 117:24>]
|
||||
SYMBOL_MACRO: b2_toiBaugarte [b2Settings.h <118:9 <118:9 118:22> 118:26>]
|
||||
SYMBOL_MACRO: b2_timeToSleep [b2Settings.h <124:9 <124:9 124:22> 124:26>]
|
||||
SYMBOL_MACRO: b2_linearSleepTolerance [b2Settings.h <127:9 <127:9 127:31> 127:33>]
|
||||
SYMBOL_MACRO: b2_angularSleepTolerance [b2Settings.h <130:9 <130:9 130:32> 130:55>]
|
||||
SYMBOL_TYPEDEF: int8 [b2Settings.h <33:21 33:24>]
|
||||
SYMBOL_BUILTIN_TYPE: signed char
|
||||
SYMBOL_TYPEDEF: int16 [b2Settings.h <34:22 34:26>]
|
||||
SYMBOL_BUILTIN_TYPE: short
|
||||
SYMBOL_TYPEDEF: int32 [b2Settings.h <35:20 35:24>]
|
||||
SYMBOL_BUILTIN_TYPE: int
|
||||
SYMBOL_TYPEDEF: uint8 [b2Settings.h <36:23 36:27>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned char
|
||||
SYMBOL_TYPEDEF: uint16 [b2Settings.h <37:24 37:29>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned short
|
||||
SYMBOL_TYPEDEF: uint32 [b2Settings.h <38:22 38:27>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned int
|
||||
SYMBOL_TYPEDEF: float32 [b2Settings.h <39:15 39:21>]
|
||||
SYMBOL_BUILTIN_TYPE: float
|
||||
SYMBOL_TYPEDEF: float64 [b2Settings.h <40:16 40:22>]
|
||||
SYMBOL_BUILTIN_TYPE: double
|
||||
SYMBOL_FUNCTION: void * b2Alloc(int32) [b2Settings.cpp <27:1 <27:7 27:13> 30:1>]
|
||||
SYMBOL_FUNCTION: void * b2Alloc(int32) [b2Settings.h <135:1 <135:7 135:13> 135:25>]
|
||||
SYMBOL_BUILTIN_TYPE: void
|
||||
SYMBOL_FUNCTION: void b2Free(void *) [b2Settings.cpp <32:1 <32:6 32:11> 35:1>]
|
||||
SYMBOL_FUNCTION: void b2Free(void *) [b2Settings.h <138:1 <138:6 138:11> 138:22>]
|
||||
SYMBOL_FUNCTION: void b2Log(const char *) [b2Settings.cpp <38:1 <38:6 38:10> 44:1>]
|
||||
SYMBOL_FUNCTION: void b2Log(const char *) [b2Settings.h <141:1 <141:6 141:10> 141:35>]
|
||||
SYMBOL_BUILTIN_TYPE: char
|
||||
SYMBOL_STRUCT: b2Version [b2Settings.h <145:1 <145:8 145:16> 150:1>]
|
||||
SYMBOL_FIELD: public int32 b2Version::major [b2Settings.h <147:8 147:12>]
|
||||
SYMBOL_FIELD: public int32 b2Version::minor [b2Settings.h <148:8 148:12>]
|
||||
SYMBOL_FIELD: public int32 b2Version::revision [b2Settings.h <149:8 149:15>]
|
||||
SYMBOL_GLOBAL_VARIABLE: b2Version b2_version [b2Settings.cpp <24:11 24:20>]
|
||||
SYMBOL_GLOBAL_VARIABLE: b2Version b2_version [b2Settings.h <153:18 153:27>]
|
||||
SYMBOL_FUNCTION: void * malloc(size_t)
|
||||
SYMBOL_FUNCTION: void free(void *)
|
||||
SYMBOL_FUNCTION: void __vcrt_assert_va_start_is_not_reference<const char *>::__vcrt_assert_va_start_is_not_reference()
|
||||
SYMBOL_FUNCTION: int vprintf(const char * const, va_list)
|
||||
REFERENCE_INCLUDE: b2Settings.cpp -> b2Settings.h [b2Settings.cpp <19:10 19:36>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> B2_SETTINGS_H [b2Settings.h <19:9 19:21>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> stddef.h [b2Settings.h <22:10 22:19>]
|
||||
REFERENCE_INCLUDE: stddef.h -> corecrt.h [stddef.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt.h -> vcruntime.h [corecrt.h <10:10 10:22>]
|
||||
REFERENCE_INCLUDE: vcruntime.h -> sal.h [vcruntime.h <47:10 47:16>]
|
||||
REFERENCE_INCLUDE: sal.h -> concurrencysal.h [sal.h <2990:10 2990:27>]
|
||||
REFERENCE_INCLUDE: vcruntime.h -> vadefs.h [vcruntime.h <48:10 48:19>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> assert.h [b2Settings.h <23:10 23:19>]
|
||||
REFERENCE_INCLUDE: assert.h -> corecrt.h [assert.h <12:10 12:20>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> float.h [b2Settings.h <24:10 24:18>]
|
||||
REFERENCE_INCLUDE: float.h -> corecrt.h [float.h <12:10 12:20>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> NDEBUG [b2Settings.h <26:14 26:19>]
|
||||
REFERENCE_INCLUDE: b2Settings.cpp -> stdio.h [b2Settings.cpp <20:10 20:18>]
|
||||
REFERENCE_INCLUDE: stdio.h -> corecrt.h [stdio.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: stdio.h -> corecrt_wstdio.h [stdio.h <12:10 12:27>]
|
||||
REFERENCE_INCLUDE: corecrt_wstdio.h -> corecrt.h [corecrt_wstdio.h <12:10 12:20>]
|
||||
REFERENCE_INCLUDE: corecrt_wstdio.h -> corecrt_stdio_config.h [corecrt_wstdio.h <13:10 13:33>]
|
||||
REFERENCE_INCLUDE: corecrt_stdio_config.h -> corecrt.h [corecrt_stdio_config.h <10:10 10:20>]
|
||||
REFERENCE_INCLUDE: b2Settings.cpp -> stdarg.h [b2Settings.cpp <21:10 21:19>]
|
||||
REFERENCE_INCLUDE: stdarg.h -> vcruntime.h [stdarg.h <11:10 11:22>]
|
||||
REFERENCE_INCLUDE: b2Settings.cpp -> stdlib.h [b2Settings.cpp <22:10 22:19>]
|
||||
REFERENCE_INCLUDE: stdlib.h -> corecrt.h [stdlib.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: stdlib.h -> corecrt_malloc.h [stdlib.h <12:10 12:27>]
|
||||
REFERENCE_INCLUDE: corecrt_malloc.h -> corecrt.h [corecrt_malloc.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: stdlib.h -> corecrt_search.h [stdlib.h <13:10 13:27>]
|
||||
REFERENCE_INCLUDE: corecrt_search.h -> corecrt.h [corecrt_search.h <13:10 13:20>]
|
||||
REFERENCE_INCLUDE: corecrt_search.h -> stddef.h [corecrt_search.h <14:10 14:19>]
|
||||
REFERENCE_INCLUDE: stdlib.h -> corecrt_wstdlib.h [stdlib.h <14:10 14:28>]
|
||||
REFERENCE_INCLUDE: corecrt_wstdlib.h -> corecrt.h [corecrt_wstdlib.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: stdlib.h -> limits.h [stdlib.h <15:10 15:19>]
|
||||
REFERENCE_INCLUDE: limits.h -> vcruntime.h [limits.h <11:10 11:22>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.cpp -> va_start [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.cpp -> va_end [b2Settings.cpp <43:2 43:7>]
|
||||
REFERENCE_TYPE_USAGE: int8 -> signed char [b2Settings.h <33:9 33:14>]
|
||||
REFERENCE_TYPE_USAGE: int16 -> short [b2Settings.h <34:9 34:14>]
|
||||
REFERENCE_TYPE_USAGE: int32 -> int [b2Settings.h <35:9 35:14>]
|
||||
REFERENCE_TYPE_USAGE: uint8 -> unsigned char [b2Settings.h <36:9 36:16>]
|
||||
REFERENCE_TYPE_USAGE: uint16 -> unsigned short [b2Settings.h <37:9 37:16>]
|
||||
REFERENCE_TYPE_USAGE: uint32 -> unsigned int [b2Settings.h <38:9 38:16>]
|
||||
REFERENCE_TYPE_USAGE: float32 -> float [b2Settings.h <39:9 39:13>]
|
||||
REFERENCE_TYPE_USAGE: float64 -> double [b2Settings.h <40:9 40:14>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> void [b2Settings.cpp <27:1 27:4>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> void [b2Settings.h <135:1 135:4>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> int32 [b2Settings.cpp <27:15 27:19>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> int32 [b2Settings.h <135:15 135:19>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.cpp <32:1 32:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.cpp <32:13 32:16>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.h <138:1 138:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.h <138:13 138:16>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> void [b2Settings.cpp <38:1 38:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> void [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> void [b2Settings.cpp <43:2 43:7>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> void [b2Settings.h <141:1 141:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> char [b2Settings.cpp <38:18 38:21>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> char [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> char [b2Settings.h <141:18 141:21>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::major -> int32 [b2Settings.h <147:2 147:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::minor -> int32 [b2Settings.h <148:2 148:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::revision -> int32 [b2Settings.h <149:2 149:6>]
|
||||
REFERENCE_TYPE_USAGE: b2Version b2_version -> b2Version [b2Settings.cpp <24:1 24:9>]
|
||||
REFERENCE_TYPE_USAGE: b2Version b2_version -> b2Version [b2Settings.h <153:8 153:16>]
|
||||
REFERENCE_CALL: void * b2Alloc(int32) -> void * malloc(size_t) [b2Settings.cpp <29:9 29:14>]
|
||||
REFERENCE_CALL: void b2Free(void *) -> void free(void *) [b2Settings.cpp <34:2 34:5>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> va_list [b2Settings.cpp <40:2 40:8>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> va_list [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> va_list [b2Settings.cpp <43:2 43:7>]
|
||||
REFERENCE_CALL: void b2Log(const char *) -> void __vcrt_assert_va_start_is_not_reference<const char *>::__vcrt_assert_va_start_is_not_reference() [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> __vcrt_assert_va_start_is_not_reference<const char *> [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> int [b2Settings.cpp <41:2 41:9>]
|
||||
REFERENCE_CALL: void b2Log(const char *) -> int vprintf(const char * const, va_list) [b2Settings.cpp <42:2 42:8>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<24:24> [b2Settings.cpp <24:24 24:24>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<24:24> [b2Settings.cpp <24:32 24:32>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<27:21> [b2Settings.cpp <27:21 27:24>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<27:21> [b2Settings.cpp <29:16 29:19>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<28:1> [b2Settings.cpp <28:1 28:1>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<28:1> [b2Settings.cpp <30:1 30:1>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<32:19> [b2Settings.cpp <32:19 32:21>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<32:19> [b2Settings.cpp <34:7 34:9>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<33:1> [b2Settings.cpp <33:1 33:1>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<33:1> [b2Settings.cpp <35:1 35:1>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<38:24> [b2Settings.cpp <38:24 38:29>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<38:24> [b2Settings.cpp <41:17 41:22>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<38:24> [b2Settings.cpp <42:10 42:15>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<39:1> [b2Settings.cpp <39:1 39:1>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<39:1> [b2Settings.cpp <44:1 44:1>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<40:10> [b2Settings.cpp <40:10 40:13>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<40:10> [b2Settings.cpp <41:11 41:14>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<40:10> [b2Settings.cpp <42:18 42:21>]
|
||||
LOCAL_SYMBOL: b2Settings.cpp<40:10> [b2Settings.cpp <43:9 43:12>]
|
||||
LOCAL_SYMBOL: b2Settings.h<135:21> [b2Settings.h <135:21 135:24>]
|
||||
LOCAL_SYMBOL: b2Settings.h<138:19> [b2Settings.h <138:19 138:21>]
|
||||
LOCAL_SYMBOL: b2Settings.h<141:24> [b2Settings.h <141:24 141:29>]
|
||||
LOCAL_SYMBOL: b2Settings.h<146:1> [b2Settings.h <146:1 146:1>]
|
||||
LOCAL_SYMBOL: b2Settings.h<146:1> [b2Settings.h <150:1 150:1>]
|
||||
COMMENT: comment [b2Settings.cpp <1:1 17:3>]
|
||||
COMMENT: comment [b2Settings.cpp <26:1 26:62>]
|
||||
COMMENT: comment [b2Settings.cpp <37:1 37:53>]
|
||||
COMMENT: comment [b2Settings.h <1:1 17:3>]
|
||||
COMMENT: comment [b2Settings.h <46:1 46:10>]
|
||||
COMMENT: comment [b2Settings.h <47:1 47:75>]
|
||||
COMMENT: comment [b2Settings.h <48:1 48:4>]
|
||||
COMMENT: comment [b2Settings.h <50:1 50:13>]
|
||||
COMMENT: comment [b2Settings.h <52:1 52:71>]
|
||||
COMMENT: comment [b2Settings.h <53:1 53:27>]
|
||||
COMMENT: comment [b2Settings.h <56:1 56:76>]
|
||||
COMMENT: comment [b2Settings.h <57:1 57:70>]
|
||||
COMMENT: comment [b2Settings.h <60:1 60:74>]
|
||||
COMMENT: comment [b2Settings.h <61:1 61:68>]
|
||||
COMMENT: comment [b2Settings.h <62:1 62:23>]
|
||||
COMMENT: comment [b2Settings.h <65:1 65:78>]
|
||||
COMMENT: comment [b2Settings.h <66:1 66:59>]
|
||||
COMMENT: comment [b2Settings.h <67:1 67:40>]
|
||||
COMMENT: comment [b2Settings.h <70:1 70:79>]
|
||||
COMMENT: comment [b2Settings.h <71:1 71:70>]
|
||||
COMMENT: comment [b2Settings.h <74:1 74:78>]
|
||||
COMMENT: comment [b2Settings.h <75:1 75:70>]
|
||||
COMMENT: comment [b2Settings.h <78:1 78:83>]
|
||||
COMMENT: comment [b2Settings.h <79:1 79:91>]
|
||||
COMMENT: comment [b2Settings.h <80:1 80:64>]
|
||||
COMMENT: comment [b2Settings.h <83:1 83:78>]
|
||||
COMMENT: comment [b2Settings.h <87:1 87:12>]
|
||||
COMMENT: comment [b2Settings.h <89:1 89:68>]
|
||||
COMMENT: comment [b2Settings.h <92:1 92:86>]
|
||||
COMMENT: comment [b2Settings.h <93:1 93:64>]
|
||||
COMMENT: comment [b2Settings.h <96:1 96:88>]
|
||||
COMMENT: comment [b2Settings.h <97:1 97:23>]
|
||||
COMMENT: comment [b2Settings.h <100:1 100:89>]
|
||||
COMMENT: comment [b2Settings.h <101:1 101:23>]
|
||||
COMMENT: comment [b2Settings.h <104:1 104:80>]
|
||||
COMMENT: comment [b2Settings.h <105:1 105:70>]
|
||||
COMMENT: comment [b2Settings.h <109:1 109:81>]
|
||||
COMMENT: comment [b2Settings.h <110:1 110:70>]
|
||||
COMMENT: comment [b2Settings.h <114:1 114:88>]
|
||||
COMMENT: comment [b2Settings.h <115:1 115:89>]
|
||||
COMMENT: comment [b2Settings.h <116:1 116:18>]
|
||||
COMMENT: comment [b2Settings.h <121:1 121:9>]
|
||||
COMMENT: comment [b2Settings.h <123:1 123:67>]
|
||||
COMMENT: comment [b2Settings.h <126:1 126:72>]
|
||||
COMMENT: comment [b2Settings.h <129:1 129:73>]
|
||||
COMMENT: comment [b2Settings.h <132:1 132:21>]
|
||||
COMMENT: comment [b2Settings.h <134:1 134:62>]
|
||||
COMMENT: comment [b2Settings.h <137:1 137:71>]
|
||||
COMMENT: comment [b2Settings.h <140:1 140:22>]
|
||||
COMMENT: comment [b2Settings.h <143:1 143:30>]
|
||||
COMMENT: comment [b2Settings.h <144:1 144:57>]
|
||||
COMMENT: comment [b2Settings.h <147:16 147:40>]
|
||||
COMMENT: comment [b2Settings.h <148:16 148:40>]
|
||||
COMMENT: comment [b2Settings.h <149:19 149:33>]
|
||||
COMMENT: comment [b2Settings.h <152:1 152:21>]
|
||||
-2285
File diff suppressed because it is too large
Load Diff
-607
@@ -1,607 +0,0 @@
|
||||
FILE: b2Timer.cpp
|
||||
FILE: b2Timer.h
|
||||
FILE: b2Settings.h
|
||||
FILE: stddef.h non-indexed
|
||||
FILE: corecrt.h non-indexed
|
||||
FILE: vcruntime.h non-indexed
|
||||
FILE: sal.h non-indexed
|
||||
FILE: concurrencysal.h non-indexed
|
||||
FILE: vadefs.h non-indexed
|
||||
FILE: assert.h non-indexed
|
||||
FILE: float.h non-indexed
|
||||
FILE: Windows.h non-indexed
|
||||
FILE: winapifamily.h non-indexed
|
||||
FILE: sdkddkver.h non-indexed
|
||||
FILE: excpt.h non-indexed
|
||||
FILE: stdarg.h non-indexed
|
||||
FILE: windef.h non-indexed
|
||||
FILE: minwindef.h non-indexed
|
||||
FILE: specstrings.h non-indexed
|
||||
FILE: specstrings_strict.h non-indexed
|
||||
FILE: specstrings_undef.h non-indexed
|
||||
FILE: driverspecs.h non-indexed
|
||||
FILE: sdv_driverspecs.h non-indexed
|
||||
FILE: winnt.h non-indexed
|
||||
FILE: ctype.h non-indexed
|
||||
FILE: corecrt_wctype.h non-indexed
|
||||
FILE: kernelspecs.h non-indexed
|
||||
FILE: basetsd.h non-indexed
|
||||
FILE: guiddef.h non-indexed
|
||||
FILE: string.h non-indexed
|
||||
FILE: corecrt_memory.h non-indexed
|
||||
FILE: corecrt_memcpy_s.h non-indexed
|
||||
FILE: errno.h non-indexed
|
||||
FILE: vcruntime_string.h non-indexed
|
||||
FILE: corecrt_wstring.h non-indexed
|
||||
FILE: pshpack4.h non-indexed
|
||||
FILE: poppack.h non-indexed
|
||||
FILE: pshpack2.h non-indexed
|
||||
FILE: pshpack8.h non-indexed
|
||||
FILE: apiset.h non-indexed
|
||||
FILE: ktmtypes.h non-indexed
|
||||
FILE: WinBase.h non-indexed
|
||||
FILE: apisetcconv.h non-indexed
|
||||
FILE: minwinbase.h non-indexed
|
||||
FILE: processenv.h non-indexed
|
||||
FILE: fileapi.h non-indexed
|
||||
FILE: debugapi.h non-indexed
|
||||
FILE: utilapiset.h non-indexed
|
||||
FILE: handleapi.h non-indexed
|
||||
FILE: errhandlingapi.h non-indexed
|
||||
FILE: fibersapi.h non-indexed
|
||||
FILE: namedpipeapi.h non-indexed
|
||||
FILE: profileapi.h non-indexed
|
||||
FILE: heapapi.h non-indexed
|
||||
FILE: ioapiset.h non-indexed
|
||||
FILE: synchapi.h non-indexed
|
||||
FILE: interlockedapi.h non-indexed
|
||||
FILE: processthreadsapi.h non-indexed
|
||||
FILE: sysinfoapi.h non-indexed
|
||||
FILE: memoryapi.h non-indexed
|
||||
FILE: threadpoollegacyapiset.h non-indexed
|
||||
FILE: threadpoolapiset.h non-indexed
|
||||
FILE: bemapiset.h non-indexed
|
||||
FILE: jobapi.h non-indexed
|
||||
FILE: wow64apiset.h non-indexed
|
||||
FILE: libloaderapi.h non-indexed
|
||||
FILE: securitybaseapi.h non-indexed
|
||||
FILE: namespaceapi.h non-indexed
|
||||
FILE: systemtopologyapi.h non-indexed
|
||||
FILE: processtopologyapi.h non-indexed
|
||||
FILE: securityappcontainer.h non-indexed
|
||||
FILE: realtimeapiset.h non-indexed
|
||||
FILE: winerror.h non-indexed
|
||||
FILE: timezoneapi.h non-indexed
|
||||
FILE: wingdi.h non-indexed
|
||||
FILE: pshpack1.h non-indexed
|
||||
FILE: WinUser.h non-indexed
|
||||
FILE: tvout.h non-indexed
|
||||
FILE: WinNls.h non-indexed
|
||||
FILE: datetimeapi.h non-indexed
|
||||
FILE: stringapiset.h non-indexed
|
||||
FILE: wincon.h non-indexed
|
||||
FILE: consoleapi.h non-indexed
|
||||
FILE: winver.h non-indexed
|
||||
FILE: verrsrc.h non-indexed
|
||||
FILE: winreg.h non-indexed
|
||||
FILE: reason.h non-indexed
|
||||
FILE: winnetwk.h non-indexed
|
||||
FILE: wnnc.h non-indexed
|
||||
FILE: stralign.h non-indexed
|
||||
FILE: winsvc.h non-indexed
|
||||
FILE: mcx.h non-indexed
|
||||
FILE: imm.h non-indexed
|
||||
FILE: ime_cmodes.h non-indexed
|
||||
SYMBOL_MACRO: B2_TIMER_H [b2Timer.h <20:9 20:18>]
|
||||
SYMBOL_MACRO: B2_SETTINGS_H [b2Settings.h <20:9 20:21>]
|
||||
SYMBOL_MACRO: b2DEBUG [b2Settings.h <27:10 27:16>]
|
||||
SYMBOL_MACRO: B2_NOT_USED [b2Settings.h <30:9 <30:9 30:19> 30:33>]
|
||||
SYMBOL_MACRO: b2Assert [b2Settings.h <31:9 <31:9 31:16> 31:28>]
|
||||
SYMBOL_MACRO: b2_maxFloat [b2Settings.h <42:9 <42:9 42:19> 42:21>]
|
||||
SYMBOL_MACRO: b2_epsilon [b2Settings.h <43:9 <43:9 43:18> 43:20>]
|
||||
SYMBOL_MACRO: b2_pi [b2Settings.h <44:9 <44:9 44:13> 44:16>]
|
||||
SYMBOL_MACRO: b2_maxManifoldPoints [b2Settings.h <54:9 <54:9 54:28> 54:29>]
|
||||
SYMBOL_MACRO: b2_maxPolygonVertices [b2Settings.h <58:9 <58:9 58:29> 58:30>]
|
||||
SYMBOL_MACRO: b2_aabbExtension [b2Settings.h <63:9 <63:9 63:24> 63:26>]
|
||||
SYMBOL_MACRO: b2_aabbMultiplier [b2Settings.h <68:9 <68:9 68:25> 68:27>]
|
||||
SYMBOL_MACRO: b2_linearSlop [b2Settings.h <72:9 <72:9 72:21> 72:24>]
|
||||
SYMBOL_MACRO: b2_angularSlop [b2Settings.h <76:9 <76:9 76:22> 76:47>]
|
||||
SYMBOL_MACRO: b2_polygonRadius [b2Settings.h <81:9 <81:9 81:24> 81:47>]
|
||||
SYMBOL_MACRO: b2_maxSubSteps [b2Settings.h <84:9 <84:9 84:22> 84:25>]
|
||||
SYMBOL_MACRO: b2_maxTOIContacts [b2Settings.h <90:9 <90:9 90:25> 90:28>]
|
||||
SYMBOL_MACRO: b2_velocityThreshold [b2Settings.h <94:9 <94:9 94:28> 94:30>]
|
||||
SYMBOL_MACRO: b2_maxLinearCorrection [b2Settings.h <98:9 <98:9 98:30> 98:32>]
|
||||
SYMBOL_MACRO: b2_maxAngularCorrection [b2Settings.h <102:9 <102:9 102:31> 102:55>]
|
||||
SYMBOL_MACRO: b2_maxTranslation [b2Settings.h <106:9 <106:9 106:25> 106:28>]
|
||||
SYMBOL_MACRO: b2_maxTranslationSquared [b2Settings.h <107:9 <107:9 107:32> 107:71>]
|
||||
SYMBOL_MACRO: b2_maxRotation [b2Settings.h <111:9 <111:9 111:22> 111:39>]
|
||||
SYMBOL_MACRO: b2_maxRotationSquared [b2Settings.h <112:9 <112:9 112:29> 112:63>]
|
||||
SYMBOL_MACRO: b2_baumgarte [b2Settings.h <117:9 <117:9 117:20> 117:24>]
|
||||
SYMBOL_MACRO: b2_toiBaugarte [b2Settings.h <118:9 <118:9 118:22> 118:26>]
|
||||
SYMBOL_MACRO: b2_timeToSleep [b2Settings.h <124:9 <124:9 124:22> 124:26>]
|
||||
SYMBOL_MACRO: b2_linearSleepTolerance [b2Settings.h <127:9 <127:9 127:31> 127:33>]
|
||||
SYMBOL_MACRO: b2_angularSleepTolerance [b2Settings.h <130:9 <130:9 130:32> 130:55>]
|
||||
SYMBOL_MACRO: WIN32_LEAN_AND_MEAN [b2Timer.cpp <26:9 26:27>]
|
||||
SYMBOL_TYPEDEF: int8 [b2Settings.h <33:21 33:24>]
|
||||
SYMBOL_BUILTIN_TYPE: signed char
|
||||
SYMBOL_TYPEDEF: int16 [b2Settings.h <34:22 34:26>]
|
||||
SYMBOL_BUILTIN_TYPE: short
|
||||
SYMBOL_TYPEDEF: int32 [b2Settings.h <35:20 35:24>]
|
||||
SYMBOL_BUILTIN_TYPE: int
|
||||
SYMBOL_TYPEDEF: uint8 [b2Settings.h <36:23 36:27>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned char
|
||||
SYMBOL_TYPEDEF: uint16 [b2Settings.h <37:24 37:29>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned short
|
||||
SYMBOL_TYPEDEF: uint32 [b2Settings.h <38:22 38:27>]
|
||||
SYMBOL_BUILTIN_TYPE: unsigned int
|
||||
SYMBOL_TYPEDEF: float32 [b2Settings.h <39:15 39:21>]
|
||||
SYMBOL_BUILTIN_TYPE: float
|
||||
SYMBOL_TYPEDEF: float64 [b2Settings.h <40:16 40:22>]
|
||||
SYMBOL_BUILTIN_TYPE: double
|
||||
SYMBOL_FUNCTION: void * b2Alloc(int32) [b2Settings.h <135:1 <135:7 135:13> 135:25>]
|
||||
SYMBOL_BUILTIN_TYPE: void
|
||||
SYMBOL_FUNCTION: void b2Free(void *) [b2Settings.h <138:1 <138:6 138:11> 138:22>]
|
||||
SYMBOL_FUNCTION: void b2Log(const char *) [b2Settings.h <141:1 <141:6 141:10> 141:35>]
|
||||
SYMBOL_BUILTIN_TYPE: char
|
||||
SYMBOL_STRUCT: b2Version [b2Settings.h <145:1 <145:8 145:16> 150:1>]
|
||||
SYMBOL_FIELD: public int32 b2Version::major [b2Settings.h <147:8 147:12>]
|
||||
SYMBOL_FIELD: public int32 b2Version::minor [b2Settings.h <148:8 148:12>]
|
||||
SYMBOL_FIELD: public int32 b2Version::revision [b2Settings.h <149:8 149:15>]
|
||||
SYMBOL_GLOBAL_VARIABLE: b2Version b2_version [b2Settings.h <153:18 153:27>]
|
||||
QUALIFIER: b2Timer [b2Timer.cpp <23:9 23:15>]
|
||||
QUALIFIER: b2Timer [b2Timer.cpp <31:1 31:7>]
|
||||
QUALIFIER: b2Timer [b2Timer.cpp <49:6 49:12>]
|
||||
QUALIFIER: b2Timer [b2Timer.cpp <56:9 56:15>]
|
||||
SYMBOL_CLASS: b2Timer [b2Timer.h <26:1 <26:7 26:13> 48:1>]
|
||||
SYMBOL_METHOD: public void b2Timer::b2Timer() [b2Timer.cpp <31:1 <31:10 31:16> 47:1>]
|
||||
SYMBOL_METHOD: public void b2Timer::b2Timer() [b2Timer.h <31:1 <31:2 <31:2 31:8> 31:10> 47:1>]
|
||||
SYMBOL_METHOD: public void b2Timer::Reset() [b2Timer.cpp <49:1 <49:15 49:19> 54:1>]
|
||||
SYMBOL_METHOD: public void b2Timer::Reset() [b2Timer.h <34:2 <34:7 34:11> 34:13>]
|
||||
SYMBOL_METHOD: public float32 b2Timer::GetMilliseconds() const [b2Timer.cpp <56:1 <56:18 56:32> 63:1>]
|
||||
SYMBOL_METHOD: public float32 b2Timer::GetMilliseconds() const [b2Timer.h <37:2 <37:10 37:24> 37:32>]
|
||||
SYMBOL_FIELD: private float64 b2Timer::m_start [b2Timer.h <42:10 42:16>]
|
||||
SYMBOL_FIELD: private static float64 b2Timer::s_invFrequency [b2Timer.cpp <23:18 23:31>]
|
||||
SYMBOL_FIELD: private static float64 b2Timer::s_invFrequency [b2Timer.h <43:17 43:30>]
|
||||
SYMBOL_METHOD: public void b2Timer::b2Timer(const b2Timer &) [b2Timer.h <26:7 <26:7 26:13> 26:13>]
|
||||
SYMBOL_METHOD: public void b2Timer::b2Timer(b2Timer &&) [b2Timer.h <26:7 <26:7 26:13> 26:13>]
|
||||
SYMBOL_FUNCTION: void _LARGE_INTEGER::_LARGE_INTEGER()
|
||||
SYMBOL_FUNCTION: BOOL QueryPerformanceFrequency(LARGE_INTEGER *)
|
||||
SYMBOL_FUNCTION: BOOL QueryPerformanceCounter(LARGE_INTEGER *)
|
||||
REFERENCE_INCLUDE: b2Timer.cpp -> b2Timer.h [b2Timer.cpp <19:10 19:33>]
|
||||
REFERENCE_MACRO_USAGE: b2Timer.h -> B2_TIMER_H [b2Timer.h <19:9 19:18>]
|
||||
REFERENCE_INCLUDE: b2Timer.h -> b2Settings.h [b2Timer.h <22:10 22:36>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> B2_SETTINGS_H [b2Settings.h <19:9 19:21>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> stddef.h [b2Settings.h <22:10 22:19>]
|
||||
REFERENCE_INCLUDE: stddef.h -> corecrt.h [stddef.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt.h -> vcruntime.h [corecrt.h <10:10 10:22>]
|
||||
REFERENCE_INCLUDE: vcruntime.h -> sal.h [vcruntime.h <47:10 47:16>]
|
||||
REFERENCE_INCLUDE: sal.h -> concurrencysal.h [sal.h <2990:10 2990:27>]
|
||||
REFERENCE_INCLUDE: vcruntime.h -> vadefs.h [vcruntime.h <48:10 48:19>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> assert.h [b2Settings.h <23:10 23:19>]
|
||||
REFERENCE_INCLUDE: assert.h -> corecrt.h [assert.h <12:10 12:20>]
|
||||
REFERENCE_INCLUDE: b2Settings.h -> float.h [b2Settings.h <24:10 24:18>]
|
||||
REFERENCE_INCLUDE: float.h -> corecrt.h [float.h <12:10 12:20>]
|
||||
REFERENCE_MACRO_USAGE: b2Settings.h -> NDEBUG [b2Settings.h <26:14 26:19>]
|
||||
REFERENCE_MACRO_USAGE: b2Timer.h -> _WIN32 [b2Timer.h <41:13 41:18>]
|
||||
REFERENCE_MACRO_USAGE: b2Timer.cpp -> _WIN32 [b2Timer.cpp <21:13 21:18>]
|
||||
REFERENCE_MACRO_USAGE: b2Timer.cpp -> WIN32_LEAN_AND_MEAN [b2Timer.cpp <25:9 25:27>]
|
||||
REFERENCE_INCLUDE: b2Timer.cpp -> Windows.h [b2Timer.cpp <29:10 29:20>]
|
||||
REFERENCE_INCLUDE: Windows.h -> winapifamily.h [Windows.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> sdkddkver.h [Windows.h <22:10 22:22>]
|
||||
REFERENCE_INCLUDE: Windows.h -> excpt.h [Windows.h <160:10 160:18>]
|
||||
REFERENCE_INCLUDE: excpt.h -> vcruntime.h [excpt.h <12:10 12:22>]
|
||||
REFERENCE_INCLUDE: Windows.h -> stdarg.h [Windows.h <161:10 161:19>]
|
||||
REFERENCE_INCLUDE: stdarg.h -> vcruntime.h [stdarg.h <11:10 11:22>]
|
||||
REFERENCE_INCLUDE: Windows.h -> windef.h [Windows.h <164:10 164:19>]
|
||||
REFERENCE_INCLUDE: windef.h -> winapifamily.h [windef.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: windef.h -> minwindef.h [windef.h <24:10 24:22>]
|
||||
REFERENCE_INCLUDE: minwindef.h -> specstrings.h [minwindef.h <14:10 14:24>]
|
||||
REFERENCE_INCLUDE: specstrings.h -> sal.h [specstrings.h <56:10 56:16>]
|
||||
REFERENCE_INCLUDE: specstrings.h -> specstrings_strict.h [specstrings.h <513:10 513:31>]
|
||||
REFERENCE_INCLUDE: specstrings_strict.h -> specstrings_undef.h [specstrings_strict.h <188:10 188:30>]
|
||||
REFERENCE_INCLUDE: specstrings.h -> driverspecs.h [specstrings.h <534:10 534:24>]
|
||||
REFERENCE_INCLUDE: driverspecs.h -> sdv_driverspecs.h [driverspecs.h <125:10 125:28>]
|
||||
REFERENCE_INCLUDE: driverspecs.h -> concurrencysal.h [driverspecs.h <126:10 126:27>]
|
||||
REFERENCE_INCLUDE: minwindef.h -> winapifamily.h [minwindef.h <16:10 16:25>]
|
||||
REFERENCE_INCLUDE: minwindef.h -> winnt.h [minwindef.h <182:10 182:18>]
|
||||
REFERENCE_INCLUDE: winnt.h -> ctype.h [winnt.h <31:10 31:18>]
|
||||
REFERENCE_INCLUDE: ctype.h -> corecrt.h [ctype.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: ctype.h -> corecrt_wctype.h [ctype.h <12:10 12:27>]
|
||||
REFERENCE_INCLUDE: corecrt_wctype.h -> corecrt.h [corecrt_wctype.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> winapifamily.h [winnt.h <32:10 32:25>]
|
||||
REFERENCE_INCLUDE: winnt.h -> specstrings.h [winnt.h <82:10 82:24>]
|
||||
REFERENCE_INCLUDE: winnt.h -> kernelspecs.h [winnt.h <83:10 83:24>]
|
||||
REFERENCE_INCLUDE: kernelspecs.h -> driverspecs.h [kernelspecs.h <36:10 36:24>]
|
||||
REFERENCE_INCLUDE: winnt.h -> basetsd.h [winnt.h <171:10 171:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> guiddef.h [winnt.h <1083:10 1083:20>]
|
||||
REFERENCE_INCLUDE: guiddef.h -> string.h [guiddef.h <146:10 146:19>]
|
||||
REFERENCE_INCLUDE: string.h -> corecrt.h [string.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: string.h -> corecrt_memory.h [string.h <12:10 12:27>]
|
||||
REFERENCE_INCLUDE: corecrt_memory.h -> corecrt.h [corecrt_memory.h <13:10 13:20>]
|
||||
REFERENCE_INCLUDE: corecrt_memory.h -> corecrt_memcpy_s.h [corecrt_memory.h <14:10 14:29>]
|
||||
REFERENCE_INCLUDE: corecrt_memcpy_s.h -> corecrt.h [corecrt_memcpy_s.h <10:10 10:20>]
|
||||
REFERENCE_INCLUDE: corecrt_memcpy_s.h -> errno.h [corecrt_memcpy_s.h <11:10 11:18>]
|
||||
REFERENCE_INCLUDE: errno.h -> corecrt.h [errno.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt_memcpy_s.h -> vcruntime_string.h [corecrt_memcpy_s.h <12:10 12:29>]
|
||||
REFERENCE_INCLUDE: vcruntime_string.h -> vcruntime.h [vcruntime_string.h <10:10 10:22>]
|
||||
REFERENCE_INCLUDE: corecrt_memory.h -> vcruntime_string.h [corecrt_memory.h <15:10 15:29>]
|
||||
REFERENCE_INCLUDE: string.h -> corecrt_wstring.h [string.h <13:10 13:28>]
|
||||
REFERENCE_INCLUDE: corecrt_wstring.h -> corecrt.h [corecrt_wstring.h <11:10 11:20>]
|
||||
REFERENCE_INCLUDE: corecrt_wstring.h -> vcruntime_string.h [corecrt_wstring.h <12:10 12:29>]
|
||||
REFERENCE_INCLUDE: string.h -> vcruntime_string.h [string.h <14:10 14:29>]
|
||||
REFERENCE_INCLUDE: winnt.h -> excpt.h [winnt.h <1304:10 1304:18>]
|
||||
REFERENCE_INCLUDE: winnt.h -> sdkddkver.h [winnt.h <1466:10 1466:22>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack4.h [winnt.h <5937:10 5937:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack4.h [winnt.h <8835:10 8835:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack4.h [winnt.h <9168:10 9168:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack4.h [winnt.h <14869:10 14869:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <6037:10 6037:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <8935:10 8935:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <9177:10 9177:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <14999:10 14999:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <15579:10 15579:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <16074:10 16074:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <16183:10 16183:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> poppack.h [winnt.h <16764:10 16764:20>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack2.h [winnt.h <14877:10 14877:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack2.h [winnt.h <15405:10 15405:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack2.h [winnt.h <15568:10 15568:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> pshpack8.h [winnt.h <16171:10 16171:21>]
|
||||
REFERENCE_INCLUDE: winnt.h -> apiset.h [winnt.h <16892:10 16892:19>]
|
||||
REFERENCE_INCLUDE: winnt.h -> string.h [winnt.h <17464:10 17464:19>]
|
||||
REFERENCE_INCLUDE: winnt.h -> ktmtypes.h [winnt.h <19112:10 19112:21>]
|
||||
REFERENCE_INCLUDE: windef.h -> winnt.h [windef.h <31:10 31:18>]
|
||||
REFERENCE_INCLUDE: Windows.h -> WinBase.h [Windows.h <165:10 165:20>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> winapifamily.h [WinBase.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> apisetcconv.h [WinBase.h <30:10 30:24>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> minwinbase.h [WinBase.h <31:10 31:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> processenv.h [WinBase.h <37:10 37:23>]
|
||||
REFERENCE_INCLUDE: processenv.h -> apiset.h [processenv.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: processenv.h -> apisetcconv.h [processenv.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: processenv.h -> minwindef.h [processenv.h <23:10 23:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> fileapi.h [WinBase.h <38:10 38:20>]
|
||||
REFERENCE_INCLUDE: fileapi.h -> apiset.h [fileapi.h <21:10 21:19>]
|
||||
REFERENCE_INCLUDE: fileapi.h -> apisetcconv.h [fileapi.h <22:10 22:24>]
|
||||
REFERENCE_INCLUDE: fileapi.h -> minwindef.h [fileapi.h <23:10 23:22>]
|
||||
REFERENCE_INCLUDE: fileapi.h -> minwinbase.h [fileapi.h <24:10 24:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> debugapi.h [WinBase.h <39:10 39:21>]
|
||||
REFERENCE_INCLUDE: debugapi.h -> apiset.h [debugapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: debugapi.h -> apisetcconv.h [debugapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: debugapi.h -> minwindef.h [debugapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: debugapi.h -> minwinbase.h [debugapi.h <22:10 22:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> utilapiset.h [WinBase.h <40:10 40:23>]
|
||||
REFERENCE_INCLUDE: utilapiset.h -> apiset.h [utilapiset.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: utilapiset.h -> apisetcconv.h [utilapiset.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: utilapiset.h -> minwindef.h [utilapiset.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> handleapi.h [WinBase.h <41:10 41:22>]
|
||||
REFERENCE_INCLUDE: handleapi.h -> apiset.h [handleapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: handleapi.h -> apisetcconv.h [handleapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: handleapi.h -> minwindef.h [handleapi.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> errhandlingapi.h [WinBase.h <42:10 42:27>]
|
||||
REFERENCE_INCLUDE: errhandlingapi.h -> apiset.h [errhandlingapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: errhandlingapi.h -> apisetcconv.h [errhandlingapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: errhandlingapi.h -> minwindef.h [errhandlingapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> fibersapi.h [WinBase.h <43:10 43:22>]
|
||||
REFERENCE_INCLUDE: fibersapi.h -> apiset.h [fibersapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: fibersapi.h -> apisetcconv.h [fibersapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: fibersapi.h -> minwindef.h [fibersapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> namedpipeapi.h [WinBase.h <44:10 44:25>]
|
||||
REFERENCE_INCLUDE: namedpipeapi.h -> apiset.h [namedpipeapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: namedpipeapi.h -> apisetcconv.h [namedpipeapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: namedpipeapi.h -> minwindef.h [namedpipeapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: namedpipeapi.h -> minwinbase.h [namedpipeapi.h <22:10 22:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> profileapi.h [WinBase.h <45:10 45:23>]
|
||||
REFERENCE_INCLUDE: profileapi.h -> apiset.h [profileapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: profileapi.h -> apisetcconv.h [profileapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: profileapi.h -> minwindef.h [profileapi.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> heapapi.h [WinBase.h <46:10 46:20>]
|
||||
REFERENCE_INCLUDE: heapapi.h -> apiset.h [heapapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: heapapi.h -> apisetcconv.h [heapapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: heapapi.h -> minwindef.h [heapapi.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: heapapi.h -> minwinbase.h [heapapi.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> ioapiset.h [WinBase.h <47:10 47:21>]
|
||||
REFERENCE_INCLUDE: ioapiset.h -> apiset.h [ioapiset.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: ioapiset.h -> apisetcconv.h [ioapiset.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: ioapiset.h -> minwindef.h [ioapiset.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: ioapiset.h -> minwinbase.h [ioapiset.h <22:10 22:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> synchapi.h [WinBase.h <48:10 48:21>]
|
||||
REFERENCE_INCLUDE: synchapi.h -> apiset.h [synchapi.h <20:10 20:19>]
|
||||
REFERENCE_INCLUDE: synchapi.h -> apisetcconv.h [synchapi.h <21:10 21:24>]
|
||||
REFERENCE_INCLUDE: synchapi.h -> minwindef.h [synchapi.h <22:10 22:22>]
|
||||
REFERENCE_INCLUDE: synchapi.h -> minwinbase.h [synchapi.h <23:10 23:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> interlockedapi.h [WinBase.h <49:10 49:27>]
|
||||
REFERENCE_INCLUDE: interlockedapi.h -> apiset.h [interlockedapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: interlockedapi.h -> apisetcconv.h [interlockedapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: interlockedapi.h -> minwindef.h [interlockedapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> processthreadsapi.h [WinBase.h <50:10 50:30>]
|
||||
REFERENCE_INCLUDE: processthreadsapi.h -> apiset.h [processthreadsapi.h <20:10 20:19>]
|
||||
REFERENCE_INCLUDE: processthreadsapi.h -> apisetcconv.h [processthreadsapi.h <21:10 21:24>]
|
||||
REFERENCE_INCLUDE: processthreadsapi.h -> minwindef.h [processthreadsapi.h <22:10 22:22>]
|
||||
REFERENCE_INCLUDE: processthreadsapi.h -> minwinbase.h [processthreadsapi.h <23:10 23:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> sysinfoapi.h [WinBase.h <51:10 51:23>]
|
||||
REFERENCE_INCLUDE: sysinfoapi.h -> apiset.h [sysinfoapi.h <21:10 21:19>]
|
||||
REFERENCE_INCLUDE: sysinfoapi.h -> apisetcconv.h [sysinfoapi.h <22:10 22:24>]
|
||||
REFERENCE_INCLUDE: sysinfoapi.h -> minwindef.h [sysinfoapi.h <23:10 23:22>]
|
||||
REFERENCE_INCLUDE: sysinfoapi.h -> minwinbase.h [sysinfoapi.h <24:10 24:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> memoryapi.h [WinBase.h <52:10 52:22>]
|
||||
REFERENCE_INCLUDE: memoryapi.h -> apiset.h [memoryapi.h <20:10 20:19>]
|
||||
REFERENCE_INCLUDE: memoryapi.h -> apisetcconv.h [memoryapi.h <21:10 21:24>]
|
||||
REFERENCE_INCLUDE: memoryapi.h -> minwindef.h [memoryapi.h <22:10 22:22>]
|
||||
REFERENCE_INCLUDE: memoryapi.h -> minwinbase.h [memoryapi.h <23:10 23:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> threadpoollegacyapiset.h [WinBase.h <53:10 53:35>]
|
||||
REFERENCE_INCLUDE: threadpoollegacyapiset.h -> apiset.h [threadpoollegacyapiset.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: threadpoollegacyapiset.h -> apisetcconv.h [threadpoollegacyapiset.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: threadpoollegacyapiset.h -> minwindef.h [threadpoollegacyapiset.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: threadpoollegacyapiset.h -> minwinbase.h [threadpoollegacyapiset.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> threadpoolapiset.h [WinBase.h <54:10 54:29>]
|
||||
REFERENCE_INCLUDE: threadpoolapiset.h -> apiset.h [threadpoolapiset.h <18:10 18:19>]
|
||||
REFERENCE_INCLUDE: threadpoolapiset.h -> apisetcconv.h [threadpoolapiset.h <19:10 19:24>]
|
||||
REFERENCE_INCLUDE: threadpoolapiset.h -> minwindef.h [threadpoolapiset.h <20:10 20:22>]
|
||||
REFERENCE_INCLUDE: threadpoolapiset.h -> minwinbase.h [threadpoolapiset.h <21:10 21:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> bemapiset.h [WinBase.h <55:10 55:22>]
|
||||
REFERENCE_INCLUDE: bemapiset.h -> apiset.h [bemapiset.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: bemapiset.h -> apisetcconv.h [bemapiset.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: bemapiset.h -> minwindef.h [bemapiset.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: bemapiset.h -> minwinbase.h [bemapiset.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> jobapi.h [WinBase.h <56:10 56:19>]
|
||||
REFERENCE_INCLUDE: jobapi.h -> apiset.h [jobapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: jobapi.h -> apisetcconv.h [jobapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: jobapi.h -> minwindef.h [jobapi.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: jobapi.h -> minwinbase.h [jobapi.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> wow64apiset.h [WinBase.h <57:10 57:24>]
|
||||
REFERENCE_INCLUDE: wow64apiset.h -> apiset.h [wow64apiset.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: wow64apiset.h -> apisetcconv.h [wow64apiset.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: wow64apiset.h -> minwindef.h [wow64apiset.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: wow64apiset.h -> minwinbase.h [wow64apiset.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> libloaderapi.h [WinBase.h <58:10 58:25>]
|
||||
REFERENCE_INCLUDE: libloaderapi.h -> apiset.h [libloaderapi.h <20:10 20:19>]
|
||||
REFERENCE_INCLUDE: libloaderapi.h -> apisetcconv.h [libloaderapi.h <21:10 21:24>]
|
||||
REFERENCE_INCLUDE: libloaderapi.h -> minwindef.h [libloaderapi.h <22:10 22:22>]
|
||||
REFERENCE_INCLUDE: libloaderapi.h -> minwinbase.h [libloaderapi.h <23:10 23:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> securitybaseapi.h [WinBase.h <59:10 59:28>]
|
||||
REFERENCE_INCLUDE: securitybaseapi.h -> apiset.h [securitybaseapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: securitybaseapi.h -> apisetcconv.h [securitybaseapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: securitybaseapi.h -> minwindef.h [securitybaseapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: securitybaseapi.h -> minwinbase.h [securitybaseapi.h <22:10 22:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> namespaceapi.h [WinBase.h <60:10 60:25>]
|
||||
REFERENCE_INCLUDE: namespaceapi.h -> apiset.h [namespaceapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: namespaceapi.h -> apisetcconv.h [namespaceapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: namespaceapi.h -> minwindef.h [namespaceapi.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: namespaceapi.h -> minwinbase.h [namespaceapi.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> systemtopologyapi.h [WinBase.h <61:10 61:30>]
|
||||
REFERENCE_INCLUDE: systemtopologyapi.h -> apiset.h [systemtopologyapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: systemtopologyapi.h -> apisetcconv.h [systemtopologyapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: systemtopologyapi.h -> minwindef.h [systemtopologyapi.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: systemtopologyapi.h -> minwinbase.h [systemtopologyapi.h <20:10 20:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> processtopologyapi.h [WinBase.h <62:10 62:31>]
|
||||
REFERENCE_INCLUDE: processtopologyapi.h -> apiset.h [processtopologyapi.h <18:10 18:19>]
|
||||
REFERENCE_INCLUDE: processtopologyapi.h -> apisetcconv.h [processtopologyapi.h <19:10 19:24>]
|
||||
REFERENCE_INCLUDE: processtopologyapi.h -> minwindef.h [processtopologyapi.h <20:10 20:22>]
|
||||
REFERENCE_INCLUDE: processtopologyapi.h -> minwinbase.h [processtopologyapi.h <21:10 21:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> securityappcontainer.h [WinBase.h <63:10 63:33>]
|
||||
REFERENCE_INCLUDE: securityappcontainer.h -> apiset.h [securityappcontainer.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: securityappcontainer.h -> apisetcconv.h [securityappcontainer.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: securityappcontainer.h -> minwindef.h [securityappcontainer.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: securityappcontainer.h -> minwinbase.h [securityappcontainer.h <22:10 22:23>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> realtimeapiset.h [WinBase.h <64:10 64:27>]
|
||||
REFERENCE_INCLUDE: realtimeapiset.h -> apiset.h [realtimeapiset.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: realtimeapiset.h -> apisetcconv.h [realtimeapiset.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: realtimeapiset.h -> minwindef.h [realtimeapiset.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> winerror.h [WinBase.h <7358:10 7358:21>]
|
||||
REFERENCE_INCLUDE: winerror.h -> specstrings.h [winerror.h <24:10 24:24>]
|
||||
REFERENCE_INCLUDE: WinBase.h -> timezoneapi.h [WinBase.h <7359:10 7359:24>]
|
||||
REFERENCE_INCLUDE: timezoneapi.h -> apiset.h [timezoneapi.h <18:10 18:19>]
|
||||
REFERENCE_INCLUDE: timezoneapi.h -> apisetcconv.h [timezoneapi.h <19:10 19:24>]
|
||||
REFERENCE_INCLUDE: timezoneapi.h -> minwindef.h [timezoneapi.h <20:10 20:22>]
|
||||
REFERENCE_INCLUDE: timezoneapi.h -> minwinbase.h [timezoneapi.h <21:10 21:23>]
|
||||
REFERENCE_INCLUDE: Windows.h -> wingdi.h [Windows.h <166:10 166:19>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> winapifamily.h [wingdi.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> pshpack1.h [wingdi.h <611:10 611:21>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> poppack.h [wingdi.h <625:10 625:20>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> poppack.h [wingdi.h <944:10 944:20>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> poppack.h [wingdi.h <1060:10 1060:20>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> poppack.h [wingdi.h <1204:10 1204:20>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> poppack.h [wingdi.h <1295:10 1295:20>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> pshpack2.h [wingdi.h <928:10 928:21>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> pshpack2.h [wingdi.h <1039:10 1039:21>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> pshpack4.h [wingdi.h <1138:10 1138:21>]
|
||||
REFERENCE_INCLUDE: wingdi.h -> pshpack4.h [wingdi.h <1221:10 1221:21>]
|
||||
REFERENCE_INCLUDE: Windows.h -> WinUser.h [Windows.h <167:10 167:20>]
|
||||
REFERENCE_INCLUDE: WinUser.h -> winapifamily.h [WinUser.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: WinUser.h -> stdarg.h [WinUser.h <51:10 51:19>]
|
||||
REFERENCE_INCLUDE: WinUser.h -> libloaderapi.h [WinUser.h <54:10 54:25>]
|
||||
REFERENCE_INCLUDE: WinUser.h -> pshpack2.h [WinUser.h <4686:10 4686:21>]
|
||||
REFERENCE_INCLUDE: WinUser.h -> poppack.h [WinUser.h <4770:10 4770:20>]
|
||||
REFERENCE_INCLUDE: WinUser.h -> tvout.h [WinUser.h <12344:10 12344:18>]
|
||||
REFERENCE_INCLUDE: tvout.h -> winapifamily.h [tvout.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> WinNls.h [Windows.h <169:10 169:19>]
|
||||
REFERENCE_INCLUDE: WinNls.h -> winapifamily.h [WinNls.h <20:10 20:25>]
|
||||
REFERENCE_INCLUDE: WinNls.h -> datetimeapi.h [WinNls.h <30:10 30:24>]
|
||||
REFERENCE_INCLUDE: datetimeapi.h -> apiset.h [datetimeapi.h <19:10 19:19>]
|
||||
REFERENCE_INCLUDE: datetimeapi.h -> apisetcconv.h [datetimeapi.h <20:10 20:24>]
|
||||
REFERENCE_INCLUDE: datetimeapi.h -> minwindef.h [datetimeapi.h <21:10 21:22>]
|
||||
REFERENCE_INCLUDE: datetimeapi.h -> minwinbase.h [datetimeapi.h <22:10 22:23>]
|
||||
REFERENCE_INCLUDE: WinNls.h -> libloaderapi.h [WinNls.h <31:10 31:25>]
|
||||
REFERENCE_INCLUDE: WinNls.h -> stringapiset.h [WinNls.h <1279:10 1279:25>]
|
||||
REFERENCE_INCLUDE: stringapiset.h -> apiset.h [stringapiset.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: stringapiset.h -> apisetcconv.h [stringapiset.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: stringapiset.h -> minwindef.h [stringapiset.h <19:10 19:22>]
|
||||
REFERENCE_INCLUDE: stringapiset.h -> WinNls.h [stringapiset.h <20:10 20:19>]
|
||||
REFERENCE_INCLUDE: Windows.h -> wincon.h [Windows.h <172:10 172:19>]
|
||||
REFERENCE_INCLUDE: wincon.h -> winapifamily.h [wincon.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: wincon.h -> wingdi.h [wincon.h <34:10 34:19>]
|
||||
REFERENCE_INCLUDE: wincon.h -> consoleapi.h [wincon.h <817:10 817:23>]
|
||||
REFERENCE_INCLUDE: consoleapi.h -> apiset.h [consoleapi.h <17:10 17:19>]
|
||||
REFERENCE_INCLUDE: consoleapi.h -> apisetcconv.h [consoleapi.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: consoleapi.h -> Windows.h [consoleapi.h <21:10 21:20>]
|
||||
REFERENCE_INCLUDE: Windows.h -> winver.h [Windows.h <173:10 173:19>]
|
||||
REFERENCE_INCLUDE: winver.h -> winapifamily.h [winver.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: winver.h -> specstrings.h [winver.h <18:10 18:24>]
|
||||
REFERENCE_INCLUDE: winver.h -> verrsrc.h [winver.h <19:10 19:20>]
|
||||
REFERENCE_INCLUDE: verrsrc.h -> winapifamily.h [verrsrc.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> winreg.h [Windows.h <176:10 176:19>]
|
||||
REFERENCE_INCLUDE: winreg.h -> winapifamily.h [winreg.h <20:10 20:25>]
|
||||
REFERENCE_INCLUDE: winreg.h -> apiset.h [winreg.h <22:10 22:19>]
|
||||
REFERENCE_INCLUDE: winreg.h -> apisetcconv.h [winreg.h <23:10 23:24>]
|
||||
REFERENCE_INCLUDE: winreg.h -> minwindef.h [winreg.h <24:10 24:22>]
|
||||
REFERENCE_INCLUDE: winreg.h -> minwinbase.h [winreg.h <25:10 25:23>]
|
||||
REFERENCE_INCLUDE: winreg.h -> reason.h [winreg.h <1316:10 1316:19>]
|
||||
REFERENCE_INCLUDE: reason.h -> winapifamily.h [reason.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> winnetwk.h [Windows.h <179:10 179:21>]
|
||||
REFERENCE_INCLUDE: winnetwk.h -> winapifamily.h [winnetwk.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: winnetwk.h -> wnnc.h [winnetwk.h <43:10 43:17>]
|
||||
REFERENCE_INCLUDE: wnnc.h -> winapifamily.h [wnnc.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> stralign.h [Windows.h <217:10 217:21>]
|
||||
REFERENCE_INCLUDE: stralign.h -> winapifamily.h [stralign.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> winsvc.h [Windows.h <230:10 230:19>]
|
||||
REFERENCE_INCLUDE: winsvc.h -> winapifamily.h [winsvc.h <21:10 21:25>]
|
||||
REFERENCE_INCLUDE: Windows.h -> mcx.h [Windows.h <235:10 235:16>]
|
||||
REFERENCE_INCLUDE: Windows.h -> imm.h [Windows.h <239:10 239:16>]
|
||||
REFERENCE_INCLUDE: imm.h -> winapifamily.h [imm.h <1:10 1:25>]
|
||||
REFERENCE_INCLUDE: imm.h -> ime_cmodes.h [imm.h <638:10 638:23>]
|
||||
REFERENCE_TYPE_USAGE: int8 -> signed char [b2Settings.h <33:9 33:14>]
|
||||
REFERENCE_TYPE_USAGE: int16 -> short [b2Settings.h <34:9 34:14>]
|
||||
REFERENCE_TYPE_USAGE: int32 -> int [b2Settings.h <35:9 35:14>]
|
||||
REFERENCE_TYPE_USAGE: uint8 -> unsigned char [b2Settings.h <36:9 36:16>]
|
||||
REFERENCE_TYPE_USAGE: uint16 -> unsigned short [b2Settings.h <37:9 37:16>]
|
||||
REFERENCE_TYPE_USAGE: uint32 -> unsigned int [b2Settings.h <38:9 38:16>]
|
||||
REFERENCE_TYPE_USAGE: float32 -> float [b2Settings.h <39:9 39:13>]
|
||||
REFERENCE_TYPE_USAGE: float64 -> double [b2Settings.h <40:9 40:14>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> void [b2Settings.h <135:1 135:4>]
|
||||
REFERENCE_TYPE_USAGE: void * b2Alloc(int32) -> int32 [b2Settings.h <135:15 135:19>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.h <138:1 138:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Free(void *) -> void [b2Settings.h <138:13 138:16>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> void [b2Settings.h <141:1 141:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Log(const char *) -> char [b2Settings.h <141:18 141:21>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::major -> int32 [b2Settings.h <147:2 147:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::minor -> int32 [b2Settings.h <148:2 148:6>]
|
||||
REFERENCE_TYPE_USAGE: int32 b2Version::revision -> int32 [b2Settings.h <149:2 149:6>]
|
||||
REFERENCE_TYPE_USAGE: b2Version b2_version -> b2Version [b2Settings.h <153:8 153:16>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::Reset() -> void [b2Timer.cpp <49:1 49:4>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::Reset() -> void [b2Timer.h <34:2 34:5>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> float32 [b2Timer.cpp <56:1 56:7>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> float32 [b2Timer.cpp <61:2 61:8>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> float32 [b2Timer.cpp <61:15 61:21>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> float32 [b2Timer.h <37:2 37:8>]
|
||||
REFERENCE_TYPE_USAGE: float64 b2Timer::m_start -> float64 [b2Timer.h <42:2 42:8>]
|
||||
REFERENCE_TYPE_USAGE: static float64 b2Timer::s_invFrequency -> float64 [b2Timer.cpp <23:1 23:7>]
|
||||
REFERENCE_TYPE_USAGE: static float64 b2Timer::s_invFrequency -> float64 [b2Timer.h <43:9 43:15>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::b2Timer() -> LARGE_INTEGER [b2Timer.cpp <33:2 33:14>]
|
||||
REFERENCE_CALL: void b2Timer::b2Timer() -> void _LARGE_INTEGER::_LARGE_INTEGER() [b2Timer.cpp <33:16 33:27>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> static float64 b2Timer::s_invFrequency [b2Timer.cpp <35:6 35:19>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> static float64 b2Timer::s_invFrequency [b2Timer.cpp <38:3 38:16>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> static float64 b2Timer::s_invFrequency [b2Timer.cpp <39:7 39:20>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> static float64 b2Timer::s_invFrequency [b2Timer.cpp <41:4 41:17>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> static float64 b2Timer::s_invFrequency [b2Timer.cpp <41:31 41:44>]
|
||||
REFERENCE_CALL: void b2Timer::b2Timer() -> BOOL QueryPerformanceFrequency(LARGE_INTEGER *) [b2Timer.cpp <37:3 37:27>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::b2Timer() -> float64 [b2Timer.cpp <38:20 38:26>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::b2Timer() -> float64 [b2Timer.cpp <46:12 46:18>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> LONGLONG _LARGE_INTEGER::QuadPart [b2Timer.cpp <38:41 38:48>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> LONGLONG _LARGE_INTEGER::QuadPart [b2Timer.cpp <46:33 46:40>]
|
||||
REFERENCE_CALL: void b2Timer::b2Timer() -> BOOL QueryPerformanceCounter(LARGE_INTEGER *) [b2Timer.cpp <45:2 45:24>]
|
||||
REFERENCE_USAGE: void b2Timer::b2Timer() -> float64 b2Timer::m_start [b2Timer.cpp <46:2 46:8>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::Reset() -> LARGE_INTEGER [b2Timer.cpp <51:2 51:14>]
|
||||
REFERENCE_CALL: void b2Timer::Reset() -> void _LARGE_INTEGER::_LARGE_INTEGER() [b2Timer.cpp <51:16 51:27>]
|
||||
REFERENCE_CALL: void b2Timer::Reset() -> BOOL QueryPerformanceCounter(LARGE_INTEGER *) [b2Timer.cpp <52:2 52:24>]
|
||||
REFERENCE_USAGE: void b2Timer::Reset() -> float64 b2Timer::m_start [b2Timer.cpp <53:2 53:8>]
|
||||
REFERENCE_TYPE_USAGE: void b2Timer::Reset() -> float64 [b2Timer.cpp <53:12 53:18>]
|
||||
REFERENCE_USAGE: void b2Timer::Reset() -> LONGLONG _LARGE_INTEGER::QuadPart [b2Timer.cpp <53:33 53:40>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> LARGE_INTEGER [b2Timer.cpp <58:2 58:14>]
|
||||
REFERENCE_CALL: float32 b2Timer::GetMilliseconds() const -> void _LARGE_INTEGER::_LARGE_INTEGER() [b2Timer.cpp <58:16 58:27>]
|
||||
REFERENCE_CALL: float32 b2Timer::GetMilliseconds() const -> BOOL QueryPerformanceCounter(LARGE_INTEGER *) [b2Timer.cpp <59:2 59:24>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> float64 [b2Timer.cpp <60:2 60:8>]
|
||||
REFERENCE_TYPE_USAGE: float32 b2Timer::GetMilliseconds() const -> float64 [b2Timer.cpp <60:18 60:24>]
|
||||
REFERENCE_USAGE: float32 b2Timer::GetMilliseconds() const -> LONGLONG _LARGE_INTEGER::QuadPart [b2Timer.cpp <60:39 60:46>]
|
||||
REFERENCE_USAGE: float32 b2Timer::GetMilliseconds() const -> static float64 b2Timer::s_invFrequency [b2Timer.cpp <61:23 61:36>]
|
||||
REFERENCE_USAGE: float32 b2Timer::GetMilliseconds() const -> float64 b2Timer::m_start [b2Timer.cpp <61:49 61:55>]
|
||||
LOCAL_SYMBOL: b2Settings.h<135:21> [b2Settings.h <135:21 135:24>]
|
||||
LOCAL_SYMBOL: b2Settings.h<138:19> [b2Settings.h <138:19 138:21>]
|
||||
LOCAL_SYMBOL: b2Settings.h<141:24> [b2Settings.h <141:24 141:29>]
|
||||
LOCAL_SYMBOL: b2Settings.h<146:1> [b2Settings.h <146:1 146:1>]
|
||||
LOCAL_SYMBOL: b2Settings.h<146:1> [b2Settings.h <150:1 150:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<32:1> [b2Timer.cpp <32:1 32:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<32:1> [b2Timer.cpp <47:1 47:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<33:16> [b2Timer.cpp <33:16 33:27>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<33:16> [b2Timer.cpp <37:30 37:41>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<33:16> [b2Timer.cpp <38:28 38:39>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<33:16> [b2Timer.cpp <45:27 45:38>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<33:16> [b2Timer.cpp <46:20 46:31>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<36:2> [b2Timer.cpp <36:2 36:2>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<36:2> [b2Timer.cpp <43:2 43:2>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<40:3> [b2Timer.cpp <40:3 40:3>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<40:3> [b2Timer.cpp <42:3 42:3>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<50:1> [b2Timer.cpp <50:1 50:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<50:1> [b2Timer.cpp <54:1 54:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<51:16> [b2Timer.cpp <51:16 51:27>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<51:16> [b2Timer.cpp <52:27 52:38>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<51:16> [b2Timer.cpp <53:20 53:31>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<57:1> [b2Timer.cpp <57:1 57:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<57:1> [b2Timer.cpp <63:1 63:1>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<58:16> [b2Timer.cpp <58:16 58:27>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<58:16> [b2Timer.cpp <59:27 59:38>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<58:16> [b2Timer.cpp <60:26 60:37>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<60:10> [b2Timer.cpp <60:10 60:14>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<60:10> [b2Timer.cpp <61:41 61:45>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<61:10> [b2Timer.cpp <61:10 61:11>]
|
||||
LOCAL_SYMBOL: b2Timer.cpp<61:10> [b2Timer.cpp <62:9 62:10>]
|
||||
LOCAL_SYMBOL: b2Timer.h<27:1> [b2Timer.h <27:1 27:1>]
|
||||
LOCAL_SYMBOL: b2Timer.h<27:1> [b2Timer.h <48:1 48:1>]
|
||||
COMMENT: comment [b2Timer.cpp <1:1 17:3>]
|
||||
COMMENT: comment [b2Timer.h <1:1 17:3>]
|
||||
COMMENT: comment [b2Timer.h <24:1 24:65>]
|
||||
COMMENT: comment [b2Timer.h <25:1 25:32>]
|
||||
COMMENT: comment [b2Timer.h <30:2 30:17>]
|
||||
COMMENT: comment [b2Timer.h <33:2 33:22>]
|
||||
COMMENT: comment [b2Timer.h <36:2 36:56>]
|
||||
COMMENT: comment [b2Settings.h <1:1 17:3>]
|
||||
COMMENT: comment [b2Settings.h <46:1 46:10>]
|
||||
COMMENT: comment [b2Settings.h <47:1 47:75>]
|
||||
COMMENT: comment [b2Settings.h <48:1 48:4>]
|
||||
COMMENT: comment [b2Settings.h <50:1 50:13>]
|
||||
COMMENT: comment [b2Settings.h <52:1 52:71>]
|
||||
COMMENT: comment [b2Settings.h <53:1 53:27>]
|
||||
COMMENT: comment [b2Settings.h <56:1 56:76>]
|
||||
COMMENT: comment [b2Settings.h <57:1 57:70>]
|
||||
COMMENT: comment [b2Settings.h <60:1 60:74>]
|
||||
COMMENT: comment [b2Settings.h <61:1 61:68>]
|
||||
COMMENT: comment [b2Settings.h <62:1 62:23>]
|
||||
COMMENT: comment [b2Settings.h <65:1 65:78>]
|
||||
COMMENT: comment [b2Settings.h <66:1 66:59>]
|
||||
COMMENT: comment [b2Settings.h <67:1 67:40>]
|
||||
COMMENT: comment [b2Settings.h <70:1 70:79>]
|
||||
COMMENT: comment [b2Settings.h <71:1 71:70>]
|
||||
COMMENT: comment [b2Settings.h <74:1 74:78>]
|
||||
COMMENT: comment [b2Settings.h <75:1 75:70>]
|
||||
COMMENT: comment [b2Settings.h <78:1 78:83>]
|
||||
COMMENT: comment [b2Settings.h <79:1 79:91>]
|
||||
COMMENT: comment [b2Settings.h <80:1 80:64>]
|
||||
COMMENT: comment [b2Settings.h <83:1 83:78>]
|
||||
COMMENT: comment [b2Settings.h <87:1 87:12>]
|
||||
COMMENT: comment [b2Settings.h <89:1 89:68>]
|
||||
COMMENT: comment [b2Settings.h <92:1 92:86>]
|
||||
COMMENT: comment [b2Settings.h <93:1 93:64>]
|
||||
COMMENT: comment [b2Settings.h <96:1 96:88>]
|
||||
COMMENT: comment [b2Settings.h <97:1 97:23>]
|
||||
COMMENT: comment [b2Settings.h <100:1 100:89>]
|
||||
COMMENT: comment [b2Settings.h <101:1 101:23>]
|
||||
COMMENT: comment [b2Settings.h <104:1 104:80>]
|
||||
COMMENT: comment [b2Settings.h <105:1 105:70>]
|
||||
COMMENT: comment [b2Settings.h <109:1 109:81>]
|
||||
COMMENT: comment [b2Settings.h <110:1 110:70>]
|
||||
COMMENT: comment [b2Settings.h <114:1 114:88>]
|
||||
COMMENT: comment [b2Settings.h <115:1 115:89>]
|
||||
COMMENT: comment [b2Settings.h <116:1 116:18>]
|
||||
COMMENT: comment [b2Settings.h <121:1 121:9>]
|
||||
COMMENT: comment [b2Settings.h <123:1 123:67>]
|
||||
COMMENT: comment [b2Settings.h <126:1 126:72>]
|
||||
COMMENT: comment [b2Settings.h <129:1 129:73>]
|
||||
COMMENT: comment [b2Settings.h <132:1 132:21>]
|
||||
COMMENT: comment [b2Settings.h <134:1 134:62>]
|
||||
COMMENT: comment [b2Settings.h <137:1 137:71>]
|
||||
COMMENT: comment [b2Settings.h <140:1 140:22>]
|
||||
COMMENT: comment [b2Settings.h <143:1 143:30>]
|
||||
COMMENT: comment [b2Settings.h <144:1 144:57>]
|
||||
COMMENT: comment [b2Settings.h <147:16 147:40>]
|
||||
COMMENT: comment [b2Settings.h <148:16 148:40>]
|
||||
COMMENT: comment [b2Settings.h <149:19 149:33>]
|
||||
COMMENT: comment [b2Settings.h <152:1 152:21>]
|
||||
-5608
File diff suppressed because it is too large
Load Diff
-5608
File diff suppressed because it is too large
Load Diff
-5774
File diff suppressed because it is too large
Load Diff
-8265
File diff suppressed because it is too large
Load Diff
-9455
File diff suppressed because it is too large
Load Diff
-5325
File diff suppressed because it is too large
Load Diff
-5325
File diff suppressed because it is too large
Load Diff
-5325
File diff suppressed because it is too large
Load Diff
-5774
File diff suppressed because it is too large
Load Diff
-5447
File diff suppressed because it is too large
Load Diff
-5320
File diff suppressed because it is too large
Load Diff
-6549
File diff suppressed because it is too large
Load Diff
-8938
File diff suppressed because it is too large
Load Diff
-5464
File diff suppressed because it is too large
Load Diff
-5197
File diff suppressed because it is too large
Load Diff
-6531
File diff suppressed because it is too large
Load Diff
-5609
File diff suppressed because it is too large
Load Diff
-6131
File diff suppressed because it is too large
Load Diff
-5307
File diff suppressed because it is too large
Load Diff
-5752
File diff suppressed because it is too large
Load Diff
-5977
File diff suppressed because it is too large
Load Diff
-8317
File diff suppressed because it is too large
Load Diff
-7065
File diff suppressed because it is too large
Load Diff
-8059
File diff suppressed because it is too large
Load Diff
-8675
File diff suppressed because it is too large
Load Diff
-11541
File diff suppressed because it is too large
Load Diff
-4860
File diff suppressed because it is too large
Load Diff
-2977
File diff suppressed because it is too large
Load Diff
@@ -1,68 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 BOX2D_H
|
||||
#define BOX2D_H
|
||||
|
||||
/**
|
||||
\mainpage Box2D API Documentation
|
||||
|
||||
\section intro_sec Getting Started
|
||||
|
||||
For documentation please see http://box2d.org/documentation.html
|
||||
|
||||
For discussion please visit http://box2d.org/forum
|
||||
*/
|
||||
|
||||
// These include files constitute the main Box2D API
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
#include "Box2D/Common/b2Draw.h"
|
||||
#include "Box2D/Common/b2Timer.h"
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2CircleShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2ChainShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
|
||||
#include "Box2D/Collision/b2BroadPhase.h"
|
||||
#include "Box2D/Collision/b2Distance.h"
|
||||
#include "Box2D/Collision/b2DynamicTree.h"
|
||||
#include "Box2D/Collision/b2TimeOfImpact.h"
|
||||
|
||||
#include "Box2D/Dynamics/b2Body.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Dynamics/b2WorldCallbacks.h"
|
||||
#include "Box2D/Dynamics/b2TimeStep.h"
|
||||
#include "Box2D/Dynamics/b2World.h"
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
#include "Box2D/Dynamics/Joints/b2DistanceJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2FrictionJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2GearJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2MotorJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2MouseJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2PrismaticJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2PulleyJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2RevoluteJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2RopeJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2WeldJoint.h"
|
||||
#include "Box2D/Dynamics/Joints/b2WheelJoint.h"
|
||||
|
||||
#endif
|
||||
-198
@@ -1,198 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2ChainShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
#include <new>
|
||||
#include <string.h>
|
||||
|
||||
b2ChainShape::~b2ChainShape()
|
||||
{
|
||||
Clear();
|
||||
}
|
||||
|
||||
void b2ChainShape::Clear()
|
||||
{
|
||||
b2Free(m_vertices);
|
||||
m_vertices = nullptr;
|
||||
m_count = 0;
|
||||
}
|
||||
|
||||
void b2ChainShape::CreateLoop(const b2Vec2* vertices, int32 count)
|
||||
{
|
||||
b2Assert(m_vertices == nullptr && m_count == 0);
|
||||
b2Assert(count >= 3);
|
||||
if (count < 3)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
for (int32 i = 1; i < count; ++i)
|
||||
{
|
||||
b2Vec2 v1 = vertices[i-1];
|
||||
b2Vec2 v2 = vertices[i];
|
||||
// If the code crashes here, it means your vertices are too close together.
|
||||
b2Assert(b2DistanceSquared(v1, v2) > b2_linearSlop * b2_linearSlop);
|
||||
}
|
||||
|
||||
m_count = count + 1;
|
||||
m_vertices = (b2Vec2*)b2Alloc(m_count * sizeof(b2Vec2));
|
||||
memcpy(m_vertices, vertices, count * sizeof(b2Vec2));
|
||||
m_vertices[count] = m_vertices[0];
|
||||
m_prevVertex = m_vertices[m_count - 2];
|
||||
m_nextVertex = m_vertices[1];
|
||||
m_hasPrevVertex = true;
|
||||
m_hasNextVertex = true;
|
||||
}
|
||||
|
||||
void b2ChainShape::CreateChain(const b2Vec2* vertices, int32 count)
|
||||
{
|
||||
b2Assert(m_vertices == nullptr && m_count == 0);
|
||||
b2Assert(count >= 2);
|
||||
for (int32 i = 1; i < count; ++i)
|
||||
{
|
||||
// If the code crashes here, it means your vertices are too close together.
|
||||
b2Assert(b2DistanceSquared(vertices[i-1], vertices[i]) > b2_linearSlop * b2_linearSlop);
|
||||
}
|
||||
|
||||
m_count = count;
|
||||
m_vertices = (b2Vec2*)b2Alloc(count * sizeof(b2Vec2));
|
||||
memcpy(m_vertices, vertices, m_count * sizeof(b2Vec2));
|
||||
|
||||
m_hasPrevVertex = false;
|
||||
m_hasNextVertex = false;
|
||||
|
||||
m_prevVertex.SetZero();
|
||||
m_nextVertex.SetZero();
|
||||
}
|
||||
|
||||
void b2ChainShape::SetPrevVertex(const b2Vec2& prevVertex)
|
||||
{
|
||||
m_prevVertex = prevVertex;
|
||||
m_hasPrevVertex = true;
|
||||
}
|
||||
|
||||
void b2ChainShape::SetNextVertex(const b2Vec2& nextVertex)
|
||||
{
|
||||
m_nextVertex = nextVertex;
|
||||
m_hasNextVertex = true;
|
||||
}
|
||||
|
||||
b2Shape* b2ChainShape::Clone(b2BlockAllocator* allocator) const
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2ChainShape));
|
||||
b2ChainShape* clone = new (mem) b2ChainShape;
|
||||
clone->CreateChain(m_vertices, m_count);
|
||||
clone->m_prevVertex = m_prevVertex;
|
||||
clone->m_nextVertex = m_nextVertex;
|
||||
clone->m_hasPrevVertex = m_hasPrevVertex;
|
||||
clone->m_hasNextVertex = m_hasNextVertex;
|
||||
return clone;
|
||||
}
|
||||
|
||||
int32 b2ChainShape::GetChildCount() const
|
||||
{
|
||||
// edge count = vertex count - 1
|
||||
return m_count - 1;
|
||||
}
|
||||
|
||||
void b2ChainShape::GetChildEdge(b2EdgeShape* edge, int32 index) const
|
||||
{
|
||||
b2Assert(0 <= index && index < m_count - 1);
|
||||
edge->m_type = b2Shape::e_edge;
|
||||
edge->m_radius = m_radius;
|
||||
|
||||
edge->m_vertex1 = m_vertices[index + 0];
|
||||
edge->m_vertex2 = m_vertices[index + 1];
|
||||
|
||||
if (index > 0)
|
||||
{
|
||||
edge->m_vertex0 = m_vertices[index - 1];
|
||||
edge->m_hasVertex0 = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
edge->m_vertex0 = m_prevVertex;
|
||||
edge->m_hasVertex0 = m_hasPrevVertex;
|
||||
}
|
||||
|
||||
if (index < m_count - 2)
|
||||
{
|
||||
edge->m_vertex3 = m_vertices[index + 2];
|
||||
edge->m_hasVertex3 = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
edge->m_vertex3 = m_nextVertex;
|
||||
edge->m_hasVertex3 = m_hasNextVertex;
|
||||
}
|
||||
}
|
||||
|
||||
bool b2ChainShape::TestPoint(const b2Transform& xf, const b2Vec2& p) const
|
||||
{
|
||||
B2_NOT_USED(xf);
|
||||
B2_NOT_USED(p);
|
||||
return false;
|
||||
}
|
||||
|
||||
bool b2ChainShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& xf, int32 childIndex) const
|
||||
{
|
||||
b2Assert(childIndex < m_count);
|
||||
|
||||
b2EdgeShape edgeShape;
|
||||
|
||||
int32 i1 = childIndex;
|
||||
int32 i2 = childIndex + 1;
|
||||
if (i2 == m_count)
|
||||
{
|
||||
i2 = 0;
|
||||
}
|
||||
|
||||
edgeShape.m_vertex1 = m_vertices[i1];
|
||||
edgeShape.m_vertex2 = m_vertices[i2];
|
||||
|
||||
return edgeShape.RayCast(output, input, xf, 0);
|
||||
}
|
||||
|
||||
void b2ChainShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const
|
||||
{
|
||||
b2Assert(childIndex < m_count);
|
||||
|
||||
int32 i1 = childIndex;
|
||||
int32 i2 = childIndex + 1;
|
||||
if (i2 == m_count)
|
||||
{
|
||||
i2 = 0;
|
||||
}
|
||||
|
||||
b2Vec2 v1 = b2Mul(xf, m_vertices[i1]);
|
||||
b2Vec2 v2 = b2Mul(xf, m_vertices[i2]);
|
||||
|
||||
aabb->lowerBound = b2Min(v1, v2);
|
||||
aabb->upperBound = b2Max(v1, v2);
|
||||
}
|
||||
|
||||
void b2ChainShape::ComputeMass(b2MassData* massData, float32 density) const
|
||||
{
|
||||
B2_NOT_USED(density);
|
||||
|
||||
massData->mass = 0.0f;
|
||||
massData->center.SetZero();
|
||||
massData->I = 0.0f;
|
||||
}
|
||||
-105
@@ -1,105 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CHAIN_SHAPE_H
|
||||
#define B2_CHAIN_SHAPE_H
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2Shape.h"
|
||||
|
||||
class b2EdgeShape;
|
||||
|
||||
/// A chain shape is a free form sequence of line segments.
|
||||
/// The chain has two-sided collision, so you can use inside and outside collision.
|
||||
/// Therefore, you may use any winding order.
|
||||
/// Since there may be many vertices, they are allocated using b2Alloc.
|
||||
/// Connectivity information is used to create smooth collisions.
|
||||
/// WARNING: The chain will not collide properly if there are self-intersections.
|
||||
class b2ChainShape : public b2Shape
|
||||
{
|
||||
public:
|
||||
b2ChainShape();
|
||||
|
||||
/// The destructor frees the vertices using b2Free.
|
||||
~b2ChainShape();
|
||||
|
||||
/// Clear all data.
|
||||
void Clear();
|
||||
|
||||
/// Create a loop. This automatically adjusts connectivity.
|
||||
/// @param vertices an array of vertices, these are copied
|
||||
/// @param count the vertex count
|
||||
void CreateLoop(const b2Vec2* vertices, int32 count);
|
||||
|
||||
/// Create a chain with isolated end vertices.
|
||||
/// @param vertices an array of vertices, these are copied
|
||||
/// @param count the vertex count
|
||||
void CreateChain(const b2Vec2* vertices, int32 count);
|
||||
|
||||
/// Establish connectivity to a vertex that precedes the first vertex.
|
||||
/// Don't call this for loops.
|
||||
void SetPrevVertex(const b2Vec2& prevVertex);
|
||||
|
||||
/// Establish connectivity to a vertex that follows the last vertex.
|
||||
/// Don't call this for loops.
|
||||
void SetNextVertex(const b2Vec2& nextVertex);
|
||||
|
||||
/// Implement b2Shape. Vertices are cloned using b2Alloc.
|
||||
b2Shape* Clone(b2BlockAllocator* allocator) const override;
|
||||
|
||||
/// @see b2Shape::GetChildCount
|
||||
int32 GetChildCount() const override;
|
||||
|
||||
/// Get a child edge.
|
||||
void GetChildEdge(b2EdgeShape* edge, int32 index) const;
|
||||
|
||||
/// This always return false.
|
||||
/// @see b2Shape::TestPoint
|
||||
bool TestPoint(const b2Transform& transform, const b2Vec2& p) const override;
|
||||
|
||||
/// Implement b2Shape.
|
||||
bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeAABB
|
||||
void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// Chains have zero mass.
|
||||
/// @see b2Shape::ComputeMass
|
||||
void ComputeMass(b2MassData* massData, float32 density) const override;
|
||||
|
||||
/// The vertices. Owned by this class.
|
||||
b2Vec2* m_vertices;
|
||||
|
||||
/// The vertex count.
|
||||
int32 m_count;
|
||||
|
||||
b2Vec2 m_prevVertex, m_nextVertex;
|
||||
bool m_hasPrevVertex, m_hasNextVertex;
|
||||
};
|
||||
|
||||
inline b2ChainShape::b2ChainShape()
|
||||
{
|
||||
m_type = e_chain;
|
||||
m_radius = b2_polygonRadius;
|
||||
m_vertices = nullptr;
|
||||
m_count = 0;
|
||||
m_hasPrevVertex = false;
|
||||
m_hasNextVertex = false;
|
||||
}
|
||||
|
||||
#endif
|
||||
-99
@@ -1,99 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2CircleShape.h"
|
||||
#include <new>
|
||||
|
||||
b2Shape* b2CircleShape::Clone(b2BlockAllocator* allocator) const
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2CircleShape));
|
||||
b2CircleShape* clone = new (mem) b2CircleShape;
|
||||
*clone = *this;
|
||||
return clone;
|
||||
}
|
||||
|
||||
int32 b2CircleShape::GetChildCount() const
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
|
||||
bool b2CircleShape::TestPoint(const b2Transform& transform, const b2Vec2& p) const
|
||||
{
|
||||
b2Vec2 center = transform.p + b2Mul(transform.q, m_p);
|
||||
b2Vec2 d = p - center;
|
||||
return b2Dot(d, d) <= m_radius * m_radius;
|
||||
}
|
||||
|
||||
// Collision Detection in Interactive 3D Environments by Gino van den Bergen
|
||||
// From Section 3.1.2
|
||||
// x = s + a * r
|
||||
// norm(x) = radius
|
||||
bool b2CircleShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& transform, int32 childIndex) const
|
||||
{
|
||||
B2_NOT_USED(childIndex);
|
||||
|
||||
b2Vec2 position = transform.p + b2Mul(transform.q, m_p);
|
||||
b2Vec2 s = input.p1 - position;
|
||||
float32 b = b2Dot(s, s) - m_radius * m_radius;
|
||||
|
||||
// Solve quadratic equation.
|
||||
b2Vec2 r = input.p2 - input.p1;
|
||||
float32 c = b2Dot(s, r);
|
||||
float32 rr = b2Dot(r, r);
|
||||
float32 sigma = c * c - rr * b;
|
||||
|
||||
// Check for negative discriminant and short segment.
|
||||
if (sigma < 0.0f || rr < b2_epsilon)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
// Find the point of intersection of the line with the circle.
|
||||
float32 a = -(c + b2Sqrt(sigma));
|
||||
|
||||
// Is the intersection point on the segment?
|
||||
if (0.0f <= a && a <= input.maxFraction * rr)
|
||||
{
|
||||
a /= rr;
|
||||
output->fraction = a;
|
||||
output->normal = s + a * r;
|
||||
output->normal.Normalize();
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
void b2CircleShape::ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const
|
||||
{
|
||||
B2_NOT_USED(childIndex);
|
||||
|
||||
b2Vec2 p = transform.p + b2Mul(transform.q, m_p);
|
||||
aabb->lowerBound.Set(p.x - m_radius, p.y - m_radius);
|
||||
aabb->upperBound.Set(p.x + m_radius, p.y + m_radius);
|
||||
}
|
||||
|
||||
void b2CircleShape::ComputeMass(b2MassData* massData, float32 density) const
|
||||
{
|
||||
massData->mass = density * b2_pi * m_radius * m_radius;
|
||||
massData->center = m_p;
|
||||
|
||||
// inertia about the local origin
|
||||
massData->I = massData->mass * (0.5f * m_radius * m_radius + b2Dot(m_p, m_p));
|
||||
}
|
||||
-60
@@ -1,60 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CIRCLE_SHAPE_H
|
||||
#define B2_CIRCLE_SHAPE_H
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2Shape.h"
|
||||
|
||||
/// A circle shape.
|
||||
class b2CircleShape : public b2Shape
|
||||
{
|
||||
public:
|
||||
b2CircleShape();
|
||||
|
||||
/// Implement b2Shape.
|
||||
b2Shape* Clone(b2BlockAllocator* allocator) const override;
|
||||
|
||||
/// @see b2Shape::GetChildCount
|
||||
int32 GetChildCount() const override;
|
||||
|
||||
/// Implement b2Shape.
|
||||
bool TestPoint(const b2Transform& transform, const b2Vec2& p) const override;
|
||||
|
||||
/// Implement b2Shape.
|
||||
bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeAABB
|
||||
void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeMass
|
||||
void ComputeMass(b2MassData* massData, float32 density) const override;
|
||||
|
||||
/// Position
|
||||
b2Vec2 m_p;
|
||||
};
|
||||
|
||||
inline b2CircleShape::b2CircleShape()
|
||||
{
|
||||
m_type = e_circle;
|
||||
m_radius = 0.0f;
|
||||
m_p.SetZero();
|
||||
}
|
||||
|
||||
#endif
|
||||
-138
@@ -1,138 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
#include <new>
|
||||
|
||||
void b2EdgeShape::Set(const b2Vec2& v1, const b2Vec2& v2)
|
||||
{
|
||||
m_vertex1 = v1;
|
||||
m_vertex2 = v2;
|
||||
m_hasVertex0 = false;
|
||||
m_hasVertex3 = false;
|
||||
}
|
||||
|
||||
b2Shape* b2EdgeShape::Clone(b2BlockAllocator* allocator) const
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2EdgeShape));
|
||||
b2EdgeShape* clone = new (mem) b2EdgeShape;
|
||||
*clone = *this;
|
||||
return clone;
|
||||
}
|
||||
|
||||
int32 b2EdgeShape::GetChildCount() const
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
|
||||
bool b2EdgeShape::TestPoint(const b2Transform& xf, const b2Vec2& p) const
|
||||
{
|
||||
B2_NOT_USED(xf);
|
||||
B2_NOT_USED(p);
|
||||
return false;
|
||||
}
|
||||
|
||||
// p = p1 + t * d
|
||||
// v = v1 + s * e
|
||||
// p1 + t * d = v1 + s * e
|
||||
// s * e - t * d = p1 - v1
|
||||
bool b2EdgeShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& xf, int32 childIndex) const
|
||||
{
|
||||
B2_NOT_USED(childIndex);
|
||||
|
||||
// Put the ray into the edge's frame of reference.
|
||||
b2Vec2 p1 = b2MulT(xf.q, input.p1 - xf.p);
|
||||
b2Vec2 p2 = b2MulT(xf.q, input.p2 - xf.p);
|
||||
b2Vec2 d = p2 - p1;
|
||||
|
||||
b2Vec2 v1 = m_vertex1;
|
||||
b2Vec2 v2 = m_vertex2;
|
||||
b2Vec2 e = v2 - v1;
|
||||
b2Vec2 normal(e.y, -e.x);
|
||||
normal.Normalize();
|
||||
|
||||
// q = p1 + t * d
|
||||
// dot(normal, q - v1) = 0
|
||||
// dot(normal, p1 - v1) + t * dot(normal, d) = 0
|
||||
float32 numerator = b2Dot(normal, v1 - p1);
|
||||
float32 denominator = b2Dot(normal, d);
|
||||
|
||||
if (denominator == 0.0f)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
float32 t = numerator / denominator;
|
||||
if (t < 0.0f || input.maxFraction < t)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
b2Vec2 q = p1 + t * d;
|
||||
|
||||
// q = v1 + s * r
|
||||
// s = dot(q - v1, r) / dot(r, r)
|
||||
b2Vec2 r = v2 - v1;
|
||||
float32 rr = b2Dot(r, r);
|
||||
if (rr == 0.0f)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
float32 s = b2Dot(q - v1, r) / rr;
|
||||
if (s < 0.0f || 1.0f < s)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
output->fraction = t;
|
||||
if (numerator > 0.0f)
|
||||
{
|
||||
output->normal = -b2Mul(xf.q, normal);
|
||||
}
|
||||
else
|
||||
{
|
||||
output->normal = b2Mul(xf.q, normal);
|
||||
}
|
||||
return true;
|
||||
}
|
||||
|
||||
void b2EdgeShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const
|
||||
{
|
||||
B2_NOT_USED(childIndex);
|
||||
|
||||
b2Vec2 v1 = b2Mul(xf, m_vertex1);
|
||||
b2Vec2 v2 = b2Mul(xf, m_vertex2);
|
||||
|
||||
b2Vec2 lower = b2Min(v1, v2);
|
||||
b2Vec2 upper = b2Max(v1, v2);
|
||||
|
||||
b2Vec2 r(m_radius, m_radius);
|
||||
aabb->lowerBound = lower - r;
|
||||
aabb->upperBound = upper + r;
|
||||
}
|
||||
|
||||
void b2EdgeShape::ComputeMass(b2MassData* massData, float32 density) const
|
||||
{
|
||||
B2_NOT_USED(density);
|
||||
|
||||
massData->mass = 0.0f;
|
||||
massData->center = 0.5f * (m_vertex1 + m_vertex2);
|
||||
massData->I = 0.0f;
|
||||
}
|
||||
-74
@@ -1,74 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_EDGE_SHAPE_H
|
||||
#define B2_EDGE_SHAPE_H
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2Shape.h"
|
||||
|
||||
/// A line segment (edge) shape. These can be connected in chains or loops
|
||||
/// to other edge shapes. The connectivity information is used to ensure
|
||||
/// correct contact normals.
|
||||
class b2EdgeShape : public b2Shape
|
||||
{
|
||||
public:
|
||||
b2EdgeShape();
|
||||
|
||||
/// Set this as an isolated edge.
|
||||
void Set(const b2Vec2& v1, const b2Vec2& v2);
|
||||
|
||||
/// Implement b2Shape.
|
||||
b2Shape* Clone(b2BlockAllocator* allocator) const override;
|
||||
|
||||
/// @see b2Shape::GetChildCount
|
||||
int32 GetChildCount() const override;
|
||||
|
||||
/// @see b2Shape::TestPoint
|
||||
bool TestPoint(const b2Transform& transform, const b2Vec2& p) const override;
|
||||
|
||||
/// Implement b2Shape.
|
||||
bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeAABB
|
||||
void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeMass
|
||||
void ComputeMass(b2MassData* massData, float32 density) const override;
|
||||
|
||||
/// These are the edge vertices
|
||||
b2Vec2 m_vertex1, m_vertex2;
|
||||
|
||||
/// Optional adjacent vertices. These are used for smooth collision.
|
||||
b2Vec2 m_vertex0, m_vertex3;
|
||||
bool m_hasVertex0, m_hasVertex3;
|
||||
};
|
||||
|
||||
inline b2EdgeShape::b2EdgeShape()
|
||||
{
|
||||
m_type = e_edge;
|
||||
m_radius = b2_polygonRadius;
|
||||
m_vertex0.x = 0.0f;
|
||||
m_vertex0.y = 0.0f;
|
||||
m_vertex3.x = 0.0f;
|
||||
m_vertex3.y = 0.0f;
|
||||
m_hasVertex0 = false;
|
||||
m_hasVertex3 = false;
|
||||
}
|
||||
|
||||
#endif
|
||||
-468
@@ -1,468 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
#include <new>
|
||||
|
||||
b2Shape* b2PolygonShape::Clone(b2BlockAllocator* allocator) const
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2PolygonShape));
|
||||
b2PolygonShape* clone = new (mem) b2PolygonShape;
|
||||
*clone = *this;
|
||||
return clone;
|
||||
}
|
||||
|
||||
void b2PolygonShape::SetAsBox(float32 hx, float32 hy)
|
||||
{
|
||||
m_count = 4;
|
||||
m_vertices[0].Set(-hx, -hy);
|
||||
m_vertices[1].Set( hx, -hy);
|
||||
m_vertices[2].Set( hx, hy);
|
||||
m_vertices[3].Set(-hx, hy);
|
||||
m_normals[0].Set(0.0f, -1.0f);
|
||||
m_normals[1].Set(1.0f, 0.0f);
|
||||
m_normals[2].Set(0.0f, 1.0f);
|
||||
m_normals[3].Set(-1.0f, 0.0f);
|
||||
m_centroid.SetZero();
|
||||
}
|
||||
|
||||
void b2PolygonShape::SetAsBox(float32 hx, float32 hy, const b2Vec2& center, float32 angle)
|
||||
{
|
||||
m_count = 4;
|
||||
m_vertices[0].Set(-hx, -hy);
|
||||
m_vertices[1].Set( hx, -hy);
|
||||
m_vertices[2].Set( hx, hy);
|
||||
m_vertices[3].Set(-hx, hy);
|
||||
m_normals[0].Set(0.0f, -1.0f);
|
||||
m_normals[1].Set(1.0f, 0.0f);
|
||||
m_normals[2].Set(0.0f, 1.0f);
|
||||
m_normals[3].Set(-1.0f, 0.0f);
|
||||
m_centroid = center;
|
||||
|
||||
b2Transform xf;
|
||||
xf.p = center;
|
||||
xf.q.Set(angle);
|
||||
|
||||
// Transform vertices and normals.
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
m_vertices[i] = b2Mul(xf, m_vertices[i]);
|
||||
m_normals[i] = b2Mul(xf.q, m_normals[i]);
|
||||
}
|
||||
}
|
||||
|
||||
int32 b2PolygonShape::GetChildCount() const
|
||||
{
|
||||
return 1;
|
||||
}
|
||||
|
||||
static b2Vec2 ComputeCentroid(const b2Vec2* vs, int32 count)
|
||||
{
|
||||
b2Assert(count >= 3);
|
||||
|
||||
b2Vec2 c; c.Set(0.0f, 0.0f);
|
||||
float32 area = 0.0f;
|
||||
|
||||
// pRef is the reference point for forming triangles.
|
||||
// It's location doesn't change the result (except for rounding error).
|
||||
b2Vec2 pRef(0.0f, 0.0f);
|
||||
#if 0
|
||||
// This code would put the reference point inside the polygon.
|
||||
for (int32 i = 0; i < count; ++i)
|
||||
{
|
||||
pRef += vs[i];
|
||||
}
|
||||
pRef *= 1.0f / count;
|
||||
#endif
|
||||
|
||||
const float32 inv3 = 1.0f / 3.0f;
|
||||
|
||||
for (int32 i = 0; i < count; ++i)
|
||||
{
|
||||
// Triangle vertices.
|
||||
b2Vec2 p1 = pRef;
|
||||
b2Vec2 p2 = vs[i];
|
||||
b2Vec2 p3 = i + 1 < count ? vs[i+1] : vs[0];
|
||||
|
||||
b2Vec2 e1 = p2 - p1;
|
||||
b2Vec2 e2 = p3 - p1;
|
||||
|
||||
float32 D = b2Cross(e1, e2);
|
||||
|
||||
float32 triangleArea = 0.5f * D;
|
||||
area += triangleArea;
|
||||
|
||||
// Area weighted centroid
|
||||
c += triangleArea * inv3 * (p1 + p2 + p3);
|
||||
}
|
||||
|
||||
// Centroid
|
||||
b2Assert(area > b2_epsilon);
|
||||
c *= 1.0f / area;
|
||||
return c;
|
||||
}
|
||||
|
||||
void b2PolygonShape::Set(const b2Vec2* vertices, int32 count)
|
||||
{
|
||||
b2Assert(3 <= count && count <= b2_maxPolygonVertices);
|
||||
if (count < 3)
|
||||
{
|
||||
SetAsBox(1.0f, 1.0f);
|
||||
return;
|
||||
}
|
||||
|
||||
int32 n = b2Min(count, b2_maxPolygonVertices);
|
||||
|
||||
// Perform welding and copy vertices into local buffer.
|
||||
b2Vec2 ps[b2_maxPolygonVertices];
|
||||
int32 tempCount = 0;
|
||||
for (int32 i = 0; i < n; ++i)
|
||||
{
|
||||
b2Vec2 v = vertices[i];
|
||||
|
||||
bool unique = true;
|
||||
for (int32 j = 0; j < tempCount; ++j)
|
||||
{
|
||||
if (b2DistanceSquared(v, ps[j]) < ((0.5f * b2_linearSlop) * (0.5f * b2_linearSlop)))
|
||||
{
|
||||
unique = false;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (unique)
|
||||
{
|
||||
ps[tempCount++] = v;
|
||||
}
|
||||
}
|
||||
|
||||
n = tempCount;
|
||||
if (n < 3)
|
||||
{
|
||||
// Polygon is degenerate.
|
||||
b2Assert(false);
|
||||
SetAsBox(1.0f, 1.0f);
|
||||
return;
|
||||
}
|
||||
|
||||
// Create the convex hull using the Gift wrapping algorithm
|
||||
// http://en.wikipedia.org/wiki/Gift_wrapping_algorithm
|
||||
|
||||
// Find the right most point on the hull
|
||||
int32 i0 = 0;
|
||||
float32 x0 = ps[0].x;
|
||||
for (int32 i = 1; i < n; ++i)
|
||||
{
|
||||
float32 x = ps[i].x;
|
||||
if (x > x0 || (x == x0 && ps[i].y < ps[i0].y))
|
||||
{
|
||||
i0 = i;
|
||||
x0 = x;
|
||||
}
|
||||
}
|
||||
|
||||
int32 hull[b2_maxPolygonVertices];
|
||||
int32 m = 0;
|
||||
int32 ih = i0;
|
||||
|
||||
for (;;)
|
||||
{
|
||||
b2Assert(m < b2_maxPolygonVertices);
|
||||
hull[m] = ih;
|
||||
|
||||
int32 ie = 0;
|
||||
for (int32 j = 1; j < n; ++j)
|
||||
{
|
||||
if (ie == ih)
|
||||
{
|
||||
ie = j;
|
||||
continue;
|
||||
}
|
||||
|
||||
b2Vec2 r = ps[ie] - ps[hull[m]];
|
||||
b2Vec2 v = ps[j] - ps[hull[m]];
|
||||
float32 c = b2Cross(r, v);
|
||||
if (c < 0.0f)
|
||||
{
|
||||
ie = j;
|
||||
}
|
||||
|
||||
// Collinearity check
|
||||
if (c == 0.0f && v.LengthSquared() > r.LengthSquared())
|
||||
{
|
||||
ie = j;
|
||||
}
|
||||
}
|
||||
|
||||
++m;
|
||||
ih = ie;
|
||||
|
||||
if (ie == i0)
|
||||
{
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
if (m < 3)
|
||||
{
|
||||
// Polygon is degenerate.
|
||||
b2Assert(false);
|
||||
SetAsBox(1.0f, 1.0f);
|
||||
return;
|
||||
}
|
||||
|
||||
m_count = m;
|
||||
|
||||
// Copy vertices.
|
||||
for (int32 i = 0; i < m; ++i)
|
||||
{
|
||||
m_vertices[i] = ps[hull[i]];
|
||||
}
|
||||
|
||||
// Compute normals. Ensure the edges have non-zero length.
|
||||
for (int32 i = 0; i < m; ++i)
|
||||
{
|
||||
int32 i1 = i;
|
||||
int32 i2 = i + 1 < m ? i + 1 : 0;
|
||||
b2Vec2 edge = m_vertices[i2] - m_vertices[i1];
|
||||
b2Assert(edge.LengthSquared() > b2_epsilon * b2_epsilon);
|
||||
m_normals[i] = b2Cross(edge, 1.0f);
|
||||
m_normals[i].Normalize();
|
||||
}
|
||||
|
||||
// Compute the polygon centroid.
|
||||
m_centroid = ComputeCentroid(m_vertices, m);
|
||||
}
|
||||
|
||||
bool b2PolygonShape::TestPoint(const b2Transform& xf, const b2Vec2& p) const
|
||||
{
|
||||
b2Vec2 pLocal = b2MulT(xf.q, p - xf.p);
|
||||
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
float32 dot = b2Dot(m_normals[i], pLocal - m_vertices[i]);
|
||||
if (dot > 0.0f)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
bool b2PolygonShape::RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& xf, int32 childIndex) const
|
||||
{
|
||||
B2_NOT_USED(childIndex);
|
||||
|
||||
// Put the ray into the polygon's frame of reference.
|
||||
b2Vec2 p1 = b2MulT(xf.q, input.p1 - xf.p);
|
||||
b2Vec2 p2 = b2MulT(xf.q, input.p2 - xf.p);
|
||||
b2Vec2 d = p2 - p1;
|
||||
|
||||
float32 lower = 0.0f, upper = input.maxFraction;
|
||||
|
||||
int32 index = -1;
|
||||
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
// p = p1 + a * d
|
||||
// dot(normal, p - v) = 0
|
||||
// dot(normal, p1 - v) + a * dot(normal, d) = 0
|
||||
float32 numerator = b2Dot(m_normals[i], m_vertices[i] - p1);
|
||||
float32 denominator = b2Dot(m_normals[i], d);
|
||||
|
||||
if (denominator == 0.0f)
|
||||
{
|
||||
if (numerator < 0.0f)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
// Note: we want this predicate without division:
|
||||
// lower < numerator / denominator, where denominator < 0
|
||||
// Since denominator < 0, we have to flip the inequality:
|
||||
// lower < numerator / denominator <==> denominator * lower > numerator.
|
||||
if (denominator < 0.0f && numerator < lower * denominator)
|
||||
{
|
||||
// Increase lower.
|
||||
// The segment enters this half-space.
|
||||
lower = numerator / denominator;
|
||||
index = i;
|
||||
}
|
||||
else if (denominator > 0.0f && numerator < upper * denominator)
|
||||
{
|
||||
// Decrease upper.
|
||||
// The segment exits this half-space.
|
||||
upper = numerator / denominator;
|
||||
}
|
||||
}
|
||||
|
||||
// The use of epsilon here causes the assert on lower to trip
|
||||
// in some cases. Apparently the use of epsilon was to make edge
|
||||
// shapes work, but now those are handled separately.
|
||||
//if (upper < lower - b2_epsilon)
|
||||
if (upper < lower)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
|
||||
b2Assert(0.0f <= lower && lower <= input.maxFraction);
|
||||
|
||||
if (index >= 0)
|
||||
{
|
||||
output->fraction = lower;
|
||||
output->normal = b2Mul(xf.q, m_normals[index]);
|
||||
return true;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
void b2PolygonShape::ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const
|
||||
{
|
||||
B2_NOT_USED(childIndex);
|
||||
|
||||
b2Vec2 lower = b2Mul(xf, m_vertices[0]);
|
||||
b2Vec2 upper = lower;
|
||||
|
||||
for (int32 i = 1; i < m_count; ++i)
|
||||
{
|
||||
b2Vec2 v = b2Mul(xf, m_vertices[i]);
|
||||
lower = b2Min(lower, v);
|
||||
upper = b2Max(upper, v);
|
||||
}
|
||||
|
||||
b2Vec2 r(m_radius, m_radius);
|
||||
aabb->lowerBound = lower - r;
|
||||
aabb->upperBound = upper + r;
|
||||
}
|
||||
|
||||
void b2PolygonShape::ComputeMass(b2MassData* massData, float32 density) const
|
||||
{
|
||||
// Polygon mass, centroid, and inertia.
|
||||
// Let rho be the polygon density in mass per unit area.
|
||||
// Then:
|
||||
// mass = rho * int(dA)
|
||||
// centroid.x = (1/mass) * rho * int(x * dA)
|
||||
// centroid.y = (1/mass) * rho * int(y * dA)
|
||||
// I = rho * int((x*x + y*y) * dA)
|
||||
//
|
||||
// We can compute these integrals by summing all the integrals
|
||||
// for each triangle of the polygon. To evaluate the integral
|
||||
// for a single triangle, we make a change of variables to
|
||||
// the (u,v) coordinates of the triangle:
|
||||
// x = x0 + e1x * u + e2x * v
|
||||
// y = y0 + e1y * u + e2y * v
|
||||
// where 0 <= u && 0 <= v && u + v <= 1.
|
||||
//
|
||||
// We integrate u from [0,1-v] and then v from [0,1].
|
||||
// We also need to use the Jacobian of the transformation:
|
||||
// D = cross(e1, e2)
|
||||
//
|
||||
// Simplification: triangle centroid = (1/3) * (p1 + p2 + p3)
|
||||
//
|
||||
// The rest of the derivation is handled by computer algebra.
|
||||
|
||||
b2Assert(m_count >= 3);
|
||||
|
||||
b2Vec2 center; center.Set(0.0f, 0.0f);
|
||||
float32 area = 0.0f;
|
||||
float32 I = 0.0f;
|
||||
|
||||
// s is the reference point for forming triangles.
|
||||
// It's location doesn't change the result (except for rounding error).
|
||||
b2Vec2 s(0.0f, 0.0f);
|
||||
|
||||
// This code would put the reference point inside the polygon.
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
s += m_vertices[i];
|
||||
}
|
||||
s *= 1.0f / m_count;
|
||||
|
||||
const float32 k_inv3 = 1.0f / 3.0f;
|
||||
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
// Triangle vertices.
|
||||
b2Vec2 e1 = m_vertices[i] - s;
|
||||
b2Vec2 e2 = i + 1 < m_count ? m_vertices[i+1] - s : m_vertices[0] - s;
|
||||
|
||||
float32 D = b2Cross(e1, e2);
|
||||
|
||||
float32 triangleArea = 0.5f * D;
|
||||
area += triangleArea;
|
||||
|
||||
// Area weighted centroid
|
||||
center += triangleArea * k_inv3 * (e1 + e2);
|
||||
|
||||
float32 ex1 = e1.x, ey1 = e1.y;
|
||||
float32 ex2 = e2.x, ey2 = e2.y;
|
||||
|
||||
float32 intx2 = ex1*ex1 + ex2*ex1 + ex2*ex2;
|
||||
float32 inty2 = ey1*ey1 + ey2*ey1 + ey2*ey2;
|
||||
|
||||
I += (0.25f * k_inv3 * D) * (intx2 + inty2);
|
||||
}
|
||||
|
||||
// Total mass
|
||||
massData->mass = density * area;
|
||||
|
||||
// Center of mass
|
||||
b2Assert(area > b2_epsilon);
|
||||
center *= 1.0f / area;
|
||||
massData->center = center + s;
|
||||
|
||||
// Inertia tensor relative to the local origin (point s).
|
||||
massData->I = density * I;
|
||||
|
||||
// Shift to center of mass then to original body origin.
|
||||
massData->I += massData->mass * (b2Dot(massData->center, massData->center) - b2Dot(center, center));
|
||||
}
|
||||
|
||||
bool b2PolygonShape::Validate() const
|
||||
{
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
int32 i1 = i;
|
||||
int32 i2 = i < m_count - 1 ? i1 + 1 : 0;
|
||||
b2Vec2 p = m_vertices[i1];
|
||||
b2Vec2 e = m_vertices[i2] - p;
|
||||
|
||||
for (int32 j = 0; j < m_count; ++j)
|
||||
{
|
||||
if (j == i1 || j == i2)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
b2Vec2 v = m_vertices[j] - p;
|
||||
float32 c = b2Cross(e, v);
|
||||
if (c < 0.0f)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
return true;
|
||||
}
|
||||
-89
@@ -1,89 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_POLYGON_SHAPE_H
|
||||
#define B2_POLYGON_SHAPE_H
|
||||
|
||||
#include "Box2D/Collision/Shapes/b2Shape.h"
|
||||
|
||||
/// A convex polygon. It is assumed that the interior of the polygon is to
|
||||
/// the left of each edge.
|
||||
/// Polygons have a maximum number of vertices equal to b2_maxPolygonVertices.
|
||||
/// In most cases you should not need many vertices for a convex polygon.
|
||||
class b2PolygonShape : public b2Shape
|
||||
{
|
||||
public:
|
||||
b2PolygonShape();
|
||||
|
||||
/// Implement b2Shape.
|
||||
b2Shape* Clone(b2BlockAllocator* allocator) const override;
|
||||
|
||||
/// @see b2Shape::GetChildCount
|
||||
int32 GetChildCount() const override;
|
||||
|
||||
/// Create a convex hull from the given array of local points.
|
||||
/// The count must be in the range [3, b2_maxPolygonVertices].
|
||||
/// @warning the points may be re-ordered, even if they form a convex polygon
|
||||
/// @warning collinear points are handled but not removed. Collinear points
|
||||
/// may lead to poor stacking behavior.
|
||||
void Set(const b2Vec2* points, int32 count);
|
||||
|
||||
/// Build vertices to represent an axis-aligned box centered on the local origin.
|
||||
/// @param hx the half-width.
|
||||
/// @param hy the half-height.
|
||||
void SetAsBox(float32 hx, float32 hy);
|
||||
|
||||
/// Build vertices to represent an oriented box.
|
||||
/// @param hx the half-width.
|
||||
/// @param hy the half-height.
|
||||
/// @param center the center of the box in local coordinates.
|
||||
/// @param angle the rotation of the box in local coordinates.
|
||||
void SetAsBox(float32 hx, float32 hy, const b2Vec2& center, float32 angle);
|
||||
|
||||
/// @see b2Shape::TestPoint
|
||||
bool TestPoint(const b2Transform& transform, const b2Vec2& p) const override;
|
||||
|
||||
/// Implement b2Shape.
|
||||
bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeAABB
|
||||
void ComputeAABB(b2AABB* aabb, const b2Transform& transform, int32 childIndex) const override;
|
||||
|
||||
/// @see b2Shape::ComputeMass
|
||||
void ComputeMass(b2MassData* massData, float32 density) const override;
|
||||
|
||||
/// Validate convexity. This is a very time consuming operation.
|
||||
/// @returns true if valid
|
||||
bool Validate() const;
|
||||
|
||||
b2Vec2 m_centroid;
|
||||
b2Vec2 m_vertices[b2_maxPolygonVertices];
|
||||
b2Vec2 m_normals[b2_maxPolygonVertices];
|
||||
int32 m_count;
|
||||
};
|
||||
|
||||
inline b2PolygonShape::b2PolygonShape()
|
||||
{
|
||||
m_type = e_polygon;
|
||||
m_radius = b2_polygonRadius;
|
||||
m_count = 0;
|
||||
m_centroid.SetZero();
|
||||
}
|
||||
|
||||
#endif
|
||||
-104
@@ -1,104 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_SHAPE_H
|
||||
#define B2_SHAPE_H
|
||||
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
|
||||
/// This holds the mass data computed for a shape.
|
||||
struct b2MassData
|
||||
{
|
||||
/// The mass of the shape, usually in kilograms.
|
||||
float32 mass;
|
||||
|
||||
/// The position of the shape's centroid relative to the shape's origin.
|
||||
b2Vec2 center;
|
||||
|
||||
/// The rotational inertia of the shape about the local origin.
|
||||
float32 I;
|
||||
};
|
||||
|
||||
/// A shape is used for collision detection. You can create a shape however you like.
|
||||
/// Shapes used for simulation in b2World are created automatically when a b2Fixture
|
||||
/// is created. Shapes may encapsulate a one or more child shapes.
|
||||
class b2Shape
|
||||
{
|
||||
public:
|
||||
|
||||
enum Type
|
||||
{
|
||||
e_circle = 0,
|
||||
e_edge = 1,
|
||||
e_polygon = 2,
|
||||
e_chain = 3,
|
||||
e_typeCount = 4
|
||||
};
|
||||
|
||||
virtual ~b2Shape() {}
|
||||
|
||||
/// Clone the concrete shape using the provided allocator.
|
||||
virtual b2Shape* Clone(b2BlockAllocator* allocator) const = 0;
|
||||
|
||||
/// Get the type of this shape. You can use this to down cast to the concrete shape.
|
||||
/// @return the shape type.
|
||||
Type GetType() const;
|
||||
|
||||
/// Get the number of child primitives.
|
||||
virtual int32 GetChildCount() const = 0;
|
||||
|
||||
/// Test a point for containment in this shape. This only works for convex shapes.
|
||||
/// @param xf the shape world transform.
|
||||
/// @param p a point in world coordinates.
|
||||
virtual bool TestPoint(const b2Transform& xf, const b2Vec2& p) const = 0;
|
||||
|
||||
/// Cast a ray against a child shape.
|
||||
/// @param output the ray-cast results.
|
||||
/// @param input the ray-cast input parameters.
|
||||
/// @param transform the transform to be applied to the shape.
|
||||
/// @param childIndex the child shape index
|
||||
virtual bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input,
|
||||
const b2Transform& transform, int32 childIndex) const = 0;
|
||||
|
||||
/// Given a transform, compute the associated axis aligned bounding box for a child shape.
|
||||
/// @param aabb returns the axis aligned box.
|
||||
/// @param xf the world transform of the shape.
|
||||
/// @param childIndex the child shape
|
||||
virtual void ComputeAABB(b2AABB* aabb, const b2Transform& xf, int32 childIndex) const = 0;
|
||||
|
||||
/// Compute the mass properties of this shape using its dimensions and density.
|
||||
/// The inertia tensor is computed about the local origin.
|
||||
/// @param massData returns the mass data for this shape.
|
||||
/// @param density the density in kilograms per meter squared.
|
||||
virtual void ComputeMass(b2MassData* massData, float32 density) const = 0;
|
||||
|
||||
Type m_type;
|
||||
|
||||
/// Radius of a shape. For polygonal shapes this must be b2_polygonRadius. There is no support for
|
||||
/// making rounded polygons.
|
||||
float32 m_radius;
|
||||
};
|
||||
|
||||
inline b2Shape::Type b2Shape::GetType() const
|
||||
{
|
||||
return m_type;
|
||||
}
|
||||
|
||||
#endif
|
||||
-119
@@ -1,119 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2BroadPhase.h"
|
||||
|
||||
b2BroadPhase::b2BroadPhase()
|
||||
{
|
||||
m_proxyCount = 0;
|
||||
|
||||
m_pairCapacity = 16;
|
||||
m_pairCount = 0;
|
||||
m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
|
||||
|
||||
m_moveCapacity = 16;
|
||||
m_moveCount = 0;
|
||||
m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
|
||||
}
|
||||
|
||||
b2BroadPhase::~b2BroadPhase()
|
||||
{
|
||||
b2Free(m_moveBuffer);
|
||||
b2Free(m_pairBuffer);
|
||||
}
|
||||
|
||||
int32 b2BroadPhase::CreateProxy(const b2AABB& aabb, void* userData)
|
||||
{
|
||||
int32 proxyId = m_tree.CreateProxy(aabb, userData);
|
||||
++m_proxyCount;
|
||||
BufferMove(proxyId);
|
||||
return proxyId;
|
||||
}
|
||||
|
||||
void b2BroadPhase::DestroyProxy(int32 proxyId)
|
||||
{
|
||||
UnBufferMove(proxyId);
|
||||
--m_proxyCount;
|
||||
m_tree.DestroyProxy(proxyId);
|
||||
}
|
||||
|
||||
void b2BroadPhase::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement)
|
||||
{
|
||||
bool buffer = m_tree.MoveProxy(proxyId, aabb, displacement);
|
||||
if (buffer)
|
||||
{
|
||||
BufferMove(proxyId);
|
||||
}
|
||||
}
|
||||
|
||||
void b2BroadPhase::TouchProxy(int32 proxyId)
|
||||
{
|
||||
BufferMove(proxyId);
|
||||
}
|
||||
|
||||
void b2BroadPhase::BufferMove(int32 proxyId)
|
||||
{
|
||||
if (m_moveCount == m_moveCapacity)
|
||||
{
|
||||
int32* oldBuffer = m_moveBuffer;
|
||||
m_moveCapacity *= 2;
|
||||
m_moveBuffer = (int32*)b2Alloc(m_moveCapacity * sizeof(int32));
|
||||
memcpy(m_moveBuffer, oldBuffer, m_moveCount * sizeof(int32));
|
||||
b2Free(oldBuffer);
|
||||
}
|
||||
|
||||
m_moveBuffer[m_moveCount] = proxyId;
|
||||
++m_moveCount;
|
||||
}
|
||||
|
||||
void b2BroadPhase::UnBufferMove(int32 proxyId)
|
||||
{
|
||||
for (int32 i = 0; i < m_moveCount; ++i)
|
||||
{
|
||||
if (m_moveBuffer[i] == proxyId)
|
||||
{
|
||||
m_moveBuffer[i] = e_nullProxy;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// This is called from b2DynamicTree::Query when we are gathering pairs.
|
||||
bool b2BroadPhase::QueryCallback(int32 proxyId)
|
||||
{
|
||||
// A proxy cannot form a pair with itself.
|
||||
if (proxyId == m_queryProxyId)
|
||||
{
|
||||
return true;
|
||||
}
|
||||
|
||||
// Grow the pair buffer as needed.
|
||||
if (m_pairCount == m_pairCapacity)
|
||||
{
|
||||
b2Pair* oldBuffer = m_pairBuffer;
|
||||
m_pairCapacity *= 2;
|
||||
m_pairBuffer = (b2Pair*)b2Alloc(m_pairCapacity * sizeof(b2Pair));
|
||||
memcpy(m_pairBuffer, oldBuffer, m_pairCount * sizeof(b2Pair));
|
||||
b2Free(oldBuffer);
|
||||
}
|
||||
|
||||
m_pairBuffer[m_pairCount].proxyIdA = b2Min(proxyId, m_queryProxyId);
|
||||
m_pairBuffer[m_pairCount].proxyIdB = b2Max(proxyId, m_queryProxyId);
|
||||
++m_pairCount;
|
||||
|
||||
return true;
|
||||
}
|
||||
-257
@@ -1,257 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_BROAD_PHASE_H
|
||||
#define B2_BROAD_PHASE_H
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/b2DynamicTree.h"
|
||||
#include <algorithm>
|
||||
|
||||
struct b2Pair
|
||||
{
|
||||
int32 proxyIdA;
|
||||
int32 proxyIdB;
|
||||
};
|
||||
|
||||
/// The broad-phase is used for computing pairs and performing volume queries and ray casts.
|
||||
/// This broad-phase does not persist pairs. Instead, this reports potentially new pairs.
|
||||
/// It is up to the client to consume the new pairs and to track subsequent overlap.
|
||||
class b2BroadPhase
|
||||
{
|
||||
public:
|
||||
|
||||
enum
|
||||
{
|
||||
e_nullProxy = -1
|
||||
};
|
||||
|
||||
b2BroadPhase();
|
||||
~b2BroadPhase();
|
||||
|
||||
/// Create a proxy with an initial AABB. Pairs are not reported until
|
||||
/// UpdatePairs is called.
|
||||
int32 CreateProxy(const b2AABB& aabb, void* userData);
|
||||
|
||||
/// Destroy a proxy. It is up to the client to remove any pairs.
|
||||
void DestroyProxy(int32 proxyId);
|
||||
|
||||
/// Call MoveProxy as many times as you like, then when you are done
|
||||
/// call UpdatePairs to finalized the proxy pairs (for your time step).
|
||||
void MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement);
|
||||
|
||||
/// Call to trigger a re-processing of it's pairs on the next call to UpdatePairs.
|
||||
void TouchProxy(int32 proxyId);
|
||||
|
||||
/// Get the fat AABB for a proxy.
|
||||
const b2AABB& GetFatAABB(int32 proxyId) const;
|
||||
|
||||
/// Get user data from a proxy. Returns nullptr if the id is invalid.
|
||||
void* GetUserData(int32 proxyId) const;
|
||||
|
||||
/// Test overlap of fat AABBs.
|
||||
bool TestOverlap(int32 proxyIdA, int32 proxyIdB) const;
|
||||
|
||||
/// Get the number of proxies.
|
||||
int32 GetProxyCount() const;
|
||||
|
||||
/// Update the pairs. This results in pair callbacks. This can only add pairs.
|
||||
template <typename T>
|
||||
void UpdatePairs(T* callback);
|
||||
|
||||
/// Query an AABB for overlapping proxies. The callback class
|
||||
/// is called for each proxy that overlaps the supplied AABB.
|
||||
template <typename T>
|
||||
void Query(T* callback, const b2AABB& aabb) const;
|
||||
|
||||
/// Ray-cast against the proxies in the tree. This relies on the callback
|
||||
/// to perform a exact ray-cast in the case were the proxy contains a shape.
|
||||
/// The callback also performs the any collision filtering. This has performance
|
||||
/// roughly equal to k * log(n), where k is the number of collisions and n is the
|
||||
/// number of proxies in the tree.
|
||||
/// @param input the ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).
|
||||
/// @param callback a callback class that is called for each proxy that is hit by the ray.
|
||||
template <typename T>
|
||||
void RayCast(T* callback, const b2RayCastInput& input) const;
|
||||
|
||||
/// Get the height of the embedded tree.
|
||||
int32 GetTreeHeight() const;
|
||||
|
||||
/// Get the balance of the embedded tree.
|
||||
int32 GetTreeBalance() const;
|
||||
|
||||
/// Get the quality metric of the embedded tree.
|
||||
float32 GetTreeQuality() const;
|
||||
|
||||
/// Shift the world origin. Useful for large worlds.
|
||||
/// The shift formula is: position -= newOrigin
|
||||
/// @param newOrigin the new origin with respect to the old origin
|
||||
void ShiftOrigin(const b2Vec2& newOrigin);
|
||||
|
||||
private:
|
||||
|
||||
friend class b2DynamicTree;
|
||||
|
||||
void BufferMove(int32 proxyId);
|
||||
void UnBufferMove(int32 proxyId);
|
||||
|
||||
bool QueryCallback(int32 proxyId);
|
||||
|
||||
b2DynamicTree m_tree;
|
||||
|
||||
int32 m_proxyCount;
|
||||
|
||||
int32* m_moveBuffer;
|
||||
int32 m_moveCapacity;
|
||||
int32 m_moveCount;
|
||||
|
||||
b2Pair* m_pairBuffer;
|
||||
int32 m_pairCapacity;
|
||||
int32 m_pairCount;
|
||||
|
||||
int32 m_queryProxyId;
|
||||
};
|
||||
|
||||
/// This is used to sort pairs.
|
||||
inline bool b2PairLessThan(const b2Pair& pair1, const b2Pair& pair2)
|
||||
{
|
||||
if (pair1.proxyIdA < pair2.proxyIdA)
|
||||
{
|
||||
return true;
|
||||
}
|
||||
|
||||
if (pair1.proxyIdA == pair2.proxyIdA)
|
||||
{
|
||||
return pair1.proxyIdB < pair2.proxyIdB;
|
||||
}
|
||||
|
||||
return false;
|
||||
}
|
||||
|
||||
inline void* b2BroadPhase::GetUserData(int32 proxyId) const
|
||||
{
|
||||
return m_tree.GetUserData(proxyId);
|
||||
}
|
||||
|
||||
inline bool b2BroadPhase::TestOverlap(int32 proxyIdA, int32 proxyIdB) const
|
||||
{
|
||||
const b2AABB& aabbA = m_tree.GetFatAABB(proxyIdA);
|
||||
const b2AABB& aabbB = m_tree.GetFatAABB(proxyIdB);
|
||||
return b2TestOverlap(aabbA, aabbB);
|
||||
}
|
||||
|
||||
inline const b2AABB& b2BroadPhase::GetFatAABB(int32 proxyId) const
|
||||
{
|
||||
return m_tree.GetFatAABB(proxyId);
|
||||
}
|
||||
|
||||
inline int32 b2BroadPhase::GetProxyCount() const
|
||||
{
|
||||
return m_proxyCount;
|
||||
}
|
||||
|
||||
inline int32 b2BroadPhase::GetTreeHeight() const
|
||||
{
|
||||
return m_tree.GetHeight();
|
||||
}
|
||||
|
||||
inline int32 b2BroadPhase::GetTreeBalance() const
|
||||
{
|
||||
return m_tree.GetMaxBalance();
|
||||
}
|
||||
|
||||
inline float32 b2BroadPhase::GetTreeQuality() const
|
||||
{
|
||||
return m_tree.GetAreaRatio();
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
void b2BroadPhase::UpdatePairs(T* callback)
|
||||
{
|
||||
// Reset pair buffer
|
||||
m_pairCount = 0;
|
||||
|
||||
// Perform tree queries for all moving proxies.
|
||||
for (int32 i = 0; i < m_moveCount; ++i)
|
||||
{
|
||||
m_queryProxyId = m_moveBuffer[i];
|
||||
if (m_queryProxyId == e_nullProxy)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
// We have to query the tree with the fat AABB so that
|
||||
// we don't fail to create a pair that may touch later.
|
||||
const b2AABB& fatAABB = m_tree.GetFatAABB(m_queryProxyId);
|
||||
|
||||
// Query tree, create pairs and add them pair buffer.
|
||||
m_tree.Query(this, fatAABB);
|
||||
}
|
||||
|
||||
// Reset move buffer
|
||||
m_moveCount = 0;
|
||||
|
||||
// Sort the pair buffer to expose duplicates.
|
||||
std::sort(m_pairBuffer, m_pairBuffer + m_pairCount, b2PairLessThan);
|
||||
|
||||
// Send the pairs back to the client.
|
||||
int32 i = 0;
|
||||
while (i < m_pairCount)
|
||||
{
|
||||
b2Pair* primaryPair = m_pairBuffer + i;
|
||||
void* userDataA = m_tree.GetUserData(primaryPair->proxyIdA);
|
||||
void* userDataB = m_tree.GetUserData(primaryPair->proxyIdB);
|
||||
|
||||
callback->AddPair(userDataA, userDataB);
|
||||
++i;
|
||||
|
||||
// Skip any duplicate pairs.
|
||||
while (i < m_pairCount)
|
||||
{
|
||||
b2Pair* pair = m_pairBuffer + i;
|
||||
if (pair->proxyIdA != primaryPair->proxyIdA || pair->proxyIdB != primaryPair->proxyIdB)
|
||||
{
|
||||
break;
|
||||
}
|
||||
++i;
|
||||
}
|
||||
}
|
||||
|
||||
// Try to keep the tree balanced.
|
||||
//m_tree.Rebalance(4);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline void b2BroadPhase::Query(T* callback, const b2AABB& aabb) const
|
||||
{
|
||||
m_tree.Query(callback, aabb);
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline void b2BroadPhase::RayCast(T* callback, const b2RayCastInput& input) const
|
||||
{
|
||||
m_tree.RayCast(callback, input);
|
||||
}
|
||||
|
||||
inline void b2BroadPhase::ShiftOrigin(const b2Vec2& newOrigin)
|
||||
{
|
||||
m_tree.ShiftOrigin(newOrigin);
|
||||
}
|
||||
|
||||
#endif
|
||||
-154
@@ -1,154 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/Shapes/b2CircleShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
|
||||
void b2CollideCircles(
|
||||
b2Manifold* manifold,
|
||||
const b2CircleShape* circleA, const b2Transform& xfA,
|
||||
const b2CircleShape* circleB, const b2Transform& xfB)
|
||||
{
|
||||
manifold->pointCount = 0;
|
||||
|
||||
b2Vec2 pA = b2Mul(xfA, circleA->m_p);
|
||||
b2Vec2 pB = b2Mul(xfB, circleB->m_p);
|
||||
|
||||
b2Vec2 d = pB - pA;
|
||||
float32 distSqr = b2Dot(d, d);
|
||||
float32 rA = circleA->m_radius, rB = circleB->m_radius;
|
||||
float32 radius = rA + rB;
|
||||
if (distSqr > radius * radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
manifold->type = b2Manifold::e_circles;
|
||||
manifold->localPoint = circleA->m_p;
|
||||
manifold->localNormal.SetZero();
|
||||
manifold->pointCount = 1;
|
||||
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
manifold->points[0].id.key = 0;
|
||||
}
|
||||
|
||||
void b2CollidePolygonAndCircle(
|
||||
b2Manifold* manifold,
|
||||
const b2PolygonShape* polygonA, const b2Transform& xfA,
|
||||
const b2CircleShape* circleB, const b2Transform& xfB)
|
||||
{
|
||||
manifold->pointCount = 0;
|
||||
|
||||
// Compute circle position in the frame of the polygon.
|
||||
b2Vec2 c = b2Mul(xfB, circleB->m_p);
|
||||
b2Vec2 cLocal = b2MulT(xfA, c);
|
||||
|
||||
// Find the min separating edge.
|
||||
int32 normalIndex = 0;
|
||||
float32 separation = -b2_maxFloat;
|
||||
float32 radius = polygonA->m_radius + circleB->m_radius;
|
||||
int32 vertexCount = polygonA->m_count;
|
||||
const b2Vec2* vertices = polygonA->m_vertices;
|
||||
const b2Vec2* normals = polygonA->m_normals;
|
||||
|
||||
for (int32 i = 0; i < vertexCount; ++i)
|
||||
{
|
||||
float32 s = b2Dot(normals[i], cLocal - vertices[i]);
|
||||
|
||||
if (s > radius)
|
||||
{
|
||||
// Early out.
|
||||
return;
|
||||
}
|
||||
|
||||
if (s > separation)
|
||||
{
|
||||
separation = s;
|
||||
normalIndex = i;
|
||||
}
|
||||
}
|
||||
|
||||
// Vertices that subtend the incident face.
|
||||
int32 vertIndex1 = normalIndex;
|
||||
int32 vertIndex2 = vertIndex1 + 1 < vertexCount ? vertIndex1 + 1 : 0;
|
||||
b2Vec2 v1 = vertices[vertIndex1];
|
||||
b2Vec2 v2 = vertices[vertIndex2];
|
||||
|
||||
// If the center is inside the polygon ...
|
||||
if (separation < b2_epsilon)
|
||||
{
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
manifold->localNormal = normals[normalIndex];
|
||||
manifold->localPoint = 0.5f * (v1 + v2);
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
manifold->points[0].id.key = 0;
|
||||
return;
|
||||
}
|
||||
|
||||
// Compute barycentric coordinates
|
||||
float32 u1 = b2Dot(cLocal - v1, v2 - v1);
|
||||
float32 u2 = b2Dot(cLocal - v2, v1 - v2);
|
||||
if (u1 <= 0.0f)
|
||||
{
|
||||
if (b2DistanceSquared(cLocal, v1) > radius * radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
manifold->localNormal = cLocal - v1;
|
||||
manifold->localNormal.Normalize();
|
||||
manifold->localPoint = v1;
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
manifold->points[0].id.key = 0;
|
||||
}
|
||||
else if (u2 <= 0.0f)
|
||||
{
|
||||
if (b2DistanceSquared(cLocal, v2) > radius * radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
manifold->localNormal = cLocal - v2;
|
||||
manifold->localNormal.Normalize();
|
||||
manifold->localPoint = v2;
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
manifold->points[0].id.key = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
b2Vec2 faceCenter = 0.5f * (v1 + v2);
|
||||
float32 s = b2Dot(cLocal - faceCenter, normals[vertIndex1]);
|
||||
if (s > radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
manifold->localNormal = normals[vertIndex1];
|
||||
manifold->localPoint = faceCenter;
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
manifold->points[0].id.key = 0;
|
||||
}
|
||||
}
|
||||
-698
@@ -1,698 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/Shapes/b2CircleShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
|
||||
|
||||
// Compute contact points for edge versus circle.
|
||||
// This accounts for edge connectivity.
|
||||
void b2CollideEdgeAndCircle(b2Manifold* manifold,
|
||||
const b2EdgeShape* edgeA, const b2Transform& xfA,
|
||||
const b2CircleShape* circleB, const b2Transform& xfB)
|
||||
{
|
||||
manifold->pointCount = 0;
|
||||
|
||||
// Compute circle in frame of edge
|
||||
b2Vec2 Q = b2MulT(xfA, b2Mul(xfB, circleB->m_p));
|
||||
|
||||
b2Vec2 A = edgeA->m_vertex1, B = edgeA->m_vertex2;
|
||||
b2Vec2 e = B - A;
|
||||
|
||||
// Barycentric coordinates
|
||||
float32 u = b2Dot(e, B - Q);
|
||||
float32 v = b2Dot(e, Q - A);
|
||||
|
||||
float32 radius = edgeA->m_radius + circleB->m_radius;
|
||||
|
||||
b2ContactFeature cf;
|
||||
cf.indexB = 0;
|
||||
cf.typeB = b2ContactFeature::e_vertex;
|
||||
|
||||
// Region A
|
||||
if (v <= 0.0f)
|
||||
{
|
||||
b2Vec2 P = A;
|
||||
b2Vec2 d = Q - P;
|
||||
float32 dd = b2Dot(d, d);
|
||||
if (dd > radius * radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
// Is there an edge connected to A?
|
||||
if (edgeA->m_hasVertex0)
|
||||
{
|
||||
b2Vec2 A1 = edgeA->m_vertex0;
|
||||
b2Vec2 B1 = A;
|
||||
b2Vec2 e1 = B1 - A1;
|
||||
float32 u1 = b2Dot(e1, B1 - Q);
|
||||
|
||||
// Is the circle in Region AB of the previous edge?
|
||||
if (u1 > 0.0f)
|
||||
{
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
cf.indexA = 0;
|
||||
cf.typeA = b2ContactFeature::e_vertex;
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_circles;
|
||||
manifold->localNormal.SetZero();
|
||||
manifold->localPoint = P;
|
||||
manifold->points[0].id.key = 0;
|
||||
manifold->points[0].id.cf = cf;
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
return;
|
||||
}
|
||||
|
||||
// Region B
|
||||
if (u <= 0.0f)
|
||||
{
|
||||
b2Vec2 P = B;
|
||||
b2Vec2 d = Q - P;
|
||||
float32 dd = b2Dot(d, d);
|
||||
if (dd > radius * radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
// Is there an edge connected to B?
|
||||
if (edgeA->m_hasVertex3)
|
||||
{
|
||||
b2Vec2 B2 = edgeA->m_vertex3;
|
||||
b2Vec2 A2 = B;
|
||||
b2Vec2 e2 = B2 - A2;
|
||||
float32 v2 = b2Dot(e2, Q - A2);
|
||||
|
||||
// Is the circle in Region AB of the next edge?
|
||||
if (v2 > 0.0f)
|
||||
{
|
||||
return;
|
||||
}
|
||||
}
|
||||
|
||||
cf.indexA = 1;
|
||||
cf.typeA = b2ContactFeature::e_vertex;
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_circles;
|
||||
manifold->localNormal.SetZero();
|
||||
manifold->localPoint = P;
|
||||
manifold->points[0].id.key = 0;
|
||||
manifold->points[0].id.cf = cf;
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
return;
|
||||
}
|
||||
|
||||
// Region AB
|
||||
float32 den = b2Dot(e, e);
|
||||
b2Assert(den > 0.0f);
|
||||
b2Vec2 P = (1.0f / den) * (u * A + v * B);
|
||||
b2Vec2 d = Q - P;
|
||||
float32 dd = b2Dot(d, d);
|
||||
if (dd > radius * radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
b2Vec2 n(-e.y, e.x);
|
||||
if (b2Dot(n, Q - A) < 0.0f)
|
||||
{
|
||||
n.Set(-n.x, -n.y);
|
||||
}
|
||||
n.Normalize();
|
||||
|
||||
cf.indexA = 0;
|
||||
cf.typeA = b2ContactFeature::e_face;
|
||||
manifold->pointCount = 1;
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
manifold->localNormal = n;
|
||||
manifold->localPoint = A;
|
||||
manifold->points[0].id.key = 0;
|
||||
manifold->points[0].id.cf = cf;
|
||||
manifold->points[0].localPoint = circleB->m_p;
|
||||
}
|
||||
|
||||
// This structure is used to keep track of the best separating axis.
|
||||
struct b2EPAxis
|
||||
{
|
||||
enum Type
|
||||
{
|
||||
e_unknown,
|
||||
e_edgeA,
|
||||
e_edgeB
|
||||
};
|
||||
|
||||
Type type;
|
||||
int32 index;
|
||||
float32 separation;
|
||||
};
|
||||
|
||||
// This holds polygon B expressed in frame A.
|
||||
struct b2TempPolygon
|
||||
{
|
||||
b2Vec2 vertices[b2_maxPolygonVertices];
|
||||
b2Vec2 normals[b2_maxPolygonVertices];
|
||||
int32 count;
|
||||
};
|
||||
|
||||
// Reference face used for clipping
|
||||
struct b2ReferenceFace
|
||||
{
|
||||
int32 i1, i2;
|
||||
|
||||
b2Vec2 v1, v2;
|
||||
|
||||
b2Vec2 normal;
|
||||
|
||||
b2Vec2 sideNormal1;
|
||||
float32 sideOffset1;
|
||||
|
||||
b2Vec2 sideNormal2;
|
||||
float32 sideOffset2;
|
||||
};
|
||||
|
||||
// This class collides and edge and a polygon, taking into account edge adjacency.
|
||||
struct b2EPCollider
|
||||
{
|
||||
void Collide(b2Manifold* manifold, const b2EdgeShape* edgeA, const b2Transform& xfA,
|
||||
const b2PolygonShape* polygonB, const b2Transform& xfB);
|
||||
b2EPAxis ComputeEdgeSeparation();
|
||||
b2EPAxis ComputePolygonSeparation();
|
||||
|
||||
enum VertexType
|
||||
{
|
||||
e_isolated,
|
||||
e_concave,
|
||||
e_convex
|
||||
};
|
||||
|
||||
b2TempPolygon m_polygonB;
|
||||
|
||||
b2Transform m_xf;
|
||||
b2Vec2 m_centroidB;
|
||||
b2Vec2 m_v0, m_v1, m_v2, m_v3;
|
||||
b2Vec2 m_normal0, m_normal1, m_normal2;
|
||||
b2Vec2 m_normal;
|
||||
VertexType m_type1, m_type2;
|
||||
b2Vec2 m_lowerLimit, m_upperLimit;
|
||||
float32 m_radius;
|
||||
bool m_front;
|
||||
};
|
||||
|
||||
// Algorithm:
|
||||
// 1. Classify v1 and v2
|
||||
// 2. Classify polygon centroid as front or back
|
||||
// 3. Flip normal if necessary
|
||||
// 4. Initialize normal range to [-pi, pi] about face normal
|
||||
// 5. Adjust normal range according to adjacent edges
|
||||
// 6. Visit each separating axes, only accept axes within the range
|
||||
// 7. Return if _any_ axis indicates separation
|
||||
// 8. Clip
|
||||
void b2EPCollider::Collide(b2Manifold* manifold, const b2EdgeShape* edgeA, const b2Transform& xfA,
|
||||
const b2PolygonShape* polygonB, const b2Transform& xfB)
|
||||
{
|
||||
m_xf = b2MulT(xfA, xfB);
|
||||
|
||||
m_centroidB = b2Mul(m_xf, polygonB->m_centroid);
|
||||
|
||||
m_v0 = edgeA->m_vertex0;
|
||||
m_v1 = edgeA->m_vertex1;
|
||||
m_v2 = edgeA->m_vertex2;
|
||||
m_v3 = edgeA->m_vertex3;
|
||||
|
||||
bool hasVertex0 = edgeA->m_hasVertex0;
|
||||
bool hasVertex3 = edgeA->m_hasVertex3;
|
||||
|
||||
b2Vec2 edge1 = m_v2 - m_v1;
|
||||
edge1.Normalize();
|
||||
m_normal1.Set(edge1.y, -edge1.x);
|
||||
float32 offset1 = b2Dot(m_normal1, m_centroidB - m_v1);
|
||||
float32 offset0 = 0.0f, offset2 = 0.0f;
|
||||
bool convex1 = false, convex2 = false;
|
||||
|
||||
// Is there a preceding edge?
|
||||
if (hasVertex0)
|
||||
{
|
||||
b2Vec2 edge0 = m_v1 - m_v0;
|
||||
edge0.Normalize();
|
||||
m_normal0.Set(edge0.y, -edge0.x);
|
||||
convex1 = b2Cross(edge0, edge1) >= 0.0f;
|
||||
offset0 = b2Dot(m_normal0, m_centroidB - m_v0);
|
||||
}
|
||||
|
||||
// Is there a following edge?
|
||||
if (hasVertex3)
|
||||
{
|
||||
b2Vec2 edge2 = m_v3 - m_v2;
|
||||
edge2.Normalize();
|
||||
m_normal2.Set(edge2.y, -edge2.x);
|
||||
convex2 = b2Cross(edge1, edge2) > 0.0f;
|
||||
offset2 = b2Dot(m_normal2, m_centroidB - m_v2);
|
||||
}
|
||||
|
||||
// Determine front or back collision. Determine collision normal limits.
|
||||
if (hasVertex0 && hasVertex3)
|
||||
{
|
||||
if (convex1 && convex2)
|
||||
{
|
||||
m_front = offset0 >= 0.0f || offset1 >= 0.0f || offset2 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = m_normal0;
|
||||
m_upperLimit = m_normal2;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = -m_normal1;
|
||||
m_upperLimit = -m_normal1;
|
||||
}
|
||||
}
|
||||
else if (convex1)
|
||||
{
|
||||
m_front = offset0 >= 0.0f || (offset1 >= 0.0f && offset2 >= 0.0f);
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = m_normal0;
|
||||
m_upperLimit = m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = -m_normal2;
|
||||
m_upperLimit = -m_normal1;
|
||||
}
|
||||
}
|
||||
else if (convex2)
|
||||
{
|
||||
m_front = offset2 >= 0.0f || (offset0 >= 0.0f && offset1 >= 0.0f);
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = m_normal1;
|
||||
m_upperLimit = m_normal2;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = -m_normal1;
|
||||
m_upperLimit = -m_normal0;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_front = offset0 >= 0.0f && offset1 >= 0.0f && offset2 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = m_normal1;
|
||||
m_upperLimit = m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = -m_normal2;
|
||||
m_upperLimit = -m_normal0;
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (hasVertex0)
|
||||
{
|
||||
if (convex1)
|
||||
{
|
||||
m_front = offset0 >= 0.0f || offset1 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = m_normal0;
|
||||
m_upperLimit = -m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = m_normal1;
|
||||
m_upperLimit = -m_normal1;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_front = offset0 >= 0.0f && offset1 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = m_normal1;
|
||||
m_upperLimit = -m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = m_normal1;
|
||||
m_upperLimit = -m_normal0;
|
||||
}
|
||||
}
|
||||
}
|
||||
else if (hasVertex3)
|
||||
{
|
||||
if (convex2)
|
||||
{
|
||||
m_front = offset1 >= 0.0f || offset2 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = -m_normal1;
|
||||
m_upperLimit = m_normal2;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = -m_normal1;
|
||||
m_upperLimit = m_normal1;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_front = offset1 >= 0.0f && offset2 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = -m_normal1;
|
||||
m_upperLimit = m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = -m_normal2;
|
||||
m_upperLimit = m_normal1;
|
||||
}
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_front = offset1 >= 0.0f;
|
||||
if (m_front)
|
||||
{
|
||||
m_normal = m_normal1;
|
||||
m_lowerLimit = -m_normal1;
|
||||
m_upperLimit = -m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_normal = -m_normal1;
|
||||
m_lowerLimit = m_normal1;
|
||||
m_upperLimit = m_normal1;
|
||||
}
|
||||
}
|
||||
|
||||
// Get polygonB in frameA
|
||||
m_polygonB.count = polygonB->m_count;
|
||||
for (int32 i = 0; i < polygonB->m_count; ++i)
|
||||
{
|
||||
m_polygonB.vertices[i] = b2Mul(m_xf, polygonB->m_vertices[i]);
|
||||
m_polygonB.normals[i] = b2Mul(m_xf.q, polygonB->m_normals[i]);
|
||||
}
|
||||
|
||||
m_radius = polygonB->m_radius + edgeA->m_radius;
|
||||
|
||||
manifold->pointCount = 0;
|
||||
|
||||
b2EPAxis edgeAxis = ComputeEdgeSeparation();
|
||||
|
||||
// If no valid normal can be found than this edge should not collide.
|
||||
if (edgeAxis.type == b2EPAxis::e_unknown)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
if (edgeAxis.separation > m_radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
b2EPAxis polygonAxis = ComputePolygonSeparation();
|
||||
if (polygonAxis.type != b2EPAxis::e_unknown && polygonAxis.separation > m_radius)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
// Use hysteresis for jitter reduction.
|
||||
const float32 k_relativeTol = 0.98f;
|
||||
const float32 k_absoluteTol = 0.001f;
|
||||
|
||||
b2EPAxis primaryAxis;
|
||||
if (polygonAxis.type == b2EPAxis::e_unknown)
|
||||
{
|
||||
primaryAxis = edgeAxis;
|
||||
}
|
||||
else if (polygonAxis.separation > k_relativeTol * edgeAxis.separation + k_absoluteTol)
|
||||
{
|
||||
primaryAxis = polygonAxis;
|
||||
}
|
||||
else
|
||||
{
|
||||
primaryAxis = edgeAxis;
|
||||
}
|
||||
|
||||
b2ClipVertex ie[2];
|
||||
b2ReferenceFace rf;
|
||||
if (primaryAxis.type == b2EPAxis::e_edgeA)
|
||||
{
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
|
||||
// Search for the polygon normal that is most anti-parallel to the edge normal.
|
||||
int32 bestIndex = 0;
|
||||
float32 bestValue = b2Dot(m_normal, m_polygonB.normals[0]);
|
||||
for (int32 i = 1; i < m_polygonB.count; ++i)
|
||||
{
|
||||
float32 value = b2Dot(m_normal, m_polygonB.normals[i]);
|
||||
if (value < bestValue)
|
||||
{
|
||||
bestValue = value;
|
||||
bestIndex = i;
|
||||
}
|
||||
}
|
||||
|
||||
int32 i1 = bestIndex;
|
||||
int32 i2 = i1 + 1 < m_polygonB.count ? i1 + 1 : 0;
|
||||
|
||||
ie[0].v = m_polygonB.vertices[i1];
|
||||
ie[0].id.cf.indexA = 0;
|
||||
ie[0].id.cf.indexB = static_cast<uint8>(i1);
|
||||
ie[0].id.cf.typeA = b2ContactFeature::e_face;
|
||||
ie[0].id.cf.typeB = b2ContactFeature::e_vertex;
|
||||
|
||||
ie[1].v = m_polygonB.vertices[i2];
|
||||
ie[1].id.cf.indexA = 0;
|
||||
ie[1].id.cf.indexB = static_cast<uint8>(i2);
|
||||
ie[1].id.cf.typeA = b2ContactFeature::e_face;
|
||||
ie[1].id.cf.typeB = b2ContactFeature::e_vertex;
|
||||
|
||||
if (m_front)
|
||||
{
|
||||
rf.i1 = 0;
|
||||
rf.i2 = 1;
|
||||
rf.v1 = m_v1;
|
||||
rf.v2 = m_v2;
|
||||
rf.normal = m_normal1;
|
||||
}
|
||||
else
|
||||
{
|
||||
rf.i1 = 1;
|
||||
rf.i2 = 0;
|
||||
rf.v1 = m_v2;
|
||||
rf.v2 = m_v1;
|
||||
rf.normal = -m_normal1;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
manifold->type = b2Manifold::e_faceB;
|
||||
|
||||
ie[0].v = m_v1;
|
||||
ie[0].id.cf.indexA = 0;
|
||||
ie[0].id.cf.indexB = static_cast<uint8>(primaryAxis.index);
|
||||
ie[0].id.cf.typeA = b2ContactFeature::e_vertex;
|
||||
ie[0].id.cf.typeB = b2ContactFeature::e_face;
|
||||
|
||||
ie[1].v = m_v2;
|
||||
ie[1].id.cf.indexA = 0;
|
||||
ie[1].id.cf.indexB = static_cast<uint8>(primaryAxis.index);
|
||||
ie[1].id.cf.typeA = b2ContactFeature::e_vertex;
|
||||
ie[1].id.cf.typeB = b2ContactFeature::e_face;
|
||||
|
||||
rf.i1 = primaryAxis.index;
|
||||
rf.i2 = rf.i1 + 1 < m_polygonB.count ? rf.i1 + 1 : 0;
|
||||
rf.v1 = m_polygonB.vertices[rf.i1];
|
||||
rf.v2 = m_polygonB.vertices[rf.i2];
|
||||
rf.normal = m_polygonB.normals[rf.i1];
|
||||
}
|
||||
|
||||
rf.sideNormal1.Set(rf.normal.y, -rf.normal.x);
|
||||
rf.sideNormal2 = -rf.sideNormal1;
|
||||
rf.sideOffset1 = b2Dot(rf.sideNormal1, rf.v1);
|
||||
rf.sideOffset2 = b2Dot(rf.sideNormal2, rf.v2);
|
||||
|
||||
// Clip incident edge against extruded edge1 side edges.
|
||||
b2ClipVertex clipPoints1[2];
|
||||
b2ClipVertex clipPoints2[2];
|
||||
int32 np;
|
||||
|
||||
// Clip to box side 1
|
||||
np = b2ClipSegmentToLine(clipPoints1, ie, rf.sideNormal1, rf.sideOffset1, rf.i1);
|
||||
|
||||
if (np < b2_maxManifoldPoints)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
// Clip to negative box side 1
|
||||
np = b2ClipSegmentToLine(clipPoints2, clipPoints1, rf.sideNormal2, rf.sideOffset2, rf.i2);
|
||||
|
||||
if (np < b2_maxManifoldPoints)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
// Now clipPoints2 contains the clipped points.
|
||||
if (primaryAxis.type == b2EPAxis::e_edgeA)
|
||||
{
|
||||
manifold->localNormal = rf.normal;
|
||||
manifold->localPoint = rf.v1;
|
||||
}
|
||||
else
|
||||
{
|
||||
manifold->localNormal = polygonB->m_normals[rf.i1];
|
||||
manifold->localPoint = polygonB->m_vertices[rf.i1];
|
||||
}
|
||||
|
||||
int32 pointCount = 0;
|
||||
for (int32 i = 0; i < b2_maxManifoldPoints; ++i)
|
||||
{
|
||||
float32 separation;
|
||||
|
||||
separation = b2Dot(rf.normal, clipPoints2[i].v - rf.v1);
|
||||
|
||||
if (separation <= m_radius)
|
||||
{
|
||||
b2ManifoldPoint* cp = manifold->points + pointCount;
|
||||
|
||||
if (primaryAxis.type == b2EPAxis::e_edgeA)
|
||||
{
|
||||
cp->localPoint = b2MulT(m_xf, clipPoints2[i].v);
|
||||
cp->id = clipPoints2[i].id;
|
||||
}
|
||||
else
|
||||
{
|
||||
cp->localPoint = clipPoints2[i].v;
|
||||
cp->id.cf.typeA = clipPoints2[i].id.cf.typeB;
|
||||
cp->id.cf.typeB = clipPoints2[i].id.cf.typeA;
|
||||
cp->id.cf.indexA = clipPoints2[i].id.cf.indexB;
|
||||
cp->id.cf.indexB = clipPoints2[i].id.cf.indexA;
|
||||
}
|
||||
|
||||
++pointCount;
|
||||
}
|
||||
}
|
||||
|
||||
manifold->pointCount = pointCount;
|
||||
}
|
||||
|
||||
b2EPAxis b2EPCollider::ComputeEdgeSeparation()
|
||||
{
|
||||
b2EPAxis axis;
|
||||
axis.type = b2EPAxis::e_edgeA;
|
||||
axis.index = m_front ? 0 : 1;
|
||||
axis.separation = FLT_MAX;
|
||||
|
||||
for (int32 i = 0; i < m_polygonB.count; ++i)
|
||||
{
|
||||
float32 s = b2Dot(m_normal, m_polygonB.vertices[i] - m_v1);
|
||||
if (s < axis.separation)
|
||||
{
|
||||
axis.separation = s;
|
||||
}
|
||||
}
|
||||
|
||||
return axis;
|
||||
}
|
||||
|
||||
b2EPAxis b2EPCollider::ComputePolygonSeparation()
|
||||
{
|
||||
b2EPAxis axis;
|
||||
axis.type = b2EPAxis::e_unknown;
|
||||
axis.index = -1;
|
||||
axis.separation = -FLT_MAX;
|
||||
|
||||
b2Vec2 perp(-m_normal.y, m_normal.x);
|
||||
|
||||
for (int32 i = 0; i < m_polygonB.count; ++i)
|
||||
{
|
||||
b2Vec2 n = -m_polygonB.normals[i];
|
||||
|
||||
float32 s1 = b2Dot(n, m_polygonB.vertices[i] - m_v1);
|
||||
float32 s2 = b2Dot(n, m_polygonB.vertices[i] - m_v2);
|
||||
float32 s = b2Min(s1, s2);
|
||||
|
||||
if (s > m_radius)
|
||||
{
|
||||
// No collision
|
||||
axis.type = b2EPAxis::e_edgeB;
|
||||
axis.index = i;
|
||||
axis.separation = s;
|
||||
return axis;
|
||||
}
|
||||
|
||||
// Adjacency
|
||||
if (b2Dot(n, perp) >= 0.0f)
|
||||
{
|
||||
if (b2Dot(n - m_upperLimit, m_normal) < -b2_angularSlop)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
if (b2Dot(n - m_lowerLimit, m_normal) < -b2_angularSlop)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
}
|
||||
|
||||
if (s > axis.separation)
|
||||
{
|
||||
axis.type = b2EPAxis::e_edgeB;
|
||||
axis.index = i;
|
||||
axis.separation = s;
|
||||
}
|
||||
}
|
||||
|
||||
return axis;
|
||||
}
|
||||
|
||||
void b2CollideEdgeAndPolygon( b2Manifold* manifold,
|
||||
const b2EdgeShape* edgeA, const b2Transform& xfA,
|
||||
const b2PolygonShape* polygonB, const b2Transform& xfB)
|
||||
{
|
||||
b2EPCollider collider;
|
||||
collider.Collide(manifold, edgeA, xfA, polygonB, xfB);
|
||||
}
|
||||
-239
@@ -1,239 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
|
||||
// Find the max separation between poly1 and poly2 using edge normals from poly1.
|
||||
static float32 b2FindMaxSeparation(int32* edgeIndex,
|
||||
const b2PolygonShape* poly1, const b2Transform& xf1,
|
||||
const b2PolygonShape* poly2, const b2Transform& xf2)
|
||||
{
|
||||
int32 count1 = poly1->m_count;
|
||||
int32 count2 = poly2->m_count;
|
||||
const b2Vec2* n1s = poly1->m_normals;
|
||||
const b2Vec2* v1s = poly1->m_vertices;
|
||||
const b2Vec2* v2s = poly2->m_vertices;
|
||||
b2Transform xf = b2MulT(xf2, xf1);
|
||||
|
||||
int32 bestIndex = 0;
|
||||
float32 maxSeparation = -b2_maxFloat;
|
||||
for (int32 i = 0; i < count1; ++i)
|
||||
{
|
||||
// Get poly1 normal in frame2.
|
||||
b2Vec2 n = b2Mul(xf.q, n1s[i]);
|
||||
b2Vec2 v1 = b2Mul(xf, v1s[i]);
|
||||
|
||||
// Find deepest point for normal i.
|
||||
float32 si = b2_maxFloat;
|
||||
for (int32 j = 0; j < count2; ++j)
|
||||
{
|
||||
float32 sij = b2Dot(n, v2s[j] - v1);
|
||||
if (sij < si)
|
||||
{
|
||||
si = sij;
|
||||
}
|
||||
}
|
||||
|
||||
if (si > maxSeparation)
|
||||
{
|
||||
maxSeparation = si;
|
||||
bestIndex = i;
|
||||
}
|
||||
}
|
||||
|
||||
*edgeIndex = bestIndex;
|
||||
return maxSeparation;
|
||||
}
|
||||
|
||||
static void b2FindIncidentEdge(b2ClipVertex c[2],
|
||||
const b2PolygonShape* poly1, const b2Transform& xf1, int32 edge1,
|
||||
const b2PolygonShape* poly2, const b2Transform& xf2)
|
||||
{
|
||||
const b2Vec2* normals1 = poly1->m_normals;
|
||||
|
||||
int32 count2 = poly2->m_count;
|
||||
const b2Vec2* vertices2 = poly2->m_vertices;
|
||||
const b2Vec2* normals2 = poly2->m_normals;
|
||||
|
||||
b2Assert(0 <= edge1 && edge1 < poly1->m_count);
|
||||
|
||||
// Get the normal of the reference edge in poly2's frame.
|
||||
b2Vec2 normal1 = b2MulT(xf2.q, b2Mul(xf1.q, normals1[edge1]));
|
||||
|
||||
// Find the incident edge on poly2.
|
||||
int32 index = 0;
|
||||
float32 minDot = b2_maxFloat;
|
||||
for (int32 i = 0; i < count2; ++i)
|
||||
{
|
||||
float32 dot = b2Dot(normal1, normals2[i]);
|
||||
if (dot < minDot)
|
||||
{
|
||||
minDot = dot;
|
||||
index = i;
|
||||
}
|
||||
}
|
||||
|
||||
// Build the clip vertices for the incident edge.
|
||||
int32 i1 = index;
|
||||
int32 i2 = i1 + 1 < count2 ? i1 + 1 : 0;
|
||||
|
||||
c[0].v = b2Mul(xf2, vertices2[i1]);
|
||||
c[0].id.cf.indexA = (uint8)edge1;
|
||||
c[0].id.cf.indexB = (uint8)i1;
|
||||
c[0].id.cf.typeA = b2ContactFeature::e_face;
|
||||
c[0].id.cf.typeB = b2ContactFeature::e_vertex;
|
||||
|
||||
c[1].v = b2Mul(xf2, vertices2[i2]);
|
||||
c[1].id.cf.indexA = (uint8)edge1;
|
||||
c[1].id.cf.indexB = (uint8)i2;
|
||||
c[1].id.cf.typeA = b2ContactFeature::e_face;
|
||||
c[1].id.cf.typeB = b2ContactFeature::e_vertex;
|
||||
}
|
||||
|
||||
// Find edge normal of max separation on A - return if separating axis is found
|
||||
// Find edge normal of max separation on B - return if separation axis is found
|
||||
// Choose reference edge as min(minA, minB)
|
||||
// Find incident edge
|
||||
// Clip
|
||||
|
||||
// The normal points from 1 to 2
|
||||
void b2CollidePolygons(b2Manifold* manifold,
|
||||
const b2PolygonShape* polyA, const b2Transform& xfA,
|
||||
const b2PolygonShape* polyB, const b2Transform& xfB)
|
||||
{
|
||||
manifold->pointCount = 0;
|
||||
float32 totalRadius = polyA->m_radius + polyB->m_radius;
|
||||
|
||||
int32 edgeA = 0;
|
||||
float32 separationA = b2FindMaxSeparation(&edgeA, polyA, xfA, polyB, xfB);
|
||||
if (separationA > totalRadius)
|
||||
return;
|
||||
|
||||
int32 edgeB = 0;
|
||||
float32 separationB = b2FindMaxSeparation(&edgeB, polyB, xfB, polyA, xfA);
|
||||
if (separationB > totalRadius)
|
||||
return;
|
||||
|
||||
const b2PolygonShape* poly1; // reference polygon
|
||||
const b2PolygonShape* poly2; // incident polygon
|
||||
b2Transform xf1, xf2;
|
||||
int32 edge1; // reference edge
|
||||
uint8 flip;
|
||||
const float32 k_tol = 0.1f * b2_linearSlop;
|
||||
|
||||
if (separationB > separationA + k_tol)
|
||||
{
|
||||
poly1 = polyB;
|
||||
poly2 = polyA;
|
||||
xf1 = xfB;
|
||||
xf2 = xfA;
|
||||
edge1 = edgeB;
|
||||
manifold->type = b2Manifold::e_faceB;
|
||||
flip = 1;
|
||||
}
|
||||
else
|
||||
{
|
||||
poly1 = polyA;
|
||||
poly2 = polyB;
|
||||
xf1 = xfA;
|
||||
xf2 = xfB;
|
||||
edge1 = edgeA;
|
||||
manifold->type = b2Manifold::e_faceA;
|
||||
flip = 0;
|
||||
}
|
||||
|
||||
b2ClipVertex incidentEdge[2];
|
||||
b2FindIncidentEdge(incidentEdge, poly1, xf1, edge1, poly2, xf2);
|
||||
|
||||
int32 count1 = poly1->m_count;
|
||||
const b2Vec2* vertices1 = poly1->m_vertices;
|
||||
|
||||
int32 iv1 = edge1;
|
||||
int32 iv2 = edge1 + 1 < count1 ? edge1 + 1 : 0;
|
||||
|
||||
b2Vec2 v11 = vertices1[iv1];
|
||||
b2Vec2 v12 = vertices1[iv2];
|
||||
|
||||
b2Vec2 localTangent = v12 - v11;
|
||||
localTangent.Normalize();
|
||||
|
||||
b2Vec2 localNormal = b2Cross(localTangent, 1.0f);
|
||||
b2Vec2 planePoint = 0.5f * (v11 + v12);
|
||||
|
||||
b2Vec2 tangent = b2Mul(xf1.q, localTangent);
|
||||
b2Vec2 normal = b2Cross(tangent, 1.0f);
|
||||
|
||||
v11 = b2Mul(xf1, v11);
|
||||
v12 = b2Mul(xf1, v12);
|
||||
|
||||
// Face offset.
|
||||
float32 frontOffset = b2Dot(normal, v11);
|
||||
|
||||
// Side offsets, extended by polytope skin thickness.
|
||||
float32 sideOffset1 = -b2Dot(tangent, v11) + totalRadius;
|
||||
float32 sideOffset2 = b2Dot(tangent, v12) + totalRadius;
|
||||
|
||||
// Clip incident edge against extruded edge1 side edges.
|
||||
b2ClipVertex clipPoints1[2];
|
||||
b2ClipVertex clipPoints2[2];
|
||||
int np;
|
||||
|
||||
// Clip to box side 1
|
||||
np = b2ClipSegmentToLine(clipPoints1, incidentEdge, -tangent, sideOffset1, iv1);
|
||||
|
||||
if (np < 2)
|
||||
return;
|
||||
|
||||
// Clip to negative box side 1
|
||||
np = b2ClipSegmentToLine(clipPoints2, clipPoints1, tangent, sideOffset2, iv2);
|
||||
|
||||
if (np < 2)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
// Now clipPoints2 contains the clipped points.
|
||||
manifold->localNormal = localNormal;
|
||||
manifold->localPoint = planePoint;
|
||||
|
||||
int32 pointCount = 0;
|
||||
for (int32 i = 0; i < b2_maxManifoldPoints; ++i)
|
||||
{
|
||||
float32 separation = b2Dot(normal, clipPoints2[i].v) - frontOffset;
|
||||
|
||||
if (separation <= totalRadius)
|
||||
{
|
||||
b2ManifoldPoint* cp = manifold->points + pointCount;
|
||||
cp->localPoint = b2MulT(xf2, clipPoints2[i].v);
|
||||
cp->id = clipPoints2[i].id;
|
||||
if (flip)
|
||||
{
|
||||
// Swap features
|
||||
b2ContactFeature cf = cp->id.cf;
|
||||
cp->id.cf.indexA = cf.indexB;
|
||||
cp->id.cf.indexB = cf.indexA;
|
||||
cp->id.cf.typeA = cf.typeB;
|
||||
cp->id.cf.typeB = cf.typeA;
|
||||
}
|
||||
++pointCount;
|
||||
}
|
||||
}
|
||||
|
||||
manifold->pointCount = pointCount;
|
||||
}
|
||||
-252
@@ -1,252 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/b2Distance.h"
|
||||
|
||||
void b2WorldManifold::Initialize(const b2Manifold* manifold,
|
||||
const b2Transform& xfA, float32 radiusA,
|
||||
const b2Transform& xfB, float32 radiusB)
|
||||
{
|
||||
if (manifold->pointCount == 0)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
switch (manifold->type)
|
||||
{
|
||||
case b2Manifold::e_circles:
|
||||
{
|
||||
normal.Set(1.0f, 0.0f);
|
||||
b2Vec2 pointA = b2Mul(xfA, manifold->localPoint);
|
||||
b2Vec2 pointB = b2Mul(xfB, manifold->points[0].localPoint);
|
||||
if (b2DistanceSquared(pointA, pointB) > b2_epsilon * b2_epsilon)
|
||||
{
|
||||
normal = pointB - pointA;
|
||||
normal.Normalize();
|
||||
}
|
||||
|
||||
b2Vec2 cA = pointA + radiusA * normal;
|
||||
b2Vec2 cB = pointB - radiusB * normal;
|
||||
points[0] = 0.5f * (cA + cB);
|
||||
separations[0] = b2Dot(cB - cA, normal);
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Manifold::e_faceA:
|
||||
{
|
||||
normal = b2Mul(xfA.q, manifold->localNormal);
|
||||
b2Vec2 planePoint = b2Mul(xfA, manifold->localPoint);
|
||||
|
||||
for (int32 i = 0; i < manifold->pointCount; ++i)
|
||||
{
|
||||
b2Vec2 clipPoint = b2Mul(xfB, manifold->points[i].localPoint);
|
||||
b2Vec2 cA = clipPoint + (radiusA - b2Dot(clipPoint - planePoint, normal)) * normal;
|
||||
b2Vec2 cB = clipPoint - radiusB * normal;
|
||||
points[i] = 0.5f * (cA + cB);
|
||||
separations[i] = b2Dot(cB - cA, normal);
|
||||
}
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Manifold::e_faceB:
|
||||
{
|
||||
normal = b2Mul(xfB.q, manifold->localNormal);
|
||||
b2Vec2 planePoint = b2Mul(xfB, manifold->localPoint);
|
||||
|
||||
for (int32 i = 0; i < manifold->pointCount; ++i)
|
||||
{
|
||||
b2Vec2 clipPoint = b2Mul(xfA, manifold->points[i].localPoint);
|
||||
b2Vec2 cB = clipPoint + (radiusB - b2Dot(clipPoint - planePoint, normal)) * normal;
|
||||
b2Vec2 cA = clipPoint - radiusA * normal;
|
||||
points[i] = 0.5f * (cA + cB);
|
||||
separations[i] = b2Dot(cA - cB, normal);
|
||||
}
|
||||
|
||||
// Ensure normal points from A to B.
|
||||
normal = -normal;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
void b2GetPointStates(b2PointState state1[b2_maxManifoldPoints], b2PointState state2[b2_maxManifoldPoints],
|
||||
const b2Manifold* manifold1, const b2Manifold* manifold2)
|
||||
{
|
||||
for (int32 i = 0; i < b2_maxManifoldPoints; ++i)
|
||||
{
|
||||
state1[i] = b2_nullState;
|
||||
state2[i] = b2_nullState;
|
||||
}
|
||||
|
||||
// Detect persists and removes.
|
||||
for (int32 i = 0; i < manifold1->pointCount; ++i)
|
||||
{
|
||||
b2ContactID id = manifold1->points[i].id;
|
||||
|
||||
state1[i] = b2_removeState;
|
||||
|
||||
for (int32 j = 0; j < manifold2->pointCount; ++j)
|
||||
{
|
||||
if (manifold2->points[j].id.key == id.key)
|
||||
{
|
||||
state1[i] = b2_persistState;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Detect persists and adds.
|
||||
for (int32 i = 0; i < manifold2->pointCount; ++i)
|
||||
{
|
||||
b2ContactID id = manifold2->points[i].id;
|
||||
|
||||
state2[i] = b2_addState;
|
||||
|
||||
for (int32 j = 0; j < manifold1->pointCount; ++j)
|
||||
{
|
||||
if (manifold1->points[j].id.key == id.key)
|
||||
{
|
||||
state2[i] = b2_persistState;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// From Real-time Collision Detection, p179.
|
||||
bool b2AABB::RayCast(b2RayCastOutput* output, const b2RayCastInput& input) const
|
||||
{
|
||||
float32 tmin = -b2_maxFloat;
|
||||
float32 tmax = b2_maxFloat;
|
||||
|
||||
b2Vec2 p = input.p1;
|
||||
b2Vec2 d = input.p2 - input.p1;
|
||||
b2Vec2 absD = b2Abs(d);
|
||||
|
||||
b2Vec2 normal;
|
||||
|
||||
for (int32 i = 0; i < 2; ++i)
|
||||
{
|
||||
if (absD(i) < b2_epsilon)
|
||||
{
|
||||
// Parallel.
|
||||
if (p(i) < lowerBound(i) || upperBound(i) < p(i))
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
float32 inv_d = 1.0f / d(i);
|
||||
float32 t1 = (lowerBound(i) - p(i)) * inv_d;
|
||||
float32 t2 = (upperBound(i) - p(i)) * inv_d;
|
||||
|
||||
// Sign of the normal vector.
|
||||
float32 s = -1.0f;
|
||||
|
||||
if (t1 > t2)
|
||||
{
|
||||
b2Swap(t1, t2);
|
||||
s = 1.0f;
|
||||
}
|
||||
|
||||
// Push the min up
|
||||
if (t1 > tmin)
|
||||
{
|
||||
normal.SetZero();
|
||||
normal(i) = s;
|
||||
tmin = t1;
|
||||
}
|
||||
|
||||
// Pull the max down
|
||||
tmax = b2Min(tmax, t2);
|
||||
|
||||
if (tmin > tmax)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
// Does the ray start inside the box?
|
||||
// Does the ray intersect beyond the max fraction?
|
||||
if (tmin < 0.0f || input.maxFraction < tmin)
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
// Intersection.
|
||||
output->fraction = tmin;
|
||||
output->normal = normal;
|
||||
return true;
|
||||
}
|
||||
|
||||
// Sutherland-Hodgman clipping.
|
||||
int32 b2ClipSegmentToLine(b2ClipVertex vOut[2], const b2ClipVertex vIn[2],
|
||||
const b2Vec2& normal, float32 offset, int32 vertexIndexA)
|
||||
{
|
||||
// Start with no output points
|
||||
int32 numOut = 0;
|
||||
|
||||
// Calculate the distance of end points to the line
|
||||
float32 distance0 = b2Dot(normal, vIn[0].v) - offset;
|
||||
float32 distance1 = b2Dot(normal, vIn[1].v) - offset;
|
||||
|
||||
// If the points are behind the plane
|
||||
if (distance0 <= 0.0f) vOut[numOut++] = vIn[0];
|
||||
if (distance1 <= 0.0f) vOut[numOut++] = vIn[1];
|
||||
|
||||
// If the points are on different sides of the plane
|
||||
if (distance0 * distance1 < 0.0f)
|
||||
{
|
||||
// Find intersection point of edge and plane
|
||||
float32 interp = distance0 / (distance0 - distance1);
|
||||
vOut[numOut].v = vIn[0].v + interp * (vIn[1].v - vIn[0].v);
|
||||
|
||||
// VertexA is hitting edgeB.
|
||||
vOut[numOut].id.cf.indexA = static_cast<uint8>(vertexIndexA);
|
||||
vOut[numOut].id.cf.indexB = vIn[0].id.cf.indexB;
|
||||
vOut[numOut].id.cf.typeA = b2ContactFeature::e_vertex;
|
||||
vOut[numOut].id.cf.typeB = b2ContactFeature::e_face;
|
||||
++numOut;
|
||||
}
|
||||
|
||||
return numOut;
|
||||
}
|
||||
|
||||
bool b2TestOverlap( const b2Shape* shapeA, int32 indexA,
|
||||
const b2Shape* shapeB, int32 indexB,
|
||||
const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2DistanceInput input;
|
||||
input.proxyA.Set(shapeA, indexA);
|
||||
input.proxyB.Set(shapeB, indexB);
|
||||
input.transformA = xfA;
|
||||
input.transformB = xfB;
|
||||
input.useRadii = true;
|
||||
|
||||
b2SimplexCache cache;
|
||||
cache.count = 0;
|
||||
|
||||
b2DistanceOutput output;
|
||||
|
||||
b2Distance(&output, &cache, &input);
|
||||
|
||||
return output.distance < 10.0f * b2_epsilon;
|
||||
}
|
||||
-277
@@ -1,277 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_COLLISION_H
|
||||
#define B2_COLLISION_H
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
#include <limits.h>
|
||||
|
||||
/// @file
|
||||
/// Structures and functions used for computing contact points, distance
|
||||
/// queries, and TOI queries.
|
||||
|
||||
class b2Shape;
|
||||
class b2CircleShape;
|
||||
class b2EdgeShape;
|
||||
class b2PolygonShape;
|
||||
|
||||
const uint8 b2_nullFeature = UCHAR_MAX;
|
||||
|
||||
/// The features that intersect to form the contact point
|
||||
/// This must be 4 bytes or less.
|
||||
struct b2ContactFeature
|
||||
{
|
||||
enum Type
|
||||
{
|
||||
e_vertex = 0,
|
||||
e_face = 1
|
||||
};
|
||||
|
||||
uint8 indexA; ///< Feature index on shapeA
|
||||
uint8 indexB; ///< Feature index on shapeB
|
||||
uint8 typeA; ///< The feature type on shapeA
|
||||
uint8 typeB; ///< The feature type on shapeB
|
||||
};
|
||||
|
||||
/// Contact ids to facilitate warm starting.
|
||||
union b2ContactID
|
||||
{
|
||||
b2ContactFeature cf;
|
||||
uint32 key; ///< Used to quickly compare contact ids.
|
||||
};
|
||||
|
||||
/// A manifold point is a contact point belonging to a contact
|
||||
/// manifold. It holds details related to the geometry and dynamics
|
||||
/// of the contact points.
|
||||
/// The local point usage depends on the manifold type:
|
||||
/// -e_circles: the local center of circleB
|
||||
/// -e_faceA: the local center of cirlceB or the clip point of polygonB
|
||||
/// -e_faceB: the clip point of polygonA
|
||||
/// This structure is stored across time steps, so we keep it small.
|
||||
/// Note: the impulses are used for internal caching and may not
|
||||
/// provide reliable contact forces, especially for high speed collisions.
|
||||
struct b2ManifoldPoint
|
||||
{
|
||||
b2Vec2 localPoint; ///< usage depends on manifold type
|
||||
float32 normalImpulse; ///< the non-penetration impulse
|
||||
float32 tangentImpulse; ///< the friction impulse
|
||||
b2ContactID id; ///< uniquely identifies a contact point between two shapes
|
||||
};
|
||||
|
||||
/// A manifold for two touching convex shapes.
|
||||
/// Box2D supports multiple types of contact:
|
||||
/// - clip point versus plane with radius
|
||||
/// - point versus point with radius (circles)
|
||||
/// The local point usage depends on the manifold type:
|
||||
/// -e_circles: the local center of circleA
|
||||
/// -e_faceA: the center of faceA
|
||||
/// -e_faceB: the center of faceB
|
||||
/// Similarly the local normal usage:
|
||||
/// -e_circles: not used
|
||||
/// -e_faceA: the normal on polygonA
|
||||
/// -e_faceB: the normal on polygonB
|
||||
/// We store contacts in this way so that position correction can
|
||||
/// account for movement, which is critical for continuous physics.
|
||||
/// All contact scenarios must be expressed in one of these types.
|
||||
/// This structure is stored across time steps, so we keep it small.
|
||||
struct b2Manifold
|
||||
{
|
||||
enum Type
|
||||
{
|
||||
e_circles,
|
||||
e_faceA,
|
||||
e_faceB
|
||||
};
|
||||
|
||||
b2ManifoldPoint points[b2_maxManifoldPoints]; ///< the points of contact
|
||||
b2Vec2 localNormal; ///< not use for Type::e_points
|
||||
b2Vec2 localPoint; ///< usage depends on manifold type
|
||||
Type type;
|
||||
int32 pointCount; ///< the number of manifold points
|
||||
};
|
||||
|
||||
/// This is used to compute the current state of a contact manifold.
|
||||
struct b2WorldManifold
|
||||
{
|
||||
/// Evaluate the manifold with supplied transforms. This assumes
|
||||
/// modest motion from the original state. This does not change the
|
||||
/// point count, impulses, etc. The radii must come from the shapes
|
||||
/// that generated the manifold.
|
||||
void Initialize(const b2Manifold* manifold,
|
||||
const b2Transform& xfA, float32 radiusA,
|
||||
const b2Transform& xfB, float32 radiusB);
|
||||
|
||||
b2Vec2 normal; ///< world vector pointing from A to B
|
||||
b2Vec2 points[b2_maxManifoldPoints]; ///< world contact point (point of intersection)
|
||||
float32 separations[b2_maxManifoldPoints]; ///< a negative value indicates overlap, in meters
|
||||
};
|
||||
|
||||
/// This is used for determining the state of contact points.
|
||||
enum b2PointState
|
||||
{
|
||||
b2_nullState, ///< point does not exist
|
||||
b2_addState, ///< point was added in the update
|
||||
b2_persistState, ///< point persisted across the update
|
||||
b2_removeState ///< point was removed in the update
|
||||
};
|
||||
|
||||
/// Compute the point states given two manifolds. The states pertain to the transition from manifold1
|
||||
/// to manifold2. So state1 is either persist or remove while state2 is either add or persist.
|
||||
void b2GetPointStates(b2PointState state1[b2_maxManifoldPoints], b2PointState state2[b2_maxManifoldPoints],
|
||||
const b2Manifold* manifold1, const b2Manifold* manifold2);
|
||||
|
||||
/// Used for computing contact manifolds.
|
||||
struct b2ClipVertex
|
||||
{
|
||||
b2Vec2 v;
|
||||
b2ContactID id;
|
||||
};
|
||||
|
||||
/// Ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).
|
||||
struct b2RayCastInput
|
||||
{
|
||||
b2Vec2 p1, p2;
|
||||
float32 maxFraction;
|
||||
};
|
||||
|
||||
/// Ray-cast output data. The ray hits at p1 + fraction * (p2 - p1), where p1 and p2
|
||||
/// come from b2RayCastInput.
|
||||
struct b2RayCastOutput
|
||||
{
|
||||
b2Vec2 normal;
|
||||
float32 fraction;
|
||||
};
|
||||
|
||||
/// An axis aligned bounding box.
|
||||
struct b2AABB
|
||||
{
|
||||
/// Verify that the bounds are sorted.
|
||||
bool IsValid() const;
|
||||
|
||||
/// Get the center of the AABB.
|
||||
b2Vec2 GetCenter() const
|
||||
{
|
||||
return 0.5f * (lowerBound + upperBound);
|
||||
}
|
||||
|
||||
/// Get the extents of the AABB (half-widths).
|
||||
b2Vec2 GetExtents() const
|
||||
{
|
||||
return 0.5f * (upperBound - lowerBound);
|
||||
}
|
||||
|
||||
/// Get the perimeter length
|
||||
float32 GetPerimeter() const
|
||||
{
|
||||
float32 wx = upperBound.x - lowerBound.x;
|
||||
float32 wy = upperBound.y - lowerBound.y;
|
||||
return 2.0f * (wx + wy);
|
||||
}
|
||||
|
||||
/// Combine an AABB into this one.
|
||||
void Combine(const b2AABB& aabb)
|
||||
{
|
||||
lowerBound = b2Min(lowerBound, aabb.lowerBound);
|
||||
upperBound = b2Max(upperBound, aabb.upperBound);
|
||||
}
|
||||
|
||||
/// Combine two AABBs into this one.
|
||||
void Combine(const b2AABB& aabb1, const b2AABB& aabb2)
|
||||
{
|
||||
lowerBound = b2Min(aabb1.lowerBound, aabb2.lowerBound);
|
||||
upperBound = b2Max(aabb1.upperBound, aabb2.upperBound);
|
||||
}
|
||||
|
||||
/// Does this aabb contain the provided AABB.
|
||||
bool Contains(const b2AABB& aabb) const
|
||||
{
|
||||
bool result = true;
|
||||
result = result && lowerBound.x <= aabb.lowerBound.x;
|
||||
result = result && lowerBound.y <= aabb.lowerBound.y;
|
||||
result = result && aabb.upperBound.x <= upperBound.x;
|
||||
result = result && aabb.upperBound.y <= upperBound.y;
|
||||
return result;
|
||||
}
|
||||
|
||||
bool RayCast(b2RayCastOutput* output, const b2RayCastInput& input) const;
|
||||
|
||||
b2Vec2 lowerBound; ///< the lower vertex
|
||||
b2Vec2 upperBound; ///< the upper vertex
|
||||
};
|
||||
|
||||
/// Compute the collision manifold between two circles.
|
||||
void b2CollideCircles(b2Manifold* manifold,
|
||||
const b2CircleShape* circleA, const b2Transform& xfA,
|
||||
const b2CircleShape* circleB, const b2Transform& xfB);
|
||||
|
||||
/// Compute the collision manifold between a polygon and a circle.
|
||||
void b2CollidePolygonAndCircle(b2Manifold* manifold,
|
||||
const b2PolygonShape* polygonA, const b2Transform& xfA,
|
||||
const b2CircleShape* circleB, const b2Transform& xfB);
|
||||
|
||||
/// Compute the collision manifold between two polygons.
|
||||
void b2CollidePolygons(b2Manifold* manifold,
|
||||
const b2PolygonShape* polygonA, const b2Transform& xfA,
|
||||
const b2PolygonShape* polygonB, const b2Transform& xfB);
|
||||
|
||||
/// Compute the collision manifold between an edge and a circle.
|
||||
void b2CollideEdgeAndCircle(b2Manifold* manifold,
|
||||
const b2EdgeShape* polygonA, const b2Transform& xfA,
|
||||
const b2CircleShape* circleB, const b2Transform& xfB);
|
||||
|
||||
/// Compute the collision manifold between an edge and a circle.
|
||||
void b2CollideEdgeAndPolygon(b2Manifold* manifold,
|
||||
const b2EdgeShape* edgeA, const b2Transform& xfA,
|
||||
const b2PolygonShape* circleB, const b2Transform& xfB);
|
||||
|
||||
/// Clipping for contact manifolds.
|
||||
int32 b2ClipSegmentToLine(b2ClipVertex vOut[2], const b2ClipVertex vIn[2],
|
||||
const b2Vec2& normal, float32 offset, int32 vertexIndexA);
|
||||
|
||||
/// Determine if two generic shapes overlap.
|
||||
bool b2TestOverlap( const b2Shape* shapeA, int32 indexA,
|
||||
const b2Shape* shapeB, int32 indexB,
|
||||
const b2Transform& xfA, const b2Transform& xfB);
|
||||
|
||||
// ---------------- Inline Functions ------------------------------------------
|
||||
|
||||
inline bool b2AABB::IsValid() const
|
||||
{
|
||||
b2Vec2 d = upperBound - lowerBound;
|
||||
bool valid = d.x >= 0.0f && d.y >= 0.0f;
|
||||
valid = valid && lowerBound.IsValid() && upperBound.IsValid();
|
||||
return valid;
|
||||
}
|
||||
|
||||
inline bool b2TestOverlap(const b2AABB& a, const b2AABB& b)
|
||||
{
|
||||
b2Vec2 d1, d2;
|
||||
d1 = b.lowerBound - a.upperBound;
|
||||
d2 = a.lowerBound - b.upperBound;
|
||||
|
||||
if (d1.x > 0.0f || d1.y > 0.0f)
|
||||
return false;
|
||||
|
||||
if (d2.x > 0.0f || d2.y > 0.0f)
|
||||
return false;
|
||||
|
||||
return true;
|
||||
}
|
||||
|
||||
#endif
|
||||
-589
@@ -1,589 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2Distance.h"
|
||||
#include "Box2D/Collision/Shapes/b2CircleShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2ChainShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
|
||||
// GJK using Voronoi regions (Christer Ericson) and Barycentric coordinates.
|
||||
int32 b2_gjkCalls, b2_gjkIters, b2_gjkMaxIters;
|
||||
|
||||
void b2DistanceProxy::Set(const b2Shape* shape, int32 index)
|
||||
{
|
||||
switch (shape->GetType())
|
||||
{
|
||||
case b2Shape::e_circle:
|
||||
{
|
||||
const b2CircleShape* circle = static_cast<const b2CircleShape*>(shape);
|
||||
m_vertices = &circle->m_p;
|
||||
m_count = 1;
|
||||
m_radius = circle->m_radius;
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Shape::e_polygon:
|
||||
{
|
||||
const b2PolygonShape* polygon = static_cast<const b2PolygonShape*>(shape);
|
||||
m_vertices = polygon->m_vertices;
|
||||
m_count = polygon->m_count;
|
||||
m_radius = polygon->m_radius;
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Shape::e_chain:
|
||||
{
|
||||
const b2ChainShape* chain = static_cast<const b2ChainShape*>(shape);
|
||||
b2Assert(0 <= index && index < chain->m_count);
|
||||
|
||||
m_buffer[0] = chain->m_vertices[index];
|
||||
if (index + 1 < chain->m_count)
|
||||
{
|
||||
m_buffer[1] = chain->m_vertices[index + 1];
|
||||
}
|
||||
else
|
||||
{
|
||||
m_buffer[1] = chain->m_vertices[0];
|
||||
}
|
||||
|
||||
m_vertices = m_buffer;
|
||||
m_count = 2;
|
||||
m_radius = chain->m_radius;
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Shape::e_edge:
|
||||
{
|
||||
const b2EdgeShape* edge = static_cast<const b2EdgeShape*>(shape);
|
||||
m_vertices = &edge->m_vertex1;
|
||||
m_count = 2;
|
||||
m_radius = edge->m_radius;
|
||||
}
|
||||
break;
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
}
|
||||
}
|
||||
|
||||
|
||||
struct b2SimplexVertex
|
||||
{
|
||||
b2Vec2 wA; // support point in proxyA
|
||||
b2Vec2 wB; // support point in proxyB
|
||||
b2Vec2 w; // wB - wA
|
||||
float32 a; // barycentric coordinate for closest point
|
||||
int32 indexA; // wA index
|
||||
int32 indexB; // wB index
|
||||
};
|
||||
|
||||
struct b2Simplex
|
||||
{
|
||||
void ReadCache( const b2SimplexCache* cache,
|
||||
const b2DistanceProxy* proxyA, const b2Transform& transformA,
|
||||
const b2DistanceProxy* proxyB, const b2Transform& transformB)
|
||||
{
|
||||
b2Assert(cache->count <= 3);
|
||||
|
||||
// Copy data from cache.
|
||||
m_count = cache->count;
|
||||
b2SimplexVertex* vertices = &m_v1;
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2SimplexVertex* v = vertices + i;
|
||||
v->indexA = cache->indexA[i];
|
||||
v->indexB = cache->indexB[i];
|
||||
b2Vec2 wALocal = proxyA->GetVertex(v->indexA);
|
||||
b2Vec2 wBLocal = proxyB->GetVertex(v->indexB);
|
||||
v->wA = b2Mul(transformA, wALocal);
|
||||
v->wB = b2Mul(transformB, wBLocal);
|
||||
v->w = v->wB - v->wA;
|
||||
v->a = 0.0f;
|
||||
}
|
||||
|
||||
// Compute the new simplex metric, if it is substantially different than
|
||||
// old metric then flush the simplex.
|
||||
if (m_count > 1)
|
||||
{
|
||||
float32 metric1 = cache->metric;
|
||||
float32 metric2 = GetMetric();
|
||||
if (metric2 < 0.5f * metric1 || 2.0f * metric1 < metric2 || metric2 < b2_epsilon)
|
||||
{
|
||||
// Reset the simplex.
|
||||
m_count = 0;
|
||||
}
|
||||
}
|
||||
|
||||
// If the cache is empty or invalid ...
|
||||
if (m_count == 0)
|
||||
{
|
||||
b2SimplexVertex* v = vertices + 0;
|
||||
v->indexA = 0;
|
||||
v->indexB = 0;
|
||||
b2Vec2 wALocal = proxyA->GetVertex(0);
|
||||
b2Vec2 wBLocal = proxyB->GetVertex(0);
|
||||
v->wA = b2Mul(transformA, wALocal);
|
||||
v->wB = b2Mul(transformB, wBLocal);
|
||||
v->w = v->wB - v->wA;
|
||||
v->a = 1.0f;
|
||||
m_count = 1;
|
||||
}
|
||||
}
|
||||
|
||||
void WriteCache(b2SimplexCache* cache) const
|
||||
{
|
||||
cache->metric = GetMetric();
|
||||
cache->count = uint16(m_count);
|
||||
const b2SimplexVertex* vertices = &m_v1;
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
cache->indexA[i] = uint8(vertices[i].indexA);
|
||||
cache->indexB[i] = uint8(vertices[i].indexB);
|
||||
}
|
||||
}
|
||||
|
||||
b2Vec2 GetSearchDirection() const
|
||||
{
|
||||
switch (m_count)
|
||||
{
|
||||
case 1:
|
||||
return -m_v1.w;
|
||||
|
||||
case 2:
|
||||
{
|
||||
b2Vec2 e12 = m_v2.w - m_v1.w;
|
||||
float32 sgn = b2Cross(e12, -m_v1.w);
|
||||
if (sgn > 0.0f)
|
||||
{
|
||||
// Origin is left of e12.
|
||||
return b2Cross(1.0f, e12);
|
||||
}
|
||||
else
|
||||
{
|
||||
// Origin is right of e12.
|
||||
return b2Cross(e12, 1.0f);
|
||||
}
|
||||
}
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
return b2Vec2_zero;
|
||||
}
|
||||
}
|
||||
|
||||
b2Vec2 GetClosestPoint() const
|
||||
{
|
||||
switch (m_count)
|
||||
{
|
||||
case 0:
|
||||
b2Assert(false);
|
||||
return b2Vec2_zero;
|
||||
|
||||
case 1:
|
||||
return m_v1.w;
|
||||
|
||||
case 2:
|
||||
return m_v1.a * m_v1.w + m_v2.a * m_v2.w;
|
||||
|
||||
case 3:
|
||||
return b2Vec2_zero;
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
return b2Vec2_zero;
|
||||
}
|
||||
}
|
||||
|
||||
void GetWitnessPoints(b2Vec2* pA, b2Vec2* pB) const
|
||||
{
|
||||
switch (m_count)
|
||||
{
|
||||
case 0:
|
||||
b2Assert(false);
|
||||
break;
|
||||
|
||||
case 1:
|
||||
*pA = m_v1.wA;
|
||||
*pB = m_v1.wB;
|
||||
break;
|
||||
|
||||
case 2:
|
||||
*pA = m_v1.a * m_v1.wA + m_v2.a * m_v2.wA;
|
||||
*pB = m_v1.a * m_v1.wB + m_v2.a * m_v2.wB;
|
||||
break;
|
||||
|
||||
case 3:
|
||||
*pA = m_v1.a * m_v1.wA + m_v2.a * m_v2.wA + m_v3.a * m_v3.wA;
|
||||
*pB = *pA;
|
||||
break;
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
float32 GetMetric() const
|
||||
{
|
||||
switch (m_count)
|
||||
{
|
||||
case 0:
|
||||
b2Assert(false);
|
||||
return 0.0f;
|
||||
|
||||
case 1:
|
||||
return 0.0f;
|
||||
|
||||
case 2:
|
||||
return b2Distance(m_v1.w, m_v2.w);
|
||||
|
||||
case 3:
|
||||
return b2Cross(m_v2.w - m_v1.w, m_v3.w - m_v1.w);
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
return 0.0f;
|
||||
}
|
||||
}
|
||||
|
||||
void Solve2();
|
||||
void Solve3();
|
||||
|
||||
b2SimplexVertex m_v1, m_v2, m_v3;
|
||||
int32 m_count;
|
||||
};
|
||||
|
||||
|
||||
// Solve a line segment using barycentric coordinates.
|
||||
//
|
||||
// p = a1 * w1 + a2 * w2
|
||||
// a1 + a2 = 1
|
||||
//
|
||||
// The vector from the origin to the closest point on the line is
|
||||
// perpendicular to the line.
|
||||
// e12 = w2 - w1
|
||||
// dot(p, e) = 0
|
||||
// a1 * dot(w1, e) + a2 * dot(w2, e) = 0
|
||||
//
|
||||
// 2-by-2 linear system
|
||||
// [1 1 ][a1] = [1]
|
||||
// [w1.e12 w2.e12][a2] = [0]
|
||||
//
|
||||
// Define
|
||||
// d12_1 = dot(w2, e12)
|
||||
// d12_2 = -dot(w1, e12)
|
||||
// d12 = d12_1 + d12_2
|
||||
//
|
||||
// Solution
|
||||
// a1 = d12_1 / d12
|
||||
// a2 = d12_2 / d12
|
||||
void b2Simplex::Solve2()
|
||||
{
|
||||
b2Vec2 w1 = m_v1.w;
|
||||
b2Vec2 w2 = m_v2.w;
|
||||
b2Vec2 e12 = w2 - w1;
|
||||
|
||||
// w1 region
|
||||
float32 d12_2 = -b2Dot(w1, e12);
|
||||
if (d12_2 <= 0.0f)
|
||||
{
|
||||
// a2 <= 0, so we clamp it to 0
|
||||
m_v1.a = 1.0f;
|
||||
m_count = 1;
|
||||
return;
|
||||
}
|
||||
|
||||
// w2 region
|
||||
float32 d12_1 = b2Dot(w2, e12);
|
||||
if (d12_1 <= 0.0f)
|
||||
{
|
||||
// a1 <= 0, so we clamp it to 0
|
||||
m_v2.a = 1.0f;
|
||||
m_count = 1;
|
||||
m_v1 = m_v2;
|
||||
return;
|
||||
}
|
||||
|
||||
// Must be in e12 region.
|
||||
float32 inv_d12 = 1.0f / (d12_1 + d12_2);
|
||||
m_v1.a = d12_1 * inv_d12;
|
||||
m_v2.a = d12_2 * inv_d12;
|
||||
m_count = 2;
|
||||
}
|
||||
|
||||
// Possible regions:
|
||||
// - points[2]
|
||||
// - edge points[0]-points[2]
|
||||
// - edge points[1]-points[2]
|
||||
// - inside the triangle
|
||||
void b2Simplex::Solve3()
|
||||
{
|
||||
b2Vec2 w1 = m_v1.w;
|
||||
b2Vec2 w2 = m_v2.w;
|
||||
b2Vec2 w3 = m_v3.w;
|
||||
|
||||
// Edge12
|
||||
// [1 1 ][a1] = [1]
|
||||
// [w1.e12 w2.e12][a2] = [0]
|
||||
// a3 = 0
|
||||
b2Vec2 e12 = w2 - w1;
|
||||
float32 w1e12 = b2Dot(w1, e12);
|
||||
float32 w2e12 = b2Dot(w2, e12);
|
||||
float32 d12_1 = w2e12;
|
||||
float32 d12_2 = -w1e12;
|
||||
|
||||
// Edge13
|
||||
// [1 1 ][a1] = [1]
|
||||
// [w1.e13 w3.e13][a3] = [0]
|
||||
// a2 = 0
|
||||
b2Vec2 e13 = w3 - w1;
|
||||
float32 w1e13 = b2Dot(w1, e13);
|
||||
float32 w3e13 = b2Dot(w3, e13);
|
||||
float32 d13_1 = w3e13;
|
||||
float32 d13_2 = -w1e13;
|
||||
|
||||
// Edge23
|
||||
// [1 1 ][a2] = [1]
|
||||
// [w2.e23 w3.e23][a3] = [0]
|
||||
// a1 = 0
|
||||
b2Vec2 e23 = w3 - w2;
|
||||
float32 w2e23 = b2Dot(w2, e23);
|
||||
float32 w3e23 = b2Dot(w3, e23);
|
||||
float32 d23_1 = w3e23;
|
||||
float32 d23_2 = -w2e23;
|
||||
|
||||
// Triangle123
|
||||
float32 n123 = b2Cross(e12, e13);
|
||||
|
||||
float32 d123_1 = n123 * b2Cross(w2, w3);
|
||||
float32 d123_2 = n123 * b2Cross(w3, w1);
|
||||
float32 d123_3 = n123 * b2Cross(w1, w2);
|
||||
|
||||
// w1 region
|
||||
if (d12_2 <= 0.0f && d13_2 <= 0.0f)
|
||||
{
|
||||
m_v1.a = 1.0f;
|
||||
m_count = 1;
|
||||
return;
|
||||
}
|
||||
|
||||
// e12
|
||||
if (d12_1 > 0.0f && d12_2 > 0.0f && d123_3 <= 0.0f)
|
||||
{
|
||||
float32 inv_d12 = 1.0f / (d12_1 + d12_2);
|
||||
m_v1.a = d12_1 * inv_d12;
|
||||
m_v2.a = d12_2 * inv_d12;
|
||||
m_count = 2;
|
||||
return;
|
||||
}
|
||||
|
||||
// e13
|
||||
if (d13_1 > 0.0f && d13_2 > 0.0f && d123_2 <= 0.0f)
|
||||
{
|
||||
float32 inv_d13 = 1.0f / (d13_1 + d13_2);
|
||||
m_v1.a = d13_1 * inv_d13;
|
||||
m_v3.a = d13_2 * inv_d13;
|
||||
m_count = 2;
|
||||
m_v2 = m_v3;
|
||||
return;
|
||||
}
|
||||
|
||||
// w2 region
|
||||
if (d12_1 <= 0.0f && d23_2 <= 0.0f)
|
||||
{
|
||||
m_v2.a = 1.0f;
|
||||
m_count = 1;
|
||||
m_v1 = m_v2;
|
||||
return;
|
||||
}
|
||||
|
||||
// w3 region
|
||||
if (d13_1 <= 0.0f && d23_1 <= 0.0f)
|
||||
{
|
||||
m_v3.a = 1.0f;
|
||||
m_count = 1;
|
||||
m_v1 = m_v3;
|
||||
return;
|
||||
}
|
||||
|
||||
// e23
|
||||
if (d23_1 > 0.0f && d23_2 > 0.0f && d123_1 <= 0.0f)
|
||||
{
|
||||
float32 inv_d23 = 1.0f / (d23_1 + d23_2);
|
||||
m_v2.a = d23_1 * inv_d23;
|
||||
m_v3.a = d23_2 * inv_d23;
|
||||
m_count = 2;
|
||||
m_v1 = m_v3;
|
||||
return;
|
||||
}
|
||||
|
||||
// Must be in triangle123
|
||||
float32 inv_d123 = 1.0f / (d123_1 + d123_2 + d123_3);
|
||||
m_v1.a = d123_1 * inv_d123;
|
||||
m_v2.a = d123_2 * inv_d123;
|
||||
m_v3.a = d123_3 * inv_d123;
|
||||
m_count = 3;
|
||||
}
|
||||
|
||||
void b2Distance(b2DistanceOutput* output,
|
||||
b2SimplexCache* cache,
|
||||
const b2DistanceInput* input)
|
||||
{
|
||||
++b2_gjkCalls;
|
||||
|
||||
const b2DistanceProxy* proxyA = &input->proxyA;
|
||||
const b2DistanceProxy* proxyB = &input->proxyB;
|
||||
|
||||
b2Transform transformA = input->transformA;
|
||||
b2Transform transformB = input->transformB;
|
||||
|
||||
// Initialize the simplex.
|
||||
b2Simplex simplex;
|
||||
simplex.ReadCache(cache, proxyA, transformA, proxyB, transformB);
|
||||
|
||||
// Get simplex vertices as an array.
|
||||
b2SimplexVertex* vertices = &simplex.m_v1;
|
||||
const int32 k_maxIters = 20;
|
||||
|
||||
// These store the vertices of the last simplex so that we
|
||||
// can check for duplicates and prevent cycling.
|
||||
int32 saveA[3], saveB[3];
|
||||
int32 saveCount = 0;
|
||||
|
||||
// Main iteration loop.
|
||||
int32 iter = 0;
|
||||
while (iter < k_maxIters)
|
||||
{
|
||||
// Copy simplex so we can identify duplicates.
|
||||
saveCount = simplex.m_count;
|
||||
for (int32 i = 0; i < saveCount; ++i)
|
||||
{
|
||||
saveA[i] = vertices[i].indexA;
|
||||
saveB[i] = vertices[i].indexB;
|
||||
}
|
||||
|
||||
switch (simplex.m_count)
|
||||
{
|
||||
case 1:
|
||||
break;
|
||||
|
||||
case 2:
|
||||
simplex.Solve2();
|
||||
break;
|
||||
|
||||
case 3:
|
||||
simplex.Solve3();
|
||||
break;
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
}
|
||||
|
||||
// If we have 3 points, then the origin is in the corresponding triangle.
|
||||
if (simplex.m_count == 3)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
// Get search direction.
|
||||
b2Vec2 d = simplex.GetSearchDirection();
|
||||
|
||||
// Ensure the search direction is numerically fit.
|
||||
if (d.LengthSquared() < b2_epsilon * b2_epsilon)
|
||||
{
|
||||
// The origin is probably contained by a line segment
|
||||
// or triangle. Thus the shapes are overlapped.
|
||||
|
||||
// We can't return zero here even though there may be overlap.
|
||||
// In case the simplex is a point, segment, or triangle it is difficult
|
||||
// to determine if the origin is contained in the CSO or very close to it.
|
||||
break;
|
||||
}
|
||||
|
||||
// Compute a tentative new simplex vertex using support points.
|
||||
b2SimplexVertex* vertex = vertices + simplex.m_count;
|
||||
vertex->indexA = proxyA->GetSupport(b2MulT(transformA.q, -d));
|
||||
vertex->wA = b2Mul(transformA, proxyA->GetVertex(vertex->indexA));
|
||||
b2Vec2 wBLocal;
|
||||
vertex->indexB = proxyB->GetSupport(b2MulT(transformB.q, d));
|
||||
vertex->wB = b2Mul(transformB, proxyB->GetVertex(vertex->indexB));
|
||||
vertex->w = vertex->wB - vertex->wA;
|
||||
|
||||
// Iteration count is equated to the number of support point calls.
|
||||
++iter;
|
||||
++b2_gjkIters;
|
||||
|
||||
// Check for duplicate support points. This is the main termination criteria.
|
||||
bool duplicate = false;
|
||||
for (int32 i = 0; i < saveCount; ++i)
|
||||
{
|
||||
if (vertex->indexA == saveA[i] && vertex->indexB == saveB[i])
|
||||
{
|
||||
duplicate = true;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
// If we found a duplicate support point we must exit to avoid cycling.
|
||||
if (duplicate)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
// New vertex is ok and needed.
|
||||
++simplex.m_count;
|
||||
}
|
||||
|
||||
b2_gjkMaxIters = b2Max(b2_gjkMaxIters, iter);
|
||||
|
||||
// Prepare output.
|
||||
simplex.GetWitnessPoints(&output->pointA, &output->pointB);
|
||||
output->distance = b2Distance(output->pointA, output->pointB);
|
||||
output->iterations = iter;
|
||||
|
||||
// Cache the simplex.
|
||||
simplex.WriteCache(cache);
|
||||
|
||||
// Apply radii if requested.
|
||||
if (input->useRadii)
|
||||
{
|
||||
float32 rA = proxyA->m_radius;
|
||||
float32 rB = proxyB->m_radius;
|
||||
|
||||
if (output->distance > rA + rB && output->distance > b2_epsilon)
|
||||
{
|
||||
// Shapes are still no overlapped.
|
||||
// Move the witness points to the outer surface.
|
||||
output->distance -= rA + rB;
|
||||
b2Vec2 normal = output->pointB - output->pointA;
|
||||
normal.Normalize();
|
||||
output->pointA += rA * normal;
|
||||
output->pointB -= rB * normal;
|
||||
}
|
||||
else
|
||||
{
|
||||
// Shapes are overlapped when radii are considered.
|
||||
// Move the witness points to the middle.
|
||||
b2Vec2 p = 0.5f * (output->pointA + output->pointB);
|
||||
output->pointA = p;
|
||||
output->pointB = p;
|
||||
output->distance = 0.0f;
|
||||
}
|
||||
}
|
||||
}
|
||||
@@ -1,141 +0,0 @@
|
||||
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_DISTANCE_H
|
||||
#define B2_DISTANCE_H
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
|
||||
class b2Shape;
|
||||
|
||||
/// A distance proxy is used by the GJK algorithm.
|
||||
/// It encapsulates any shape.
|
||||
struct b2DistanceProxy
|
||||
{
|
||||
b2DistanceProxy() : m_vertices(nullptr), m_count(0), m_radius(0.0f) {}
|
||||
|
||||
/// Initialize the proxy using the given shape. The shape
|
||||
/// must remain in scope while the proxy is in use.
|
||||
void Set(const b2Shape* shape, int32 index);
|
||||
|
||||
/// Get the supporting vertex index in the given direction.
|
||||
int32 GetSupport(const b2Vec2& d) const;
|
||||
|
||||
/// Get the supporting vertex in the given direction.
|
||||
const b2Vec2& GetSupportVertex(const b2Vec2& d) const;
|
||||
|
||||
/// Get the vertex count.
|
||||
int32 GetVertexCount() const;
|
||||
|
||||
/// Get a vertex by index. Used by b2Distance.
|
||||
const b2Vec2& GetVertex(int32 index) const;
|
||||
|
||||
b2Vec2 m_buffer[2];
|
||||
const b2Vec2* m_vertices;
|
||||
int32 m_count;
|
||||
float32 m_radius;
|
||||
};
|
||||
|
||||
/// Used to warm start b2Distance.
|
||||
/// Set count to zero on first call.
|
||||
struct b2SimplexCache
|
||||
{
|
||||
float32 metric; ///< length or area
|
||||
uint16 count;
|
||||
uint8 indexA[3]; ///< vertices on shape A
|
||||
uint8 indexB[3]; ///< vertices on shape B
|
||||
};
|
||||
|
||||
/// Input for b2Distance.
|
||||
/// You have to option to use the shape radii
|
||||
/// in the computation. Even
|
||||
struct b2DistanceInput
|
||||
{
|
||||
b2DistanceProxy proxyA;
|
||||
b2DistanceProxy proxyB;
|
||||
b2Transform transformA;
|
||||
b2Transform transformB;
|
||||
bool useRadii;
|
||||
};
|
||||
|
||||
/// Output for b2Distance.
|
||||
struct b2DistanceOutput
|
||||
{
|
||||
b2Vec2 pointA; ///< closest point on shapeA
|
||||
b2Vec2 pointB; ///< closest point on shapeB
|
||||
float32 distance;
|
||||
int32 iterations; ///< number of GJK iterations used
|
||||
};
|
||||
|
||||
/// Compute the closest points between two shapes. Supports any combination of:
|
||||
/// b2CircleShape, b2PolygonShape, b2EdgeShape. The simplex cache is input/output.
|
||||
/// On the first call set b2SimplexCache.count to zero.
|
||||
void b2Distance(b2DistanceOutput* output,
|
||||
b2SimplexCache* cache,
|
||||
const b2DistanceInput* input);
|
||||
|
||||
|
||||
//////////////////////////////////////////////////////////////////////////
|
||||
|
||||
inline int32 b2DistanceProxy::GetVertexCount() const
|
||||
{
|
||||
return m_count;
|
||||
}
|
||||
|
||||
inline const b2Vec2& b2DistanceProxy::GetVertex(int32 index) const
|
||||
{
|
||||
b2Assert(0 <= index && index < m_count);
|
||||
return m_vertices[index];
|
||||
}
|
||||
|
||||
inline int32 b2DistanceProxy::GetSupport(const b2Vec2& d) const
|
||||
{
|
||||
int32 bestIndex = 0;
|
||||
float32 bestValue = b2Dot(m_vertices[0], d);
|
||||
for (int32 i = 1; i < m_count; ++i)
|
||||
{
|
||||
float32 value = b2Dot(m_vertices[i], d);
|
||||
if (value > bestValue)
|
||||
{
|
||||
bestIndex = i;
|
||||
bestValue = value;
|
||||
}
|
||||
}
|
||||
|
||||
return bestIndex;
|
||||
}
|
||||
|
||||
inline const b2Vec2& b2DistanceProxy::GetSupportVertex(const b2Vec2& d) const
|
||||
{
|
||||
int32 bestIndex = 0;
|
||||
float32 bestValue = b2Dot(m_vertices[0], d);
|
||||
for (int32 i = 1; i < m_count; ++i)
|
||||
{
|
||||
float32 value = b2Dot(m_vertices[i], d);
|
||||
if (value > bestValue)
|
||||
{
|
||||
bestIndex = i;
|
||||
bestValue = value;
|
||||
}
|
||||
}
|
||||
|
||||
return m_vertices[bestIndex];
|
||||
}
|
||||
|
||||
#endif
|
||||
-780
@@ -1,780 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2DynamicTree.h"
|
||||
#include <string.h>
|
||||
|
||||
b2DynamicTree::b2DynamicTree()
|
||||
{
|
||||
m_root = b2_nullNode;
|
||||
|
||||
m_nodeCapacity = 16;
|
||||
m_nodeCount = 0;
|
||||
m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
|
||||
memset(m_nodes, 0, m_nodeCapacity * sizeof(b2TreeNode));
|
||||
|
||||
// Build a linked list for the free list.
|
||||
for (int32 i = 0; i < m_nodeCapacity - 1; ++i)
|
||||
{
|
||||
m_nodes[i].next = i + 1;
|
||||
m_nodes[i].height = -1;
|
||||
}
|
||||
m_nodes[m_nodeCapacity-1].next = b2_nullNode;
|
||||
m_nodes[m_nodeCapacity-1].height = -1;
|
||||
m_freeList = 0;
|
||||
|
||||
m_path = 0;
|
||||
|
||||
m_insertionCount = 0;
|
||||
}
|
||||
|
||||
b2DynamicTree::~b2DynamicTree()
|
||||
{
|
||||
// This frees the entire tree in one shot.
|
||||
b2Free(m_nodes);
|
||||
}
|
||||
|
||||
// Allocate a node from the pool. Grow the pool if necessary.
|
||||
int32 b2DynamicTree::AllocateNode()
|
||||
{
|
||||
// Expand the node pool as needed.
|
||||
if (m_freeList == b2_nullNode)
|
||||
{
|
||||
b2Assert(m_nodeCount == m_nodeCapacity);
|
||||
|
||||
// The free list is empty. Rebuild a bigger pool.
|
||||
b2TreeNode* oldNodes = m_nodes;
|
||||
m_nodeCapacity *= 2;
|
||||
m_nodes = (b2TreeNode*)b2Alloc(m_nodeCapacity * sizeof(b2TreeNode));
|
||||
memcpy(m_nodes, oldNodes, m_nodeCount * sizeof(b2TreeNode));
|
||||
b2Free(oldNodes);
|
||||
|
||||
// Build a linked list for the free list. The parent
|
||||
// pointer becomes the "next" pointer.
|
||||
for (int32 i = m_nodeCount; i < m_nodeCapacity - 1; ++i)
|
||||
{
|
||||
m_nodes[i].next = i + 1;
|
||||
m_nodes[i].height = -1;
|
||||
}
|
||||
m_nodes[m_nodeCapacity-1].next = b2_nullNode;
|
||||
m_nodes[m_nodeCapacity-1].height = -1;
|
||||
m_freeList = m_nodeCount;
|
||||
}
|
||||
|
||||
// Peel a node off the free list.
|
||||
int32 nodeId = m_freeList;
|
||||
m_freeList = m_nodes[nodeId].next;
|
||||
m_nodes[nodeId].parent = b2_nullNode;
|
||||
m_nodes[nodeId].child1 = b2_nullNode;
|
||||
m_nodes[nodeId].child2 = b2_nullNode;
|
||||
m_nodes[nodeId].height = 0;
|
||||
m_nodes[nodeId].userData = nullptr;
|
||||
++m_nodeCount;
|
||||
return nodeId;
|
||||
}
|
||||
|
||||
// Return a node to the pool.
|
||||
void b2DynamicTree::FreeNode(int32 nodeId)
|
||||
{
|
||||
b2Assert(0 <= nodeId && nodeId < m_nodeCapacity);
|
||||
b2Assert(0 < m_nodeCount);
|
||||
m_nodes[nodeId].next = m_freeList;
|
||||
m_nodes[nodeId].height = -1;
|
||||
m_freeList = nodeId;
|
||||
--m_nodeCount;
|
||||
}
|
||||
|
||||
// Create a proxy in the tree as a leaf node. We return the index
|
||||
// of the node instead of a pointer so that we can grow
|
||||
// the node pool.
|
||||
int32 b2DynamicTree::CreateProxy(const b2AABB& aabb, void* userData)
|
||||
{
|
||||
int32 proxyId = AllocateNode();
|
||||
|
||||
// Fatten the aabb.
|
||||
b2Vec2 r(b2_aabbExtension, b2_aabbExtension);
|
||||
m_nodes[proxyId].aabb.lowerBound = aabb.lowerBound - r;
|
||||
m_nodes[proxyId].aabb.upperBound = aabb.upperBound + r;
|
||||
m_nodes[proxyId].userData = userData;
|
||||
m_nodes[proxyId].height = 0;
|
||||
|
||||
InsertLeaf(proxyId);
|
||||
|
||||
return proxyId;
|
||||
}
|
||||
|
||||
void b2DynamicTree::DestroyProxy(int32 proxyId)
|
||||
{
|
||||
b2Assert(0 <= proxyId && proxyId < m_nodeCapacity);
|
||||
b2Assert(m_nodes[proxyId].IsLeaf());
|
||||
|
||||
RemoveLeaf(proxyId);
|
||||
FreeNode(proxyId);
|
||||
}
|
||||
|
||||
bool b2DynamicTree::MoveProxy(int32 proxyId, const b2AABB& aabb, const b2Vec2& displacement)
|
||||
{
|
||||
b2Assert(0 <= proxyId && proxyId < m_nodeCapacity);
|
||||
|
||||
b2Assert(m_nodes[proxyId].IsLeaf());
|
||||
|
||||
if (m_nodes[proxyId].aabb.Contains(aabb))
|
||||
{
|
||||
return false;
|
||||
}
|
||||
|
||||
RemoveLeaf(proxyId);
|
||||
|
||||
// Extend AABB.
|
||||
b2AABB b = aabb;
|
||||
b2Vec2 r(b2_aabbExtension, b2_aabbExtension);
|
||||
b.lowerBound = b.lowerBound - r;
|
||||
b.upperBound = b.upperBound + r;
|
||||
|
||||
// Predict AABB displacement.
|
||||
b2Vec2 d = b2_aabbMultiplier * displacement;
|
||||
|
||||
if (d.x < 0.0f)
|
||||
{
|
||||
b.lowerBound.x += d.x;
|
||||
}
|
||||
else
|
||||
{
|
||||
b.upperBound.x += d.x;
|
||||
}
|
||||
|
||||
if (d.y < 0.0f)
|
||||
{
|
||||
b.lowerBound.y += d.y;
|
||||
}
|
||||
else
|
||||
{
|
||||
b.upperBound.y += d.y;
|
||||
}
|
||||
|
||||
m_nodes[proxyId].aabb = b;
|
||||
|
||||
InsertLeaf(proxyId);
|
||||
return true;
|
||||
}
|
||||
|
||||
void b2DynamicTree::InsertLeaf(int32 leaf)
|
||||
{
|
||||
++m_insertionCount;
|
||||
|
||||
if (m_root == b2_nullNode)
|
||||
{
|
||||
m_root = leaf;
|
||||
m_nodes[m_root].parent = b2_nullNode;
|
||||
return;
|
||||
}
|
||||
|
||||
// Find the best sibling for this node
|
||||
b2AABB leafAABB = m_nodes[leaf].aabb;
|
||||
int32 index = m_root;
|
||||
while (m_nodes[index].IsLeaf() == false)
|
||||
{
|
||||
int32 child1 = m_nodes[index].child1;
|
||||
int32 child2 = m_nodes[index].child2;
|
||||
|
||||
float32 area = m_nodes[index].aabb.GetPerimeter();
|
||||
|
||||
b2AABB combinedAABB;
|
||||
combinedAABB.Combine(m_nodes[index].aabb, leafAABB);
|
||||
float32 combinedArea = combinedAABB.GetPerimeter();
|
||||
|
||||
// Cost of creating a new parent for this node and the new leaf
|
||||
float32 cost = 2.0f * combinedArea;
|
||||
|
||||
// Minimum cost of pushing the leaf further down the tree
|
||||
float32 inheritanceCost = 2.0f * (combinedArea - area);
|
||||
|
||||
// Cost of descending into child1
|
||||
float32 cost1;
|
||||
if (m_nodes[child1].IsLeaf())
|
||||
{
|
||||
b2AABB aabb;
|
||||
aabb.Combine(leafAABB, m_nodes[child1].aabb);
|
||||
cost1 = aabb.GetPerimeter() + inheritanceCost;
|
||||
}
|
||||
else
|
||||
{
|
||||
b2AABB aabb;
|
||||
aabb.Combine(leafAABB, m_nodes[child1].aabb);
|
||||
float32 oldArea = m_nodes[child1].aabb.GetPerimeter();
|
||||
float32 newArea = aabb.GetPerimeter();
|
||||
cost1 = (newArea - oldArea) + inheritanceCost;
|
||||
}
|
||||
|
||||
// Cost of descending into child2
|
||||
float32 cost2;
|
||||
if (m_nodes[child2].IsLeaf())
|
||||
{
|
||||
b2AABB aabb;
|
||||
aabb.Combine(leafAABB, m_nodes[child2].aabb);
|
||||
cost2 = aabb.GetPerimeter() + inheritanceCost;
|
||||
}
|
||||
else
|
||||
{
|
||||
b2AABB aabb;
|
||||
aabb.Combine(leafAABB, m_nodes[child2].aabb);
|
||||
float32 oldArea = m_nodes[child2].aabb.GetPerimeter();
|
||||
float32 newArea = aabb.GetPerimeter();
|
||||
cost2 = newArea - oldArea + inheritanceCost;
|
||||
}
|
||||
|
||||
// Descend according to the minimum cost.
|
||||
if (cost < cost1 && cost < cost2)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
// Descend
|
||||
if (cost1 < cost2)
|
||||
{
|
||||
index = child1;
|
||||
}
|
||||
else
|
||||
{
|
||||
index = child2;
|
||||
}
|
||||
}
|
||||
|
||||
int32 sibling = index;
|
||||
|
||||
// Create a new parent.
|
||||
int32 oldParent = m_nodes[sibling].parent;
|
||||
int32 newParent = AllocateNode();
|
||||
m_nodes[newParent].parent = oldParent;
|
||||
m_nodes[newParent].userData = nullptr;
|
||||
m_nodes[newParent].aabb.Combine(leafAABB, m_nodes[sibling].aabb);
|
||||
m_nodes[newParent].height = m_nodes[sibling].height + 1;
|
||||
|
||||
if (oldParent != b2_nullNode)
|
||||
{
|
||||
// The sibling was not the root.
|
||||
if (m_nodes[oldParent].child1 == sibling)
|
||||
{
|
||||
m_nodes[oldParent].child1 = newParent;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_nodes[oldParent].child2 = newParent;
|
||||
}
|
||||
|
||||
m_nodes[newParent].child1 = sibling;
|
||||
m_nodes[newParent].child2 = leaf;
|
||||
m_nodes[sibling].parent = newParent;
|
||||
m_nodes[leaf].parent = newParent;
|
||||
}
|
||||
else
|
||||
{
|
||||
// The sibling was the root.
|
||||
m_nodes[newParent].child1 = sibling;
|
||||
m_nodes[newParent].child2 = leaf;
|
||||
m_nodes[sibling].parent = newParent;
|
||||
m_nodes[leaf].parent = newParent;
|
||||
m_root = newParent;
|
||||
}
|
||||
|
||||
// Walk back up the tree fixing heights and AABBs
|
||||
index = m_nodes[leaf].parent;
|
||||
while (index != b2_nullNode)
|
||||
{
|
||||
index = Balance(index);
|
||||
|
||||
int32 child1 = m_nodes[index].child1;
|
||||
int32 child2 = m_nodes[index].child2;
|
||||
|
||||
b2Assert(child1 != b2_nullNode);
|
||||
b2Assert(child2 != b2_nullNode);
|
||||
|
||||
m_nodes[index].height = 1 + b2Max(m_nodes[child1].height, m_nodes[child2].height);
|
||||
m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb);
|
||||
|
||||
index = m_nodes[index].parent;
|
||||
}
|
||||
|
||||
//Validate();
|
||||
}
|
||||
|
||||
void b2DynamicTree::RemoveLeaf(int32 leaf)
|
||||
{
|
||||
if (leaf == m_root)
|
||||
{
|
||||
m_root = b2_nullNode;
|
||||
return;
|
||||
}
|
||||
|
||||
int32 parent = m_nodes[leaf].parent;
|
||||
int32 grandParent = m_nodes[parent].parent;
|
||||
int32 sibling;
|
||||
if (m_nodes[parent].child1 == leaf)
|
||||
{
|
||||
sibling = m_nodes[parent].child2;
|
||||
}
|
||||
else
|
||||
{
|
||||
sibling = m_nodes[parent].child1;
|
||||
}
|
||||
|
||||
if (grandParent != b2_nullNode)
|
||||
{
|
||||
// Destroy parent and connect sibling to grandParent.
|
||||
if (m_nodes[grandParent].child1 == parent)
|
||||
{
|
||||
m_nodes[grandParent].child1 = sibling;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_nodes[grandParent].child2 = sibling;
|
||||
}
|
||||
m_nodes[sibling].parent = grandParent;
|
||||
FreeNode(parent);
|
||||
|
||||
// Adjust ancestor bounds.
|
||||
int32 index = grandParent;
|
||||
while (index != b2_nullNode)
|
||||
{
|
||||
index = Balance(index);
|
||||
|
||||
int32 child1 = m_nodes[index].child1;
|
||||
int32 child2 = m_nodes[index].child2;
|
||||
|
||||
m_nodes[index].aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb);
|
||||
m_nodes[index].height = 1 + b2Max(m_nodes[child1].height, m_nodes[child2].height);
|
||||
|
||||
index = m_nodes[index].parent;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_root = sibling;
|
||||
m_nodes[sibling].parent = b2_nullNode;
|
||||
FreeNode(parent);
|
||||
}
|
||||
|
||||
//Validate();
|
||||
}
|
||||
|
||||
// Perform a left or right rotation if node A is imbalanced.
|
||||
// Returns the new root index.
|
||||
int32 b2DynamicTree::Balance(int32 iA)
|
||||
{
|
||||
b2Assert(iA != b2_nullNode);
|
||||
|
||||
b2TreeNode* A = m_nodes + iA;
|
||||
if (A->IsLeaf() || A->height < 2)
|
||||
{
|
||||
return iA;
|
||||
}
|
||||
|
||||
int32 iB = A->child1;
|
||||
int32 iC = A->child2;
|
||||
b2Assert(0 <= iB && iB < m_nodeCapacity);
|
||||
b2Assert(0 <= iC && iC < m_nodeCapacity);
|
||||
|
||||
b2TreeNode* B = m_nodes + iB;
|
||||
b2TreeNode* C = m_nodes + iC;
|
||||
|
||||
int32 balance = C->height - B->height;
|
||||
|
||||
// Rotate C up
|
||||
if (balance > 1)
|
||||
{
|
||||
int32 iF = C->child1;
|
||||
int32 iG = C->child2;
|
||||
b2TreeNode* F = m_nodes + iF;
|
||||
b2TreeNode* G = m_nodes + iG;
|
||||
b2Assert(0 <= iF && iF < m_nodeCapacity);
|
||||
b2Assert(0 <= iG && iG < m_nodeCapacity);
|
||||
|
||||
// Swap A and C
|
||||
C->child1 = iA;
|
||||
C->parent = A->parent;
|
||||
A->parent = iC;
|
||||
|
||||
// A's old parent should point to C
|
||||
if (C->parent != b2_nullNode)
|
||||
{
|
||||
if (m_nodes[C->parent].child1 == iA)
|
||||
{
|
||||
m_nodes[C->parent].child1 = iC;
|
||||
}
|
||||
else
|
||||
{
|
||||
b2Assert(m_nodes[C->parent].child2 == iA);
|
||||
m_nodes[C->parent].child2 = iC;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_root = iC;
|
||||
}
|
||||
|
||||
// Rotate
|
||||
if (F->height > G->height)
|
||||
{
|
||||
C->child2 = iF;
|
||||
A->child2 = iG;
|
||||
G->parent = iA;
|
||||
A->aabb.Combine(B->aabb, G->aabb);
|
||||
C->aabb.Combine(A->aabb, F->aabb);
|
||||
|
||||
A->height = 1 + b2Max(B->height, G->height);
|
||||
C->height = 1 + b2Max(A->height, F->height);
|
||||
}
|
||||
else
|
||||
{
|
||||
C->child2 = iG;
|
||||
A->child2 = iF;
|
||||
F->parent = iA;
|
||||
A->aabb.Combine(B->aabb, F->aabb);
|
||||
C->aabb.Combine(A->aabb, G->aabb);
|
||||
|
||||
A->height = 1 + b2Max(B->height, F->height);
|
||||
C->height = 1 + b2Max(A->height, G->height);
|
||||
}
|
||||
|
||||
return iC;
|
||||
}
|
||||
|
||||
// Rotate B up
|
||||
if (balance < -1)
|
||||
{
|
||||
int32 iD = B->child1;
|
||||
int32 iE = B->child2;
|
||||
b2TreeNode* D = m_nodes + iD;
|
||||
b2TreeNode* E = m_nodes + iE;
|
||||
b2Assert(0 <= iD && iD < m_nodeCapacity);
|
||||
b2Assert(0 <= iE && iE < m_nodeCapacity);
|
||||
|
||||
// Swap A and B
|
||||
B->child1 = iA;
|
||||
B->parent = A->parent;
|
||||
A->parent = iB;
|
||||
|
||||
// A's old parent should point to B
|
||||
if (B->parent != b2_nullNode)
|
||||
{
|
||||
if (m_nodes[B->parent].child1 == iA)
|
||||
{
|
||||
m_nodes[B->parent].child1 = iB;
|
||||
}
|
||||
else
|
||||
{
|
||||
b2Assert(m_nodes[B->parent].child2 == iA);
|
||||
m_nodes[B->parent].child2 = iB;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
m_root = iB;
|
||||
}
|
||||
|
||||
// Rotate
|
||||
if (D->height > E->height)
|
||||
{
|
||||
B->child2 = iD;
|
||||
A->child1 = iE;
|
||||
E->parent = iA;
|
||||
A->aabb.Combine(C->aabb, E->aabb);
|
||||
B->aabb.Combine(A->aabb, D->aabb);
|
||||
|
||||
A->height = 1 + b2Max(C->height, E->height);
|
||||
B->height = 1 + b2Max(A->height, D->height);
|
||||
}
|
||||
else
|
||||
{
|
||||
B->child2 = iE;
|
||||
A->child1 = iD;
|
||||
D->parent = iA;
|
||||
A->aabb.Combine(C->aabb, D->aabb);
|
||||
B->aabb.Combine(A->aabb, E->aabb);
|
||||
|
||||
A->height = 1 + b2Max(C->height, D->height);
|
||||
B->height = 1 + b2Max(A->height, E->height);
|
||||
}
|
||||
|
||||
return iB;
|
||||
}
|
||||
|
||||
return iA;
|
||||
}
|
||||
|
||||
int32 b2DynamicTree::GetHeight() const
|
||||
{
|
||||
if (m_root == b2_nullNode)
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
return m_nodes[m_root].height;
|
||||
}
|
||||
|
||||
//
|
||||
float32 b2DynamicTree::GetAreaRatio() const
|
||||
{
|
||||
if (m_root == b2_nullNode)
|
||||
{
|
||||
return 0.0f;
|
||||
}
|
||||
|
||||
const b2TreeNode* root = m_nodes + m_root;
|
||||
float32 rootArea = root->aabb.GetPerimeter();
|
||||
|
||||
float32 totalArea = 0.0f;
|
||||
for (int32 i = 0; i < m_nodeCapacity; ++i)
|
||||
{
|
||||
const b2TreeNode* node = m_nodes + i;
|
||||
if (node->height < 0)
|
||||
{
|
||||
// Free node in pool
|
||||
continue;
|
||||
}
|
||||
|
||||
totalArea += node->aabb.GetPerimeter();
|
||||
}
|
||||
|
||||
return totalArea / rootArea;
|
||||
}
|
||||
|
||||
// Compute the height of a sub-tree.
|
||||
int32 b2DynamicTree::ComputeHeight(int32 nodeId) const
|
||||
{
|
||||
b2Assert(0 <= nodeId && nodeId < m_nodeCapacity);
|
||||
b2TreeNode* node = m_nodes + nodeId;
|
||||
|
||||
if (node->IsLeaf())
|
||||
{
|
||||
return 0;
|
||||
}
|
||||
|
||||
int32 height1 = ComputeHeight(node->child1);
|
||||
int32 height2 = ComputeHeight(node->child2);
|
||||
return 1 + b2Max(height1, height2);
|
||||
}
|
||||
|
||||
int32 b2DynamicTree::ComputeHeight() const
|
||||
{
|
||||
int32 height = ComputeHeight(m_root);
|
||||
return height;
|
||||
}
|
||||
|
||||
void b2DynamicTree::ValidateStructure(int32 index) const
|
||||
{
|
||||
if (index == b2_nullNode)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
if (index == m_root)
|
||||
{
|
||||
b2Assert(m_nodes[index].parent == b2_nullNode);
|
||||
}
|
||||
|
||||
const b2TreeNode* node = m_nodes + index;
|
||||
|
||||
int32 child1 = node->child1;
|
||||
int32 child2 = node->child2;
|
||||
|
||||
if (node->IsLeaf())
|
||||
{
|
||||
b2Assert(child1 == b2_nullNode);
|
||||
b2Assert(child2 == b2_nullNode);
|
||||
b2Assert(node->height == 0);
|
||||
return;
|
||||
}
|
||||
|
||||
b2Assert(0 <= child1 && child1 < m_nodeCapacity);
|
||||
b2Assert(0 <= child2 && child2 < m_nodeCapacity);
|
||||
|
||||
b2Assert(m_nodes[child1].parent == index);
|
||||
b2Assert(m_nodes[child2].parent == index);
|
||||
|
||||
ValidateStructure(child1);
|
||||
ValidateStructure(child2);
|
||||
}
|
||||
|
||||
void b2DynamicTree::ValidateMetrics(int32 index) const
|
||||
{
|
||||
if (index == b2_nullNode)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
const b2TreeNode* node = m_nodes + index;
|
||||
|
||||
int32 child1 = node->child1;
|
||||
int32 child2 = node->child2;
|
||||
|
||||
if (node->IsLeaf())
|
||||
{
|
||||
b2Assert(child1 == b2_nullNode);
|
||||
b2Assert(child2 == b2_nullNode);
|
||||
b2Assert(node->height == 0);
|
||||
return;
|
||||
}
|
||||
|
||||
b2Assert(0 <= child1 && child1 < m_nodeCapacity);
|
||||
b2Assert(0 <= child2 && child2 < m_nodeCapacity);
|
||||
|
||||
int32 height1 = m_nodes[child1].height;
|
||||
int32 height2 = m_nodes[child2].height;
|
||||
int32 height;
|
||||
height = 1 + b2Max(height1, height2);
|
||||
b2Assert(node->height == height);
|
||||
|
||||
b2AABB aabb;
|
||||
aabb.Combine(m_nodes[child1].aabb, m_nodes[child2].aabb);
|
||||
|
||||
b2Assert(aabb.lowerBound == node->aabb.lowerBound);
|
||||
b2Assert(aabb.upperBound == node->aabb.upperBound);
|
||||
|
||||
ValidateMetrics(child1);
|
||||
ValidateMetrics(child2);
|
||||
}
|
||||
|
||||
void b2DynamicTree::Validate() const
|
||||
{
|
||||
#if defined(b2DEBUG)
|
||||
ValidateStructure(m_root);
|
||||
ValidateMetrics(m_root);
|
||||
|
||||
int32 freeCount = 0;
|
||||
int32 freeIndex = m_freeList;
|
||||
while (freeIndex != b2_nullNode)
|
||||
{
|
||||
b2Assert(0 <= freeIndex && freeIndex < m_nodeCapacity);
|
||||
freeIndex = m_nodes[freeIndex].next;
|
||||
++freeCount;
|
||||
}
|
||||
|
||||
b2Assert(GetHeight() == ComputeHeight());
|
||||
|
||||
b2Assert(m_nodeCount + freeCount == m_nodeCapacity);
|
||||
#endif
|
||||
}
|
||||
|
||||
int32 b2DynamicTree::GetMaxBalance() const
|
||||
{
|
||||
int32 maxBalance = 0;
|
||||
for (int32 i = 0; i < m_nodeCapacity; ++i)
|
||||
{
|
||||
const b2TreeNode* node = m_nodes + i;
|
||||
if (node->height <= 1)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
b2Assert(node->IsLeaf() == false);
|
||||
|
||||
int32 child1 = node->child1;
|
||||
int32 child2 = node->child2;
|
||||
int32 balance = b2Abs(m_nodes[child2].height - m_nodes[child1].height);
|
||||
maxBalance = b2Max(maxBalance, balance);
|
||||
}
|
||||
|
||||
return maxBalance;
|
||||
}
|
||||
|
||||
void b2DynamicTree::RebuildBottomUp()
|
||||
{
|
||||
int32* nodes = (int32*)b2Alloc(m_nodeCount * sizeof(int32));
|
||||
int32 count = 0;
|
||||
|
||||
// Build array of leaves. Free the rest.
|
||||
for (int32 i = 0; i < m_nodeCapacity; ++i)
|
||||
{
|
||||
if (m_nodes[i].height < 0)
|
||||
{
|
||||
// free node in pool
|
||||
continue;
|
||||
}
|
||||
|
||||
if (m_nodes[i].IsLeaf())
|
||||
{
|
||||
m_nodes[i].parent = b2_nullNode;
|
||||
nodes[count] = i;
|
||||
++count;
|
||||
}
|
||||
else
|
||||
{
|
||||
FreeNode(i);
|
||||
}
|
||||
}
|
||||
|
||||
while (count > 1)
|
||||
{
|
||||
float32 minCost = b2_maxFloat;
|
||||
int32 iMin = -1, jMin = -1;
|
||||
for (int32 i = 0; i < count; ++i)
|
||||
{
|
||||
b2AABB aabbi = m_nodes[nodes[i]].aabb;
|
||||
|
||||
for (int32 j = i + 1; j < count; ++j)
|
||||
{
|
||||
b2AABB aabbj = m_nodes[nodes[j]].aabb;
|
||||
b2AABB b;
|
||||
b.Combine(aabbi, aabbj);
|
||||
float32 cost = b.GetPerimeter();
|
||||
if (cost < minCost)
|
||||
{
|
||||
iMin = i;
|
||||
jMin = j;
|
||||
minCost = cost;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
int32 index1 = nodes[iMin];
|
||||
int32 index2 = nodes[jMin];
|
||||
b2TreeNode* child1 = m_nodes + index1;
|
||||
b2TreeNode* child2 = m_nodes + index2;
|
||||
|
||||
int32 parentIndex = AllocateNode();
|
||||
b2TreeNode* parent = m_nodes + parentIndex;
|
||||
parent->child1 = index1;
|
||||
parent->child2 = index2;
|
||||
parent->height = 1 + b2Max(child1->height, child2->height);
|
||||
parent->aabb.Combine(child1->aabb, child2->aabb);
|
||||
parent->parent = b2_nullNode;
|
||||
|
||||
child1->parent = parentIndex;
|
||||
child2->parent = parentIndex;
|
||||
|
||||
nodes[jMin] = nodes[count-1];
|
||||
nodes[iMin] = parentIndex;
|
||||
--count;
|
||||
}
|
||||
|
||||
m_root = nodes[0];
|
||||
b2Free(nodes);
|
||||
|
||||
Validate();
|
||||
}
|
||||
|
||||
void b2DynamicTree::ShiftOrigin(const b2Vec2& newOrigin)
|
||||
{
|
||||
// Build array of leaves. Free the rest.
|
||||
for (int32 i = 0; i < m_nodeCapacity; ++i)
|
||||
{
|
||||
m_nodes[i].aabb.lowerBound -= newOrigin;
|
||||
m_nodes[i].aabb.upperBound -= newOrigin;
|
||||
}
|
||||
}
|
||||
-289
@@ -1,289 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_DYNAMIC_TREE_H
|
||||
#define B2_DYNAMIC_TREE_H
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Common/b2GrowableStack.h"
|
||||
|
||||
#define b2_nullNode (-1)
|
||||
|
||||
/// A node in the dynamic tree. The client does not interact with this directly.
|
||||
struct b2TreeNode
|
||||
{
|
||||
bool IsLeaf() const
|
||||
{
|
||||
return child1 == b2_nullNode;
|
||||
}
|
||||
|
||||
/// Enlarged AABB
|
||||
b2AABB aabb;
|
||||
|
||||
void* userData;
|
||||
|
||||
union
|
||||
{
|
||||
int32 parent;
|
||||
int32 next;
|
||||
};
|
||||
|
||||
int32 child1;
|
||||
int32 child2;
|
||||
|
||||
// leaf = 0, free node = -1
|
||||
int32 height;
|
||||
};
|
||||
|
||||
/// A dynamic AABB tree broad-phase, inspired by Nathanael Presson's btDbvt.
|
||||
/// A dynamic tree arranges data in a binary tree to accelerate
|
||||
/// queries such as volume queries and ray casts. Leafs are proxies
|
||||
/// with an AABB. In the tree we expand the proxy AABB by b2_fatAABBFactor
|
||||
/// so that the proxy AABB is bigger than the client object. This allows the client
|
||||
/// object to move by small amounts without triggering a tree update.
|
||||
///
|
||||
/// Nodes are pooled and relocatable, so we use node indices rather than pointers.
|
||||
class b2DynamicTree
|
||||
{
|
||||
public:
|
||||
/// Constructing the tree initializes the node pool.
|
||||
b2DynamicTree();
|
||||
|
||||
/// Destroy the tree, freeing the node pool.
|
||||
~b2DynamicTree();
|
||||
|
||||
/// Create a proxy. Provide a tight fitting AABB and a userData pointer.
|
||||
int32 CreateProxy(const b2AABB& aabb, void* userData);
|
||||
|
||||
/// Destroy a proxy. This asserts if the id is invalid.
|
||||
void DestroyProxy(int32 proxyId);
|
||||
|
||||
/// Move a proxy with a swepted AABB. If the proxy has moved outside of its fattened AABB,
|
||||
/// then the proxy is removed from the tree and re-inserted. Otherwise
|
||||
/// the function returns immediately.
|
||||
/// @return true if the proxy was re-inserted.
|
||||
bool MoveProxy(int32 proxyId, const b2AABB& aabb1, const b2Vec2& displacement);
|
||||
|
||||
/// Get proxy user data.
|
||||
/// @return the proxy user data or 0 if the id is invalid.
|
||||
void* GetUserData(int32 proxyId) const;
|
||||
|
||||
/// Get the fat AABB for a proxy.
|
||||
const b2AABB& GetFatAABB(int32 proxyId) const;
|
||||
|
||||
/// Query an AABB for overlapping proxies. The callback class
|
||||
/// is called for each proxy that overlaps the supplied AABB.
|
||||
template <typename T>
|
||||
void Query(T* callback, const b2AABB& aabb) const;
|
||||
|
||||
/// Ray-cast against the proxies in the tree. This relies on the callback
|
||||
/// to perform a exact ray-cast in the case were the proxy contains a shape.
|
||||
/// The callback also performs the any collision filtering. This has performance
|
||||
/// roughly equal to k * log(n), where k is the number of collisions and n is the
|
||||
/// number of proxies in the tree.
|
||||
/// @param input the ray-cast input data. The ray extends from p1 to p1 + maxFraction * (p2 - p1).
|
||||
/// @param callback a callback class that is called for each proxy that is hit by the ray.
|
||||
template <typename T>
|
||||
void RayCast(T* callback, const b2RayCastInput& input) const;
|
||||
|
||||
/// Validate this tree. For testing.
|
||||
void Validate() const;
|
||||
|
||||
/// Compute the height of the binary tree in O(N) time. Should not be
|
||||
/// called often.
|
||||
int32 GetHeight() const;
|
||||
|
||||
/// Get the maximum balance of an node in the tree. The balance is the difference
|
||||
/// in height of the two children of a node.
|
||||
int32 GetMaxBalance() const;
|
||||
|
||||
/// Get the ratio of the sum of the node areas to the root area.
|
||||
float32 GetAreaRatio() const;
|
||||
|
||||
/// Build an optimal tree. Very expensive. For testing.
|
||||
void RebuildBottomUp();
|
||||
|
||||
/// Shift the world origin. Useful for large worlds.
|
||||
/// The shift formula is: position -= newOrigin
|
||||
/// @param newOrigin the new origin with respect to the old origin
|
||||
void ShiftOrigin(const b2Vec2& newOrigin);
|
||||
|
||||
private:
|
||||
|
||||
int32 AllocateNode();
|
||||
void FreeNode(int32 node);
|
||||
|
||||
void InsertLeaf(int32 node);
|
||||
void RemoveLeaf(int32 node);
|
||||
|
||||
int32 Balance(int32 index);
|
||||
|
||||
int32 ComputeHeight() const;
|
||||
int32 ComputeHeight(int32 nodeId) const;
|
||||
|
||||
void ValidateStructure(int32 index) const;
|
||||
void ValidateMetrics(int32 index) const;
|
||||
|
||||
int32 m_root;
|
||||
|
||||
b2TreeNode* m_nodes;
|
||||
int32 m_nodeCount;
|
||||
int32 m_nodeCapacity;
|
||||
|
||||
int32 m_freeList;
|
||||
|
||||
/// This is used to incrementally traverse the tree for re-balancing.
|
||||
uint32 m_path;
|
||||
|
||||
int32 m_insertionCount;
|
||||
};
|
||||
|
||||
inline void* b2DynamicTree::GetUserData(int32 proxyId) const
|
||||
{
|
||||
b2Assert(0 <= proxyId && proxyId < m_nodeCapacity);
|
||||
return m_nodes[proxyId].userData;
|
||||
}
|
||||
|
||||
inline const b2AABB& b2DynamicTree::GetFatAABB(int32 proxyId) const
|
||||
{
|
||||
b2Assert(0 <= proxyId && proxyId < m_nodeCapacity);
|
||||
return m_nodes[proxyId].aabb;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline void b2DynamicTree::Query(T* callback, const b2AABB& aabb) const
|
||||
{
|
||||
b2GrowableStack<int32, 256> stack;
|
||||
stack.Push(m_root);
|
||||
|
||||
while (stack.GetCount() > 0)
|
||||
{
|
||||
int32 nodeId = stack.Pop();
|
||||
if (nodeId == b2_nullNode)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
const b2TreeNode* node = m_nodes + nodeId;
|
||||
|
||||
if (b2TestOverlap(node->aabb, aabb))
|
||||
{
|
||||
if (node->IsLeaf())
|
||||
{
|
||||
bool proceed = callback->QueryCallback(nodeId);
|
||||
if (proceed == false)
|
||||
{
|
||||
return;
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
stack.Push(node->child1);
|
||||
stack.Push(node->child2);
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline void b2DynamicTree::RayCast(T* callback, const b2RayCastInput& input) const
|
||||
{
|
||||
b2Vec2 p1 = input.p1;
|
||||
b2Vec2 p2 = input.p2;
|
||||
b2Vec2 r = p2 - p1;
|
||||
b2Assert(r.LengthSquared() > 0.0f);
|
||||
r.Normalize();
|
||||
|
||||
// v is perpendicular to the segment.
|
||||
b2Vec2 v = b2Cross(1.0f, r);
|
||||
b2Vec2 abs_v = b2Abs(v);
|
||||
|
||||
// Separating axis for segment (Gino, p80).
|
||||
// |dot(v, p1 - c)| > dot(|v|, h)
|
||||
|
||||
float32 maxFraction = input.maxFraction;
|
||||
|
||||
// Build a bounding box for the segment.
|
||||
b2AABB segmentAABB;
|
||||
{
|
||||
b2Vec2 t = p1 + maxFraction * (p2 - p1);
|
||||
segmentAABB.lowerBound = b2Min(p1, t);
|
||||
segmentAABB.upperBound = b2Max(p1, t);
|
||||
}
|
||||
|
||||
b2GrowableStack<int32, 256> stack;
|
||||
stack.Push(m_root);
|
||||
|
||||
while (stack.GetCount() > 0)
|
||||
{
|
||||
int32 nodeId = stack.Pop();
|
||||
if (nodeId == b2_nullNode)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
const b2TreeNode* node = m_nodes + nodeId;
|
||||
|
||||
if (b2TestOverlap(node->aabb, segmentAABB) == false)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
// Separating axis for segment (Gino, p80).
|
||||
// |dot(v, p1 - c)| > dot(|v|, h)
|
||||
b2Vec2 c = node->aabb.GetCenter();
|
||||
b2Vec2 h = node->aabb.GetExtents();
|
||||
float32 separation = b2Abs(b2Dot(v, p1 - c)) - b2Dot(abs_v, h);
|
||||
if (separation > 0.0f)
|
||||
{
|
||||
continue;
|
||||
}
|
||||
|
||||
if (node->IsLeaf())
|
||||
{
|
||||
b2RayCastInput subInput;
|
||||
subInput.p1 = input.p1;
|
||||
subInput.p2 = input.p2;
|
||||
subInput.maxFraction = maxFraction;
|
||||
|
||||
float32 value = callback->RayCastCallback(subInput, nodeId);
|
||||
|
||||
if (value == 0.0f)
|
||||
{
|
||||
// The client has terminated the ray cast.
|
||||
return;
|
||||
}
|
||||
|
||||
if (value > 0.0f)
|
||||
{
|
||||
// Update segment bounding box.
|
||||
maxFraction = value;
|
||||
b2Vec2 t = p1 + maxFraction * (p2 - p1);
|
||||
segmentAABB.lowerBound = b2Min(p1, t);
|
||||
segmentAABB.upperBound = b2Max(p1, t);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
stack.Push(node->child1);
|
||||
stack.Push(node->child2);
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
#endif
|
||||
-486
@@ -1,486 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/b2Distance.h"
|
||||
#include "Box2D/Collision/b2TimeOfImpact.h"
|
||||
#include "Box2D/Collision/Shapes/b2CircleShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2PolygonShape.h"
|
||||
#include "Box2D/Common/b2Timer.h"
|
||||
|
||||
#include <stdio.h>
|
||||
|
||||
float32 b2_toiTime, b2_toiMaxTime;
|
||||
int32 b2_toiCalls, b2_toiIters, b2_toiMaxIters;
|
||||
int32 b2_toiRootIters, b2_toiMaxRootIters;
|
||||
|
||||
//
|
||||
struct b2SeparationFunction
|
||||
{
|
||||
enum Type
|
||||
{
|
||||
e_points,
|
||||
e_faceA,
|
||||
e_faceB
|
||||
};
|
||||
|
||||
// TODO_ERIN might not need to return the separation
|
||||
|
||||
float32 Initialize(const b2SimplexCache* cache,
|
||||
const b2DistanceProxy* proxyA, const b2Sweep& sweepA,
|
||||
const b2DistanceProxy* proxyB, const b2Sweep& sweepB,
|
||||
float32 t1)
|
||||
{
|
||||
m_proxyA = proxyA;
|
||||
m_proxyB = proxyB;
|
||||
int32 count = cache->count;
|
||||
b2Assert(0 < count && count < 3);
|
||||
|
||||
m_sweepA = sweepA;
|
||||
m_sweepB = sweepB;
|
||||
|
||||
b2Transform xfA, xfB;
|
||||
m_sweepA.GetTransform(&xfA, t1);
|
||||
m_sweepB.GetTransform(&xfB, t1);
|
||||
|
||||
if (count == 1)
|
||||
{
|
||||
m_type = e_points;
|
||||
b2Vec2 localPointA = m_proxyA->GetVertex(cache->indexA[0]);
|
||||
b2Vec2 localPointB = m_proxyB->GetVertex(cache->indexB[0]);
|
||||
b2Vec2 pointA = b2Mul(xfA, localPointA);
|
||||
b2Vec2 pointB = b2Mul(xfB, localPointB);
|
||||
m_axis = pointB - pointA;
|
||||
float32 s = m_axis.Normalize();
|
||||
return s;
|
||||
}
|
||||
else if (cache->indexA[0] == cache->indexA[1])
|
||||
{
|
||||
// Two points on B and one on A.
|
||||
m_type = e_faceB;
|
||||
b2Vec2 localPointB1 = proxyB->GetVertex(cache->indexB[0]);
|
||||
b2Vec2 localPointB2 = proxyB->GetVertex(cache->indexB[1]);
|
||||
|
||||
m_axis = b2Cross(localPointB2 - localPointB1, 1.0f);
|
||||
m_axis.Normalize();
|
||||
b2Vec2 normal = b2Mul(xfB.q, m_axis);
|
||||
|
||||
m_localPoint = 0.5f * (localPointB1 + localPointB2);
|
||||
b2Vec2 pointB = b2Mul(xfB, m_localPoint);
|
||||
|
||||
b2Vec2 localPointA = proxyA->GetVertex(cache->indexA[0]);
|
||||
b2Vec2 pointA = b2Mul(xfA, localPointA);
|
||||
|
||||
float32 s = b2Dot(pointA - pointB, normal);
|
||||
if (s < 0.0f)
|
||||
{
|
||||
m_axis = -m_axis;
|
||||
s = -s;
|
||||
}
|
||||
return s;
|
||||
}
|
||||
else
|
||||
{
|
||||
// Two points on A and one or two points on B.
|
||||
m_type = e_faceA;
|
||||
b2Vec2 localPointA1 = m_proxyA->GetVertex(cache->indexA[0]);
|
||||
b2Vec2 localPointA2 = m_proxyA->GetVertex(cache->indexA[1]);
|
||||
|
||||
m_axis = b2Cross(localPointA2 - localPointA1, 1.0f);
|
||||
m_axis.Normalize();
|
||||
b2Vec2 normal = b2Mul(xfA.q, m_axis);
|
||||
|
||||
m_localPoint = 0.5f * (localPointA1 + localPointA2);
|
||||
b2Vec2 pointA = b2Mul(xfA, m_localPoint);
|
||||
|
||||
b2Vec2 localPointB = m_proxyB->GetVertex(cache->indexB[0]);
|
||||
b2Vec2 pointB = b2Mul(xfB, localPointB);
|
||||
|
||||
float32 s = b2Dot(pointB - pointA, normal);
|
||||
if (s < 0.0f)
|
||||
{
|
||||
m_axis = -m_axis;
|
||||
s = -s;
|
||||
}
|
||||
return s;
|
||||
}
|
||||
}
|
||||
|
||||
//
|
||||
float32 FindMinSeparation(int32* indexA, int32* indexB, float32 t) const
|
||||
{
|
||||
b2Transform xfA, xfB;
|
||||
m_sweepA.GetTransform(&xfA, t);
|
||||
m_sweepB.GetTransform(&xfB, t);
|
||||
|
||||
switch (m_type)
|
||||
{
|
||||
case e_points:
|
||||
{
|
||||
b2Vec2 axisA = b2MulT(xfA.q, m_axis);
|
||||
b2Vec2 axisB = b2MulT(xfB.q, -m_axis);
|
||||
|
||||
*indexA = m_proxyA->GetSupport(axisA);
|
||||
*indexB = m_proxyB->GetSupport(axisB);
|
||||
|
||||
b2Vec2 localPointA = m_proxyA->GetVertex(*indexA);
|
||||
b2Vec2 localPointB = m_proxyB->GetVertex(*indexB);
|
||||
|
||||
b2Vec2 pointA = b2Mul(xfA, localPointA);
|
||||
b2Vec2 pointB = b2Mul(xfB, localPointB);
|
||||
|
||||
float32 separation = b2Dot(pointB - pointA, m_axis);
|
||||
return separation;
|
||||
}
|
||||
|
||||
case e_faceA:
|
||||
{
|
||||
b2Vec2 normal = b2Mul(xfA.q, m_axis);
|
||||
b2Vec2 pointA = b2Mul(xfA, m_localPoint);
|
||||
|
||||
b2Vec2 axisB = b2MulT(xfB.q, -normal);
|
||||
|
||||
*indexA = -1;
|
||||
*indexB = m_proxyB->GetSupport(axisB);
|
||||
|
||||
b2Vec2 localPointB = m_proxyB->GetVertex(*indexB);
|
||||
b2Vec2 pointB = b2Mul(xfB, localPointB);
|
||||
|
||||
float32 separation = b2Dot(pointB - pointA, normal);
|
||||
return separation;
|
||||
}
|
||||
|
||||
case e_faceB:
|
||||
{
|
||||
b2Vec2 normal = b2Mul(xfB.q, m_axis);
|
||||
b2Vec2 pointB = b2Mul(xfB, m_localPoint);
|
||||
|
||||
b2Vec2 axisA = b2MulT(xfA.q, -normal);
|
||||
|
||||
*indexB = -1;
|
||||
*indexA = m_proxyA->GetSupport(axisA);
|
||||
|
||||
b2Vec2 localPointA = m_proxyA->GetVertex(*indexA);
|
||||
b2Vec2 pointA = b2Mul(xfA, localPointA);
|
||||
|
||||
float32 separation = b2Dot(pointA - pointB, normal);
|
||||
return separation;
|
||||
}
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
*indexA = -1;
|
||||
*indexB = -1;
|
||||
return 0.0f;
|
||||
}
|
||||
}
|
||||
|
||||
//
|
||||
float32 Evaluate(int32 indexA, int32 indexB, float32 t) const
|
||||
{
|
||||
b2Transform xfA, xfB;
|
||||
m_sweepA.GetTransform(&xfA, t);
|
||||
m_sweepB.GetTransform(&xfB, t);
|
||||
|
||||
switch (m_type)
|
||||
{
|
||||
case e_points:
|
||||
{
|
||||
b2Vec2 localPointA = m_proxyA->GetVertex(indexA);
|
||||
b2Vec2 localPointB = m_proxyB->GetVertex(indexB);
|
||||
|
||||
b2Vec2 pointA = b2Mul(xfA, localPointA);
|
||||
b2Vec2 pointB = b2Mul(xfB, localPointB);
|
||||
float32 separation = b2Dot(pointB - pointA, m_axis);
|
||||
|
||||
return separation;
|
||||
}
|
||||
|
||||
case e_faceA:
|
||||
{
|
||||
b2Vec2 normal = b2Mul(xfA.q, m_axis);
|
||||
b2Vec2 pointA = b2Mul(xfA, m_localPoint);
|
||||
|
||||
b2Vec2 localPointB = m_proxyB->GetVertex(indexB);
|
||||
b2Vec2 pointB = b2Mul(xfB, localPointB);
|
||||
|
||||
float32 separation = b2Dot(pointB - pointA, normal);
|
||||
return separation;
|
||||
}
|
||||
|
||||
case e_faceB:
|
||||
{
|
||||
b2Vec2 normal = b2Mul(xfB.q, m_axis);
|
||||
b2Vec2 pointB = b2Mul(xfB, m_localPoint);
|
||||
|
||||
b2Vec2 localPointA = m_proxyA->GetVertex(indexA);
|
||||
b2Vec2 pointA = b2Mul(xfA, localPointA);
|
||||
|
||||
float32 separation = b2Dot(pointA - pointB, normal);
|
||||
return separation;
|
||||
}
|
||||
|
||||
default:
|
||||
b2Assert(false);
|
||||
return 0.0f;
|
||||
}
|
||||
}
|
||||
|
||||
const b2DistanceProxy* m_proxyA;
|
||||
const b2DistanceProxy* m_proxyB;
|
||||
b2Sweep m_sweepA, m_sweepB;
|
||||
Type m_type;
|
||||
b2Vec2 m_localPoint;
|
||||
b2Vec2 m_axis;
|
||||
};
|
||||
|
||||
// CCD via the local separating axis method. This seeks progression
|
||||
// by computing the largest time at which separation is maintained.
|
||||
void b2TimeOfImpact(b2TOIOutput* output, const b2TOIInput* input)
|
||||
{
|
||||
b2Timer timer;
|
||||
|
||||
++b2_toiCalls;
|
||||
|
||||
output->state = b2TOIOutput::e_unknown;
|
||||
output->t = input->tMax;
|
||||
|
||||
const b2DistanceProxy* proxyA = &input->proxyA;
|
||||
const b2DistanceProxy* proxyB = &input->proxyB;
|
||||
|
||||
b2Sweep sweepA = input->sweepA;
|
||||
b2Sweep sweepB = input->sweepB;
|
||||
|
||||
// Large rotations can make the root finder fail, so we normalize the
|
||||
// sweep angles.
|
||||
sweepA.Normalize();
|
||||
sweepB.Normalize();
|
||||
|
||||
float32 tMax = input->tMax;
|
||||
|
||||
float32 totalRadius = proxyA->m_radius + proxyB->m_radius;
|
||||
float32 target = b2Max(b2_linearSlop, totalRadius - 3.0f * b2_linearSlop);
|
||||
float32 tolerance = 0.25f * b2_linearSlop;
|
||||
b2Assert(target > tolerance);
|
||||
|
||||
float32 t1 = 0.0f;
|
||||
const int32 k_maxIterations = 20; // TODO_ERIN b2Settings
|
||||
int32 iter = 0;
|
||||
|
||||
// Prepare input for distance query.
|
||||
b2SimplexCache cache;
|
||||
cache.count = 0;
|
||||
b2DistanceInput distanceInput;
|
||||
distanceInput.proxyA = input->proxyA;
|
||||
distanceInput.proxyB = input->proxyB;
|
||||
distanceInput.useRadii = false;
|
||||
|
||||
// The outer loop progressively attempts to compute new separating axes.
|
||||
// This loop terminates when an axis is repeated (no progress is made).
|
||||
for(;;)
|
||||
{
|
||||
b2Transform xfA, xfB;
|
||||
sweepA.GetTransform(&xfA, t1);
|
||||
sweepB.GetTransform(&xfB, t1);
|
||||
|
||||
// Get the distance between shapes. We can also use the results
|
||||
// to get a separating axis.
|
||||
distanceInput.transformA = xfA;
|
||||
distanceInput.transformB = xfB;
|
||||
b2DistanceOutput distanceOutput;
|
||||
b2Distance(&distanceOutput, &cache, &distanceInput);
|
||||
|
||||
// If the shapes are overlapped, we give up on continuous collision.
|
||||
if (distanceOutput.distance <= 0.0f)
|
||||
{
|
||||
// Failure!
|
||||
output->state = b2TOIOutput::e_overlapped;
|
||||
output->t = 0.0f;
|
||||
break;
|
||||
}
|
||||
|
||||
if (distanceOutput.distance < target + tolerance)
|
||||
{
|
||||
// Victory!
|
||||
output->state = b2TOIOutput::e_touching;
|
||||
output->t = t1;
|
||||
break;
|
||||
}
|
||||
|
||||
// Initialize the separating axis.
|
||||
b2SeparationFunction fcn;
|
||||
fcn.Initialize(&cache, proxyA, sweepA, proxyB, sweepB, t1);
|
||||
#if 0
|
||||
// Dump the curve seen by the root finder
|
||||
{
|
||||
const int32 N = 100;
|
||||
float32 dx = 1.0f / N;
|
||||
float32 xs[N+1];
|
||||
float32 fs[N+1];
|
||||
|
||||
float32 x = 0.0f;
|
||||
|
||||
for (int32 i = 0; i <= N; ++i)
|
||||
{
|
||||
sweepA.GetTransform(&xfA, x);
|
||||
sweepB.GetTransform(&xfB, x);
|
||||
float32 f = fcn.Evaluate(xfA, xfB) - target;
|
||||
|
||||
printf("%g %g\n", x, f);
|
||||
|
||||
xs[i] = x;
|
||||
fs[i] = f;
|
||||
|
||||
x += dx;
|
||||
}
|
||||
}
|
||||
#endif
|
||||
|
||||
// Compute the TOI on the separating axis. We do this by successively
|
||||
// resolving the deepest point. This loop is bounded by the number of vertices.
|
||||
bool done = false;
|
||||
float32 t2 = tMax;
|
||||
int32 pushBackIter = 0;
|
||||
for (;;)
|
||||
{
|
||||
// Find the deepest point at t2. Store the witness point indices.
|
||||
int32 indexA, indexB;
|
||||
float32 s2 = fcn.FindMinSeparation(&indexA, &indexB, t2);
|
||||
|
||||
// Is the final configuration separated?
|
||||
if (s2 > target + tolerance)
|
||||
{
|
||||
// Victory!
|
||||
output->state = b2TOIOutput::e_separated;
|
||||
output->t = tMax;
|
||||
done = true;
|
||||
break;
|
||||
}
|
||||
|
||||
// Has the separation reached tolerance?
|
||||
if (s2 > target - tolerance)
|
||||
{
|
||||
// Advance the sweeps
|
||||
t1 = t2;
|
||||
break;
|
||||
}
|
||||
|
||||
// Compute the initial separation of the witness points.
|
||||
float32 s1 = fcn.Evaluate(indexA, indexB, t1);
|
||||
|
||||
// Check for initial overlap. This might happen if the root finder
|
||||
// runs out of iterations.
|
||||
if (s1 < target - tolerance)
|
||||
{
|
||||
output->state = b2TOIOutput::e_failed;
|
||||
output->t = t1;
|
||||
done = true;
|
||||
break;
|
||||
}
|
||||
|
||||
// Check for touching
|
||||
if (s1 <= target + tolerance)
|
||||
{
|
||||
// Victory! t1 should hold the TOI (could be 0.0).
|
||||
output->state = b2TOIOutput::e_touching;
|
||||
output->t = t1;
|
||||
done = true;
|
||||
break;
|
||||
}
|
||||
|
||||
// Compute 1D root of: f(x) - target = 0
|
||||
int32 rootIterCount = 0;
|
||||
float32 a1 = t1, a2 = t2;
|
||||
for (;;)
|
||||
{
|
||||
// Use a mix of the secant rule and bisection.
|
||||
float32 t;
|
||||
if (rootIterCount & 1)
|
||||
{
|
||||
// Secant rule to improve convergence.
|
||||
t = a1 + (target - s1) * (a2 - a1) / (s2 - s1);
|
||||
}
|
||||
else
|
||||
{
|
||||
// Bisection to guarantee progress.
|
||||
t = 0.5f * (a1 + a2);
|
||||
}
|
||||
|
||||
++rootIterCount;
|
||||
++b2_toiRootIters;
|
||||
|
||||
float32 s = fcn.Evaluate(indexA, indexB, t);
|
||||
|
||||
if (b2Abs(s - target) < tolerance)
|
||||
{
|
||||
// t2 holds a tentative value for t1
|
||||
t2 = t;
|
||||
break;
|
||||
}
|
||||
|
||||
// Ensure we continue to bracket the root.
|
||||
if (s > target)
|
||||
{
|
||||
a1 = t;
|
||||
s1 = s;
|
||||
}
|
||||
else
|
||||
{
|
||||
a2 = t;
|
||||
s2 = s;
|
||||
}
|
||||
|
||||
if (rootIterCount == 50)
|
||||
{
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
b2_toiMaxRootIters = b2Max(b2_toiMaxRootIters, rootIterCount);
|
||||
|
||||
++pushBackIter;
|
||||
|
||||
if (pushBackIter == b2_maxPolygonVertices)
|
||||
{
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
++iter;
|
||||
++b2_toiIters;
|
||||
|
||||
if (done)
|
||||
{
|
||||
break;
|
||||
}
|
||||
|
||||
if (iter == k_maxIterations)
|
||||
{
|
||||
// Root finder got stuck. Semi-victory.
|
||||
output->state = b2TOIOutput::e_failed;
|
||||
output->t = t1;
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
b2_toiMaxIters = b2Max(b2_toiMaxIters, iter);
|
||||
|
||||
float32 time = timer.GetMilliseconds();
|
||||
b2_toiMaxTime = b2Max(b2_toiMaxTime, time);
|
||||
b2_toiTime += time;
|
||||
}
|
||||
-58
@@ -1,58 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_TIME_OF_IMPACT_H
|
||||
#define B2_TIME_OF_IMPACT_H
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
#include "Box2D/Collision/b2Distance.h"
|
||||
|
||||
/// Input parameters for b2TimeOfImpact
|
||||
struct b2TOIInput
|
||||
{
|
||||
b2DistanceProxy proxyA;
|
||||
b2DistanceProxy proxyB;
|
||||
b2Sweep sweepA;
|
||||
b2Sweep sweepB;
|
||||
float32 tMax; // defines sweep interval [0, tMax]
|
||||
};
|
||||
|
||||
// Output parameters for b2TimeOfImpact.
|
||||
struct b2TOIOutput
|
||||
{
|
||||
enum State
|
||||
{
|
||||
e_unknown,
|
||||
e_failed,
|
||||
e_overlapped,
|
||||
e_touching,
|
||||
e_separated
|
||||
};
|
||||
|
||||
State state;
|
||||
float32 t;
|
||||
};
|
||||
|
||||
/// Compute the upper bound on time before two shapes penetrate. Time is represented as
|
||||
/// a fraction between [0,tMax]. This uses a swept separating axis and may miss some intermediate,
|
||||
/// non-tunneling collision. If you change the time interval, you should call this function
|
||||
/// again.
|
||||
/// Note: use b2Distance to compute the contact point and normal at the time of impact.
|
||||
void b2TimeOfImpact(b2TOIOutput* output, const b2TOIInput* input);
|
||||
|
||||
#endif
|
||||
-215
@@ -1,215 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include <limits.h>
|
||||
#include <string.h>
|
||||
#include <stddef.h>
|
||||
|
||||
int32 b2BlockAllocator::s_blockSizes[b2_blockSizes] =
|
||||
{
|
||||
16, // 0
|
||||
32, // 1
|
||||
64, // 2
|
||||
96, // 3
|
||||
128, // 4
|
||||
160, // 5
|
||||
192, // 6
|
||||
224, // 7
|
||||
256, // 8
|
||||
320, // 9
|
||||
384, // 10
|
||||
448, // 11
|
||||
512, // 12
|
||||
640, // 13
|
||||
};
|
||||
uint8 b2BlockAllocator::s_blockSizeLookup[b2_maxBlockSize + 1];
|
||||
bool b2BlockAllocator::s_blockSizeLookupInitialized;
|
||||
|
||||
struct b2Chunk
|
||||
{
|
||||
int32 blockSize;
|
||||
b2Block* blocks;
|
||||
};
|
||||
|
||||
struct b2Block
|
||||
{
|
||||
b2Block* next;
|
||||
};
|
||||
|
||||
b2BlockAllocator::b2BlockAllocator()
|
||||
{
|
||||
b2Assert(b2_blockSizes < UCHAR_MAX);
|
||||
|
||||
m_chunkSpace = b2_chunkArrayIncrement;
|
||||
m_chunkCount = 0;
|
||||
m_chunks = (b2Chunk*)b2Alloc(m_chunkSpace * sizeof(b2Chunk));
|
||||
|
||||
memset(m_chunks, 0, m_chunkSpace * sizeof(b2Chunk));
|
||||
memset(m_freeLists, 0, sizeof(m_freeLists));
|
||||
|
||||
if (s_blockSizeLookupInitialized == false)
|
||||
{
|
||||
int32 j = 0;
|
||||
for (int32 i = 1; i <= b2_maxBlockSize; ++i)
|
||||
{
|
||||
b2Assert(j < b2_blockSizes);
|
||||
if (i <= s_blockSizes[j])
|
||||
{
|
||||
s_blockSizeLookup[i] = (uint8)j;
|
||||
}
|
||||
else
|
||||
{
|
||||
++j;
|
||||
s_blockSizeLookup[i] = (uint8)j;
|
||||
}
|
||||
}
|
||||
|
||||
s_blockSizeLookupInitialized = true;
|
||||
}
|
||||
}
|
||||
|
||||
b2BlockAllocator::~b2BlockAllocator()
|
||||
{
|
||||
for (int32 i = 0; i < m_chunkCount; ++i)
|
||||
{
|
||||
b2Free(m_chunks[i].blocks);
|
||||
}
|
||||
|
||||
b2Free(m_chunks);
|
||||
}
|
||||
|
||||
void* b2BlockAllocator::Allocate(int32 size)
|
||||
{
|
||||
if (size == 0)
|
||||
return nullptr;
|
||||
|
||||
b2Assert(0 < size);
|
||||
|
||||
if (size > b2_maxBlockSize)
|
||||
{
|
||||
return b2Alloc(size);
|
||||
}
|
||||
|
||||
int32 index = s_blockSizeLookup[size];
|
||||
b2Assert(0 <= index && index < b2_blockSizes);
|
||||
|
||||
if (m_freeLists[index])
|
||||
{
|
||||
b2Block* block = m_freeLists[index];
|
||||
m_freeLists[index] = block->next;
|
||||
return block;
|
||||
}
|
||||
else
|
||||
{
|
||||
if (m_chunkCount == m_chunkSpace)
|
||||
{
|
||||
b2Chunk* oldChunks = m_chunks;
|
||||
m_chunkSpace += b2_chunkArrayIncrement;
|
||||
m_chunks = (b2Chunk*)b2Alloc(m_chunkSpace * sizeof(b2Chunk));
|
||||
memcpy(m_chunks, oldChunks, m_chunkCount * sizeof(b2Chunk));
|
||||
memset(m_chunks + m_chunkCount, 0, b2_chunkArrayIncrement * sizeof(b2Chunk));
|
||||
b2Free(oldChunks);
|
||||
}
|
||||
|
||||
b2Chunk* chunk = m_chunks + m_chunkCount;
|
||||
chunk->blocks = (b2Block*)b2Alloc(b2_chunkSize);
|
||||
#if defined(_DEBUG)
|
||||
memset(chunk->blocks, 0xcd, b2_chunkSize);
|
||||
#endif
|
||||
int32 blockSize = s_blockSizes[index];
|
||||
chunk->blockSize = blockSize;
|
||||
int32 blockCount = b2_chunkSize / blockSize;
|
||||
b2Assert(blockCount * blockSize <= b2_chunkSize);
|
||||
for (int32 i = 0; i < blockCount - 1; ++i)
|
||||
{
|
||||
b2Block* block = (b2Block*)((int8*)chunk->blocks + blockSize * i);
|
||||
b2Block* next = (b2Block*)((int8*)chunk->blocks + blockSize * (i + 1));
|
||||
block->next = next;
|
||||
}
|
||||
b2Block* last = (b2Block*)((int8*)chunk->blocks + blockSize * (blockCount - 1));
|
||||
last->next = nullptr;
|
||||
|
||||
m_freeLists[index] = chunk->blocks->next;
|
||||
++m_chunkCount;
|
||||
|
||||
return chunk->blocks;
|
||||
}
|
||||
}
|
||||
|
||||
void b2BlockAllocator::Free(void* p, int32 size)
|
||||
{
|
||||
if (size == 0)
|
||||
{
|
||||
return;
|
||||
}
|
||||
|
||||
b2Assert(0 < size);
|
||||
|
||||
if (size > b2_maxBlockSize)
|
||||
{
|
||||
b2Free(p);
|
||||
return;
|
||||
}
|
||||
|
||||
int32 index = s_blockSizeLookup[size];
|
||||
b2Assert(0 <= index && index < b2_blockSizes);
|
||||
|
||||
#ifdef _DEBUG
|
||||
// Verify the memory address and size is valid.
|
||||
int32 blockSize = s_blockSizes[index];
|
||||
bool found = false;
|
||||
for (int32 i = 0; i < m_chunkCount; ++i)
|
||||
{
|
||||
b2Chunk* chunk = m_chunks + i;
|
||||
if (chunk->blockSize != blockSize)
|
||||
{
|
||||
b2Assert( (int8*)p + blockSize <= (int8*)chunk->blocks ||
|
||||
(int8*)chunk->blocks + b2_chunkSize <= (int8*)p);
|
||||
}
|
||||
else
|
||||
{
|
||||
if ((int8*)chunk->blocks <= (int8*)p && (int8*)p + blockSize <= (int8*)chunk->blocks + b2_chunkSize)
|
||||
{
|
||||
found = true;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
b2Assert(found);
|
||||
|
||||
memset(p, 0xfd, blockSize);
|
||||
#endif
|
||||
|
||||
b2Block* block = (b2Block*)p;
|
||||
block->next = m_freeLists[index];
|
||||
m_freeLists[index] = block;
|
||||
}
|
||||
|
||||
void b2BlockAllocator::Clear()
|
||||
{
|
||||
for (int32 i = 0; i < m_chunkCount; ++i)
|
||||
{
|
||||
b2Free(m_chunks[i].blocks);
|
||||
}
|
||||
|
||||
m_chunkCount = 0;
|
||||
memset(m_chunks, 0, m_chunkSpace * sizeof(b2Chunk));
|
||||
|
||||
memset(m_freeLists, 0, sizeof(m_freeLists));
|
||||
}
|
||||
-62
@@ -1,62 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_BLOCK_ALLOCATOR_H
|
||||
#define B2_BLOCK_ALLOCATOR_H
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
|
||||
const int32 b2_chunkSize = 16 * 1024;
|
||||
const int32 b2_maxBlockSize = 640;
|
||||
const int32 b2_blockSizes = 14;
|
||||
const int32 b2_chunkArrayIncrement = 128;
|
||||
|
||||
struct b2Block;
|
||||
struct b2Chunk;
|
||||
|
||||
/// This is a small object allocator used for allocating small
|
||||
/// objects that persist for more than one time step.
|
||||
/// See: http://www.codeproject.com/useritems/Small_Block_Allocator.asp
|
||||
class b2BlockAllocator
|
||||
{
|
||||
public:
|
||||
b2BlockAllocator();
|
||||
~b2BlockAllocator();
|
||||
|
||||
/// Allocate memory. This will use b2Alloc if the size is larger than b2_maxBlockSize.
|
||||
void* Allocate(int32 size);
|
||||
|
||||
/// Free memory. This will use b2Free if the size is larger than b2_maxBlockSize.
|
||||
void Free(void* p, int32 size);
|
||||
|
||||
void Clear();
|
||||
|
||||
private:
|
||||
|
||||
b2Chunk* m_chunks;
|
||||
int32 m_chunkCount;
|
||||
int32 m_chunkSpace;
|
||||
|
||||
b2Block* m_freeLists[b2_blockSizes];
|
||||
|
||||
static int32 s_blockSizes[b2_blockSizes];
|
||||
static uint8 s_blockSizeLookup[b2_maxBlockSize + 1];
|
||||
static bool s_blockSizeLookupInitialized;
|
||||
};
|
||||
|
||||
#endif
|
||||
@@ -1,44 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 Erin Catto http://box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Common/b2Draw.h"
|
||||
|
||||
b2Draw::b2Draw()
|
||||
{
|
||||
m_drawFlags = 0;
|
||||
}
|
||||
|
||||
void b2Draw::SetFlags(uint32 flags)
|
||||
{
|
||||
m_drawFlags = flags;
|
||||
}
|
||||
|
||||
uint32 b2Draw::GetFlags() const
|
||||
{
|
||||
return m_drawFlags;
|
||||
}
|
||||
|
||||
void b2Draw::AppendFlags(uint32 flags)
|
||||
{
|
||||
m_drawFlags |= flags;
|
||||
}
|
||||
|
||||
void b2Draw::ClearFlags(uint32 flags)
|
||||
{
|
||||
m_drawFlags &= ~flags;
|
||||
}
|
||||
@@ -1,97 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 Erin Catto http://box2d.org
|
||||
*
|
||||
* 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 B2_DRAW_H
|
||||
#define B2_DRAW_H
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
|
||||
/// Color for debug drawing. Each value has the range [0,1].
|
||||
struct b2Color
|
||||
{
|
||||
b2Color() {}
|
||||
b2Color(float32 rIn, float32 gIn, float32 bIn, float32 aIn = 1.0f)
|
||||
{
|
||||
r = rIn; g = gIn; b = bIn; a = aIn;
|
||||
}
|
||||
|
||||
void Set(float32 rIn, float32 gIn, float32 bIn, float32 aIn = 1.0f)
|
||||
{
|
||||
r = rIn; g = gIn; b = bIn; a = aIn;
|
||||
}
|
||||
|
||||
float32 r, g, b, a;
|
||||
};
|
||||
|
||||
/// Implement and register this class with a b2World to provide debug drawing of physics
|
||||
/// entities in your game.
|
||||
class b2Draw
|
||||
{
|
||||
public:
|
||||
b2Draw();
|
||||
|
||||
virtual ~b2Draw() {}
|
||||
|
||||
enum
|
||||
{
|
||||
e_shapeBit = 0x0001, ///< draw shapes
|
||||
e_jointBit = 0x0002, ///< draw joint connections
|
||||
e_aabbBit = 0x0004, ///< draw axis aligned bounding boxes
|
||||
e_pairBit = 0x0008, ///< draw broad-phase pairs
|
||||
e_centerOfMassBit = 0x0010 ///< draw center of mass frame
|
||||
};
|
||||
|
||||
/// Set the drawing flags.
|
||||
void SetFlags(uint32 flags);
|
||||
|
||||
/// Get the drawing flags.
|
||||
uint32 GetFlags() const;
|
||||
|
||||
/// Append flags to the current flags.
|
||||
void AppendFlags(uint32 flags);
|
||||
|
||||
/// Clear flags from the current flags.
|
||||
void ClearFlags(uint32 flags);
|
||||
|
||||
/// Draw a closed polygon provided in CCW order.
|
||||
virtual void DrawPolygon(const b2Vec2* vertices, int32 vertexCount, const b2Color& color) = 0;
|
||||
|
||||
/// Draw a solid closed polygon provided in CCW order.
|
||||
virtual void DrawSolidPolygon(const b2Vec2* vertices, int32 vertexCount, const b2Color& color) = 0;
|
||||
|
||||
/// Draw a circle.
|
||||
virtual void DrawCircle(const b2Vec2& center, float32 radius, const b2Color& color) = 0;
|
||||
|
||||
/// Draw a solid circle.
|
||||
virtual void DrawSolidCircle(const b2Vec2& center, float32 radius, const b2Vec2& axis, const b2Color& color) = 0;
|
||||
|
||||
/// Draw a line segment.
|
||||
virtual void DrawSegment(const b2Vec2& p1, const b2Vec2& p2, const b2Color& color) = 0;
|
||||
|
||||
/// Draw a transform. Choose your own length scale.
|
||||
/// @param xf a transform.
|
||||
virtual void DrawTransform(const b2Transform& xf) = 0;
|
||||
|
||||
/// Draw a point.
|
||||
virtual void DrawPoint(const b2Vec2& p, float32 size, const b2Color& color) = 0;
|
||||
|
||||
protected:
|
||||
uint32 m_drawFlags;
|
||||
};
|
||||
|
||||
#endif
|
||||
-85
@@ -1,85 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_GROWABLE_STACK_H
|
||||
#define B2_GROWABLE_STACK_H
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
#include <string.h>
|
||||
|
||||
/// This is a growable LIFO stack with an initial capacity of N.
|
||||
/// If the stack size exceeds the initial capacity, the heap is used
|
||||
/// to increase the size of the stack.
|
||||
template <typename T, int32 N>
|
||||
class b2GrowableStack
|
||||
{
|
||||
public:
|
||||
b2GrowableStack()
|
||||
{
|
||||
m_stack = m_array;
|
||||
m_count = 0;
|
||||
m_capacity = N;
|
||||
}
|
||||
|
||||
~b2GrowableStack()
|
||||
{
|
||||
if (m_stack != m_array)
|
||||
{
|
||||
b2Free(m_stack);
|
||||
m_stack = nullptr;
|
||||
}
|
||||
}
|
||||
|
||||
void Push(const T& element)
|
||||
{
|
||||
if (m_count == m_capacity)
|
||||
{
|
||||
T* old = m_stack;
|
||||
m_capacity *= 2;
|
||||
m_stack = (T*)b2Alloc(m_capacity * sizeof(T));
|
||||
memcpy(m_stack, old, m_count * sizeof(T));
|
||||
if (old != m_array)
|
||||
{
|
||||
b2Free(old);
|
||||
}
|
||||
}
|
||||
|
||||
m_stack[m_count] = element;
|
||||
++m_count;
|
||||
}
|
||||
|
||||
T Pop()
|
||||
{
|
||||
b2Assert(m_count > 0);
|
||||
--m_count;
|
||||
return m_stack[m_count];
|
||||
}
|
||||
|
||||
int32 GetCount()
|
||||
{
|
||||
return m_count;
|
||||
}
|
||||
|
||||
private:
|
||||
T* m_stack;
|
||||
T m_array[N];
|
||||
int32 m_count;
|
||||
int32 m_capacity;
|
||||
};
|
||||
|
||||
|
||||
#endif
|
||||
@@ -1,94 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2007-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
|
||||
const b2Vec2 b2Vec2_zero(0.0f, 0.0f);
|
||||
|
||||
/// Solve A * x = b, where b is a column vector. This is more efficient
|
||||
/// than computing the inverse in one-shot cases.
|
||||
b2Vec3 b2Mat33::Solve33(const b2Vec3& b) const
|
||||
{
|
||||
float32 det = b2Dot(ex, b2Cross(ey, ez));
|
||||
if (det != 0.0f)
|
||||
{
|
||||
det = 1.0f / det;
|
||||
}
|
||||
b2Vec3 x;
|
||||
x.x = det * b2Dot(b, b2Cross(ey, ez));
|
||||
x.y = det * b2Dot(ex, b2Cross(b, ez));
|
||||
x.z = det * b2Dot(ex, b2Cross(ey, b));
|
||||
return x;
|
||||
}
|
||||
|
||||
/// Solve A * x = b, where b is a column vector. This is more efficient
|
||||
/// than computing the inverse in one-shot cases.
|
||||
b2Vec2 b2Mat33::Solve22(const b2Vec2& b) const
|
||||
{
|
||||
float32 a11 = ex.x, a12 = ey.x, a21 = ex.y, a22 = ey.y;
|
||||
float32 det = a11 * a22 - a12 * a21;
|
||||
if (det != 0.0f)
|
||||
{
|
||||
det = 1.0f / det;
|
||||
}
|
||||
b2Vec2 x;
|
||||
x.x = det * (a22 * b.x - a12 * b.y);
|
||||
x.y = det * (a11 * b.y - a21 * b.x);
|
||||
return x;
|
||||
}
|
||||
|
||||
///
|
||||
void b2Mat33::GetInverse22(b2Mat33* M) const
|
||||
{
|
||||
float32 a = ex.x, b = ey.x, c = ex.y, d = ey.y;
|
||||
float32 det = a * d - b * c;
|
||||
if (det != 0.0f)
|
||||
{
|
||||
det = 1.0f / det;
|
||||
}
|
||||
|
||||
M->ex.x = det * d; M->ey.x = -det * b; M->ex.z = 0.0f;
|
||||
M->ex.y = -det * c; M->ey.y = det * a; M->ey.z = 0.0f;
|
||||
M->ez.x = 0.0f; M->ez.y = 0.0f; M->ez.z = 0.0f;
|
||||
}
|
||||
|
||||
/// Returns the zero matrix if singular.
|
||||
void b2Mat33::GetSymInverse33(b2Mat33* M) const
|
||||
{
|
||||
float32 det = b2Dot(ex, b2Cross(ey, ez));
|
||||
if (det != 0.0f)
|
||||
{
|
||||
det = 1.0f / det;
|
||||
}
|
||||
|
||||
float32 a11 = ex.x, a12 = ey.x, a13 = ez.x;
|
||||
float32 a22 = ey.y, a23 = ez.y;
|
||||
float32 a33 = ez.z;
|
||||
|
||||
M->ex.x = det * (a22 * a33 - a23 * a23);
|
||||
M->ex.y = det * (a13 * a23 - a12 * a33);
|
||||
M->ex.z = det * (a12 * a23 - a13 * a22);
|
||||
|
||||
M->ey.x = M->ex.y;
|
||||
M->ey.y = det * (a11 * a33 - a13 * a13);
|
||||
M->ey.z = det * (a13 * a12 - a11 * a23);
|
||||
|
||||
M->ez.x = M->ex.z;
|
||||
M->ez.y = M->ey.z;
|
||||
M->ez.z = det * (a11 * a22 - a12 * a12);
|
||||
}
|
||||
@@ -1,725 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_MATH_H
|
||||
#define B2_MATH_H
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
#include <math.h>
|
||||
|
||||
/// This function is used to ensure that a floating point number is not a NaN or infinity.
|
||||
inline bool b2IsValid(float32 x)
|
||||
{
|
||||
int32 ix = *reinterpret_cast<int32*>(&x);
|
||||
return (ix & 0x7f800000) != 0x7f800000;
|
||||
}
|
||||
|
||||
/// This is a approximate yet fast inverse square-root.
|
||||
inline float32 b2InvSqrt(float32 x)
|
||||
{
|
||||
union
|
||||
{
|
||||
float32 x;
|
||||
int32 i;
|
||||
} convert;
|
||||
|
||||
convert.x = x;
|
||||
float32 xhalf = 0.5f * x;
|
||||
convert.i = 0x5f3759df - (convert.i >> 1);
|
||||
x = convert.x;
|
||||
x = x * (1.5f - xhalf * x * x);
|
||||
return x;
|
||||
}
|
||||
|
||||
#define b2Sqrt(x) sqrtf(x)
|
||||
#define b2Atan2(y, x) atan2f(y, x)
|
||||
|
||||
/// A 2D column vector.
|
||||
struct b2Vec2
|
||||
{
|
||||
/// Default constructor does nothing (for performance).
|
||||
b2Vec2() {}
|
||||
|
||||
/// Construct using coordinates.
|
||||
b2Vec2(float32 xIn, float32 yIn) : x(xIn), y(yIn) {}
|
||||
|
||||
/// Set this vector to all zeros.
|
||||
void SetZero() { x = 0.0f; y = 0.0f; }
|
||||
|
||||
/// Set this vector to some specified coordinates.
|
||||
void Set(float32 x_, float32 y_) { x = x_; y = y_; }
|
||||
|
||||
/// Negate this vector.
|
||||
b2Vec2 operator -() const { b2Vec2 v; v.Set(-x, -y); return v; }
|
||||
|
||||
/// Read from and indexed element.
|
||||
float32 operator () (int32 i) const
|
||||
{
|
||||
return (&x)[i];
|
||||
}
|
||||
|
||||
/// Write to an indexed element.
|
||||
float32& operator () (int32 i)
|
||||
{
|
||||
return (&x)[i];
|
||||
}
|
||||
|
||||
/// Add a vector to this vector.
|
||||
void operator += (const b2Vec2& v)
|
||||
{
|
||||
x += v.x; y += v.y;
|
||||
}
|
||||
|
||||
/// Subtract a vector from this vector.
|
||||
void operator -= (const b2Vec2& v)
|
||||
{
|
||||
x -= v.x; y -= v.y;
|
||||
}
|
||||
|
||||
/// Multiply this vector by a scalar.
|
||||
void operator *= (float32 a)
|
||||
{
|
||||
x *= a; y *= a;
|
||||
}
|
||||
|
||||
/// Get the length of this vector (the norm).
|
||||
float32 Length() const
|
||||
{
|
||||
return b2Sqrt(x * x + y * y);
|
||||
}
|
||||
|
||||
/// Get the length squared. For performance, use this instead of
|
||||
/// b2Vec2::Length (if possible).
|
||||
float32 LengthSquared() const
|
||||
{
|
||||
return x * x + y * y;
|
||||
}
|
||||
|
||||
/// Convert this vector into a unit vector. Returns the length.
|
||||
float32 Normalize()
|
||||
{
|
||||
float32 length = Length();
|
||||
if (length < b2_epsilon)
|
||||
{
|
||||
return 0.0f;
|
||||
}
|
||||
float32 invLength = 1.0f / length;
|
||||
x *= invLength;
|
||||
y *= invLength;
|
||||
|
||||
return length;
|
||||
}
|
||||
|
||||
/// Does this vector contain finite coordinates?
|
||||
bool IsValid() const
|
||||
{
|
||||
return b2IsValid(x) && b2IsValid(y);
|
||||
}
|
||||
|
||||
/// Get the skew vector such that dot(skew_vec, other) == cross(vec, other)
|
||||
b2Vec2 Skew() const
|
||||
{
|
||||
return b2Vec2(-y, x);
|
||||
}
|
||||
|
||||
float32 x, y;
|
||||
};
|
||||
|
||||
/// A 2D column vector with 3 elements.
|
||||
struct b2Vec3
|
||||
{
|
||||
/// Default constructor does nothing (for performance).
|
||||
b2Vec3() {}
|
||||
|
||||
/// Construct using coordinates.
|
||||
b2Vec3(float32 xIn, float32 yIn, float32 zIn) : x(xIn), y(yIn), z(zIn) {}
|
||||
|
||||
/// Set this vector to all zeros.
|
||||
void SetZero() { x = 0.0f; y = 0.0f; z = 0.0f; }
|
||||
|
||||
/// Set this vector to some specified coordinates.
|
||||
void Set(float32 x_, float32 y_, float32 z_) { x = x_; y = y_; z = z_; }
|
||||
|
||||
/// Negate this vector.
|
||||
b2Vec3 operator -() const { b2Vec3 v; v.Set(-x, -y, -z); return v; }
|
||||
|
||||
/// Add a vector to this vector.
|
||||
void operator += (const b2Vec3& v)
|
||||
{
|
||||
x += v.x; y += v.y; z += v.z;
|
||||
}
|
||||
|
||||
/// Subtract a vector from this vector.
|
||||
void operator -= (const b2Vec3& v)
|
||||
{
|
||||
x -= v.x; y -= v.y; z -= v.z;
|
||||
}
|
||||
|
||||
/// Multiply this vector by a scalar.
|
||||
void operator *= (float32 s)
|
||||
{
|
||||
x *= s; y *= s; z *= s;
|
||||
}
|
||||
|
||||
float32 x, y, z;
|
||||
};
|
||||
|
||||
/// A 2-by-2 matrix. Stored in column-major order.
|
||||
struct b2Mat22
|
||||
{
|
||||
/// The default constructor does nothing (for performance).
|
||||
b2Mat22() {}
|
||||
|
||||
/// Construct this matrix using columns.
|
||||
b2Mat22(const b2Vec2& c1, const b2Vec2& c2)
|
||||
{
|
||||
ex = c1;
|
||||
ey = c2;
|
||||
}
|
||||
|
||||
/// Construct this matrix using scalars.
|
||||
b2Mat22(float32 a11, float32 a12, float32 a21, float32 a22)
|
||||
{
|
||||
ex.x = a11; ex.y = a21;
|
||||
ey.x = a12; ey.y = a22;
|
||||
}
|
||||
|
||||
/// Initialize this matrix using columns.
|
||||
void Set(const b2Vec2& c1, const b2Vec2& c2)
|
||||
{
|
||||
ex = c1;
|
||||
ey = c2;
|
||||
}
|
||||
|
||||
/// Set this to the identity matrix.
|
||||
void SetIdentity()
|
||||
{
|
||||
ex.x = 1.0f; ey.x = 0.0f;
|
||||
ex.y = 0.0f; ey.y = 1.0f;
|
||||
}
|
||||
|
||||
/// Set this matrix to all zeros.
|
||||
void SetZero()
|
||||
{
|
||||
ex.x = 0.0f; ey.x = 0.0f;
|
||||
ex.y = 0.0f; ey.y = 0.0f;
|
||||
}
|
||||
|
||||
b2Mat22 GetInverse() const
|
||||
{
|
||||
float32 a = ex.x, b = ey.x, c = ex.y, d = ey.y;
|
||||
b2Mat22 B;
|
||||
float32 det = a * d - b * c;
|
||||
if (det != 0.0f)
|
||||
{
|
||||
det = 1.0f / det;
|
||||
}
|
||||
B.ex.x = det * d; B.ey.x = -det * b;
|
||||
B.ex.y = -det * c; B.ey.y = det * a;
|
||||
return B;
|
||||
}
|
||||
|
||||
/// Solve A * x = b, where b is a column vector. This is more efficient
|
||||
/// than computing the inverse in one-shot cases.
|
||||
b2Vec2 Solve(const b2Vec2& b) const
|
||||
{
|
||||
float32 a11 = ex.x, a12 = ey.x, a21 = ex.y, a22 = ey.y;
|
||||
float32 det = a11 * a22 - a12 * a21;
|
||||
if (det != 0.0f)
|
||||
{
|
||||
det = 1.0f / det;
|
||||
}
|
||||
b2Vec2 x;
|
||||
x.x = det * (a22 * b.x - a12 * b.y);
|
||||
x.y = det * (a11 * b.y - a21 * b.x);
|
||||
return x;
|
||||
}
|
||||
|
||||
b2Vec2 ex, ey;
|
||||
};
|
||||
|
||||
/// A 3-by-3 matrix. Stored in column-major order.
|
||||
struct b2Mat33
|
||||
{
|
||||
/// The default constructor does nothing (for performance).
|
||||
b2Mat33() {}
|
||||
|
||||
/// Construct this matrix using columns.
|
||||
b2Mat33(const b2Vec3& c1, const b2Vec3& c2, const b2Vec3& c3)
|
||||
{
|
||||
ex = c1;
|
||||
ey = c2;
|
||||
ez = c3;
|
||||
}
|
||||
|
||||
/// Set this matrix to all zeros.
|
||||
void SetZero()
|
||||
{
|
||||
ex.SetZero();
|
||||
ey.SetZero();
|
||||
ez.SetZero();
|
||||
}
|
||||
|
||||
/// Solve A * x = b, where b is a column vector. This is more efficient
|
||||
/// than computing the inverse in one-shot cases.
|
||||
b2Vec3 Solve33(const b2Vec3& b) const;
|
||||
|
||||
/// Solve A * x = b, where b is a column vector. This is more efficient
|
||||
/// than computing the inverse in one-shot cases. Solve only the upper
|
||||
/// 2-by-2 matrix equation.
|
||||
b2Vec2 Solve22(const b2Vec2& b) const;
|
||||
|
||||
/// Get the inverse of this matrix as a 2-by-2.
|
||||
/// Returns the zero matrix if singular.
|
||||
void GetInverse22(b2Mat33* M) const;
|
||||
|
||||
/// Get the symmetric inverse of this matrix as a 3-by-3.
|
||||
/// Returns the zero matrix if singular.
|
||||
void GetSymInverse33(b2Mat33* M) const;
|
||||
|
||||
b2Vec3 ex, ey, ez;
|
||||
};
|
||||
|
||||
/// Rotation
|
||||
struct b2Rot
|
||||
{
|
||||
b2Rot() {}
|
||||
|
||||
/// Initialize from an angle in radians
|
||||
explicit b2Rot(float32 angle)
|
||||
{
|
||||
/// TODO_ERIN optimize
|
||||
s = sinf(angle);
|
||||
c = cosf(angle);
|
||||
}
|
||||
|
||||
/// Set using an angle in radians.
|
||||
void Set(float32 angle)
|
||||
{
|
||||
/// TODO_ERIN optimize
|
||||
s = sinf(angle);
|
||||
c = cosf(angle);
|
||||
}
|
||||
|
||||
/// Set to the identity rotation
|
||||
void SetIdentity()
|
||||
{
|
||||
s = 0.0f;
|
||||
c = 1.0f;
|
||||
}
|
||||
|
||||
/// Get the angle in radians
|
||||
float32 GetAngle() const
|
||||
{
|
||||
return b2Atan2(s, c);
|
||||
}
|
||||
|
||||
/// Get the x-axis
|
||||
b2Vec2 GetXAxis() const
|
||||
{
|
||||
return b2Vec2(c, s);
|
||||
}
|
||||
|
||||
/// Get the u-axis
|
||||
b2Vec2 GetYAxis() const
|
||||
{
|
||||
return b2Vec2(-s, c);
|
||||
}
|
||||
|
||||
/// Sine and cosine
|
||||
float32 s, c;
|
||||
};
|
||||
|
||||
/// A transform contains translation and rotation. It is used to represent
|
||||
/// the position and orientation of rigid frames.
|
||||
struct b2Transform
|
||||
{
|
||||
/// The default constructor does nothing.
|
||||
b2Transform() {}
|
||||
|
||||
/// Initialize using a position vector and a rotation.
|
||||
b2Transform(const b2Vec2& position, const b2Rot& rotation) : p(position), q(rotation) {}
|
||||
|
||||
/// Set this to the identity transform.
|
||||
void SetIdentity()
|
||||
{
|
||||
p.SetZero();
|
||||
q.SetIdentity();
|
||||
}
|
||||
|
||||
/// Set this based on the position and angle.
|
||||
void Set(const b2Vec2& position, float32 angle)
|
||||
{
|
||||
p = position;
|
||||
q.Set(angle);
|
||||
}
|
||||
|
||||
b2Vec2 p;
|
||||
b2Rot q;
|
||||
};
|
||||
|
||||
/// This describes the motion of a body/shape for TOI computation.
|
||||
/// Shapes are defined with respect to the body origin, which may
|
||||
/// no coincide with the center of mass. However, to support dynamics
|
||||
/// we must interpolate the center of mass position.
|
||||
struct b2Sweep
|
||||
{
|
||||
/// Get the interpolated transform at a specific time.
|
||||
/// @param beta is a factor in [0,1], where 0 indicates alpha0.
|
||||
void GetTransform(b2Transform* xfb, float32 beta) const;
|
||||
|
||||
/// Advance the sweep forward, yielding a new initial state.
|
||||
/// @param alpha the new initial time.
|
||||
void Advance(float32 alpha);
|
||||
|
||||
/// Normalize the angles.
|
||||
void Normalize();
|
||||
|
||||
b2Vec2 localCenter; ///< local center of mass position
|
||||
b2Vec2 c0, c; ///< center world positions
|
||||
float32 a0, a; ///< world angles
|
||||
|
||||
/// Fraction of the current time step in the range [0,1]
|
||||
/// c0 and a0 are the positions at alpha0.
|
||||
float32 alpha0;
|
||||
};
|
||||
|
||||
/// Useful constant
|
||||
extern const b2Vec2 b2Vec2_zero;
|
||||
|
||||
/// Perform the dot product on two vectors.
|
||||
inline float32 b2Dot(const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return a.x * b.x + a.y * b.y;
|
||||
}
|
||||
|
||||
/// Perform the cross product on two vectors. In 2D this produces a scalar.
|
||||
inline float32 b2Cross(const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return a.x * b.y - a.y * b.x;
|
||||
}
|
||||
|
||||
/// Perform the cross product on a vector and a scalar. In 2D this produces
|
||||
/// a vector.
|
||||
inline b2Vec2 b2Cross(const b2Vec2& a, float32 s)
|
||||
{
|
||||
return b2Vec2(s * a.y, -s * a.x);
|
||||
}
|
||||
|
||||
/// Perform the cross product on a scalar and a vector. In 2D this produces
|
||||
/// a vector.
|
||||
inline b2Vec2 b2Cross(float32 s, const b2Vec2& a)
|
||||
{
|
||||
return b2Vec2(-s * a.y, s * a.x);
|
||||
}
|
||||
|
||||
/// Multiply a matrix times a vector. If a rotation matrix is provided,
|
||||
/// then this transforms the vector from one frame to another.
|
||||
inline b2Vec2 b2Mul(const b2Mat22& A, const b2Vec2& v)
|
||||
{
|
||||
return b2Vec2(A.ex.x * v.x + A.ey.x * v.y, A.ex.y * v.x + A.ey.y * v.y);
|
||||
}
|
||||
|
||||
/// Multiply a matrix transpose times a vector. If a rotation matrix is provided,
|
||||
/// then this transforms the vector from one frame to another (inverse transform).
|
||||
inline b2Vec2 b2MulT(const b2Mat22& A, const b2Vec2& v)
|
||||
{
|
||||
return b2Vec2(b2Dot(v, A.ex), b2Dot(v, A.ey));
|
||||
}
|
||||
|
||||
/// Add two vectors component-wise.
|
||||
inline b2Vec2 operator + (const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return b2Vec2(a.x + b.x, a.y + b.y);
|
||||
}
|
||||
|
||||
/// Subtract two vectors component-wise.
|
||||
inline b2Vec2 operator - (const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return b2Vec2(a.x - b.x, a.y - b.y);
|
||||
}
|
||||
|
||||
inline b2Vec2 operator * (float32 s, const b2Vec2& a)
|
||||
{
|
||||
return b2Vec2(s * a.x, s * a.y);
|
||||
}
|
||||
|
||||
inline bool operator == (const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return a.x == b.x && a.y == b.y;
|
||||
}
|
||||
|
||||
inline bool operator != (const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return a.x != b.x || a.y != b.y;
|
||||
}
|
||||
|
||||
inline float32 b2Distance(const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
b2Vec2 c = a - b;
|
||||
return c.Length();
|
||||
}
|
||||
|
||||
inline float32 b2DistanceSquared(const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
b2Vec2 c = a - b;
|
||||
return b2Dot(c, c);
|
||||
}
|
||||
|
||||
inline b2Vec3 operator * (float32 s, const b2Vec3& a)
|
||||
{
|
||||
return b2Vec3(s * a.x, s * a.y, s * a.z);
|
||||
}
|
||||
|
||||
/// Add two vectors component-wise.
|
||||
inline b2Vec3 operator + (const b2Vec3& a, const b2Vec3& b)
|
||||
{
|
||||
return b2Vec3(a.x + b.x, a.y + b.y, a.z + b.z);
|
||||
}
|
||||
|
||||
/// Subtract two vectors component-wise.
|
||||
inline b2Vec3 operator - (const b2Vec3& a, const b2Vec3& b)
|
||||
{
|
||||
return b2Vec3(a.x - b.x, a.y - b.y, a.z - b.z);
|
||||
}
|
||||
|
||||
/// Perform the dot product on two vectors.
|
||||
inline float32 b2Dot(const b2Vec3& a, const b2Vec3& b)
|
||||
{
|
||||
return a.x * b.x + a.y * b.y + a.z * b.z;
|
||||
}
|
||||
|
||||
/// Perform the cross product on two vectors.
|
||||
inline b2Vec3 b2Cross(const b2Vec3& a, const b2Vec3& b)
|
||||
{
|
||||
return b2Vec3(a.y * b.z - a.z * b.y, a.z * b.x - a.x * b.z, a.x * b.y - a.y * b.x);
|
||||
}
|
||||
|
||||
inline b2Mat22 operator + (const b2Mat22& A, const b2Mat22& B)
|
||||
{
|
||||
return b2Mat22(A.ex + B.ex, A.ey + B.ey);
|
||||
}
|
||||
|
||||
// A * B
|
||||
inline b2Mat22 b2Mul(const b2Mat22& A, const b2Mat22& B)
|
||||
{
|
||||
return b2Mat22(b2Mul(A, B.ex), b2Mul(A, B.ey));
|
||||
}
|
||||
|
||||
// A^T * B
|
||||
inline b2Mat22 b2MulT(const b2Mat22& A, const b2Mat22& B)
|
||||
{
|
||||
b2Vec2 c1(b2Dot(A.ex, B.ex), b2Dot(A.ey, B.ex));
|
||||
b2Vec2 c2(b2Dot(A.ex, B.ey), b2Dot(A.ey, B.ey));
|
||||
return b2Mat22(c1, c2);
|
||||
}
|
||||
|
||||
/// Multiply a matrix times a vector.
|
||||
inline b2Vec3 b2Mul(const b2Mat33& A, const b2Vec3& v)
|
||||
{
|
||||
return v.x * A.ex + v.y * A.ey + v.z * A.ez;
|
||||
}
|
||||
|
||||
/// Multiply a matrix times a vector.
|
||||
inline b2Vec2 b2Mul22(const b2Mat33& A, const b2Vec2& v)
|
||||
{
|
||||
return b2Vec2(A.ex.x * v.x + A.ey.x * v.y, A.ex.y * v.x + A.ey.y * v.y);
|
||||
}
|
||||
|
||||
/// Multiply two rotations: q * r
|
||||
inline b2Rot b2Mul(const b2Rot& q, const b2Rot& r)
|
||||
{
|
||||
// [qc -qs] * [rc -rs] = [qc*rc-qs*rs -qc*rs-qs*rc]
|
||||
// [qs qc] [rs rc] [qs*rc+qc*rs -qs*rs+qc*rc]
|
||||
// s = qs * rc + qc * rs
|
||||
// c = qc * rc - qs * rs
|
||||
b2Rot qr;
|
||||
qr.s = q.s * r.c + q.c * r.s;
|
||||
qr.c = q.c * r.c - q.s * r.s;
|
||||
return qr;
|
||||
}
|
||||
|
||||
/// Transpose multiply two rotations: qT * r
|
||||
inline b2Rot b2MulT(const b2Rot& q, const b2Rot& r)
|
||||
{
|
||||
// [ qc qs] * [rc -rs] = [qc*rc+qs*rs -qc*rs+qs*rc]
|
||||
// [-qs qc] [rs rc] [-qs*rc+qc*rs qs*rs+qc*rc]
|
||||
// s = qc * rs - qs * rc
|
||||
// c = qc * rc + qs * rs
|
||||
b2Rot qr;
|
||||
qr.s = q.c * r.s - q.s * r.c;
|
||||
qr.c = q.c * r.c + q.s * r.s;
|
||||
return qr;
|
||||
}
|
||||
|
||||
/// Rotate a vector
|
||||
inline b2Vec2 b2Mul(const b2Rot& q, const b2Vec2& v)
|
||||
{
|
||||
return b2Vec2(q.c * v.x - q.s * v.y, q.s * v.x + q.c * v.y);
|
||||
}
|
||||
|
||||
/// Inverse rotate a vector
|
||||
inline b2Vec2 b2MulT(const b2Rot& q, const b2Vec2& v)
|
||||
{
|
||||
return b2Vec2(q.c * v.x + q.s * v.y, -q.s * v.x + q.c * v.y);
|
||||
}
|
||||
|
||||
inline b2Vec2 b2Mul(const b2Transform& T, const b2Vec2& v)
|
||||
{
|
||||
float32 x = (T.q.c * v.x - T.q.s * v.y) + T.p.x;
|
||||
float32 y = (T.q.s * v.x + T.q.c * v.y) + T.p.y;
|
||||
|
||||
return b2Vec2(x, y);
|
||||
}
|
||||
|
||||
inline b2Vec2 b2MulT(const b2Transform& T, const b2Vec2& v)
|
||||
{
|
||||
float32 px = v.x - T.p.x;
|
||||
float32 py = v.y - T.p.y;
|
||||
float32 x = (T.q.c * px + T.q.s * py);
|
||||
float32 y = (-T.q.s * px + T.q.c * py);
|
||||
|
||||
return b2Vec2(x, y);
|
||||
}
|
||||
|
||||
// v2 = A.q.Rot(B.q.Rot(v1) + B.p) + A.p
|
||||
// = (A.q * B.q).Rot(v1) + A.q.Rot(B.p) + A.p
|
||||
inline b2Transform b2Mul(const b2Transform& A, const b2Transform& B)
|
||||
{
|
||||
b2Transform C;
|
||||
C.q = b2Mul(A.q, B.q);
|
||||
C.p = b2Mul(A.q, B.p) + A.p;
|
||||
return C;
|
||||
}
|
||||
|
||||
// v2 = A.q' * (B.q * v1 + B.p - A.p)
|
||||
// = A.q' * B.q * v1 + A.q' * (B.p - A.p)
|
||||
inline b2Transform b2MulT(const b2Transform& A, const b2Transform& B)
|
||||
{
|
||||
b2Transform C;
|
||||
C.q = b2MulT(A.q, B.q);
|
||||
C.p = b2MulT(A.q, B.p - A.p);
|
||||
return C;
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline T b2Abs(T a)
|
||||
{
|
||||
return a > T(0) ? a : -a;
|
||||
}
|
||||
|
||||
inline b2Vec2 b2Abs(const b2Vec2& a)
|
||||
{
|
||||
return b2Vec2(b2Abs(a.x), b2Abs(a.y));
|
||||
}
|
||||
|
||||
inline b2Mat22 b2Abs(const b2Mat22& A)
|
||||
{
|
||||
return b2Mat22(b2Abs(A.ex), b2Abs(A.ey));
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline T b2Min(T a, T b)
|
||||
{
|
||||
return a < b ? a : b;
|
||||
}
|
||||
|
||||
inline b2Vec2 b2Min(const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return b2Vec2(b2Min(a.x, b.x), b2Min(a.y, b.y));
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline T b2Max(T a, T b)
|
||||
{
|
||||
return a > b ? a : b;
|
||||
}
|
||||
|
||||
inline b2Vec2 b2Max(const b2Vec2& a, const b2Vec2& b)
|
||||
{
|
||||
return b2Vec2(b2Max(a.x, b.x), b2Max(a.y, b.y));
|
||||
}
|
||||
|
||||
template <typename T>
|
||||
inline T b2Clamp(T a, T low, T high)
|
||||
{
|
||||
return b2Max(low, b2Min(a, high));
|
||||
}
|
||||
|
||||
inline b2Vec2 b2Clamp(const b2Vec2& a, const b2Vec2& low, const b2Vec2& high)
|
||||
{
|
||||
return b2Max(low, b2Min(a, high));
|
||||
}
|
||||
|
||||
template<typename T> inline void b2Swap(T& a, T& b)
|
||||
{
|
||||
T tmp = a;
|
||||
a = b;
|
||||
b = tmp;
|
||||
}
|
||||
|
||||
/// "Next Largest Power of 2
|
||||
/// Given a binary integer value x, the next largest power of 2 can be computed by a SWAR algorithm
|
||||
/// that recursively "folds" the upper bits into the lower bits. This process yields a bit vector with
|
||||
/// the same most significant 1 as x, but all 1's below it. Adding 1 to that value yields the next
|
||||
/// largest power of 2. For a 32-bit value:"
|
||||
inline uint32 b2NextPowerOfTwo(uint32 x)
|
||||
{
|
||||
x |= (x >> 1);
|
||||
x |= (x >> 2);
|
||||
x |= (x >> 4);
|
||||
x |= (x >> 8);
|
||||
x |= (x >> 16);
|
||||
return x + 1;
|
||||
}
|
||||
|
||||
inline bool b2IsPowerOfTwo(uint32 x)
|
||||
{
|
||||
bool result = x > 0 && (x & (x - 1)) == 0;
|
||||
return result;
|
||||
}
|
||||
|
||||
inline void b2Sweep::GetTransform(b2Transform* xf, float32 beta) const
|
||||
{
|
||||
xf->p = (1.0f - beta) * c0 + beta * c;
|
||||
float32 angle = (1.0f - beta) * a0 + beta * a;
|
||||
xf->q.Set(angle);
|
||||
|
||||
// Shift to origin
|
||||
xf->p -= b2Mul(xf->q, localCenter);
|
||||
}
|
||||
|
||||
inline void b2Sweep::Advance(float32 alpha)
|
||||
{
|
||||
b2Assert(alpha0 < 1.0f);
|
||||
float32 beta = (alpha - alpha0) / (1.0f - alpha0);
|
||||
c0 += beta * (c - c0);
|
||||
a0 += beta * (a - a0);
|
||||
alpha0 = alpha;
|
||||
}
|
||||
|
||||
/// Normalize an angle in radians to be between -pi and pi
|
||||
inline void b2Sweep::Normalize()
|
||||
{
|
||||
float32 twoPi = 2.0f * b2_pi;
|
||||
float32 d = twoPi * floorf(a0 / twoPi);
|
||||
a0 -= d;
|
||||
a -= d;
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -1,44 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
#include <stdio.h>
|
||||
#include <stdarg.h>
|
||||
#include <stdlib.h>
|
||||
|
||||
b2Version b2_version = {2, 3, 2};
|
||||
|
||||
// Memory allocators. Modify these to use your own allocator.
|
||||
void* b2Alloc(int32 size)
|
||||
{
|
||||
return malloc(size);
|
||||
}
|
||||
|
||||
void b2Free(void* mem)
|
||||
{
|
||||
free(mem);
|
||||
}
|
||||
|
||||
// You can modify this to use your logging facility.
|
||||
void b2Log(const char* string, ...)
|
||||
{
|
||||
va_list args;
|
||||
va_start(args, string);
|
||||
vprintf(string, args);
|
||||
va_end(args);
|
||||
}
|
||||
@@ -1,155 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_SETTINGS_H
|
||||
#define B2_SETTINGS_H
|
||||
|
||||
#include <stddef.h>
|
||||
#include <assert.h>
|
||||
#include <float.h>
|
||||
|
||||
#if !defined(NDEBUG)
|
||||
#define b2DEBUG
|
||||
#endif
|
||||
|
||||
#define B2_NOT_USED(x) ((void)(x))
|
||||
#define b2Assert(A) assert(A)
|
||||
|
||||
typedef signed char int8;
|
||||
typedef signed short int16;
|
||||
typedef signed int int32;
|
||||
typedef unsigned char uint8;
|
||||
typedef unsigned short uint16;
|
||||
typedef unsigned int uint32;
|
||||
typedef float float32;
|
||||
typedef double float64;
|
||||
|
||||
#define b2_maxFloat FLT_MAX
|
||||
#define b2_epsilon FLT_EPSILON
|
||||
#define b2_pi 3.14159265359f
|
||||
|
||||
/// @file
|
||||
/// Global tuning constants based on meters-kilograms-seconds (MKS) units.
|
||||
///
|
||||
|
||||
// Collision
|
||||
|
||||
/// The maximum number of contact points between two convex shapes. Do
|
||||
/// not change this value.
|
||||
#define b2_maxManifoldPoints 2
|
||||
|
||||
/// The maximum number of vertices on a convex polygon. You cannot increase
|
||||
/// this too much because b2BlockAllocator has a maximum object size.
|
||||
#define b2_maxPolygonVertices 8
|
||||
|
||||
/// This is used to fatten AABBs in the dynamic tree. This allows proxies
|
||||
/// to move by a small amount without triggering a tree adjustment.
|
||||
/// This is in meters.
|
||||
#define b2_aabbExtension 0.1f
|
||||
|
||||
/// This is used to fatten AABBs in the dynamic tree. This is used to predict
|
||||
/// the future position based on the current displacement.
|
||||
/// This is a dimensionless multiplier.
|
||||
#define b2_aabbMultiplier 2.0f
|
||||
|
||||
/// A small length used as a collision and constraint tolerance. Usually it is
|
||||
/// chosen to be numerically significant, but visually insignificant.
|
||||
#define b2_linearSlop 0.005f
|
||||
|
||||
/// A small angle used as a collision and constraint tolerance. Usually it is
|
||||
/// chosen to be numerically significant, but visually insignificant.
|
||||
#define b2_angularSlop (2.0f / 180.0f * b2_pi)
|
||||
|
||||
/// The radius of the polygon/edge shape skin. This should not be modified. Making
|
||||
/// this smaller means polygons will have an insufficient buffer for continuous collision.
|
||||
/// Making it larger may create artifacts for vertex collision.
|
||||
#define b2_polygonRadius (2.0f * b2_linearSlop)
|
||||
|
||||
/// Maximum number of sub-steps per contact in continuous physics simulation.
|
||||
#define b2_maxSubSteps 8
|
||||
|
||||
|
||||
// Dynamics
|
||||
|
||||
/// Maximum number of contacts to be handled to solve a TOI impact.
|
||||
#define b2_maxTOIContacts 32
|
||||
|
||||
/// A velocity threshold for elastic collisions. Any collision with a relative linear
|
||||
/// velocity below this threshold will be treated as inelastic.
|
||||
#define b2_velocityThreshold 1.0f
|
||||
|
||||
/// The maximum linear position correction used when solving constraints. This helps to
|
||||
/// prevent overshoot.
|
||||
#define b2_maxLinearCorrection 0.2f
|
||||
|
||||
/// The maximum angular position correction used when solving constraints. This helps to
|
||||
/// prevent overshoot.
|
||||
#define b2_maxAngularCorrection (8.0f / 180.0f * b2_pi)
|
||||
|
||||
/// The maximum linear velocity of a body. This limit is very large and is used
|
||||
/// to prevent numerical problems. You shouldn't need to adjust this.
|
||||
#define b2_maxTranslation 2.0f
|
||||
#define b2_maxTranslationSquared (b2_maxTranslation * b2_maxTranslation)
|
||||
|
||||
/// The maximum angular velocity of a body. This limit is very large and is used
|
||||
/// to prevent numerical problems. You shouldn't need to adjust this.
|
||||
#define b2_maxRotation (0.5f * b2_pi)
|
||||
#define b2_maxRotationSquared (b2_maxRotation * b2_maxRotation)
|
||||
|
||||
/// This scale factor controls how fast overlap is resolved. Ideally this would be 1 so
|
||||
/// that overlap is removed in one time step. However using values close to 1 often lead
|
||||
/// to overshoot.
|
||||
#define b2_baumgarte 0.2f
|
||||
#define b2_toiBaugarte 0.75f
|
||||
|
||||
|
||||
// Sleep
|
||||
|
||||
/// The time that a body must be still before it will go to sleep.
|
||||
#define b2_timeToSleep 0.5f
|
||||
|
||||
/// A body cannot sleep if its linear velocity is above this tolerance.
|
||||
#define b2_linearSleepTolerance 0.01f
|
||||
|
||||
/// A body cannot sleep if its angular velocity is above this tolerance.
|
||||
#define b2_angularSleepTolerance (2.0f / 180.0f * b2_pi)
|
||||
|
||||
// Memory Allocation
|
||||
|
||||
/// Implement this function to use your own memory allocator.
|
||||
void* b2Alloc(int32 size);
|
||||
|
||||
/// If you implement b2Alloc, you should also implement this function.
|
||||
void b2Free(void* mem);
|
||||
|
||||
/// Logging function.
|
||||
void b2Log(const char* string, ...);
|
||||
|
||||
/// Version numbering scheme.
|
||||
/// See http://en.wikipedia.org/wiki/Software_versioning
|
||||
struct b2Version
|
||||
{
|
||||
int32 major; ///< significant changes
|
||||
int32 minor; ///< incremental changes
|
||||
int32 revision; ///< bug fixes
|
||||
};
|
||||
|
||||
/// Current version.
|
||||
extern b2Version b2_version;
|
||||
|
||||
#endif
|
||||
-83
@@ -1,83 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Common/b2StackAllocator.h"
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
|
||||
b2StackAllocator::b2StackAllocator()
|
||||
{
|
||||
m_index = 0;
|
||||
m_allocation = 0;
|
||||
m_maxAllocation = 0;
|
||||
m_entryCount = 0;
|
||||
}
|
||||
|
||||
b2StackAllocator::~b2StackAllocator()
|
||||
{
|
||||
b2Assert(m_index == 0);
|
||||
b2Assert(m_entryCount == 0);
|
||||
}
|
||||
|
||||
void* b2StackAllocator::Allocate(int32 size)
|
||||
{
|
||||
b2Assert(m_entryCount < b2_maxStackEntries);
|
||||
|
||||
b2StackEntry* entry = m_entries + m_entryCount;
|
||||
entry->size = size;
|
||||
if (m_index + size > b2_stackSize)
|
||||
{
|
||||
entry->data = (char*)b2Alloc(size);
|
||||
entry->usedMalloc = true;
|
||||
}
|
||||
else
|
||||
{
|
||||
entry->data = m_data + m_index;
|
||||
entry->usedMalloc = false;
|
||||
m_index += size;
|
||||
}
|
||||
|
||||
m_allocation += size;
|
||||
m_maxAllocation = b2Max(m_maxAllocation, m_allocation);
|
||||
++m_entryCount;
|
||||
|
||||
return entry->data;
|
||||
}
|
||||
|
||||
void b2StackAllocator::Free(void* p)
|
||||
{
|
||||
b2Assert(m_entryCount > 0);
|
||||
b2StackEntry* entry = m_entries + m_entryCount - 1;
|
||||
b2Assert(p == entry->data);
|
||||
if (entry->usedMalloc)
|
||||
{
|
||||
b2Free(p);
|
||||
}
|
||||
else
|
||||
{
|
||||
m_index -= entry->size;
|
||||
}
|
||||
m_allocation -= entry->size;
|
||||
--m_entryCount;
|
||||
|
||||
p = nullptr;
|
||||
}
|
||||
|
||||
int32 b2StackAllocator::GetMaxAllocation() const
|
||||
{
|
||||
return m_maxAllocation;
|
||||
}
|
||||
-60
@@ -1,60 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_STACK_ALLOCATOR_H
|
||||
#define B2_STACK_ALLOCATOR_H
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
|
||||
const int32 b2_stackSize = 100 * 1024; // 100k
|
||||
const int32 b2_maxStackEntries = 32;
|
||||
|
||||
struct b2StackEntry
|
||||
{
|
||||
char* data;
|
||||
int32 size;
|
||||
bool usedMalloc;
|
||||
};
|
||||
|
||||
// This is a stack allocator used for fast per step allocations.
|
||||
// You must nest allocate/free pairs. The code will assert
|
||||
// if you try to interleave multiple allocate/free pairs.
|
||||
class b2StackAllocator
|
||||
{
|
||||
public:
|
||||
b2StackAllocator();
|
||||
~b2StackAllocator();
|
||||
|
||||
void* Allocate(int32 size);
|
||||
void Free(void* p);
|
||||
|
||||
int32 GetMaxAllocation() const;
|
||||
|
||||
private:
|
||||
|
||||
char m_data[b2_stackSize];
|
||||
int32 m_index;
|
||||
|
||||
int32 m_allocation;
|
||||
int32 m_maxAllocation;
|
||||
|
||||
b2StackEntry m_entries[b2_maxStackEntries];
|
||||
int32 m_entryCount;
|
||||
};
|
||||
|
||||
#endif
|
||||
@@ -1,104 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 Erin Catto http://box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Common/b2Timer.h"
|
||||
|
||||
#if defined(_WIN32)
|
||||
|
||||
float64 b2Timer::s_invFrequency = 0.0f;
|
||||
|
||||
#ifndef WIN32_LEAN_AND_MEAN
|
||||
#define WIN32_LEAN_AND_MEAN
|
||||
#endif
|
||||
|
||||
#include <windows.h>
|
||||
|
||||
b2Timer::b2Timer()
|
||||
{
|
||||
LARGE_INTEGER largeInteger;
|
||||
|
||||
if (s_invFrequency == 0.0f)
|
||||
{
|
||||
QueryPerformanceFrequency(&largeInteger);
|
||||
s_invFrequency = float64(largeInteger.QuadPart);
|
||||
if (s_invFrequency > 0.0f)
|
||||
{
|
||||
s_invFrequency = 1000.0f / s_invFrequency;
|
||||
}
|
||||
}
|
||||
|
||||
QueryPerformanceCounter(&largeInteger);
|
||||
m_start = float64(largeInteger.QuadPart);
|
||||
}
|
||||
|
||||
void b2Timer::Reset()
|
||||
{
|
||||
LARGE_INTEGER largeInteger;
|
||||
QueryPerformanceCounter(&largeInteger);
|
||||
m_start = float64(largeInteger.QuadPart);
|
||||
}
|
||||
|
||||
float32 b2Timer::GetMilliseconds() const
|
||||
{
|
||||
LARGE_INTEGER largeInteger;
|
||||
QueryPerformanceCounter(&largeInteger);
|
||||
float64 count = float64(largeInteger.QuadPart);
|
||||
float32 ms = float32(s_invFrequency * (count - m_start));
|
||||
return ms;
|
||||
}
|
||||
|
||||
#elif defined(__linux__) || defined (__APPLE__)
|
||||
|
||||
#include <sys/time.h>
|
||||
|
||||
b2Timer::b2Timer()
|
||||
{
|
||||
Reset();
|
||||
}
|
||||
|
||||
void b2Timer::Reset()
|
||||
{
|
||||
timeval t;
|
||||
gettimeofday(&t, 0);
|
||||
m_start_sec = t.tv_sec;
|
||||
m_start_usec = t.tv_usec;
|
||||
}
|
||||
|
||||
float32 b2Timer::GetMilliseconds() const
|
||||
{
|
||||
timeval t;
|
||||
gettimeofday(&t, 0);
|
||||
return 1000.0f * (t.tv_sec - m_start_sec) + 0.001f * (t.tv_usec - m_start_usec);
|
||||
}
|
||||
|
||||
#else
|
||||
|
||||
b2Timer::b2Timer()
|
||||
{
|
||||
}
|
||||
|
||||
void b2Timer::Reset()
|
||||
{
|
||||
}
|
||||
|
||||
float32 b2Timer::GetMilliseconds() const
|
||||
{
|
||||
return 0.0f;
|
||||
}
|
||||
|
||||
#endif
|
||||
@@ -1,50 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2011 Erin Catto http://box2d.org
|
||||
*
|
||||
* 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 B2_TIMER_H
|
||||
#define B2_TIMER_H
|
||||
|
||||
#include "Box2D/Common/b2Settings.h"
|
||||
|
||||
/// Timer for profiling. This has platform specific code and may
|
||||
/// not work on every platform.
|
||||
class b2Timer
|
||||
{
|
||||
public:
|
||||
|
||||
/// Constructor
|
||||
b2Timer();
|
||||
|
||||
/// Reset the timer.
|
||||
void Reset();
|
||||
|
||||
/// Get the time since construction or the last reset.
|
||||
float32 GetMilliseconds() const;
|
||||
|
||||
private:
|
||||
|
||||
#if defined(_WIN32)
|
||||
float64 m_start;
|
||||
static float64 s_invFrequency;
|
||||
#elif defined(__linux__) || defined (__APPLE__)
|
||||
unsigned long m_start_sec;
|
||||
unsigned long m_start_usec;
|
||||
#endif
|
||||
};
|
||||
|
||||
#endif
|
||||
-53
@@ -1,53 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Collision/Shapes/b2ChainShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2ChainAndCircleContact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2ChainAndCircleContact));
|
||||
return new (mem) b2ChainAndCircleContact(fixtureA, indexA, fixtureB, indexB);
|
||||
}
|
||||
|
||||
void b2ChainAndCircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2ChainAndCircleContact*)contact)->~b2ChainAndCircleContact();
|
||||
allocator->Free(contact, sizeof(b2ChainAndCircleContact));
|
||||
}
|
||||
|
||||
b2ChainAndCircleContact::b2ChainAndCircleContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB)
|
||||
: b2Contact(fixtureA, indexA, fixtureB, indexB)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_chain);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_circle);
|
||||
}
|
||||
|
||||
void b2ChainAndCircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2ChainShape* chain = (b2ChainShape*)m_fixtureA->GetShape();
|
||||
b2EdgeShape edge;
|
||||
chain->GetChildEdge(&edge, m_indexA);
|
||||
b2CollideEdgeAndCircle( manifold, &edge, xfA,
|
||||
(b2CircleShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-39
@@ -1,39 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CHAIN_AND_CIRCLE_CONTACT_H
|
||||
#define B2_CHAIN_AND_CIRCLE_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2ChainAndCircleContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2ChainAndCircleContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB);
|
||||
~b2ChainAndCircleContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
-53
@@ -1,53 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Collision/Shapes/b2ChainShape.h"
|
||||
#include "Box2D/Collision/Shapes/b2EdgeShape.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2ChainAndPolygonContact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2ChainAndPolygonContact));
|
||||
return new (mem) b2ChainAndPolygonContact(fixtureA, indexA, fixtureB, indexB);
|
||||
}
|
||||
|
||||
void b2ChainAndPolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2ChainAndPolygonContact*)contact)->~b2ChainAndPolygonContact();
|
||||
allocator->Free(contact, sizeof(b2ChainAndPolygonContact));
|
||||
}
|
||||
|
||||
b2ChainAndPolygonContact::b2ChainAndPolygonContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB)
|
||||
: b2Contact(fixtureA, indexA, fixtureB, indexB)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_chain);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);
|
||||
}
|
||||
|
||||
void b2ChainAndPolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2ChainShape* chain = (b2ChainShape*)m_fixtureA->GetShape();
|
||||
b2EdgeShape edge;
|
||||
chain->GetChildEdge(&edge, m_indexA);
|
||||
b2CollideEdgeAndPolygon( manifold, &edge, xfA,
|
||||
(b2PolygonShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-39
@@ -1,39 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CHAIN_AND_POLYGON_CONTACT_H
|
||||
#define B2_CHAIN_AND_POLYGON_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2ChainAndPolygonContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2ChainAndPolygonContact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB);
|
||||
~b2ChainAndPolygonContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
-52
@@ -1,52 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2CircleContact.h"
|
||||
#include "Box2D/Dynamics/b2Body.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Dynamics/b2WorldCallbacks.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Collision/b2TimeOfImpact.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2CircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2CircleContact));
|
||||
return new (mem) b2CircleContact(fixtureA, fixtureB);
|
||||
}
|
||||
|
||||
void b2CircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2CircleContact*)contact)->~b2CircleContact();
|
||||
allocator->Free(contact, sizeof(b2CircleContact));
|
||||
}
|
||||
|
||||
b2CircleContact::b2CircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB)
|
||||
: b2Contact(fixtureA, 0, fixtureB, 0)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_circle);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_circle);
|
||||
}
|
||||
|
||||
void b2CircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2CollideCircles(manifold,
|
||||
(b2CircleShape*)m_fixtureA->GetShape(), xfA,
|
||||
(b2CircleShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-39
@@ -1,39 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CIRCLE_CONTACT_H
|
||||
#define B2_CIRCLE_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2CircleContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2CircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB);
|
||||
~b2CircleContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
-247
@@ -1,247 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2CircleContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2PolygonContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2ChainAndCircleContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2ChainAndPolygonContact.h"
|
||||
#include "Box2D/Dynamics/Contacts/b2ContactSolver.h"
|
||||
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/b2TimeOfImpact.h"
|
||||
#include "Box2D/Collision/Shapes/b2Shape.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Dynamics/b2Body.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Dynamics/b2World.h"
|
||||
|
||||
b2ContactRegister b2Contact::s_registers[b2Shape::e_typeCount][b2Shape::e_typeCount];
|
||||
bool b2Contact::s_initialized = false;
|
||||
|
||||
void b2Contact::InitializeRegisters()
|
||||
{
|
||||
AddType(b2CircleContact::Create, b2CircleContact::Destroy, b2Shape::e_circle, b2Shape::e_circle);
|
||||
AddType(b2PolygonAndCircleContact::Create, b2PolygonAndCircleContact::Destroy, b2Shape::e_polygon, b2Shape::e_circle);
|
||||
AddType(b2PolygonContact::Create, b2PolygonContact::Destroy, b2Shape::e_polygon, b2Shape::e_polygon);
|
||||
AddType(b2EdgeAndCircleContact::Create, b2EdgeAndCircleContact::Destroy, b2Shape::e_edge, b2Shape::e_circle);
|
||||
AddType(b2EdgeAndPolygonContact::Create, b2EdgeAndPolygonContact::Destroy, b2Shape::e_edge, b2Shape::e_polygon);
|
||||
AddType(b2ChainAndCircleContact::Create, b2ChainAndCircleContact::Destroy, b2Shape::e_chain, b2Shape::e_circle);
|
||||
AddType(b2ChainAndPolygonContact::Create, b2ChainAndPolygonContact::Destroy, b2Shape::e_chain, b2Shape::e_polygon);
|
||||
}
|
||||
|
||||
void b2Contact::AddType(b2ContactCreateFcn* createFcn, b2ContactDestroyFcn* destoryFcn,
|
||||
b2Shape::Type type1, b2Shape::Type type2)
|
||||
{
|
||||
b2Assert(0 <= type1 && type1 < b2Shape::e_typeCount);
|
||||
b2Assert(0 <= type2 && type2 < b2Shape::e_typeCount);
|
||||
|
||||
s_registers[type1][type2].createFcn = createFcn;
|
||||
s_registers[type1][type2].destroyFcn = destoryFcn;
|
||||
s_registers[type1][type2].primary = true;
|
||||
|
||||
if (type1 != type2)
|
||||
{
|
||||
s_registers[type2][type1].createFcn = createFcn;
|
||||
s_registers[type2][type1].destroyFcn = destoryFcn;
|
||||
s_registers[type2][type1].primary = false;
|
||||
}
|
||||
}
|
||||
|
||||
b2Contact* b2Contact::Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator)
|
||||
{
|
||||
if (s_initialized == false)
|
||||
{
|
||||
InitializeRegisters();
|
||||
s_initialized = true;
|
||||
}
|
||||
|
||||
b2Shape::Type type1 = fixtureA->GetType();
|
||||
b2Shape::Type type2 = fixtureB->GetType();
|
||||
|
||||
b2Assert(0 <= type1 && type1 < b2Shape::e_typeCount);
|
||||
b2Assert(0 <= type2 && type2 < b2Shape::e_typeCount);
|
||||
|
||||
b2ContactCreateFcn* createFcn = s_registers[type1][type2].createFcn;
|
||||
if (createFcn)
|
||||
{
|
||||
if (s_registers[type1][type2].primary)
|
||||
{
|
||||
return createFcn(fixtureA, indexA, fixtureB, indexB, allocator);
|
||||
}
|
||||
else
|
||||
{
|
||||
return createFcn(fixtureB, indexB, fixtureA, indexA, allocator);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
return nullptr;
|
||||
}
|
||||
}
|
||||
|
||||
void b2Contact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
b2Assert(s_initialized == true);
|
||||
|
||||
b2Fixture* fixtureA = contact->m_fixtureA;
|
||||
b2Fixture* fixtureB = contact->m_fixtureB;
|
||||
|
||||
if (contact->m_manifold.pointCount > 0 &&
|
||||
fixtureA->IsSensor() == false &&
|
||||
fixtureB->IsSensor() == false)
|
||||
{
|
||||
fixtureA->GetBody()->SetAwake(true);
|
||||
fixtureB->GetBody()->SetAwake(true);
|
||||
}
|
||||
|
||||
b2Shape::Type typeA = fixtureA->GetType();
|
||||
b2Shape::Type typeB = fixtureB->GetType();
|
||||
|
||||
b2Assert(0 <= typeA && typeB < b2Shape::e_typeCount);
|
||||
b2Assert(0 <= typeA && typeB < b2Shape::e_typeCount);
|
||||
|
||||
b2ContactDestroyFcn* destroyFcn = s_registers[typeA][typeB].destroyFcn;
|
||||
destroyFcn(contact, allocator);
|
||||
}
|
||||
|
||||
b2Contact::b2Contact(b2Fixture* fA, int32 indexA, b2Fixture* fB, int32 indexB)
|
||||
{
|
||||
m_flags = e_enabledFlag;
|
||||
|
||||
m_fixtureA = fA;
|
||||
m_fixtureB = fB;
|
||||
|
||||
m_indexA = indexA;
|
||||
m_indexB = indexB;
|
||||
|
||||
m_manifold.pointCount = 0;
|
||||
|
||||
m_prev = nullptr;
|
||||
m_next = nullptr;
|
||||
|
||||
m_nodeA.contact = nullptr;
|
||||
m_nodeA.prev = nullptr;
|
||||
m_nodeA.next = nullptr;
|
||||
m_nodeA.other = nullptr;
|
||||
|
||||
m_nodeB.contact = nullptr;
|
||||
m_nodeB.prev = nullptr;
|
||||
m_nodeB.next = nullptr;
|
||||
m_nodeB.other = nullptr;
|
||||
|
||||
m_toiCount = 0;
|
||||
|
||||
m_friction = b2MixFriction(m_fixtureA->m_friction, m_fixtureB->m_friction);
|
||||
m_restitution = b2MixRestitution(m_fixtureA->m_restitution, m_fixtureB->m_restitution);
|
||||
|
||||
m_tangentSpeed = 0.0f;
|
||||
}
|
||||
|
||||
// Update the contact manifold and touching status.
|
||||
// Note: do not assume the fixture AABBs are overlapping or are valid.
|
||||
void b2Contact::Update(b2ContactListener* listener)
|
||||
{
|
||||
b2Manifold oldManifold = m_manifold;
|
||||
|
||||
// Re-enable this contact.
|
||||
m_flags |= e_enabledFlag;
|
||||
|
||||
bool touching = false;
|
||||
bool wasTouching = (m_flags & e_touchingFlag) == e_touchingFlag;
|
||||
|
||||
bool sensorA = m_fixtureA->IsSensor();
|
||||
bool sensorB = m_fixtureB->IsSensor();
|
||||
bool sensor = sensorA || sensorB;
|
||||
|
||||
b2Body* bodyA = m_fixtureA->GetBody();
|
||||
b2Body* bodyB = m_fixtureB->GetBody();
|
||||
const b2Transform& xfA = bodyA->GetTransform();
|
||||
const b2Transform& xfB = bodyB->GetTransform();
|
||||
|
||||
// Is this contact a sensor?
|
||||
if (sensor)
|
||||
{
|
||||
const b2Shape* shapeA = m_fixtureA->GetShape();
|
||||
const b2Shape* shapeB = m_fixtureB->GetShape();
|
||||
touching = b2TestOverlap(shapeA, m_indexA, shapeB, m_indexB, xfA, xfB);
|
||||
|
||||
// Sensors don't generate manifolds.
|
||||
m_manifold.pointCount = 0;
|
||||
}
|
||||
else
|
||||
{
|
||||
Evaluate(&m_manifold, xfA, xfB);
|
||||
touching = m_manifold.pointCount > 0;
|
||||
|
||||
// Match old contact ids to new contact ids and copy the
|
||||
// stored impulses to warm start the solver.
|
||||
for (int32 i = 0; i < m_manifold.pointCount; ++i)
|
||||
{
|
||||
b2ManifoldPoint* mp2 = m_manifold.points + i;
|
||||
mp2->normalImpulse = 0.0f;
|
||||
mp2->tangentImpulse = 0.0f;
|
||||
b2ContactID id2 = mp2->id;
|
||||
|
||||
for (int32 j = 0; j < oldManifold.pointCount; ++j)
|
||||
{
|
||||
b2ManifoldPoint* mp1 = oldManifold.points + j;
|
||||
|
||||
if (mp1->id.key == id2.key)
|
||||
{
|
||||
mp2->normalImpulse = mp1->normalImpulse;
|
||||
mp2->tangentImpulse = mp1->tangentImpulse;
|
||||
break;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
if (touching != wasTouching)
|
||||
{
|
||||
bodyA->SetAwake(true);
|
||||
bodyB->SetAwake(true);
|
||||
}
|
||||
}
|
||||
|
||||
if (touching)
|
||||
{
|
||||
m_flags |= e_touchingFlag;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_flags &= ~e_touchingFlag;
|
||||
}
|
||||
|
||||
if (wasTouching == false && touching == true && listener)
|
||||
{
|
||||
listener->BeginContact(this);
|
||||
}
|
||||
|
||||
if (wasTouching == true && touching == false && listener)
|
||||
{
|
||||
listener->EndContact(this);
|
||||
}
|
||||
|
||||
if (sensor == false && touching && listener)
|
||||
{
|
||||
listener->PreSolve(this, &oldManifold);
|
||||
}
|
||||
}
|
||||
-349
@@ -1,349 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CONTACT_H
|
||||
#define B2_CONTACT_H
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Collision/Shapes/b2Shape.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
|
||||
class b2Body;
|
||||
class b2Contact;
|
||||
class b2Fixture;
|
||||
class b2World;
|
||||
class b2BlockAllocator;
|
||||
class b2StackAllocator;
|
||||
class b2ContactListener;
|
||||
|
||||
/// Friction mixing law. The idea is to allow either fixture to drive the friction to zero.
|
||||
/// For example, anything slides on ice.
|
||||
inline float32 b2MixFriction(float32 friction1, float32 friction2)
|
||||
{
|
||||
return b2Sqrt(friction1 * friction2);
|
||||
}
|
||||
|
||||
/// Restitution mixing law. The idea is allow for anything to bounce off an inelastic surface.
|
||||
/// For example, a superball bounces on anything.
|
||||
inline float32 b2MixRestitution(float32 restitution1, float32 restitution2)
|
||||
{
|
||||
return restitution1 > restitution2 ? restitution1 : restitution2;
|
||||
}
|
||||
|
||||
typedef b2Contact* b2ContactCreateFcn( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB,
|
||||
b2BlockAllocator* allocator);
|
||||
typedef void b2ContactDestroyFcn(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
struct b2ContactRegister
|
||||
{
|
||||
b2ContactCreateFcn* createFcn;
|
||||
b2ContactDestroyFcn* destroyFcn;
|
||||
bool primary;
|
||||
};
|
||||
|
||||
/// A contact edge is used to connect bodies and contacts together
|
||||
/// in a contact graph where each body is a node and each contact
|
||||
/// is an edge. A contact edge belongs to a doubly linked list
|
||||
/// maintained in each attached body. Each contact has two contact
|
||||
/// nodes, one for each attached body.
|
||||
struct b2ContactEdge
|
||||
{
|
||||
b2Body* other; ///< provides quick access to the other body attached.
|
||||
b2Contact* contact; ///< the contact
|
||||
b2ContactEdge* prev; ///< the previous contact edge in the body's contact list
|
||||
b2ContactEdge* next; ///< the next contact edge in the body's contact list
|
||||
};
|
||||
|
||||
/// The class manages contact between two shapes. A contact exists for each overlapping
|
||||
/// AABB in the broad-phase (except if filtered). Therefore a contact object may exist
|
||||
/// that has no contact points.
|
||||
class b2Contact
|
||||
{
|
||||
public:
|
||||
|
||||
/// Get the contact manifold. Do not modify the manifold unless you understand the
|
||||
/// internals of Box2D.
|
||||
b2Manifold* GetManifold();
|
||||
const b2Manifold* GetManifold() const;
|
||||
|
||||
/// Get the world manifold.
|
||||
void GetWorldManifold(b2WorldManifold* worldManifold) const;
|
||||
|
||||
/// Is this contact touching?
|
||||
bool IsTouching() const;
|
||||
|
||||
/// Enable/disable this contact. This can be used inside the pre-solve
|
||||
/// contact listener. The contact is only disabled for the current
|
||||
/// time step (or sub-step in continuous collisions).
|
||||
void SetEnabled(bool flag);
|
||||
|
||||
/// Has this contact been disabled?
|
||||
bool IsEnabled() const;
|
||||
|
||||
/// Get the next contact in the world's contact list.
|
||||
b2Contact* GetNext();
|
||||
const b2Contact* GetNext() const;
|
||||
|
||||
/// Get fixture A in this contact.
|
||||
b2Fixture* GetFixtureA();
|
||||
const b2Fixture* GetFixtureA() const;
|
||||
|
||||
/// Get the child primitive index for fixture A.
|
||||
int32 GetChildIndexA() const;
|
||||
|
||||
/// Get fixture B in this contact.
|
||||
b2Fixture* GetFixtureB();
|
||||
const b2Fixture* GetFixtureB() const;
|
||||
|
||||
/// Get the child primitive index for fixture B.
|
||||
int32 GetChildIndexB() const;
|
||||
|
||||
/// Override the default friction mixture. You can call this in b2ContactListener::PreSolve.
|
||||
/// This value persists until set or reset.
|
||||
void SetFriction(float32 friction);
|
||||
|
||||
/// Get the friction.
|
||||
float32 GetFriction() const;
|
||||
|
||||
/// Reset the friction mixture to the default value.
|
||||
void ResetFriction();
|
||||
|
||||
/// Override the default restitution mixture. You can call this in b2ContactListener::PreSolve.
|
||||
/// The value persists until you set or reset.
|
||||
void SetRestitution(float32 restitution);
|
||||
|
||||
/// Get the restitution.
|
||||
float32 GetRestitution() const;
|
||||
|
||||
/// Reset the restitution to the default value.
|
||||
void ResetRestitution();
|
||||
|
||||
/// Set the desired tangent speed for a conveyor belt behavior. In meters per second.
|
||||
void SetTangentSpeed(float32 speed);
|
||||
|
||||
/// Get the desired tangent speed. In meters per second.
|
||||
float32 GetTangentSpeed() const;
|
||||
|
||||
/// Evaluate this contact with your own manifold and transforms.
|
||||
virtual void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) = 0;
|
||||
|
||||
protected:
|
||||
friend class b2ContactManager;
|
||||
friend class b2World;
|
||||
friend class b2ContactSolver;
|
||||
friend class b2Body;
|
||||
friend class b2Fixture;
|
||||
|
||||
// Flags stored in m_flags
|
||||
enum
|
||||
{
|
||||
// Used when crawling contact graph when forming islands.
|
||||
e_islandFlag = 0x0001,
|
||||
|
||||
// Set when the shapes are touching.
|
||||
e_touchingFlag = 0x0002,
|
||||
|
||||
// This contact can be disabled (by user)
|
||||
e_enabledFlag = 0x0004,
|
||||
|
||||
// This contact needs filtering because a fixture filter was changed.
|
||||
e_filterFlag = 0x0008,
|
||||
|
||||
// This bullet contact had a TOI event
|
||||
e_bulletHitFlag = 0x0010,
|
||||
|
||||
// This contact has a valid TOI in m_toi
|
||||
e_toiFlag = 0x0020
|
||||
};
|
||||
|
||||
/// Flag this contact for filtering. Filtering will occur the next time step.
|
||||
void FlagForFiltering();
|
||||
|
||||
static void AddType(b2ContactCreateFcn* createFcn, b2ContactDestroyFcn* destroyFcn,
|
||||
b2Shape::Type typeA, b2Shape::Type typeB);
|
||||
static void InitializeRegisters();
|
||||
static b2Contact* Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2Shape::Type typeA, b2Shape::Type typeB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2Contact() : m_fixtureA(nullptr), m_fixtureB(nullptr) {}
|
||||
b2Contact(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB);
|
||||
virtual ~b2Contact() {}
|
||||
|
||||
void Update(b2ContactListener* listener);
|
||||
|
||||
static b2ContactRegister s_registers[b2Shape::e_typeCount][b2Shape::e_typeCount];
|
||||
static bool s_initialized;
|
||||
|
||||
uint32 m_flags;
|
||||
|
||||
// World pool and list pointers.
|
||||
b2Contact* m_prev;
|
||||
b2Contact* m_next;
|
||||
|
||||
// Nodes for connecting bodies.
|
||||
b2ContactEdge m_nodeA;
|
||||
b2ContactEdge m_nodeB;
|
||||
|
||||
b2Fixture* m_fixtureA;
|
||||
b2Fixture* m_fixtureB;
|
||||
|
||||
int32 m_indexA;
|
||||
int32 m_indexB;
|
||||
|
||||
b2Manifold m_manifold;
|
||||
|
||||
int32 m_toiCount;
|
||||
float32 m_toi;
|
||||
|
||||
float32 m_friction;
|
||||
float32 m_restitution;
|
||||
|
||||
float32 m_tangentSpeed;
|
||||
};
|
||||
|
||||
inline b2Manifold* b2Contact::GetManifold()
|
||||
{
|
||||
return &m_manifold;
|
||||
}
|
||||
|
||||
inline const b2Manifold* b2Contact::GetManifold() const
|
||||
{
|
||||
return &m_manifold;
|
||||
}
|
||||
|
||||
inline void b2Contact::GetWorldManifold(b2WorldManifold* worldManifold) const
|
||||
{
|
||||
const b2Body* bodyA = m_fixtureA->GetBody();
|
||||
const b2Body* bodyB = m_fixtureB->GetBody();
|
||||
const b2Shape* shapeA = m_fixtureA->GetShape();
|
||||
const b2Shape* shapeB = m_fixtureB->GetShape();
|
||||
|
||||
worldManifold->Initialize(&m_manifold, bodyA->GetTransform(), shapeA->m_radius, bodyB->GetTransform(), shapeB->m_radius);
|
||||
}
|
||||
|
||||
inline void b2Contact::SetEnabled(bool flag)
|
||||
{
|
||||
if (flag)
|
||||
{
|
||||
m_flags |= e_enabledFlag;
|
||||
}
|
||||
else
|
||||
{
|
||||
m_flags &= ~e_enabledFlag;
|
||||
}
|
||||
}
|
||||
|
||||
inline bool b2Contact::IsEnabled() const
|
||||
{
|
||||
return (m_flags & e_enabledFlag) == e_enabledFlag;
|
||||
}
|
||||
|
||||
inline bool b2Contact::IsTouching() const
|
||||
{
|
||||
return (m_flags & e_touchingFlag) == e_touchingFlag;
|
||||
}
|
||||
|
||||
inline b2Contact* b2Contact::GetNext()
|
||||
{
|
||||
return m_next;
|
||||
}
|
||||
|
||||
inline const b2Contact* b2Contact::GetNext() const
|
||||
{
|
||||
return m_next;
|
||||
}
|
||||
|
||||
inline b2Fixture* b2Contact::GetFixtureA()
|
||||
{
|
||||
return m_fixtureA;
|
||||
}
|
||||
|
||||
inline const b2Fixture* b2Contact::GetFixtureA() const
|
||||
{
|
||||
return m_fixtureA;
|
||||
}
|
||||
|
||||
inline b2Fixture* b2Contact::GetFixtureB()
|
||||
{
|
||||
return m_fixtureB;
|
||||
}
|
||||
|
||||
inline int32 b2Contact::GetChildIndexA() const
|
||||
{
|
||||
return m_indexA;
|
||||
}
|
||||
|
||||
inline const b2Fixture* b2Contact::GetFixtureB() const
|
||||
{
|
||||
return m_fixtureB;
|
||||
}
|
||||
|
||||
inline int32 b2Contact::GetChildIndexB() const
|
||||
{
|
||||
return m_indexB;
|
||||
}
|
||||
|
||||
inline void b2Contact::FlagForFiltering()
|
||||
{
|
||||
m_flags |= e_filterFlag;
|
||||
}
|
||||
|
||||
inline void b2Contact::SetFriction(float32 friction)
|
||||
{
|
||||
m_friction = friction;
|
||||
}
|
||||
|
||||
inline float32 b2Contact::GetFriction() const
|
||||
{
|
||||
return m_friction;
|
||||
}
|
||||
|
||||
inline void b2Contact::ResetFriction()
|
||||
{
|
||||
m_friction = b2MixFriction(m_fixtureA->m_friction, m_fixtureB->m_friction);
|
||||
}
|
||||
|
||||
inline void b2Contact::SetRestitution(float32 restitution)
|
||||
{
|
||||
m_restitution = restitution;
|
||||
}
|
||||
|
||||
inline float32 b2Contact::GetRestitution() const
|
||||
{
|
||||
return m_restitution;
|
||||
}
|
||||
|
||||
inline void b2Contact::ResetRestitution()
|
||||
{
|
||||
m_restitution = b2MixRestitution(m_fixtureA->m_restitution, m_fixtureB->m_restitution);
|
||||
}
|
||||
|
||||
inline void b2Contact::SetTangentSpeed(float32 speed)
|
||||
{
|
||||
m_tangentSpeed = speed;
|
||||
}
|
||||
|
||||
inline float32 b2Contact::GetTangentSpeed() const
|
||||
{
|
||||
return m_tangentSpeed;
|
||||
}
|
||||
|
||||
#endif
|
||||
-838
@@ -1,838 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2011 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2ContactSolver.h"
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
#include "Box2D/Dynamics/b2Body.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Dynamics/b2World.h"
|
||||
#include "Box2D/Common/b2StackAllocator.h"
|
||||
|
||||
// Solver debugging is normally disabled because the block solver sometimes has to deal with a poorly conditioned effective mass matrix.
|
||||
#define B2_DEBUG_SOLVER 0
|
||||
|
||||
bool g_blockSolve = true;
|
||||
|
||||
struct b2ContactPositionConstraint
|
||||
{
|
||||
b2Vec2 localPoints[b2_maxManifoldPoints];
|
||||
b2Vec2 localNormal;
|
||||
b2Vec2 localPoint;
|
||||
int32 indexA;
|
||||
int32 indexB;
|
||||
float32 invMassA, invMassB;
|
||||
b2Vec2 localCenterA, localCenterB;
|
||||
float32 invIA, invIB;
|
||||
b2Manifold::Type type;
|
||||
float32 radiusA, radiusB;
|
||||
int32 pointCount;
|
||||
};
|
||||
|
||||
b2ContactSolver::b2ContactSolver(b2ContactSolverDef* def)
|
||||
{
|
||||
m_step = def->step;
|
||||
m_allocator = def->allocator;
|
||||
m_count = def->count;
|
||||
m_positionConstraints = (b2ContactPositionConstraint*)m_allocator->Allocate(m_count * sizeof(b2ContactPositionConstraint));
|
||||
m_velocityConstraints = (b2ContactVelocityConstraint*)m_allocator->Allocate(m_count * sizeof(b2ContactVelocityConstraint));
|
||||
m_positions = def->positions;
|
||||
m_velocities = def->velocities;
|
||||
m_contacts = def->contacts;
|
||||
|
||||
// Initialize position independent portions of the constraints.
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2Contact* contact = m_contacts[i];
|
||||
|
||||
b2Fixture* fixtureA = contact->m_fixtureA;
|
||||
b2Fixture* fixtureB = contact->m_fixtureB;
|
||||
b2Shape* shapeA = fixtureA->GetShape();
|
||||
b2Shape* shapeB = fixtureB->GetShape();
|
||||
float32 radiusA = shapeA->m_radius;
|
||||
float32 radiusB = shapeB->m_radius;
|
||||
b2Body* bodyA = fixtureA->GetBody();
|
||||
b2Body* bodyB = fixtureB->GetBody();
|
||||
b2Manifold* manifold = contact->GetManifold();
|
||||
|
||||
int32 pointCount = manifold->pointCount;
|
||||
b2Assert(pointCount > 0);
|
||||
|
||||
b2ContactVelocityConstraint* vc = m_velocityConstraints + i;
|
||||
vc->friction = contact->m_friction;
|
||||
vc->restitution = contact->m_restitution;
|
||||
vc->tangentSpeed = contact->m_tangentSpeed;
|
||||
vc->indexA = bodyA->m_islandIndex;
|
||||
vc->indexB = bodyB->m_islandIndex;
|
||||
vc->invMassA = bodyA->m_invMass;
|
||||
vc->invMassB = bodyB->m_invMass;
|
||||
vc->invIA = bodyA->m_invI;
|
||||
vc->invIB = bodyB->m_invI;
|
||||
vc->contactIndex = i;
|
||||
vc->pointCount = pointCount;
|
||||
vc->K.SetZero();
|
||||
vc->normalMass.SetZero();
|
||||
|
||||
b2ContactPositionConstraint* pc = m_positionConstraints + i;
|
||||
pc->indexA = bodyA->m_islandIndex;
|
||||
pc->indexB = bodyB->m_islandIndex;
|
||||
pc->invMassA = bodyA->m_invMass;
|
||||
pc->invMassB = bodyB->m_invMass;
|
||||
pc->localCenterA = bodyA->m_sweep.localCenter;
|
||||
pc->localCenterB = bodyB->m_sweep.localCenter;
|
||||
pc->invIA = bodyA->m_invI;
|
||||
pc->invIB = bodyB->m_invI;
|
||||
pc->localNormal = manifold->localNormal;
|
||||
pc->localPoint = manifold->localPoint;
|
||||
pc->pointCount = pointCount;
|
||||
pc->radiusA = radiusA;
|
||||
pc->radiusB = radiusB;
|
||||
pc->type = manifold->type;
|
||||
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2ManifoldPoint* cp = manifold->points + j;
|
||||
b2VelocityConstraintPoint* vcp = vc->points + j;
|
||||
|
||||
if (m_step.warmStarting)
|
||||
{
|
||||
vcp->normalImpulse = m_step.dtRatio * cp->normalImpulse;
|
||||
vcp->tangentImpulse = m_step.dtRatio * cp->tangentImpulse;
|
||||
}
|
||||
else
|
||||
{
|
||||
vcp->normalImpulse = 0.0f;
|
||||
vcp->tangentImpulse = 0.0f;
|
||||
}
|
||||
|
||||
vcp->rA.SetZero();
|
||||
vcp->rB.SetZero();
|
||||
vcp->normalMass = 0.0f;
|
||||
vcp->tangentMass = 0.0f;
|
||||
vcp->velocityBias = 0.0f;
|
||||
|
||||
pc->localPoints[j] = cp->localPoint;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
b2ContactSolver::~b2ContactSolver()
|
||||
{
|
||||
m_allocator->Free(m_velocityConstraints);
|
||||
m_allocator->Free(m_positionConstraints);
|
||||
}
|
||||
|
||||
// Initialize position dependent portions of the velocity constraints.
|
||||
void b2ContactSolver::InitializeVelocityConstraints()
|
||||
{
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2ContactVelocityConstraint* vc = m_velocityConstraints + i;
|
||||
b2ContactPositionConstraint* pc = m_positionConstraints + i;
|
||||
|
||||
float32 radiusA = pc->radiusA;
|
||||
float32 radiusB = pc->radiusB;
|
||||
b2Manifold* manifold = m_contacts[vc->contactIndex]->GetManifold();
|
||||
|
||||
int32 indexA = vc->indexA;
|
||||
int32 indexB = vc->indexB;
|
||||
|
||||
float32 mA = vc->invMassA;
|
||||
float32 mB = vc->invMassB;
|
||||
float32 iA = vc->invIA;
|
||||
float32 iB = vc->invIB;
|
||||
b2Vec2 localCenterA = pc->localCenterA;
|
||||
b2Vec2 localCenterB = pc->localCenterB;
|
||||
|
||||
b2Vec2 cA = m_positions[indexA].c;
|
||||
float32 aA = m_positions[indexA].a;
|
||||
b2Vec2 vA = m_velocities[indexA].v;
|
||||
float32 wA = m_velocities[indexA].w;
|
||||
|
||||
b2Vec2 cB = m_positions[indexB].c;
|
||||
float32 aB = m_positions[indexB].a;
|
||||
b2Vec2 vB = m_velocities[indexB].v;
|
||||
float32 wB = m_velocities[indexB].w;
|
||||
|
||||
b2Assert(manifold->pointCount > 0);
|
||||
|
||||
b2Transform xfA, xfB;
|
||||
xfA.q.Set(aA);
|
||||
xfB.q.Set(aB);
|
||||
xfA.p = cA - b2Mul(xfA.q, localCenterA);
|
||||
xfB.p = cB - b2Mul(xfB.q, localCenterB);
|
||||
|
||||
b2WorldManifold worldManifold;
|
||||
worldManifold.Initialize(manifold, xfA, radiusA, xfB, radiusB);
|
||||
|
||||
vc->normal = worldManifold.normal;
|
||||
|
||||
int32 pointCount = vc->pointCount;
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2VelocityConstraintPoint* vcp = vc->points + j;
|
||||
|
||||
vcp->rA = worldManifold.points[j] - cA;
|
||||
vcp->rB = worldManifold.points[j] - cB;
|
||||
|
||||
float32 rnA = b2Cross(vcp->rA, vc->normal);
|
||||
float32 rnB = b2Cross(vcp->rB, vc->normal);
|
||||
|
||||
float32 kNormal = mA + mB + iA * rnA * rnA + iB * rnB * rnB;
|
||||
|
||||
vcp->normalMass = kNormal > 0.0f ? 1.0f / kNormal : 0.0f;
|
||||
|
||||
b2Vec2 tangent = b2Cross(vc->normal, 1.0f);
|
||||
|
||||
float32 rtA = b2Cross(vcp->rA, tangent);
|
||||
float32 rtB = b2Cross(vcp->rB, tangent);
|
||||
|
||||
float32 kTangent = mA + mB + iA * rtA * rtA + iB * rtB * rtB;
|
||||
|
||||
vcp->tangentMass = kTangent > 0.0f ? 1.0f / kTangent : 0.0f;
|
||||
|
||||
// Setup a velocity bias for restitution.
|
||||
vcp->velocityBias = 0.0f;
|
||||
float32 vRel = b2Dot(vc->normal, vB + b2Cross(wB, vcp->rB) - vA - b2Cross(wA, vcp->rA));
|
||||
if (vRel < -b2_velocityThreshold)
|
||||
{
|
||||
vcp->velocityBias = -vc->restitution * vRel;
|
||||
}
|
||||
}
|
||||
|
||||
// If we have two points, then prepare the block solver.
|
||||
if (vc->pointCount == 2 && g_blockSolve)
|
||||
{
|
||||
b2VelocityConstraintPoint* vcp1 = vc->points + 0;
|
||||
b2VelocityConstraintPoint* vcp2 = vc->points + 1;
|
||||
|
||||
float32 rn1A = b2Cross(vcp1->rA, vc->normal);
|
||||
float32 rn1B = b2Cross(vcp1->rB, vc->normal);
|
||||
float32 rn2A = b2Cross(vcp2->rA, vc->normal);
|
||||
float32 rn2B = b2Cross(vcp2->rB, vc->normal);
|
||||
|
||||
float32 k11 = mA + mB + iA * rn1A * rn1A + iB * rn1B * rn1B;
|
||||
float32 k22 = mA + mB + iA * rn2A * rn2A + iB * rn2B * rn2B;
|
||||
float32 k12 = mA + mB + iA * rn1A * rn2A + iB * rn1B * rn2B;
|
||||
|
||||
// Ensure a reasonable condition number.
|
||||
const float32 k_maxConditionNumber = 1000.0f;
|
||||
if (k11 * k11 < k_maxConditionNumber * (k11 * k22 - k12 * k12))
|
||||
{
|
||||
// K is safe to invert.
|
||||
vc->K.ex.Set(k11, k12);
|
||||
vc->K.ey.Set(k12, k22);
|
||||
vc->normalMass = vc->K.GetInverse();
|
||||
}
|
||||
else
|
||||
{
|
||||
// The constraints are redundant, just use one.
|
||||
// TODO_ERIN use deepest?
|
||||
vc->pointCount = 1;
|
||||
}
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
void b2ContactSolver::WarmStart()
|
||||
{
|
||||
// Warm start.
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2ContactVelocityConstraint* vc = m_velocityConstraints + i;
|
||||
|
||||
int32 indexA = vc->indexA;
|
||||
int32 indexB = vc->indexB;
|
||||
float32 mA = vc->invMassA;
|
||||
float32 iA = vc->invIA;
|
||||
float32 mB = vc->invMassB;
|
||||
float32 iB = vc->invIB;
|
||||
int32 pointCount = vc->pointCount;
|
||||
|
||||
b2Vec2 vA = m_velocities[indexA].v;
|
||||
float32 wA = m_velocities[indexA].w;
|
||||
b2Vec2 vB = m_velocities[indexB].v;
|
||||
float32 wB = m_velocities[indexB].w;
|
||||
|
||||
b2Vec2 normal = vc->normal;
|
||||
b2Vec2 tangent = b2Cross(normal, 1.0f);
|
||||
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2VelocityConstraintPoint* vcp = vc->points + j;
|
||||
b2Vec2 P = vcp->normalImpulse * normal + vcp->tangentImpulse * tangent;
|
||||
wA -= iA * b2Cross(vcp->rA, P);
|
||||
vA -= mA * P;
|
||||
wB += iB * b2Cross(vcp->rB, P);
|
||||
vB += mB * P;
|
||||
}
|
||||
|
||||
m_velocities[indexA].v = vA;
|
||||
m_velocities[indexA].w = wA;
|
||||
m_velocities[indexB].v = vB;
|
||||
m_velocities[indexB].w = wB;
|
||||
}
|
||||
}
|
||||
|
||||
void b2ContactSolver::SolveVelocityConstraints()
|
||||
{
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2ContactVelocityConstraint* vc = m_velocityConstraints + i;
|
||||
|
||||
int32 indexA = vc->indexA;
|
||||
int32 indexB = vc->indexB;
|
||||
float32 mA = vc->invMassA;
|
||||
float32 iA = vc->invIA;
|
||||
float32 mB = vc->invMassB;
|
||||
float32 iB = vc->invIB;
|
||||
int32 pointCount = vc->pointCount;
|
||||
|
||||
b2Vec2 vA = m_velocities[indexA].v;
|
||||
float32 wA = m_velocities[indexA].w;
|
||||
b2Vec2 vB = m_velocities[indexB].v;
|
||||
float32 wB = m_velocities[indexB].w;
|
||||
|
||||
b2Vec2 normal = vc->normal;
|
||||
b2Vec2 tangent = b2Cross(normal, 1.0f);
|
||||
float32 friction = vc->friction;
|
||||
|
||||
b2Assert(pointCount == 1 || pointCount == 2);
|
||||
|
||||
// Solve tangent constraints first because non-penetration is more important
|
||||
// than friction.
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2VelocityConstraintPoint* vcp = vc->points + j;
|
||||
|
||||
// Relative velocity at contact
|
||||
b2Vec2 dv = vB + b2Cross(wB, vcp->rB) - vA - b2Cross(wA, vcp->rA);
|
||||
|
||||
// Compute tangent force
|
||||
float32 vt = b2Dot(dv, tangent) - vc->tangentSpeed;
|
||||
float32 lambda = vcp->tangentMass * (-vt);
|
||||
|
||||
// b2Clamp the accumulated force
|
||||
float32 maxFriction = friction * vcp->normalImpulse;
|
||||
float32 newImpulse = b2Clamp(vcp->tangentImpulse + lambda, -maxFriction, maxFriction);
|
||||
lambda = newImpulse - vcp->tangentImpulse;
|
||||
vcp->tangentImpulse = newImpulse;
|
||||
|
||||
// Apply contact impulse
|
||||
b2Vec2 P = lambda * tangent;
|
||||
|
||||
vA -= mA * P;
|
||||
wA -= iA * b2Cross(vcp->rA, P);
|
||||
|
||||
vB += mB * P;
|
||||
wB += iB * b2Cross(vcp->rB, P);
|
||||
}
|
||||
|
||||
// Solve normal constraints
|
||||
if (pointCount == 1 || g_blockSolve == false)
|
||||
{
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2VelocityConstraintPoint* vcp = vc->points + j;
|
||||
|
||||
// Relative velocity at contact
|
||||
b2Vec2 dv = vB + b2Cross(wB, vcp->rB) - vA - b2Cross(wA, vcp->rA);
|
||||
|
||||
// Compute normal impulse
|
||||
float32 vn = b2Dot(dv, normal);
|
||||
float32 lambda = -vcp->normalMass * (vn - vcp->velocityBias);
|
||||
|
||||
// b2Clamp the accumulated impulse
|
||||
float32 newImpulse = b2Max(vcp->normalImpulse + lambda, 0.0f);
|
||||
lambda = newImpulse - vcp->normalImpulse;
|
||||
vcp->normalImpulse = newImpulse;
|
||||
|
||||
// Apply contact impulse
|
||||
b2Vec2 P = lambda * normal;
|
||||
vA -= mA * P;
|
||||
wA -= iA * b2Cross(vcp->rA, P);
|
||||
|
||||
vB += mB * P;
|
||||
wB += iB * b2Cross(vcp->rB, P);
|
||||
}
|
||||
}
|
||||
else
|
||||
{
|
||||
// Block solver developed in collaboration with Dirk Gregorius (back in 01/07 on Box2D_Lite).
|
||||
// Build the mini LCP for this contact patch
|
||||
//
|
||||
// vn = A * x + b, vn >= 0, x >= 0 and vn_i * x_i = 0 with i = 1..2
|
||||
//
|
||||
// A = J * W * JT and J = ( -n, -r1 x n, n, r2 x n )
|
||||
// b = vn0 - velocityBias
|
||||
//
|
||||
// The system is solved using the "Total enumeration method" (s. Murty). The complementary constraint vn_i * x_i
|
||||
// implies that we must have in any solution either vn_i = 0 or x_i = 0. So for the 2D contact problem the cases
|
||||
// vn1 = 0 and vn2 = 0, x1 = 0 and x2 = 0, x1 = 0 and vn2 = 0, x2 = 0 and vn1 = 0 need to be tested. The first valid
|
||||
// solution that satisfies the problem is chosen.
|
||||
//
|
||||
// In order to account of the accumulated impulse 'a' (because of the iterative nature of the solver which only requires
|
||||
// that the accumulated impulse is clamped and not the incremental impulse) we change the impulse variable (x_i).
|
||||
//
|
||||
// Substitute:
|
||||
//
|
||||
// x = a + d
|
||||
//
|
||||
// a := old total impulse
|
||||
// x := new total impulse
|
||||
// d := incremental impulse
|
||||
//
|
||||
// For the current iteration we extend the formula for the incremental impulse
|
||||
// to compute the new total impulse:
|
||||
//
|
||||
// vn = A * d + b
|
||||
// = A * (x - a) + b
|
||||
// = A * x + b - A * a
|
||||
// = A * x + b'
|
||||
// b' = b - A * a;
|
||||
|
||||
b2VelocityConstraintPoint* cp1 = vc->points + 0;
|
||||
b2VelocityConstraintPoint* cp2 = vc->points + 1;
|
||||
|
||||
b2Vec2 a(cp1->normalImpulse, cp2->normalImpulse);
|
||||
b2Assert(a.x >= 0.0f && a.y >= 0.0f);
|
||||
|
||||
// Relative velocity at contact
|
||||
b2Vec2 dv1 = vB + b2Cross(wB, cp1->rB) - vA - b2Cross(wA, cp1->rA);
|
||||
b2Vec2 dv2 = vB + b2Cross(wB, cp2->rB) - vA - b2Cross(wA, cp2->rA);
|
||||
|
||||
// Compute normal velocity
|
||||
float32 vn1 = b2Dot(dv1, normal);
|
||||
float32 vn2 = b2Dot(dv2, normal);
|
||||
|
||||
b2Vec2 b;
|
||||
b.x = vn1 - cp1->velocityBias;
|
||||
b.y = vn2 - cp2->velocityBias;
|
||||
|
||||
// Compute b'
|
||||
b -= b2Mul(vc->K, a);
|
||||
|
||||
const float32 k_errorTol = 1e-3f;
|
||||
B2_NOT_USED(k_errorTol);
|
||||
|
||||
for (;;)
|
||||
{
|
||||
//
|
||||
// Case 1: vn = 0
|
||||
//
|
||||
// 0 = A * x + b'
|
||||
//
|
||||
// Solve for x:
|
||||
//
|
||||
// x = - inv(A) * b'
|
||||
//
|
||||
b2Vec2 x = - b2Mul(vc->normalMass, b);
|
||||
|
||||
if (x.x >= 0.0f && x.y >= 0.0f)
|
||||
{
|
||||
// Get the incremental impulse
|
||||
b2Vec2 d = x - a;
|
||||
|
||||
// Apply incremental impulse
|
||||
b2Vec2 P1 = d.x * normal;
|
||||
b2Vec2 P2 = d.y * normal;
|
||||
vA -= mA * (P1 + P2);
|
||||
wA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));
|
||||
|
||||
vB += mB * (P1 + P2);
|
||||
wB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));
|
||||
|
||||
// Accumulate
|
||||
cp1->normalImpulse = x.x;
|
||||
cp2->normalImpulse = x.y;
|
||||
|
||||
#if B2_DEBUG_SOLVER == 1
|
||||
// Postconditions
|
||||
dv1 = vB + b2Cross(wB, cp1->rB) - vA - b2Cross(wA, cp1->rA);
|
||||
dv2 = vB + b2Cross(wB, cp2->rB) - vA - b2Cross(wA, cp2->rA);
|
||||
|
||||
// Compute normal velocity
|
||||
vn1 = b2Dot(dv1, normal);
|
||||
vn2 = b2Dot(dv2, normal);
|
||||
|
||||
b2Assert(b2Abs(vn1 - cp1->velocityBias) < k_errorTol);
|
||||
b2Assert(b2Abs(vn2 - cp2->velocityBias) < k_errorTol);
|
||||
#endif
|
||||
break;
|
||||
}
|
||||
|
||||
//
|
||||
// Case 2: vn1 = 0 and x2 = 0
|
||||
//
|
||||
// 0 = a11 * x1 + a12 * 0 + b1'
|
||||
// vn2 = a21 * x1 + a22 * 0 + b2'
|
||||
//
|
||||
x.x = - cp1->normalMass * b.x;
|
||||
x.y = 0.0f;
|
||||
vn1 = 0.0f;
|
||||
vn2 = vc->K.ex.y * x.x + b.y;
|
||||
if (x.x >= 0.0f && vn2 >= 0.0f)
|
||||
{
|
||||
// Get the incremental impulse
|
||||
b2Vec2 d = x - a;
|
||||
|
||||
// Apply incremental impulse
|
||||
b2Vec2 P1 = d.x * normal;
|
||||
b2Vec2 P2 = d.y * normal;
|
||||
vA -= mA * (P1 + P2);
|
||||
wA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));
|
||||
|
||||
vB += mB * (P1 + P2);
|
||||
wB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));
|
||||
|
||||
// Accumulate
|
||||
cp1->normalImpulse = x.x;
|
||||
cp2->normalImpulse = x.y;
|
||||
|
||||
#if B2_DEBUG_SOLVER == 1
|
||||
// Postconditions
|
||||
dv1 = vB + b2Cross(wB, cp1->rB) - vA - b2Cross(wA, cp1->rA);
|
||||
|
||||
// Compute normal velocity
|
||||
vn1 = b2Dot(dv1, normal);
|
||||
|
||||
b2Assert(b2Abs(vn1 - cp1->velocityBias) < k_errorTol);
|
||||
#endif
|
||||
break;
|
||||
}
|
||||
|
||||
|
||||
//
|
||||
// Case 3: vn2 = 0 and x1 = 0
|
||||
//
|
||||
// vn1 = a11 * 0 + a12 * x2 + b1'
|
||||
// 0 = a21 * 0 + a22 * x2 + b2'
|
||||
//
|
||||
x.x = 0.0f;
|
||||
x.y = - cp2->normalMass * b.y;
|
||||
vn1 = vc->K.ey.x * x.y + b.x;
|
||||
vn2 = 0.0f;
|
||||
|
||||
if (x.y >= 0.0f && vn1 >= 0.0f)
|
||||
{
|
||||
// Resubstitute for the incremental impulse
|
||||
b2Vec2 d = x - a;
|
||||
|
||||
// Apply incremental impulse
|
||||
b2Vec2 P1 = d.x * normal;
|
||||
b2Vec2 P2 = d.y * normal;
|
||||
vA -= mA * (P1 + P2);
|
||||
wA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));
|
||||
|
||||
vB += mB * (P1 + P2);
|
||||
wB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));
|
||||
|
||||
// Accumulate
|
||||
cp1->normalImpulse = x.x;
|
||||
cp2->normalImpulse = x.y;
|
||||
|
||||
#if B2_DEBUG_SOLVER == 1
|
||||
// Postconditions
|
||||
dv2 = vB + b2Cross(wB, cp2->rB) - vA - b2Cross(wA, cp2->rA);
|
||||
|
||||
// Compute normal velocity
|
||||
vn2 = b2Dot(dv2, normal);
|
||||
|
||||
b2Assert(b2Abs(vn2 - cp2->velocityBias) < k_errorTol);
|
||||
#endif
|
||||
break;
|
||||
}
|
||||
|
||||
//
|
||||
// Case 4: x1 = 0 and x2 = 0
|
||||
//
|
||||
// vn1 = b1
|
||||
// vn2 = b2;
|
||||
x.x = 0.0f;
|
||||
x.y = 0.0f;
|
||||
vn1 = b.x;
|
||||
vn2 = b.y;
|
||||
|
||||
if (vn1 >= 0.0f && vn2 >= 0.0f )
|
||||
{
|
||||
// Resubstitute for the incremental impulse
|
||||
b2Vec2 d = x - a;
|
||||
|
||||
// Apply incremental impulse
|
||||
b2Vec2 P1 = d.x * normal;
|
||||
b2Vec2 P2 = d.y * normal;
|
||||
vA -= mA * (P1 + P2);
|
||||
wA -= iA * (b2Cross(cp1->rA, P1) + b2Cross(cp2->rA, P2));
|
||||
|
||||
vB += mB * (P1 + P2);
|
||||
wB += iB * (b2Cross(cp1->rB, P1) + b2Cross(cp2->rB, P2));
|
||||
|
||||
// Accumulate
|
||||
cp1->normalImpulse = x.x;
|
||||
cp2->normalImpulse = x.y;
|
||||
|
||||
break;
|
||||
}
|
||||
|
||||
// No solution, give up. This is hit sometimes, but it doesn't seem to matter.
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
m_velocities[indexA].v = vA;
|
||||
m_velocities[indexA].w = wA;
|
||||
m_velocities[indexB].v = vB;
|
||||
m_velocities[indexB].w = wB;
|
||||
}
|
||||
}
|
||||
|
||||
void b2ContactSolver::StoreImpulses()
|
||||
{
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2ContactVelocityConstraint* vc = m_velocityConstraints + i;
|
||||
b2Manifold* manifold = m_contacts[vc->contactIndex]->GetManifold();
|
||||
|
||||
for (int32 j = 0; j < vc->pointCount; ++j)
|
||||
{
|
||||
manifold->points[j].normalImpulse = vc->points[j].normalImpulse;
|
||||
manifold->points[j].tangentImpulse = vc->points[j].tangentImpulse;
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
struct b2PositionSolverManifold
|
||||
{
|
||||
void Initialize(b2ContactPositionConstraint* pc, const b2Transform& xfA, const b2Transform& xfB, int32 index)
|
||||
{
|
||||
b2Assert(pc->pointCount > 0);
|
||||
|
||||
switch (pc->type)
|
||||
{
|
||||
case b2Manifold::e_circles:
|
||||
{
|
||||
b2Vec2 pointA = b2Mul(xfA, pc->localPoint);
|
||||
b2Vec2 pointB = b2Mul(xfB, pc->localPoints[0]);
|
||||
normal = pointB - pointA;
|
||||
normal.Normalize();
|
||||
point = 0.5f * (pointA + pointB);
|
||||
separation = b2Dot(pointB - pointA, normal) - pc->radiusA - pc->radiusB;
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Manifold::e_faceA:
|
||||
{
|
||||
normal = b2Mul(xfA.q, pc->localNormal);
|
||||
b2Vec2 planePoint = b2Mul(xfA, pc->localPoint);
|
||||
|
||||
b2Vec2 clipPoint = b2Mul(xfB, pc->localPoints[index]);
|
||||
separation = b2Dot(clipPoint - planePoint, normal) - pc->radiusA - pc->radiusB;
|
||||
point = clipPoint;
|
||||
}
|
||||
break;
|
||||
|
||||
case b2Manifold::e_faceB:
|
||||
{
|
||||
normal = b2Mul(xfB.q, pc->localNormal);
|
||||
b2Vec2 planePoint = b2Mul(xfB, pc->localPoint);
|
||||
|
||||
b2Vec2 clipPoint = b2Mul(xfA, pc->localPoints[index]);
|
||||
separation = b2Dot(clipPoint - planePoint, normal) - pc->radiusA - pc->radiusB;
|
||||
point = clipPoint;
|
||||
|
||||
// Ensure normal points from A to B
|
||||
normal = -normal;
|
||||
}
|
||||
break;
|
||||
}
|
||||
}
|
||||
|
||||
b2Vec2 normal;
|
||||
b2Vec2 point;
|
||||
float32 separation;
|
||||
};
|
||||
|
||||
// Sequential solver.
|
||||
bool b2ContactSolver::SolvePositionConstraints()
|
||||
{
|
||||
float32 minSeparation = 0.0f;
|
||||
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2ContactPositionConstraint* pc = m_positionConstraints + i;
|
||||
|
||||
int32 indexA = pc->indexA;
|
||||
int32 indexB = pc->indexB;
|
||||
b2Vec2 localCenterA = pc->localCenterA;
|
||||
float32 mA = pc->invMassA;
|
||||
float32 iA = pc->invIA;
|
||||
b2Vec2 localCenterB = pc->localCenterB;
|
||||
float32 mB = pc->invMassB;
|
||||
float32 iB = pc->invIB;
|
||||
int32 pointCount = pc->pointCount;
|
||||
|
||||
b2Vec2 cA = m_positions[indexA].c;
|
||||
float32 aA = m_positions[indexA].a;
|
||||
|
||||
b2Vec2 cB = m_positions[indexB].c;
|
||||
float32 aB = m_positions[indexB].a;
|
||||
|
||||
// Solve normal constraints
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2Transform xfA, xfB;
|
||||
xfA.q.Set(aA);
|
||||
xfB.q.Set(aB);
|
||||
xfA.p = cA - b2Mul(xfA.q, localCenterA);
|
||||
xfB.p = cB - b2Mul(xfB.q, localCenterB);
|
||||
|
||||
b2PositionSolverManifold psm;
|
||||
psm.Initialize(pc, xfA, xfB, j);
|
||||
b2Vec2 normal = psm.normal;
|
||||
|
||||
b2Vec2 point = psm.point;
|
||||
float32 separation = psm.separation;
|
||||
|
||||
b2Vec2 rA = point - cA;
|
||||
b2Vec2 rB = point - cB;
|
||||
|
||||
// Track max constraint error.
|
||||
minSeparation = b2Min(minSeparation, separation);
|
||||
|
||||
// Prevent large corrections and allow slop.
|
||||
float32 C = b2Clamp(b2_baumgarte * (separation + b2_linearSlop), -b2_maxLinearCorrection, 0.0f);
|
||||
|
||||
// Compute the effective mass.
|
||||
float32 rnA = b2Cross(rA, normal);
|
||||
float32 rnB = b2Cross(rB, normal);
|
||||
float32 K = mA + mB + iA * rnA * rnA + iB * rnB * rnB;
|
||||
|
||||
// Compute normal impulse
|
||||
float32 impulse = K > 0.0f ? - C / K : 0.0f;
|
||||
|
||||
b2Vec2 P = impulse * normal;
|
||||
|
||||
cA -= mA * P;
|
||||
aA -= iA * b2Cross(rA, P);
|
||||
|
||||
cB += mB * P;
|
||||
aB += iB * b2Cross(rB, P);
|
||||
}
|
||||
|
||||
m_positions[indexA].c = cA;
|
||||
m_positions[indexA].a = aA;
|
||||
|
||||
m_positions[indexB].c = cB;
|
||||
m_positions[indexB].a = aB;
|
||||
}
|
||||
|
||||
// We can't expect minSpeparation >= -b2_linearSlop because we don't
|
||||
// push the separation above -b2_linearSlop.
|
||||
return minSeparation >= -3.0f * b2_linearSlop;
|
||||
}
|
||||
|
||||
// Sequential position solver for position constraints.
|
||||
bool b2ContactSolver::SolveTOIPositionConstraints(int32 toiIndexA, int32 toiIndexB)
|
||||
{
|
||||
float32 minSeparation = 0.0f;
|
||||
|
||||
for (int32 i = 0; i < m_count; ++i)
|
||||
{
|
||||
b2ContactPositionConstraint* pc = m_positionConstraints + i;
|
||||
|
||||
int32 indexA = pc->indexA;
|
||||
int32 indexB = pc->indexB;
|
||||
b2Vec2 localCenterA = pc->localCenterA;
|
||||
b2Vec2 localCenterB = pc->localCenterB;
|
||||
int32 pointCount = pc->pointCount;
|
||||
|
||||
float32 mA = 0.0f;
|
||||
float32 iA = 0.0f;
|
||||
if (indexA == toiIndexA || indexA == toiIndexB)
|
||||
{
|
||||
mA = pc->invMassA;
|
||||
iA = pc->invIA;
|
||||
}
|
||||
|
||||
float32 mB = 0.0f;
|
||||
float32 iB = 0.;
|
||||
if (indexB == toiIndexA || indexB == toiIndexB)
|
||||
{
|
||||
mB = pc->invMassB;
|
||||
iB = pc->invIB;
|
||||
}
|
||||
|
||||
b2Vec2 cA = m_positions[indexA].c;
|
||||
float32 aA = m_positions[indexA].a;
|
||||
|
||||
b2Vec2 cB = m_positions[indexB].c;
|
||||
float32 aB = m_positions[indexB].a;
|
||||
|
||||
// Solve normal constraints
|
||||
for (int32 j = 0; j < pointCount; ++j)
|
||||
{
|
||||
b2Transform xfA, xfB;
|
||||
xfA.q.Set(aA);
|
||||
xfB.q.Set(aB);
|
||||
xfA.p = cA - b2Mul(xfA.q, localCenterA);
|
||||
xfB.p = cB - b2Mul(xfB.q, localCenterB);
|
||||
|
||||
b2PositionSolverManifold psm;
|
||||
psm.Initialize(pc, xfA, xfB, j);
|
||||
b2Vec2 normal = psm.normal;
|
||||
|
||||
b2Vec2 point = psm.point;
|
||||
float32 separation = psm.separation;
|
||||
|
||||
b2Vec2 rA = point - cA;
|
||||
b2Vec2 rB = point - cB;
|
||||
|
||||
// Track max constraint error.
|
||||
minSeparation = b2Min(minSeparation, separation);
|
||||
|
||||
// Prevent large corrections and allow slop.
|
||||
float32 C = b2Clamp(b2_toiBaugarte * (separation + b2_linearSlop), -b2_maxLinearCorrection, 0.0f);
|
||||
|
||||
// Compute the effective mass.
|
||||
float32 rnA = b2Cross(rA, normal);
|
||||
float32 rnB = b2Cross(rB, normal);
|
||||
float32 K = mA + mB + iA * rnA * rnA + iB * rnB * rnB;
|
||||
|
||||
// Compute normal impulse
|
||||
float32 impulse = K > 0.0f ? - C / K : 0.0f;
|
||||
|
||||
b2Vec2 P = impulse * normal;
|
||||
|
||||
cA -= mA * P;
|
||||
aA -= iA * b2Cross(rA, P);
|
||||
|
||||
cB += mB * P;
|
||||
aB += iB * b2Cross(rB, P);
|
||||
}
|
||||
|
||||
m_positions[indexA].c = cA;
|
||||
m_positions[indexA].a = aA;
|
||||
|
||||
m_positions[indexB].c = cB;
|
||||
m_positions[indexB].a = aB;
|
||||
}
|
||||
|
||||
// We can't expect minSpeparation >= -b2_linearSlop because we don't
|
||||
// push the separation above -b2_linearSlop.
|
||||
return minSeparation >= -1.5f * b2_linearSlop;
|
||||
}
|
||||
-95
@@ -1,95 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_CONTACT_SOLVER_H
|
||||
#define B2_CONTACT_SOLVER_H
|
||||
|
||||
#include "Box2D/Common/b2Math.h"
|
||||
#include "Box2D/Collision/b2Collision.h"
|
||||
#include "Box2D/Dynamics/b2TimeStep.h"
|
||||
|
||||
class b2Contact;
|
||||
class b2Body;
|
||||
class b2StackAllocator;
|
||||
struct b2ContactPositionConstraint;
|
||||
|
||||
struct b2VelocityConstraintPoint
|
||||
{
|
||||
b2Vec2 rA;
|
||||
b2Vec2 rB;
|
||||
float32 normalImpulse;
|
||||
float32 tangentImpulse;
|
||||
float32 normalMass;
|
||||
float32 tangentMass;
|
||||
float32 velocityBias;
|
||||
};
|
||||
|
||||
struct b2ContactVelocityConstraint
|
||||
{
|
||||
b2VelocityConstraintPoint points[b2_maxManifoldPoints];
|
||||
b2Vec2 normal;
|
||||
b2Mat22 normalMass;
|
||||
b2Mat22 K;
|
||||
int32 indexA;
|
||||
int32 indexB;
|
||||
float32 invMassA, invMassB;
|
||||
float32 invIA, invIB;
|
||||
float32 friction;
|
||||
float32 restitution;
|
||||
float32 tangentSpeed;
|
||||
int32 pointCount;
|
||||
int32 contactIndex;
|
||||
};
|
||||
|
||||
struct b2ContactSolverDef
|
||||
{
|
||||
b2TimeStep step;
|
||||
b2Contact** contacts;
|
||||
int32 count;
|
||||
b2Position* positions;
|
||||
b2Velocity* velocities;
|
||||
b2StackAllocator* allocator;
|
||||
};
|
||||
|
||||
class b2ContactSolver
|
||||
{
|
||||
public:
|
||||
b2ContactSolver(b2ContactSolverDef* def);
|
||||
~b2ContactSolver();
|
||||
|
||||
void InitializeVelocityConstraints();
|
||||
|
||||
void WarmStart();
|
||||
void SolveVelocityConstraints();
|
||||
void StoreImpulses();
|
||||
|
||||
bool SolvePositionConstraints();
|
||||
bool SolveTOIPositionConstraints(int32 toiIndexA, int32 toiIndexB);
|
||||
|
||||
b2TimeStep m_step;
|
||||
b2Position* m_positions;
|
||||
b2Velocity* m_velocities;
|
||||
b2StackAllocator* m_allocator;
|
||||
b2ContactPositionConstraint* m_positionConstraints;
|
||||
b2ContactVelocityConstraint* m_velocityConstraints;
|
||||
b2Contact** m_contacts;
|
||||
int m_count;
|
||||
};
|
||||
|
||||
#endif
|
||||
|
||||
-49
@@ -1,49 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2EdgeAndCircleContact.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2EdgeAndCircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2EdgeAndCircleContact));
|
||||
return new (mem) b2EdgeAndCircleContact(fixtureA, fixtureB);
|
||||
}
|
||||
|
||||
void b2EdgeAndCircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2EdgeAndCircleContact*)contact)->~b2EdgeAndCircleContact();
|
||||
allocator->Free(contact, sizeof(b2EdgeAndCircleContact));
|
||||
}
|
||||
|
||||
b2EdgeAndCircleContact::b2EdgeAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB)
|
||||
: b2Contact(fixtureA, 0, fixtureB, 0)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_edge);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_circle);
|
||||
}
|
||||
|
||||
void b2EdgeAndCircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2CollideEdgeAndCircle( manifold,
|
||||
(b2EdgeShape*)m_fixtureA->GetShape(), xfA,
|
||||
(b2CircleShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-39
@@ -1,39 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_EDGE_AND_CIRCLE_CONTACT_H
|
||||
#define B2_EDGE_AND_CIRCLE_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2EdgeAndCircleContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2EdgeAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB);
|
||||
~b2EdgeAndCircleContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
-49
@@ -1,49 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2010 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2EdgeAndPolygonContact.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2EdgeAndPolygonContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2EdgeAndPolygonContact));
|
||||
return new (mem) b2EdgeAndPolygonContact(fixtureA, fixtureB);
|
||||
}
|
||||
|
||||
void b2EdgeAndPolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2EdgeAndPolygonContact*)contact)->~b2EdgeAndPolygonContact();
|
||||
allocator->Free(contact, sizeof(b2EdgeAndPolygonContact));
|
||||
}
|
||||
|
||||
b2EdgeAndPolygonContact::b2EdgeAndPolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB)
|
||||
: b2Contact(fixtureA, 0, fixtureB, 0)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_edge);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);
|
||||
}
|
||||
|
||||
void b2EdgeAndPolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2CollideEdgeAndPolygon( manifold,
|
||||
(b2EdgeShape*)m_fixtureA->GetShape(), xfA,
|
||||
(b2PolygonShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-39
@@ -1,39 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_EDGE_AND_POLYGON_CONTACT_H
|
||||
#define B2_EDGE_AND_POLYGON_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2EdgeAndPolygonContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2EdgeAndPolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB);
|
||||
~b2EdgeAndPolygonContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
-49
@@ -1,49 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2PolygonAndCircleContact.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2PolygonAndCircleContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2PolygonAndCircleContact));
|
||||
return new (mem) b2PolygonAndCircleContact(fixtureA, fixtureB);
|
||||
}
|
||||
|
||||
void b2PolygonAndCircleContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2PolygonAndCircleContact*)contact)->~b2PolygonAndCircleContact();
|
||||
allocator->Free(contact, sizeof(b2PolygonAndCircleContact));
|
||||
}
|
||||
|
||||
b2PolygonAndCircleContact::b2PolygonAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB)
|
||||
: b2Contact(fixtureA, 0, fixtureB, 0)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_polygon);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_circle);
|
||||
}
|
||||
|
||||
void b2PolygonAndCircleContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2CollidePolygonAndCircle( manifold,
|
||||
(b2PolygonShape*)m_fixtureA->GetShape(), xfA,
|
||||
(b2CircleShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-38
@@ -1,38 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_POLYGON_AND_CIRCLE_CONTACT_H
|
||||
#define B2_POLYGON_AND_CIRCLE_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2PolygonAndCircleContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create(b2Fixture* fixtureA, int32 indexA, b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2PolygonAndCircleContact(b2Fixture* fixtureA, b2Fixture* fixtureB);
|
||||
~b2PolygonAndCircleContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
-52
@@ -1,52 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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.
|
||||
*/
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2PolygonContact.h"
|
||||
#include "Box2D/Common/b2BlockAllocator.h"
|
||||
#include "Box2D/Collision/b2TimeOfImpact.h"
|
||||
#include "Box2D/Dynamics/b2Body.h"
|
||||
#include "Box2D/Dynamics/b2Fixture.h"
|
||||
#include "Box2D/Dynamics/b2WorldCallbacks.h"
|
||||
|
||||
#include <new>
|
||||
|
||||
b2Contact* b2PolygonContact::Create(b2Fixture* fixtureA, int32, b2Fixture* fixtureB, int32, b2BlockAllocator* allocator)
|
||||
{
|
||||
void* mem = allocator->Allocate(sizeof(b2PolygonContact));
|
||||
return new (mem) b2PolygonContact(fixtureA, fixtureB);
|
||||
}
|
||||
|
||||
void b2PolygonContact::Destroy(b2Contact* contact, b2BlockAllocator* allocator)
|
||||
{
|
||||
((b2PolygonContact*)contact)->~b2PolygonContact();
|
||||
allocator->Free(contact, sizeof(b2PolygonContact));
|
||||
}
|
||||
|
||||
b2PolygonContact::b2PolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB)
|
||||
: b2Contact(fixtureA, 0, fixtureB, 0)
|
||||
{
|
||||
b2Assert(m_fixtureA->GetType() == b2Shape::e_polygon);
|
||||
b2Assert(m_fixtureB->GetType() == b2Shape::e_polygon);
|
||||
}
|
||||
|
||||
void b2PolygonContact::Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB)
|
||||
{
|
||||
b2CollidePolygons( manifold,
|
||||
(b2PolygonShape*)m_fixtureA->GetShape(), xfA,
|
||||
(b2PolygonShape*)m_fixtureB->GetShape(), xfB);
|
||||
}
|
||||
-39
@@ -1,39 +0,0 @@
|
||||
/*
|
||||
* Copyright (c) 2006-2009 Erin Catto http://www.box2d.org
|
||||
*
|
||||
* 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 B2_POLYGON_CONTACT_H
|
||||
#define B2_POLYGON_CONTACT_H
|
||||
|
||||
#include "Box2D/Dynamics/Contacts/b2Contact.h"
|
||||
|
||||
class b2BlockAllocator;
|
||||
|
||||
class b2PolygonContact : public b2Contact
|
||||
{
|
||||
public:
|
||||
static b2Contact* Create( b2Fixture* fixtureA, int32 indexA,
|
||||
b2Fixture* fixtureB, int32 indexB, b2BlockAllocator* allocator);
|
||||
static void Destroy(b2Contact* contact, b2BlockAllocator* allocator);
|
||||
|
||||
b2PolygonContact(b2Fixture* fixtureA, b2Fixture* fixtureB);
|
||||
~b2PolygonContact() {}
|
||||
|
||||
void Evaluate(b2Manifold* manifold, const b2Transform& xfA, const b2Transform& xfB) override;
|
||||
};
|
||||
|
||||
#endif
|
||||
Some files were not shown because too many files have changed in this diff Show More
Reference in New Issue
Block a user