// Copyright 2023 The Dawn & Tint Authors // // Redistribution and use in source and binary forms, with or without // modification, are permitted provided that the following conditions are met: // // 1. Redistributions of source code must retain the above copyright notice, this // list of conditions and the following disclaimer. // // 2. 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. // // 3. Neither the name of the copyright holder 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 AND CONTRIBUTORS "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 HOLDER 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. #ifndef SRC_DAWN_COMMON_CONTENTLESSOBJECTCACHE_H_ #define SRC_DAWN_COMMON_CONTENTLESSOBJECTCACHE_H_ #include <mutex> #include <type_traits> #include <utility> #include "absl/container/flat_hash_set.h" #include "absl/container/inlined_vector.h" #include "dawn/common/ContentLessObjectCacheable.h" #include "dawn/common/Ref.h" #include "dawn/common/RefCounted.h" #include "dawn/common/WeakRef.h" #include "partition_alloc/pointers/raw_ptr.h" namespace dawn { template <typename RefCountedT> class ContentLessObjectCache; namespace detail { // Tagged-type to force special path for EqualityFunc when dealing with Erase. When erasing, we only // care about pointer equality, not value equality. This is also particularly important because // trying to promote on the Erase path can cause failures as the object's last ref could've been // dropped already. template <typename RefCountedT> struct ForErase { … }; // All cached WeakRefs must have an immutable hash value determined at insertion. This ensures that // even if the last ref of the cached value is dropped, we still get the same hash in the set for // erasing. template <typename RefCountedT> struct WeakRefAndHash { … }; template <typename RefCountedT> struct ContentLessObjectCacheKeyFuncs { … }; } // namespace detail template <typename RefCountedT> class ContentLessObjectCache { … }; } // namespace dawn #endif // SRC_DAWN_COMMON_CONTENTLESSOBJECTCACHE_H_