mirror of
https://github.com/status-im/react-native.git
synced 2025-02-24 15:18:10 +00:00
b4fa1fa0c6
Summary: Why do we need a dedicated registry class? * We need to simplify registry-related logic in Scheduler. * We need to couple threading aspect of the registry with the registry itself, otherwise it's not clear why exactly we acquire the mutex. We also should not acquire the mutex in a per-method way (as we did before), because it's incorrect and misleading (only lines that access the registry should by protected). * We need to have a way to share the registry with other classes (e.g. UIManager) without passing a reference to the whole Scheduler. Reviewed By: mdvacca Differential Revision: D13036550 fbshipit-source-id: 644da910e823666c586834a3da2b4cdcb90eebb2
41 lines
1.1 KiB
C++
41 lines
1.1 KiB
C++
// Copyright (c) Facebook, Inc. and its affiliates.
|
|
|
|
// This source code is licensed under the MIT license found in the
|
|
// LICENSE file in the root directory of this source tree.
|
|
|
|
#include "ShadowTreeRegistry.h"
|
|
|
|
namespace facebook {
|
|
namespace react {
|
|
|
|
void ShadowTreeRegistry::add(std::unique_ptr<ShadowTree> &&shadowTree) const {
|
|
std::lock_guard<std::mutex> lock(mutex_);
|
|
registry_.emplace(shadowTree->getSurfaceId(), std::move(shadowTree));
|
|
}
|
|
|
|
std::unique_ptr<ShadowTree> ShadowTreeRegistry::remove(
|
|
SurfaceId surfaceId) const {
|
|
std::lock_guard<std::mutex> lock(mutex_);
|
|
auto iterator = registry_.find(surfaceId);
|
|
auto shadowTree = std::unique_ptr<ShadowTree>(iterator->second.release());
|
|
registry_.erase(iterator);
|
|
return shadowTree;
|
|
}
|
|
|
|
bool ShadowTreeRegistry::get(
|
|
SurfaceId surfaceId,
|
|
std::function<void(const ShadowTree &shadowTree)> callback) const {
|
|
std::lock_guard<std::mutex> lock(mutex_);
|
|
auto iterator = registry_.find(surfaceId);
|
|
|
|
if (iterator == registry_.end()) {
|
|
return false;
|
|
}
|
|
|
|
callback(*iterator->second);
|
|
return true;
|
|
}
|
|
|
|
} // namespace react
|
|
} // namespace facebook
|