1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
|
#include <torch/csrc/distributed/c10d/PrefixStore.hpp>
#include <utility>
namespace c10d {
PrefixStore::PrefixStore(std::string prefix, c10::intrusive_ptr<Store> store)
: prefix_(std::move(prefix)), store_(std::move(store)) {}
std::string PrefixStore::joinKey(const std::string& key) {
return prefix_ + "/" + key;
}
std::vector<std::string> PrefixStore::joinKeys(
const std::vector<std::string>& keys) {
std::vector<std::string> joinedKeys;
joinedKeys.reserve(keys.size());
for (const auto& key : keys) {
joinedKeys.emplace_back(joinKey(key));
}
return joinedKeys;
}
void PrefixStore::set(
const std::string& key,
const std::vector<uint8_t>& value) {
store_->set(joinKey(key), value);
}
std::vector<uint8_t> PrefixStore::compareSet(
const std::string& key,
const std::vector<uint8_t>& expectedValue,
const std::vector<uint8_t>& desiredValue) {
return store_->compareSet(joinKey(key), expectedValue, desiredValue);
}
std::vector<uint8_t> PrefixStore::get(const std::string& key) {
return store_->get(joinKey(key));
}
int64_t PrefixStore::add(const std::string& key, int64_t value) {
return store_->add(joinKey(key), value);
}
bool PrefixStore::deleteKey(const std::string& key) {
return store_->deleteKey(joinKey(key));
}
int64_t PrefixStore::getNumKeys() {
return store_->getNumKeys();
}
bool PrefixStore::check(const std::vector<std::string>& keys) {
auto joinedKeys = joinKeys(keys);
return store_->check(joinedKeys);
}
void PrefixStore::wait(const std::vector<std::string>& keys) {
auto joinedKeys = joinKeys(keys);
store_->wait(joinedKeys);
}
void PrefixStore::wait(
const std::vector<std::string>& keys,
const std::chrono::milliseconds& timeout) {
auto joinedKeys = joinKeys(keys);
store_->wait(joinedKeys, timeout);
}
const std::chrono::milliseconds& PrefixStore::getTimeout() const noexcept {
return store_->getTimeout();
}
void PrefixStore::setTimeout(const std::chrono::milliseconds& timeout) {
store_->setTimeout(timeout);
}
void PrefixStore::append(
const std::string& key,
const std::vector<uint8_t>& value) {
store_->append(joinKey(key), value);
}
std::vector<std::vector<uint8_t>> PrefixStore::multiGet(
const std::vector<std::string>& keys) {
std::vector<std::string> prefixed_keys;
prefixed_keys.reserve(keys.size());
for (auto& key : keys) {
prefixed_keys.push_back(joinKey(key));
}
return store_->multiGet(prefixed_keys);
}
void PrefixStore::multiSet(
const std::vector<std::string>& keys,
const std::vector<std::vector<uint8_t>>& values) {
std::vector<std::string> prefixed_keys;
prefixed_keys.reserve(keys.size());
for (auto& key : keys) {
prefixed_keys.push_back(joinKey(key));
}
store_->multiSet(prefixed_keys, values);
}
// Returns true if this store support append, multiGet and multiSet
bool PrefixStore::hasExtendedApi() const {
return store_->hasExtendedApi();
}
c10::intrusive_ptr<Store> PrefixStore::getUnderlyingStore() {
return store_;
}
c10::intrusive_ptr<Store> PrefixStore::getUnderlyingNonPrefixStore() {
c10::intrusive_ptr<Store> store = store_;
while (store) {
// Attempt to dynamically cast to PrefixStore
PrefixStore* asPrefixStore = dynamic_cast<PrefixStore*>(store.get());
if (asPrefixStore) {
store = asPrefixStore->getUnderlyingStore();
} else {
break; // We've reached a non-PrefixStore
}
}
TORCH_CHECK(
store != nullptr, "Underlying Non-PrefixStore shouldn't be null.");
return store;
}
} // namespace c10d
|
