mirror of
https://github.com/bitcoin/bitcoin.git
synced 2026-03-11 16:15:34 +01:00
1868a84451f Merge bitcoin-core/libmultiprocess#245: type-context.h: Extent cancel_mutex lock to prevent theoretical race fd4a90d3103 Merge bitcoin-core/libmultiprocess#244: ci: suppress two tidy lint issues 16dfc368640 ci: avoid bugprone-unused-return-value lint in test dacd5eda464 ci: suppress nontrivial-threadlocal lint in proxy.cpp ef96a5b2be2 doc: Comment cleanups after #240 e0f1cd76219 type-context.h: Extent cancel_mutex lock to prevent theoretical race 290702c74ce Merge bitcoin-core/libmultiprocess#240: Avoid errors from asynchronous (non-c++) clients 3a69d4755af Merge bitcoin-core/libmultiprocess#241: doc: Bump version number v7 -> v8 0174450ca2e Prevent crash on unclean disconnect if abandoned IPC call returns interface pointer ddb5f74196f Allow simultaneous calls on same Context.thread c4762c7b513 refactor: Add ProxyServer<Thread>::post() method 0ade1b40ac5 doc: Bump version number git-subtree-dir: src/ipc/libmultiprocess git-subtree-split: 1868a84451fe1b6a00116375a5f717230bb2533e
343 lines
11 KiB
C++
343 lines
11 KiB
C++
// Copyright (c) The Bitcoin Core developers
|
|
// Distributed under the MIT software license, see the accompanying
|
|
// file COPYING or http://www.opensource.org/licenses/mit-license.php.
|
|
|
|
#ifndef MP_UTIL_H
|
|
#define MP_UTIL_H
|
|
|
|
#include <capnp/schema.h>
|
|
#include <cassert>
|
|
#include <cstddef>
|
|
#include <cstring>
|
|
#include <exception>
|
|
#include <functional>
|
|
#include <kj/string-tree.h>
|
|
#include <mutex>
|
|
#include <string>
|
|
#include <tuple>
|
|
#include <type_traits>
|
|
#include <utility>
|
|
#include <variant>
|
|
#include <vector>
|
|
|
|
namespace mp {
|
|
|
|
//! Generic utility functions used by capnp code.
|
|
|
|
//! Type holding a list of types.
|
|
//!
|
|
//! Example:
|
|
//! TypeList<int, bool, void>
|
|
template <typename... Types>
|
|
struct TypeList
|
|
{
|
|
static constexpr size_t size = sizeof...(Types);
|
|
};
|
|
|
|
//! Construct a template class value by deducing template arguments from the
|
|
//! types of constructor arguments, so they don't need to be specified manually.
|
|
//!
|
|
//! Uses of this can go away with class template deduction in C++17
|
|
//! (https://en.cppreference.com/w/cpp/language/class_template_argument_deduction)
|
|
//!
|
|
//! Example:
|
|
//! Make<std::pair>(5, true) // Constructs std::pair<int, bool>(5, true);
|
|
template <template <typename...> class Class, typename... Types, typename... Args>
|
|
Class<Types..., std::remove_reference_t<Args>...> Make(Args&&... args)
|
|
{
|
|
return Class<Types..., std::remove_reference_t<Args>...>{std::forward<Args>(args)...};
|
|
}
|
|
|
|
//! Type helper splitting a TypeList into two halves at position index.
|
|
//!
|
|
//! Example:
|
|
//! is_same<TypeList<int, double>, Split<2, TypeList<int, double, float, bool>>::First>
|
|
//! is_same<TypeList<float, bool>, Split<2, TypeList<int, double, float, bool>>::Second>
|
|
template <std::size_t index, typename List, typename _First = TypeList<>, bool done = index == 0>
|
|
struct Split;
|
|
|
|
//! Specialization of above (base case)
|
|
template <typename _Second, typename _First>
|
|
struct Split<0, _Second, _First, true>
|
|
{
|
|
using First = _First;
|
|
using Second = _Second;
|
|
};
|
|
|
|
//! Specialization of above (recursive case)
|
|
template <std::size_t index, typename Type, typename... _Second, typename... _First>
|
|
struct Split<index, TypeList<Type, _Second...>, TypeList<_First...>, false>
|
|
{
|
|
using _Next = Split<index - 1, TypeList<_Second...>, TypeList<_First..., Type>>;
|
|
using First = typename _Next::First;
|
|
using Second = typename _Next::Second;
|
|
};
|
|
|
|
//! Type helper giving return type of a callable type.
|
|
template <typename Callable>
|
|
using ResultOf = decltype(std::declval<Callable>()());
|
|
|
|
//! Substitutue for std::remove_cvref_t
|
|
template <typename T>
|
|
using RemoveCvRef = std::remove_cv_t<std::remove_reference_t<T>>;
|
|
|
|
//! Type helper abbreviating std::decay.
|
|
template <typename T>
|
|
using Decay = std::decay_t<T>;
|
|
|
|
//! SFINAE helper, see using Require below.
|
|
template <typename SfinaeExpr, typename Result_>
|
|
struct _Require
|
|
{
|
|
using Result = Result_;
|
|
};
|
|
|
|
//! SFINAE helper, basically the same as to C++17's void_t, but allowing types other than void to be returned.
|
|
template <typename SfinaeExpr, typename Result = void>
|
|
using Require = typename _Require<SfinaeExpr, Result>::Result;
|
|
|
|
//! Function parameter type for prioritizing overloaded function calls that
|
|
//! would otherwise be ambiguous.
|
|
//!
|
|
//! Example:
|
|
//! auto foo(Priority<1>) -> std::enable_if<>;
|
|
//! auto foo(Priority<0>) -> void;
|
|
//!
|
|
//! foo(Priority<1>()); // Calls higher priority overload if enabled.
|
|
template <int priority>
|
|
struct Priority : Priority<priority - 1>
|
|
{
|
|
};
|
|
|
|
//! Specialization of above (base case)
|
|
template <>
|
|
struct Priority<0>
|
|
{
|
|
};
|
|
|
|
//! Return capnp type name with filename prefix removed.
|
|
template <typename T>
|
|
const char* TypeName()
|
|
{
|
|
// DisplayName string looks like
|
|
// "interfaces/capnp/common.capnp:ChainNotifications.resendWalletTransactions$Results"
|
|
// This discards the part of the string before the first ':' character.
|
|
// Another alternative would be to use the displayNamePrefixLength field,
|
|
// but this discards everything before the last '.' character, throwing away
|
|
// the object name, which is useful.
|
|
const char* display_name = ::capnp::Schema::from<T>().getProto().getDisplayName().cStr();
|
|
const char* short_name = strchr(display_name, ':');
|
|
return short_name ? short_name + 1 : display_name;
|
|
}
|
|
|
|
//! Convenient wrapper around std::variant<T*, T>
|
|
template <typename T>
|
|
struct PtrOrValue {
|
|
std::variant<T*, T> data;
|
|
|
|
template <typename... Args>
|
|
PtrOrValue(T* ptr, Args&&... args) : data(ptr ? ptr : std::variant<T*, T>{std::in_place_type<T>, std::forward<Args>(args)...}) {}
|
|
|
|
T& operator*() { return data.index() ? std::get<T>(data) : *std::get<T*>(data); }
|
|
T* operator->() { return &**this; }
|
|
T& operator*() const { return data.index() ? std::get<T>(data) : *std::get<T*>(data); }
|
|
T* operator->() const { return &**this; }
|
|
};
|
|
|
|
// Annotated mutex and lock class (https://clang.llvm.org/docs/ThreadSafetyAnalysis.html)
|
|
#if defined(__clang__) && (!defined(SWIG))
|
|
#define MP_TSA(x) __attribute__((x))
|
|
#else
|
|
#define MP_TSA(x) // no-op
|
|
#endif
|
|
|
|
#define MP_CAPABILITY(x) MP_TSA(capability(x))
|
|
#define MP_SCOPED_CAPABILITY MP_TSA(scoped_lockable)
|
|
#define MP_REQUIRES(x) MP_TSA(requires_capability(x))
|
|
#define MP_ACQUIRE(...) MP_TSA(acquire_capability(__VA_ARGS__))
|
|
#define MP_RELEASE(...) MP_TSA(release_capability(__VA_ARGS__))
|
|
#define MP_ASSERT_CAPABILITY(x) MP_TSA(assert_capability(x))
|
|
#define MP_GUARDED_BY(x) MP_TSA(guarded_by(x))
|
|
#define MP_NO_TSA MP_TSA(no_thread_safety_analysis)
|
|
|
|
class MP_CAPABILITY("mutex") Mutex {
|
|
public:
|
|
void lock() MP_ACQUIRE() { m_mutex.lock(); }
|
|
void unlock() MP_RELEASE() { m_mutex.unlock(); }
|
|
|
|
std::mutex m_mutex;
|
|
};
|
|
|
|
class MP_SCOPED_CAPABILITY Lock {
|
|
public:
|
|
explicit Lock(Mutex& m) MP_ACQUIRE(m) : m_lock(m.m_mutex) {}
|
|
~Lock() MP_RELEASE() = default;
|
|
void unlock() MP_RELEASE() { m_lock.unlock(); }
|
|
void lock() MP_ACQUIRE() { m_lock.lock(); }
|
|
void assert_locked(Mutex& mutex) MP_ASSERT_CAPABILITY() MP_ASSERT_CAPABILITY(mutex)
|
|
{
|
|
assert(m_lock.mutex() == &mutex.m_mutex);
|
|
assert(m_lock);
|
|
}
|
|
|
|
std::unique_lock<std::mutex> m_lock;
|
|
};
|
|
|
|
template<typename T>
|
|
struct GuardedRef
|
|
{
|
|
Mutex& mutex;
|
|
T& ref MP_GUARDED_BY(mutex);
|
|
};
|
|
|
|
// CTAD for Clang 16: GuardedRef{mutex, x} -> GuardedRef<decltype(x)>
|
|
template <class U>
|
|
GuardedRef(Mutex&, U&) -> GuardedRef<U>;
|
|
|
|
//! Analog to std::lock_guard that unlocks instead of locks.
|
|
template <typename Lock>
|
|
struct UnlockGuard
|
|
{
|
|
UnlockGuard(Lock& lock) : m_lock(lock) { m_lock.unlock(); }
|
|
~UnlockGuard() { m_lock.lock(); }
|
|
Lock& m_lock;
|
|
};
|
|
|
|
template <typename Lock, typename Callback>
|
|
void Unlock(Lock& lock, Callback&& callback)
|
|
{
|
|
const UnlockGuard<Lock> unlock(lock);
|
|
callback();
|
|
}
|
|
|
|
//! Invoke a function and run a follow-up action before returning the original
|
|
//! result.
|
|
//!
|
|
//! This can be used similarly to KJ_DEFER to run cleanup code, but works better
|
|
//! if the cleanup function can throw because it avoids clang bug
|
|
//! https://github.com/llvm/llvm-project/issues/12658 which skips calling
|
|
//! destructors in that case and can lead to memory leaks. Also, if both
|
|
//! functions throw, this lets one exception take precedence instead of
|
|
//! terminating due to having two active exceptions.
|
|
template <typename Fn, typename After>
|
|
decltype(auto) TryFinally(Fn&& fn, After&& after)
|
|
{
|
|
bool success{false};
|
|
using R = std::invoke_result_t<Fn>;
|
|
try {
|
|
if constexpr (std::is_void_v<R>) {
|
|
std::forward<Fn>(fn)();
|
|
success = true;
|
|
std::forward<After>(after)();
|
|
return;
|
|
} else {
|
|
decltype(auto) result = std::forward<Fn>(fn)();
|
|
success = true;
|
|
std::forward<After>(after)();
|
|
return result;
|
|
}
|
|
} catch (...) {
|
|
if (!success) std::forward<After>(after)();
|
|
throw;
|
|
}
|
|
}
|
|
|
|
//! Format current thread name as "{exe_name}-{$pid}/{thread_name}-{$tid}".
|
|
std::string ThreadName(const char* exe_name);
|
|
|
|
//! Escape binary string for use in log so it doesn't trigger unicode decode
|
|
//! errors in python unit tests.
|
|
std::string LogEscape(const kj::StringTree& string, size_t max_size);
|
|
|
|
//! Callback type used by SpawnProcess below.
|
|
using FdToArgsFn = std::function<std::vector<std::string>(int fd)>;
|
|
|
|
//! Spawn a new process that communicates with the current process over a socket
|
|
//! pair. Returns pid through an output argument, and file descriptor for the
|
|
//! local side of the socket.
|
|
//! The fd_to_args callback is invoked in the parent process before fork().
|
|
//! It must not rely on child pid/state, and must return the command line
|
|
//! arguments that should be used to execute the process. Embed the remote file
|
|
//! descriptor number in whatever format the child process expects.
|
|
int SpawnProcess(int& pid, FdToArgsFn&& fd_to_args);
|
|
|
|
//! Call execvp with vector args.
|
|
//! Not safe to call in a post-fork child of a multi-threaded process.
|
|
//! Currently only used by mpgen at build time.
|
|
void ExecProcess(const std::vector<std::string>& args);
|
|
|
|
//! Wait for a process to exit and return its exit code.
|
|
int WaitProcess(int pid);
|
|
|
|
inline char* CharCast(char* c) { return c; }
|
|
inline char* CharCast(unsigned char* c) { return (char*)c; }
|
|
inline const char* CharCast(const char* c) { return c; }
|
|
inline const char* CharCast(const unsigned char* c) { return (const char*)c; }
|
|
|
|
//! Exception thrown from code executing an IPC call that is interrupted.
|
|
struct InterruptException final : std::exception {
|
|
explicit InterruptException(std::string message) : m_message(std::move(message)) {}
|
|
const char* what() const noexcept override { return m_message.c_str(); }
|
|
std::string m_message;
|
|
};
|
|
|
|
class CancelProbe;
|
|
|
|
//! Helper class that detects when a promise is canceled. Used to detect
|
|
//! canceled requests and prevent potential crashes on unclean disconnects.
|
|
//!
|
|
//! In the future, this could also be used to support a way for wrapped C++
|
|
//! methods to detect cancellation (like approach #4 in
|
|
//! https://github.com/bitcoin/bitcoin/issues/33575).
|
|
class CancelMonitor
|
|
{
|
|
public:
|
|
inline ~CancelMonitor();
|
|
inline void promiseDestroyed(CancelProbe& probe);
|
|
|
|
bool m_canceled{false};
|
|
std::function<void()> m_on_cancel;
|
|
CancelProbe* m_probe{nullptr};
|
|
};
|
|
|
|
//! Helper object to attach to a promise and update a CancelMonitor.
|
|
class CancelProbe
|
|
{
|
|
public:
|
|
CancelProbe(CancelMonitor& monitor) : m_monitor(&monitor)
|
|
{
|
|
assert(!monitor.m_probe);
|
|
monitor.m_probe = this;
|
|
}
|
|
~CancelProbe()
|
|
{
|
|
if (m_monitor) m_monitor->promiseDestroyed(*this);
|
|
}
|
|
CancelMonitor* m_monitor;
|
|
};
|
|
|
|
CancelMonitor::~CancelMonitor()
|
|
{
|
|
if (m_probe) {
|
|
assert(m_probe->m_monitor == this);
|
|
m_probe->m_monitor = nullptr;
|
|
m_probe = nullptr;
|
|
}
|
|
}
|
|
|
|
void CancelMonitor::promiseDestroyed(CancelProbe& probe)
|
|
{
|
|
// If promise is being destroyed, assume the promise has been canceled. In
|
|
// theory this method could be called when a promise was fulfilled or
|
|
// rejected rather than canceled, but it's safe to assume that's not the
|
|
// case because the CancelMonitor class is meant to be used inside code
|
|
// fulfilling or rejecting the promise and destroyed before doing so.
|
|
assert(m_probe == &probe);
|
|
m_canceled = true;
|
|
if (m_on_cancel) m_on_cancel();
|
|
m_probe = nullptr;
|
|
}
|
|
} // namespace mp
|
|
|
|
#endif // MP_UTIL_H
|