RavEngine
Loading...
Searching...
No Matches
GuEdgeCache.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 GU_EDGECACHE_H
30#define GU_EDGECACHE_H
31
32#include "foundation/PxMemory.h"
33#include "foundation/PxAllocator.h"
34#include "foundation/PxHash.h"
35
36namespace physx
37{
38namespace Gu
39{
41 {
42#define NUM_EDGES_IN_CACHE 64 //must be power of 2. 32 lines result in 10% extra work (due to cache misses), 64 lines in 6% extra work, 128 lines in 4%.
43 public:
44 EdgeCache()
45 {
46 PxMemZero(cacheLines, NUM_EDGES_IN_CACHE*sizeof(CacheLine));
47 }
48
49 PxU32 hash(PxU32 key) const
50 {
51 return (NUM_EDGES_IN_CACHE - 1) & PxComputeHash(key); //Only a 16 bit hash would be needed here.
52 }
53
54 bool isInCache(PxU8 vertex0, PxU8 vertex1)
55 {
56 PX_ASSERT(vertex1 >= vertex0);
57 PxU16 key = PxU16((vertex0 << 8) | vertex1);
58 PxU32 h = hash(key);
59 CacheLine& cl = cacheLines[h];
60 if (cl.fullKey == key)
61 {
62 return true;
63 }
64 else //cache the line now as it's about to be processed
65 {
66 cl.fullKey = key;
67 return false;
68 }
69 }
70
71 private:
72 struct CacheLine
73 {
74 PxU16 fullKey;
75 };
76 CacheLine cacheLines[NUM_EDGES_IN_CACHE];
77#undef NUM_EDGES_IN_CACHE
78 };
79}
80
81}
82
83#endif
84
Definition GuEdgeCache.h:41
Sorts an array of objects in ascending order, assuming that the predicate implements the < operator:
Definition PxBoxController.h:39
PX_FORCE_INLINE void * PxMemZero(void *dest, PxU32 count)
Sets the bytes of the provided buffer to zero.
Definition PxMemory.h:53