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
|
#include <torch/csrc/distributed/c10d/Store.hpp>
namespace c10d {
const std::chrono::milliseconds& Store::getTimeout() const noexcept {
return timeout_;
}
// Set timeout function
void Store::setTimeout(const std::chrono::milliseconds& timeout) {
timeout_ = timeout;
}
void Store::set(const std::string& key, const std::string& value) {
set(key, std::vector<uint8_t>(value.begin(), value.end()));
}
std::string Store::compareSet(
const std::string& key,
const std::string& currentValue,
const std::string& newValue) {
auto value = compareSet(
key,
std::vector<uint8_t>(currentValue.begin(), currentValue.end()),
std::vector<uint8_t>(newValue.begin(), newValue.end()));
return std::string(value.begin(), value.end());
}
std::string Store::get_to_str(const std::string& key) {
auto value = get(key);
return std::string(value.begin(), value.end());
}
void Store::append(const std::string& key, const std::vector<uint8_t>& value) {
// This fallback depends on compareSet
std::vector<uint8_t> expected = value;
std::vector<uint8_t> current;
// cannot use get(key) as it might block forever if the key doesn't exist
current = compareSet(key, current, expected);
while (current != expected) {
expected = current;
expected.insert(expected.end(), value.begin(), value.end());
current = compareSet(key, current, expected);
}
}
std::vector<std::vector<uint8_t>> Store::multiGet(
const std::vector<std::string>& keys) {
std::vector<std::vector<uint8_t>> result;
result.reserve(keys.size());
for (auto& key : keys) {
result.emplace_back(get(key));
}
return result;
}
void Store::multiSet(
const std::vector<std::string>& keys,
const std::vector<std::vector<uint8_t>>& values) {
for (auto i : ::c10::irange(keys.size())) {
set(keys[i], values[i]);
}
}
bool Store::hasExtendedApi() const {
return false;
}
} // namespace c10d
|
