1
0
Fork 0
mirror of https://github.com/ton-blockchain/ton synced 2025-02-13 11:42:18 +00:00
ton/tdutils/td/utils/ThreadLocalStorage.h

67 lines
1.8 KiB
C
Raw Normal View History

2019-09-07 10:03:22 +00:00
/*
This file is part of TON Blockchain Library.
TON Blockchain Library is free software: you can redistribute it and/or modify
it under the terms of the GNU Lesser General Public License as published by
the Free Software Foundation, either version 2 of the License, or
(at your option) any later version.
TON Blockchain Library is distributed in the hope that it will be useful,
but WITHOUT ANY WARRANTY; without even the implied warranty of
MERCHANTABILITY or FITNESS FOR A PARTICULAR PURPOSE. See the
GNU Lesser General Public License for more details.
You should have received a copy of the GNU Lesser General Public License
along with TON Blockchain Library. If not, see <http://www.gnu.org/licenses/>.
2020-04-10 19:06:01 +00:00
Copyright 2017-2020 Telegram Systems LLP
2019-09-07 10:03:22 +00:00
*/
2020-07-06 14:07:20 +00:00
2019-09-07 10:03:22 +00:00
#pragma once
2020-07-06 14:07:20 +00:00
#include "td/utils/common.h"
2019-09-07 10:03:22 +00:00
#include "td/utils/port/thread_local.h"
#include <array>
2020-07-06 14:07:20 +00:00
#include <atomic>
2019-09-07 10:03:22 +00:00
namespace td {
template <class T>
class ThreadLocalStorage {
public:
2020-07-06 14:07:20 +00:00
T &get() {
2019-09-07 10:03:22 +00:00
return thread_local_node().value;
}
template <class F>
2020-07-06 14:07:20 +00:00
void for_each(F &&f) {
int32 n = max_thread_id_.load();
for (int32 i = 0; i < n; i++) {
2019-09-07 10:03:22 +00:00
f(nodes_[i].value);
}
}
template <class F>
2020-07-06 14:07:20 +00:00
void for_each(F &&f) const {
int32 n = max_thread_id_.load();
for (int32 i = 0; i < n; i++) {
2019-09-07 10:03:22 +00:00
f(nodes_[i].value);
}
}
private:
struct Node {
T value{};
2020-07-06 14:07:20 +00:00
char padding[TD_CONCURRENCY_PAD];
2019-09-07 10:03:22 +00:00
};
2020-07-06 14:07:20 +00:00
static constexpr int32 MAX_THREAD_ID = 128;
std::atomic<int32> max_thread_id_{MAX_THREAD_ID};
2019-09-07 10:03:22 +00:00
std::array<Node, MAX_THREAD_ID> nodes_;
2020-07-06 14:07:20 +00:00
Node &thread_local_node() {
2019-09-07 10:03:22 +00:00
auto thread_id = get_thread_id();
CHECK(0 <= thread_id && static_cast<size_t>(thread_id) < nodes_.size());
return nodes_[thread_id];
}
};
} // namespace td