| // Copyright 2021 The Dawn Authors |
| // |
| // Licensed under the Apache License, Version 2.0 (the "License"); |
| // you may not use this file except in compliance with the License. |
| // You may obtain a copy of the License at |
| // |
| // http://www.apache.org/licenses/LICENSE-2.0 |
| // |
| // Unless required by applicable law or agreed to in writing, software |
| // distributed under the License is distributed on an "AS IS" BASIS, |
| // WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied. |
| // See the License for the specific language governing permissions and |
| // limitations under the License. |
| |
| #ifndef SRC_DAWN_COMMON_CONCURRENTCACHE_H_ |
| #define SRC_DAWN_COMMON_CONCURRENTCACHE_H_ |
| |
| #include <mutex> |
| #include <unordered_set> |
| #include <utility> |
| |
| #include "dawn/common/NonCopyable.h" |
| |
| namespace dawn { |
| |
| template <typename T> |
| class ConcurrentCache : public NonMovable { |
| public: |
| ConcurrentCache() = default; |
| |
| T* Find(T* object) { |
| std::lock_guard<std::mutex> lock(mMutex); |
| auto iter = mCache.find(object); |
| if (iter == mCache.end()) { |
| return nullptr; |
| } |
| return *iter; |
| } |
| |
| std::pair<T*, bool> Insert(T* object) { |
| std::lock_guard<std::mutex> lock(mMutex); |
| auto [value, inserted] = mCache.insert(object); |
| return {*value, inserted}; |
| } |
| |
| size_t Erase(T* object) { |
| std::lock_guard<std::mutex> lock(mMutex); |
| return mCache.erase(object); |
| } |
| |
| private: |
| std::mutex mMutex; |
| std::unordered_set<T*, typename T::HashFunc, typename T::EqualityFunc> mCache; |
| }; |
| |
| } // namespace dawn |
| |
| #endif // SRC_DAWN_COMMON_CONCURRENTCACHE_H_ |