RavEngine
Loading...
Searching...
No Matches
PxcConstraintBlockStream.h
1// Redistribution and use in source and binary forms, with or without
2// modification, are permitted provided that the following conditions
3// are met:
4// * Redistributions of source code must retain the above copyright
5// notice, this list of conditions and the following disclaimer.
6// * Redistributions in binary form must reproduce the above copyright
7// notice, this list of conditions and the following disclaimer in the
8// documentation and/or other materials provided with the distribution.
9// * Neither the name of NVIDIA CORPORATION nor the names of its
10// contributors may be used to endorse or promote products derived
11// from this software without specific prior written permission.
12//
13// THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ''AS IS'' AND ANY
14// EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE
15// IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR
16// PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR
17// CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL,
18// EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO,
19// PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR
20// PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY
21// OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT
22// (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE
23// OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE.
24//
25// Copyright (c) 2008-2022 NVIDIA Corporation. All rights reserved.
26// Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved.
27// Copyright (c) 2001-2004 NovodeX AG. All rights reserved.
28
29#ifndef PXC_CONSTRAINT_BLOCK_POOL_H
30#define PXC_CONSTRAINT_BLOCK_POOL_H
31
32#include "PxvConfig.h"
33#include "foundation/PxArray.h"
34#include "foundation/PxMutex.h"
35#include "PxcNpMemBlockPool.h"
36
37namespace physx
38{
40{
41public:
43 mBlockPool(blockPool)
44 {
45 }
46
47 PX_FORCE_INLINE void reset()
48 {
49 mBlockPool.releaseConstraintBlocks(mTrackingArray);
50 }
51
52 PxcNpMemBlockArray mTrackingArray;
53 PxcNpMemBlockPool& mBlockPool;
54
55private:
57};
58
60{
62public:
64 mBlockPool (blockPool),
65 mBlock (NULL),
66 mUsed (0)
67 {
68 }
69
70 PX_FORCE_INLINE PxU8* reserve(PxU32 size, PxsConstraintBlockManager& manager)
71 {
72 size = (size+15)&~15;
73 if(size>PxcNpMemBlock::SIZE)
74 return mBlockPool.acquireExceptionalConstraintMemory(size);
75
76 if(mBlock == NULL || size+mUsed>PxcNpMemBlock::SIZE)
77 {
78 mBlock = mBlockPool.acquireConstraintBlock(manager.mTrackingArray);
79 PX_ASSERT(0==mBlock || mBlock->data == reinterpret_cast<PxU8*>(mBlock));
80 mUsed = size;
81 return reinterpret_cast<PxU8*>(mBlock);
82 }
83 PX_ASSERT(mBlock && mBlock->data == reinterpret_cast<PxU8*>(mBlock));
84 PxU8* PX_RESTRICT result = mBlock->data+mUsed;
85 mUsed += size;
86 return result;
87 }
88
89 PX_FORCE_INLINE void reset()
90 {
91 mBlock = NULL;
92 mUsed = 0;
93 }
94
95 PX_FORCE_INLINE PxcNpMemBlockPool& getMemBlockPool() { return mBlockPool; }
96
97private:
98 PxcNpMemBlockPool& mBlockPool;
99 PxcNpMemBlock* mBlock; // current constraint block
100 PxU32 mUsed; // number of bytes used in constraint block
101 //Tracking peak allocations
102 PxU32 mPeakUsed;
103};
104
106{
107 PX_NOCOPY(PxcContactBlockStream)
108public:
110 mBlockPool(blockPool),
111 mBlock(NULL),
112 mUsed(0)
113 {
114 }
115
116 PX_FORCE_INLINE PxU8* reserve(PxU32 size)
117 {
118 size = (size+15)&~15;
119
120 if(size>PxcNpMemBlock::SIZE)
121 return mBlockPool.acquireExceptionalConstraintMemory(size);
122
123 PX_ASSERT(size <= PxcNpMemBlock::SIZE);
124
125 if(mBlock == NULL || size+mUsed>PxcNpMemBlock::SIZE)
126 {
127 mBlock = mBlockPool.acquireContactBlock();
128 PX_ASSERT(0==mBlock || mBlock->data == reinterpret_cast<PxU8*>(mBlock));
129 mUsed = size;
130 return reinterpret_cast<PxU8*>(mBlock);
131 }
132 PX_ASSERT(mBlock && mBlock->data == reinterpret_cast<PxU8*>(mBlock));
133 PxU8* PX_RESTRICT result = mBlock->data+mUsed;
134 mUsed += size;
135 return result;
136 }
137
138 PX_FORCE_INLINE void reset()
139 {
140 mBlock = NULL;
141 mUsed = 0;
142 }
143
144 PX_FORCE_INLINE PxcNpMemBlockPool& getMemBlockPool() { return mBlockPool; }
145
146private:
147 PxcNpMemBlockPool& mBlockPool;
148 PxcNpMemBlock* mBlock; // current constraint block
149 PxU32 mUsed; // number of bytes used in constraint block
150};
151
152}
153
154#endif
Definition PxcConstraintBlockStream.h:60
Definition PxcConstraintBlockStream.h:106
Definition PxcNpMemBlockPool.h:52
Definition PxcConstraintBlockStream.h:40
#define PX_RESTRICT
Definition PxPreprocessor.h:355
#define PX_FORCE_INLINE
Definition PxPreprocessor.h:335
Sorts an array of objects in ascending order, assuming that the predicate implements the < operator:
Definition PxBoxController.h:39
Definition PxcNpMemBlockPool.h:41