dawn-cmake/src/common/ConcurrentCache.h
Corentin Wallez 5984d8d1a8 Use C++17 structured binding in more places.
Bug: dawn:824
Change-Id: Ie39d4f622bfb3dcc3a74b03d594efcea7139a9dc
Reviewed-on: https://dawn-review.googlesource.com/c/dawn/+/75069
Reviewed-by: Austin Eng <enga@chromium.org>
Reviewed-by: Loko Kung <lokokung@google.com>
Commit-Queue: Corentin Wallez <cwallez@chromium.org>
2022-01-06 09:17:57 +00:00

55 lines
1.5 KiB
C++

// 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 COMMON_CONCURRENT_CACHE_H_
#define COMMON_CONCURRENT_CACHE_H_
#include "common/NonCopyable.h"
#include <mutex>
#include <unordered_set>
#include <utility>
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;
};
#endif