1 | // |
2 | // Redistribution and use in source and binary forms, with or without |
3 | // modification, are permitted provided that the following conditions |
4 | // are met: |
5 | // * Redistributions of source code must retain the above copyright |
6 | // notice, this list of conditions and the following disclaimer. |
7 | // * Redistributions in binary form must reproduce the above copyright |
8 | // notice, this list of conditions and the following disclaimer in the |
9 | // documentation and/or other materials provided with the distribution. |
10 | // * Neither the name of NVIDIA CORPORATION nor the names of its |
11 | // contributors may be used to endorse or promote products derived |
12 | // from this software without specific prior written permission. |
13 | // |
14 | // THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS ''AS IS'' AND ANY |
15 | // EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT LIMITED TO, THE |
16 | // IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR A PARTICULAR |
17 | // PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT OWNER OR |
18 | // CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, SPECIAL, |
19 | // EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT LIMITED TO, |
20 | // PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, DATA, OR |
21 | // PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY THEORY |
22 | // OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT |
23 | // (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE |
24 | // OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. |
25 | // |
26 | // Copyright (c) 2008-2021 NVIDIA Corporation. All rights reserved. |
27 | // Copyright (c) 2004-2008 AGEIA Technologies, Inc. All rights reserved. |
28 | // Copyright (c) 2001-2004 NovodeX AG. All rights reserved. |
29 | |
30 | |
31 | #ifndef PXC_THREADCOHERENTCACHE_H |
32 | #define PXC_THREADCOHERENTCACHE_H |
33 | |
34 | #include "PsMutex.h" |
35 | #include "PsAllocator.h" |
36 | #include "PsSList.h" |
37 | |
38 | namespace physx |
39 | { |
40 | |
41 | class PxsContext; |
42 | /*! |
43 | Controls a pool of large objects which must be thread safe. |
44 | Tries to return the object most recently used by the thread(for better cache coherancy). |
45 | Assumes the object has a default contructor. |
46 | |
47 | (Note the semantics are different to a pool because we dont want to construct/destroy each time |
48 | an object is requested, which may be expensive). |
49 | |
50 | TODO: add thread coherancy. |
51 | */ |
52 | template<class T, class Params> |
53 | class PxcThreadCoherentCache : public Ps::AlignedAllocator<16, Ps::ReflectionAllocator<T> > |
54 | { |
55 | typedef Ps::AlignedAllocator<16, Ps::ReflectionAllocator<T> > Allocator; |
56 | PX_NOCOPY(PxcThreadCoherentCache) |
57 | public: |
58 | |
59 | typedef Ps::SListEntry EntryBase; |
60 | |
61 | PX_INLINE PxcThreadCoherentCache(Params* params, const Allocator& alloc = Allocator()) : Allocator(alloc), mParams(params) |
62 | { |
63 | } |
64 | |
65 | PX_INLINE ~PxcThreadCoherentCache() |
66 | { |
67 | T* np = static_cast<T*>(root.pop()); |
68 | |
69 | while(np!=NULL) |
70 | { |
71 | np->~T(); |
72 | Allocator::deallocate(np); |
73 | np = static_cast<T*>(root.pop()); |
74 | } |
75 | } |
76 | |
77 | PX_INLINE T* get() |
78 | { |
79 | T* rv = static_cast<T*>(root.pop()); |
80 | if(rv==NULL) |
81 | { |
82 | rv = reinterpret_cast<T*>(Allocator::allocate(sizeof(T), __FILE__, __LINE__)); |
83 | new (rv) T(mParams); |
84 | } |
85 | |
86 | return rv; |
87 | } |
88 | |
89 | PX_INLINE void put(T* item) |
90 | { |
91 | root.push(entry&: *item); |
92 | } |
93 | |
94 | |
95 | private: |
96 | Ps::SList root; |
97 | Params* mParams; |
98 | |
99 | template<class T2, class P2> |
100 | friend class PxcThreadCoherentCacheIterator; |
101 | }; |
102 | |
103 | /*! |
104 | Used to iterate over all objects controlled by the cache. |
105 | |
106 | Note: The iterator flushes the cache(extracts all items on construction and adds them back on |
107 | destruction so we can iterate the list in a safe manner). |
108 | */ |
109 | template<class T, class Params> |
110 | class PxcThreadCoherentCacheIterator |
111 | { |
112 | public: |
113 | PxcThreadCoherentCacheIterator(PxcThreadCoherentCache<T, Params>& cache) : mCache(cache) |
114 | { |
115 | mNext = cache.root.flush(); |
116 | mFirst = mNext; |
117 | } |
118 | ~PxcThreadCoherentCacheIterator() |
119 | { |
120 | Ps::SListEntry* np = mFirst; |
121 | while(np != NULL) |
122 | { |
123 | Ps::SListEntry* npNext = np->next(); |
124 | mCache.root.push(*np); |
125 | np = npNext; |
126 | } |
127 | } |
128 | |
129 | PX_INLINE T* getNext() |
130 | { |
131 | if(mNext == NULL) |
132 | return NULL; |
133 | |
134 | T* rv = static_cast<T*>(mNext); |
135 | mNext = mNext->next(); |
136 | |
137 | return rv; |
138 | } |
139 | private: |
140 | |
141 | PxcThreadCoherentCacheIterator<T, Params>& operator=(const PxcThreadCoherentCacheIterator<T, Params>&); |
142 | PxcThreadCoherentCache<T, Params> &mCache; |
143 | Ps::SListEntry* mNext; |
144 | Ps::SListEntry* mFirst; |
145 | |
146 | }; |
147 | |
148 | } |
149 | |
150 | #endif |
151 | |