1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
|
// This code contains NVIDIA Confidential Information and is disclosed to you
// under a form of NVIDIA software license agreement provided separately to you.
//
// Notice
// NVIDIA Corporation and its licensors retain all intellectual property and
// proprietary rights in and to this software and related documentation and
// any modifications thereto. Any use, reproduction, disclosure, or
// distribution of this software and related documentation without an express
// license agreement from NVIDIA Corporation is strictly prohibited.
//
// ALL NVIDIA DESIGN SPECIFICATIONS, CODE ARE PROVIDED "AS IS.". NVIDIA MAKES
// NO WARRANTIES, EXPRESSED, IMPLIED, STATUTORY, OR OTHERWISE WITH RESPECT TO
// THE MATERIALS, AND EXPRESSLY DISCLAIMS ALL IMPLIED WARRANTIES OF NONINFRINGEMENT,
// MERCHANTABILITY, AND FITNESS FOR A PARTICULAR PURPOSE.
//
// Information and code furnished is believed to be accurate and reliable.
// However, NVIDIA Corporation assumes no responsibility for the consequences of use of such
// information or for any infringement of patents or other rights of third parties that may
// result from its use. No license is granted by implication or otherwise under any patent
// or patent rights of NVIDIA Corporation. Details are subject to change without notice.
// This code supersedes and replaces all information previously supplied.
// NVIDIA Corporation products are not authorized for use as critical
// components in life support devices or systems without express written approval of
// NVIDIA Corporation.
//
// Copyright (c) 2008-2016 NVIDIA Corporation. All rights reserved.
// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.
// Copyright (c) 2001-2004 NovodeX AG. All rights reserved.
#include "BpBroadPhase.h"
#include "BpBroadPhaseSap.h"
#include "BpBroadPhaseMBP.h"
#include "PxSceneDesc.h"
#include "BpSimpleAABBManager.h"
using namespace physx;
using namespace Bp;
BroadPhase* BroadPhase::create(
const PxBroadPhaseType::Enum bpType,
const PxU32 maxNbRegions,
const PxU32 maxNbBroadPhaseOverlaps,
const PxU32 maxNbStaticShapes,
const PxU32 maxNbDynamicShapes,
PxU64 contextID)
{
PX_ASSERT(bpType==PxBroadPhaseType::eMBP || bpType == PxBroadPhaseType::eSAP);
if(bpType==PxBroadPhaseType::eMBP)
return PX_NEW(BroadPhaseMBP)(maxNbRegions, maxNbBroadPhaseOverlaps, maxNbStaticShapes, maxNbDynamicShapes);
else
return PX_NEW(BroadPhaseSap)(maxNbBroadPhaseOverlaps, maxNbStaticShapes, maxNbDynamicShapes, contextID);
}
#if PX_CHECKED
bool BroadPhaseUpdateData::isValid(const BroadPhaseUpdateData& updateData, const BroadPhase& bp)
{
return (updateData.isValid() && bp.isValid(updateData));
}
#endif
#if PX_CHECKED
bool BroadPhaseUpdateData::isValid() const
{
const BpHandle* created=getCreatedHandles();
const BpHandle* updated=getUpdatedHandles();
const BpHandle* removed=getRemovedHandles();
const PxU32 createdSize=getNumCreatedHandles();
const PxU32 updatedSize=getNumUpdatedHandles();
const PxU32 removedSize=getNumRemovedHandles();
const PxBounds3* bounds=getAABBs();
const BpHandle* groups=getGroups();
const PxU32 boxesCapacity=getCapacity();
if(NULL==created && createdSize>0)
{
return false;
}
if(NULL==updated && updatedSize>0)
{
return false;
}
if(NULL==removed && removedSize>0)
{
return false;
}
ValType minVal=0;
ValType maxVal=0xffffffff;
PX_UNUSED(minVal);
PX_UNUSED(maxVal);
for(PxU32 i=0;i<createdSize;i++)
{
if(created[i]>=boxesCapacity)
return false;
//Created array in ascending order of id.
if(i>0 && (created[i] < created[i-1]))
{
return false;
}
for(PxU32 j=0;j<3;j++)
{
//Max must be greater than min.
if(bounds[created[i]].minimum[j]>bounds[created[i]].maximum[j])
return false;
#if 0
//Bounds have an upper limit.
if(bounds[created[i]].getMax(j)>=maxVal)
return false;
//Bounds have a lower limit.
if(bounds[created[i]].getMin(j)<=minVal)
return false;
//Max must be odd.
if(4 != (bounds[created[i]].getMax(j) & 4))
return false;
//Min must be even.
if(0 != (bounds[created[i]].getMin(j) & 4))
return false;
#endif
}
//Group ids must be less than BP_INVALID_BP_HANDLE.
if(groups[created[i]]>=BP_INVALID_BP_HANDLE)
return false;
}
for(PxU32 i=0;i<updatedSize;i++)
{
if(updated[i]>=boxesCapacity)
return false;
//Updated array in ascending order of id
if(i>0 && (updated[i] < updated[i-1]))
{
return false;
}
for(PxU32 j=0;j<3;j++)
{
//Max must be greater than min.
if(bounds[updated[i]].minimum[j]>bounds[updated[i]].maximum[j])
return false;
#if 0
//Bounds have an upper limit.
if(bounds[updated[i]].getMax(j)>=maxVal)
return false;
//Bounds have a lower limit.
if(bounds[updated[i]].getMin(j)<=minVal)
return false;
//Max must be odd.
if(4 != (bounds[updated[i]].getMax(j) & 4))
return false;
//Min must be even.
if(0 != (bounds[updated[i]].getMin(j) & 4))
return false;
#endif
}
//Group ids must be less than BP_INVALID_BP_HANDLE.
if(groups[updated[i]]>=BP_INVALID_BP_HANDLE)
return false;
}
for(PxU32 i=0;i<removedSize;i++)
{
if(removed[i]>=boxesCapacity)
return false;
//Removed array in ascending order of id
if(i>0 && (removed[i] < removed[i-1]))
{
return false;
}
}
return true;
}
#endif
|