38a54df863
People keep tripping over the old copyrights and copy-pasting them to new files. Search and replace "Cloudius Systems" with "ScyllaDB". Message-Id: <1460013664-25966-1-git-send-email-penberg@scylladb.com>
100 lines
3.1 KiB
C++
100 lines
3.1 KiB
C++
/*
|
|
* Copyright (C) 2016 ScyllaDB
|
|
*/
|
|
|
|
/*
|
|
* This file is part of Scylla.
|
|
*
|
|
* Scylla is free software: you can redistribute it and/or modify
|
|
* it under the terms of the GNU Affero General Public License as published by
|
|
* the Free Software Foundation, either version 3 of the License, or
|
|
* (at your option) any later version.
|
|
*
|
|
* Scylla 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 General Public License for more details.
|
|
*
|
|
* You should have received a copy of the GNU General Public License
|
|
* along with Scylla. If not, see <http://www.gnu.org/licenses/>.
|
|
*/
|
|
|
|
#pragma once
|
|
|
|
#include <memory>
|
|
#include <experimental/optional>
|
|
#include <seastar/core/semaphore.hh>
|
|
#include <seastar/core/shared_ptr.hh>
|
|
|
|
/**
|
|
* Joinpoint:
|
|
*
|
|
* Helper type for letting operations working on all shards "join" and acquire
|
|
* the same value of something, with that value being based on whenever that
|
|
* join takes place. (Obvious use case: time stamp after one set of per-shard ops, but
|
|
* before final ones).
|
|
* The generation of the value is guaranteed to happen on the shards that created the
|
|
* join point.
|
|
*/
|
|
namespace utils {
|
|
|
|
template<typename T>
|
|
class joinpoint {
|
|
public:
|
|
typedef typename futurize<T>::type type;
|
|
typedef std::function<type()> func_type;
|
|
|
|
joinpoint(func_type f)
|
|
: _func(std::move(f))
|
|
, _shard(engine().cpu_id())
|
|
, _enter(0)
|
|
, _wait(0)
|
|
{}
|
|
type value() {
|
|
return smp::submit_to(_shard, [this, id = engine().cpu_id()] {
|
|
_enter.signal();
|
|
if (id == _shard) {
|
|
// We should not generate to common value until all shards
|
|
// have reached this point. Thus the two semaphores.
|
|
return _enter.wait(smp::count).then([this] {
|
|
return _func().then([this](T v) {
|
|
_value = std::move(v);
|
|
_wait.signal(smp::count - 1); // we don't wait
|
|
return make_ready_future<T>(*_value);
|
|
}).handle_exception([this](auto ep) {
|
|
_wait.broken(ep);
|
|
return make_exception_future<T>(ep);
|
|
});
|
|
});
|
|
}
|
|
return _wait.wait().then([this] {
|
|
assert(_value);
|
|
return make_ready_future<T>(*_value);
|
|
});
|
|
});
|
|
}
|
|
private:
|
|
func_type _func;
|
|
shard_id _shard;
|
|
semaphore _enter;
|
|
semaphore _wait;
|
|
std::experimental::optional<T> _value;
|
|
};
|
|
|
|
/**
|
|
* Based on the join-code in cf::snapshot.
|
|
* An object that allows us to generate a value for-all-shards
|
|
* at some point down the execution in multiple shards.
|
|
*
|
|
* T type must be copyable, and preferable primitive/trivial
|
|
* or at the very least shard-copy safe.
|
|
*/
|
|
template<typename Func, typename T = std::result_of_t<Func()>>
|
|
joinpoint<T> make_joinpoint(Func && f) {
|
|
return joinpoint<T>([f = std::forward<Func>(f)] {
|
|
return futurize<T>::apply(f);
|
|
});
|
|
}
|
|
|
|
}
|