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 132 133 134 135 136 137 138 139 140 141 142 143 144 145 146 147 148 149 150 151 152 153 154 155 156 157 158 159 160 161 162 163 164 165 166 167 168 169 170 171 172 173 174 175 176 177 178 179 180 181 182 183 184 185 186 187 188 189 190 191 192 193 194 195 196 197 198 199 200 201 202 203 204 205 206 207 208 209 210 211 212 213 214 215 216 217 218 219 220 221 222 223 224 225 226 227 228 229 230 231 232 233 234 235 236 237 238 239 240 241 242 243 244 245 246 247 248 249 250 251 252 253 254 255 256 257 258 259 260 261 262 263 264 265 266 267 268 269 270 271 272 273 274 275 276 277 278 279 280 281 282 283 284 285 286 287 288 289 290 291 292 293 294 295 296 297 298 299 300 301 302 303 304 305 306 307 308 309 310 311 312 313 314 315 316 317 318 319 320 321 322 323 324 325 326
|
/* Copyright (C) 2022 Wildfire Games.
* This file is part of 0 A.D.
*
* 0 A.D. is free software: you can redistribute it and/or modify
* it under the terms of the GNU General Public License as published by
* the Free Software Foundation, either version 2 of the License, or
* (at your option) any later version.
*
* 0 A.D. 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 0 A.D. If not, see <http://www.gnu.org/licenses/>.
*/
#ifndef INCLUDED_FUTURE
#define INCLUDED_FUTURE
#include "ps/FutureForward.h"
#include <atomic>
#include <condition_variable>
#include <functional>
#include <mutex>
#include <type_traits>
template<typename ResultType>
class PackagedTask;
namespace FutureSharedStateDetail
{
enum class Status
{
PENDING,
STARTED,
DONE,
CANCELED
};
template<typename ResultType>
class SharedStateResult
{
public:
void ResetResult()
{
if (m_HasResult)
m_Result.m_Result.~ResultType();
m_HasResult = false;
}
union Result
{
std::aligned_storage_t<sizeof(ResultType), alignof(ResultType)> m_Bytes;
ResultType m_Result;
Result() : m_Bytes() {};
~Result() {};
};
// We don't use Result directly so the result doesn't have to be default constructible.
Result m_Result;
bool m_HasResult = false;
};
// Don't have m_Result for void ReturnType
template<>
class SharedStateResult<void>
{
};
/**
* The shared state between futures and packaged state.
* Holds all relevant data.
*/
template<typename ResultType>
class SharedState : public SharedStateResult<ResultType>
{
static constexpr bool VoidResult = std::is_same_v<ResultType, void>;
public:
SharedState(std::function<ResultType()>&& func) : m_Func(std::move(func)) {}
~SharedState()
{
// For safety, wait on started task completion, but not on pending ones (auto-cancelled).
if (!Cancel())
{
Wait();
Cancel();
}
if constexpr (!VoidResult)
SharedStateResult<ResultType>::ResetResult();
}
SharedState(const SharedState&) = delete;
SharedState(SharedState&&) = delete;
bool IsDoneOrCanceled() const
{
return m_Status == Status::DONE || m_Status == Status::CANCELED;
}
void Wait()
{
// Fast path: we're already done.
if (IsDoneOrCanceled())
return;
// Slow path: we aren't done when we run the above check. Lock and wait until we are.
std::unique_lock<std::mutex> lock(m_Mutex);
m_ConditionVariable.wait(lock, [this]() -> bool { return IsDoneOrCanceled(); });
}
/**
* If the task is pending, cancel it: the status becomes CANCELED and if the task was completed, the result is destroyed.
* @return true if the task was indeed cancelled, false otherwise (the task is running or already done).
*/
bool Cancel()
{
Status expected = Status::PENDING;
bool cancelled = m_Status.compare_exchange_strong(expected, Status::CANCELED);
// If we're done, invalidate, if we're pending, atomically cancel, otherwise fail.
if (cancelled || m_Status == Status::DONE)
{
if (m_Status == Status::DONE)
m_Status = Status::CANCELED;
if constexpr (!VoidResult)
SharedStateResult<ResultType>::ResetResult();
m_ConditionVariable.notify_all();
return cancelled;
}
return false;
}
/**
* Move the result away from the shared state, mark the future invalid.
*/
template<typename _ResultType = ResultType>
std::enable_if_t<!std::is_same_v<_ResultType, void>, ResultType> GetResult()
{
// The caller must ensure that this is only called if we have a result.
ENSURE(SharedStateResult<ResultType>::m_HasResult);
m_Status = Status::CANCELED;
SharedStateResult<ResultType>::m_HasResult = false;
return std::move(SharedStateResult<ResultType>::m_Result.m_Result);
}
std::atomic<Status> m_Status = Status::PENDING;
std::mutex m_Mutex;
std::condition_variable m_ConditionVariable;
std::function<ResultType()> m_Func;
};
} // namespace FutureSharedStateDetail
/**
* Corresponds to std::future.
* Unlike std::future, Future can request the cancellation of the task that would produce the result.
* This makes it more similar to Java's CancellableTask or C#'s Task.
* The name Future was kept over Task so it would be more familiar to C++ users,
* but this all should be revised once Concurrency TS wraps up.
*
* Future is _not_ thread-safe. Call it from a single thread or ensure synchronization externally.
*
* The destructor is never blocking. The promise may still be running on destruction.
* TODO:
* - Handle exceptions.
*/
template<typename ResultType>
class Future
{
template<typename T>
friend class PackagedTask;
static constexpr bool VoidResult = std::is_same_v<ResultType, void>;
using Status = FutureSharedStateDetail::Status;
using SharedState = FutureSharedStateDetail::SharedState<ResultType>;
public:
Future() = default;
Future(const Future& o) = delete;
Future(Future&&) = default;
Future& operator=(Future&&) = default;
~Future() = default;
/**
* Make the future wait for the result of @a func.
*/
template<typename T>
PackagedTask<ResultType> Wrap(T&& func);
/**
* Move the result out of the future, and invalidate the future.
* If the future is not complete, calls Wait().
* If the future is canceled, asserts.
*/
template<typename SfinaeType = ResultType>
std::enable_if_t<!std::is_same_v<SfinaeType, void>, ResultType> Get()
{
ENSURE(!!m_SharedState);
Wait();
if constexpr (VoidResult)
return;
else
{
ENSURE(m_SharedState->m_Status != Status::CANCELED);
// This mark the state invalid - can't call Get again.
return m_SharedState->GetResult();
}
}
/**
* @return true if the shared state is valid and has a result (i.e. Get can be called).
*/
bool IsReady() const
{
return !!m_SharedState && m_SharedState->m_Status == Status::DONE;
}
/**
* @return true if the future has a shared state and it's not been invalidated, ie. pending, started or done.
*/
bool Valid() const
{
return !!m_SharedState && m_SharedState->m_Status != Status::CANCELED;
}
void Wait()
{
if (Valid())
m_SharedState->Wait();
}
/**
* Cancels the task, waiting if the task is currently started.
* Use this function over Cancel() if you need to ensure determinism (i.e. in the simulation).
* @see Cancel.
*/
void CancelOrWait()
{
if (!Valid())
return;
if (!m_SharedState->Cancel())
m_SharedState->Wait();
m_SharedState.reset();
}
/**
* Cancels the task (without waiting).
* The result is always invalid, even if the task had completed before.
* Note that this cannot stop started tasks.
*/
void Cancel()
{
if (m_SharedState)
m_SharedState->Cancel();
m_SharedState.reset();
}
protected:
std::shared_ptr<SharedState> m_SharedState;
};
/**
* Corresponds somewhat to std::packaged_task.
* Like packaged_task, this holds a function acting as a promise.
* This type is mostly just the shared state and the call operator,
* handling the promise & continuation logic.
*/
template<typename ResultType>
class PackagedTask
{
static constexpr bool VoidResult = std::is_same_v<ResultType, void>;
public:
PackagedTask() = delete;
PackagedTask(std::shared_ptr<typename Future<ResultType>::SharedState> ss) : m_SharedState(std::move(ss)) {}
void operator()()
{
typename Future<ResultType>::Status expected = Future<ResultType>::Status::PENDING;
if (!m_SharedState->m_Status.compare_exchange_strong(expected, Future<ResultType>::Status::STARTED))
return;
if constexpr (VoidResult)
m_SharedState->m_Func();
else
{
// To avoid UB, explicitly placement-new the value.
new (&m_SharedState->m_Result) ResultType{std::move(m_SharedState->m_Func())};
m_SharedState->m_HasResult = true;
}
// Because we might have threads waiting on us, we need to make sure that they either:
// - don't wait on our condition variable
// - receive the notification when we're done.
// This requires locking the mutex (@see Wait).
{
std::lock_guard<std::mutex> lock(m_SharedState->m_Mutex);
m_SharedState->m_Status = Future<ResultType>::Status::DONE;
}
m_SharedState->m_ConditionVariable.notify_all();
// We no longer need the shared state, drop it immediately.
m_SharedState.reset();
}
void Cancel()
{
m_SharedState->Cancel();
m_SharedState.reset();
}
protected:
std::shared_ptr<typename Future<ResultType>::SharedState> m_SharedState;
};
template<typename ResultType>
template<typename T>
PackagedTask<ResultType> Future<ResultType>::Wrap(T&& func)
{
static_assert(std::is_convertible_v<std::invoke_result_t<T>, ResultType>, "The return type of the wrapped function cannot be converted to the type of the Future.");
m_SharedState = std::make_shared<SharedState>(std::move(func));
return PackagedTask<ResultType>(m_SharedState);
}
#endif // INCLUDED_FUTURE
|