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
|
//
// Redistribution and use in source and binary forms, with or without
// modification, are permitted provided that the following conditions
// are met:
// * Redistributions of source code must retain the above copyright
// notice, this list of conditions and the following disclaimer.
// * Redistributions in binary form must reproduce the above copyright
// notice, this list of conditions and the following disclaimer in the
// documentation and/or other materials provided with the distribution.
// * Neither the name of NVIDIA CORPORATION nor the names of its
// contributors may be used to endorse or promote products derived
// from this software without specific prior written permission.
//
// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ``AS IS'' AND ANY
// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
//
// Copyright (c) 2018 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 "PxAssert.h"
#include "SwFabric.h"
#include "SwFactory.h"
#include "PsSort.h"
#include "limits.h" // for USHRT_MAX
#include "PsUtilities.h"
using namespace nvidia;
using namespace physx::shdfnd;
cloth::SwTether::SwTether(uint16_t anchor, float length) : mAnchor(anchor), mLength(length)
{
}
cloth::SwFabric::SwFabric(SwFactory& factory, uint32_t numParticles, Range<const uint32_t> phases,
Range<const uint32_t> sets, Range<const float> restvalues, Range<const uint32_t> indices,
Range<const uint32_t> anchors, Range<const float> tetherLengths, uint32_t id)
: mFactory(factory), mNumParticles(numParticles), mTetherLengthScale(1.0f), mId(id)
{
// should no longer be prefixed with 0
PX_ASSERT(sets.front() != 0);
#if PX_WINDOWS_FAMILY
const uint32_t kSimdWidth = 8; // avx
#else
const uint32_t kSimdWidth = 4;
#endif
// consistency check
PX_ASSERT(sets.back() == restvalues.size());
PX_ASSERT(restvalues.size() * 2 == indices.size());
PX_ASSERT(mNumParticles > *maxElement(indices.begin(), indices.end()));
PX_ASSERT(mNumParticles + kSimdWidth - 1 <= USHRT_MAX);
mPhases.assign(phases.begin(), phases.end());
mSets.reserve(sets.size() + 1);
mSets.pushBack(0); // prefix with 0
mOriginalNumRestvalues = uint32_t(restvalues.size());
// padd indices for SIMD
const uint32_t* iBegin = indices.begin(), *iIt = iBegin;
const float* rBegin = restvalues.begin(), *rIt = rBegin;
const uint32_t* sIt, *sEnd = sets.end();
for(sIt = sets.begin(); sIt != sEnd; ++sIt)
{
const float* rEnd = rBegin + *sIt;
const uint32_t* iEnd = iBegin + *sIt * 2;
uint32_t numConstraints = uint32_t(rEnd - rIt);
for(; rIt != rEnd; ++rIt)
mRestvalues.pushBack(*rIt);
for(; iIt != iEnd; ++iIt)
mIndices.pushBack(uint16_t(*iIt));
// add dummy indices to make multiple of 4
for(; numConstraints &= kSimdWidth - 1; ++numConstraints)
{
mRestvalues.pushBack(-FLT_MAX);
uint32_t index = mNumParticles + numConstraints - 1;
mIndices.pushBack(uint16_t(index));
mIndices.pushBack(uint16_t(index));
}
mSets.pushBack(uint32_t(mRestvalues.size()));
}
// trim overallocations
RestvalueContainer(mRestvalues.begin(), mRestvalues.end()).swap(mRestvalues);
Vector<uint16_t>::Type(mIndices.begin(), mIndices.end()).swap(mIndices);
// tethers
PX_ASSERT(anchors.size() == tetherLengths.size());
// pad to allow for direct 16 byte (unaligned) loads
mTethers.reserve(anchors.size() + 2);
for(; !anchors.empty(); anchors.popFront(), tetherLengths.popFront())
mTethers.pushBack(SwTether(uint16_t(anchors.front()), tetherLengths.front()));
mFactory.mFabrics.pushBack(this);
}
cloth::SwFabric::~SwFabric()
{
Vector<SwFabric*>::Type::Iterator fIt = mFactory.mFabrics.find(this);
PX_ASSERT(fIt != mFactory.mFabrics.end());
mFactory.mFabrics.replaceWithLast(fIt);
}
cloth::Factory& cloth::SwFabric::getFactory() const
{
return mFactory;
}
uint32_t cloth::SwFabric::getNumPhases() const
{
return uint32_t(mPhases.size());
}
uint32_t cloth::SwFabric::getNumRestvalues() const
{
return mOriginalNumRestvalues;
}
uint32_t cloth::SwFabric::getNumSets() const
{
return uint32_t(mSets.size() - 1);
}
uint32_t cloth::SwFabric::getNumIndices() const
{
return 2 * mOriginalNumRestvalues;
}
uint32_t cloth::SwFabric::getNumParticles() const
{
return mNumParticles;
}
uint32_t cloth::SwFabric::getNumTethers() const
{
return uint32_t(mTethers.size());
}
void cloth::SwFabric::scaleRestvalues(float scale)
{
RestvalueContainer::Iterator rIt, rEnd = mRestvalues.end();
for(rIt = mRestvalues.begin(); rIt != rEnd; ++rIt)
*rIt *= scale;
}
void cloth::SwFabric::scaleTetherLengths(float scale)
{
mTetherLengthScale *= scale;
}
|