2023-03-10 16:48:53 -06:00
|
|
|
//===-- Shared memory RPC client / server interface -------------*- C++ -*-===//
|
|
|
|
//
|
|
|
|
// Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
|
|
|
|
// See https://llvm.org/LICENSE.txt for license information.
|
|
|
|
// SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2023-03-20 09:29:43 -05:00
|
|
|
//
|
|
|
|
// This file implements a remote procedure call mechanism to communicate between
|
|
|
|
// heterogeneous devices that can share an address space atomically. We provide
|
|
|
|
// a client and a server to facilitate the remote call. The client makes request
|
|
|
|
// to the server using a shared communication channel. We use separate atomic
|
|
|
|
// signals to indicate which side, the client or the server is in ownership of
|
|
|
|
// the buffer.
|
|
|
|
//
|
|
|
|
//===----------------------------------------------------------------------===//
|
2023-03-10 16:48:53 -06:00
|
|
|
|
|
|
|
#ifndef LLVM_LIBC_SRC_SUPPORT_RPC_RPC_H
|
|
|
|
#define LLVM_LIBC_SRC_SUPPORT_RPC_RPC_H
|
|
|
|
|
2023-03-30 09:50:56 -05:00
|
|
|
#include "rpc_util.h"
|
2023-03-10 16:48:53 -06:00
|
|
|
#include "src/__support/CPP/atomic.h"
|
2023-05-04 14:53:28 -05:00
|
|
|
#include "src/__support/CPP/functional.h"
|
2023-04-13 21:27:51 -05:00
|
|
|
#include "src/__support/CPP/optional.h"
|
2023-04-18 09:44:27 -05:00
|
|
|
#include "src/__support/GPU/utils.h"
|
2023-04-13 21:27:51 -05:00
|
|
|
#include "src/string/memory_utils/memcpy_implementations.h"
|
2023-03-10 16:48:53 -06:00
|
|
|
|
|
|
|
#include <stdint.h>
|
|
|
|
|
|
|
|
namespace __llvm_libc {
|
|
|
|
namespace rpc {
|
|
|
|
|
2023-04-13 21:27:51 -05:00
|
|
|
/// A list of opcodes that we use to invoke certain actions on the server.
|
|
|
|
enum Opcode : uint16_t {
|
2023-03-10 16:48:53 -06:00
|
|
|
NOOP = 0,
|
|
|
|
PRINT_TO_STDERR = 1,
|
|
|
|
EXIT = 2,
|
2023-04-14 09:24:00 -05:00
|
|
|
TEST_INCREMENT = 3,
|
2023-05-10 18:14:51 -05:00
|
|
|
TEST_INTERFACE = 4,
|
2023-03-10 16:48:53 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
/// A fixed size channel used to communicate between the RPC client and server.
|
2023-05-04 14:53:28 -05:00
|
|
|
struct Buffer {
|
|
|
|
uint64_t data[8];
|
2023-03-10 16:48:53 -06:00
|
|
|
};
|
2023-04-13 21:27:51 -05:00
|
|
|
static_assert(sizeof(Buffer) == 64, "Buffer size mismatch");
|
2023-03-10 16:48:53 -06:00
|
|
|
|
2023-05-04 14:53:28 -05:00
|
|
|
/// The information associated with a packet. This indicates which operations to
|
|
|
|
/// perform and which threads are active in the slots.
|
|
|
|
struct Header {
|
|
|
|
uint64_t mask;
|
|
|
|
uint16_t opcode;
|
|
|
|
};
|
|
|
|
|
|
|
|
/// The data payload for the associated packet. We provide enough space for each
|
|
|
|
/// thread in the cooperating lane to have a buffer.
|
|
|
|
struct Payload {
|
|
|
|
#if defined(LIBC_TARGET_ARCH_IS_GPU)
|
|
|
|
Buffer slot[gpu::LANE_SIZE];
|
|
|
|
#else
|
|
|
|
// Flexible array size allocated at runtime to the appropriate size.
|
|
|
|
Buffer slot[];
|
|
|
|
#endif
|
|
|
|
};
|
|
|
|
|
|
|
|
/// A packet used to share data between the client and server across an entire
|
|
|
|
/// lane. We use a lane as the minimum granularity for execution.
|
|
|
|
struct alignas(64) Packet {
|
|
|
|
Header header;
|
|
|
|
Payload payload;
|
|
|
|
};
|
|
|
|
|
2023-05-01 12:10:04 -05:00
|
|
|
// TODO: This should be configured by the server and passed in. The general rule
|
|
|
|
// of thumb is that you should have at least as many ports as possible
|
|
|
|
// concurrent work items on the GPU to mitigate the lack offorward
|
|
|
|
// progress guarantees on the GPU.
|
|
|
|
constexpr uint64_t default_port_count = 64;
|
|
|
|
|
2023-03-10 16:48:53 -06:00
|
|
|
/// A common process used to synchronize communication between a client and a
|
|
|
|
/// server. The process contains an inbox and an outbox used for signaling
|
2023-04-13 21:27:51 -05:00
|
|
|
/// ownership of the shared buffer between both sides.
|
|
|
|
///
|
2023-05-04 00:21:18 +01:00
|
|
|
/// No process writes to its inbox. Each toggles the bit in the outbox to pass
|
|
|
|
/// ownership to the other process.
|
|
|
|
/// When inbox == outbox, the current state machine owns the buffer.
|
|
|
|
/// Initially the client is able to open any port as it will load 0 from both.
|
|
|
|
/// The server inbox read is inverted, so it loads inbox==1, outbox==0 until
|
|
|
|
/// the client has written to its outbox.
|
|
|
|
///
|
2023-04-13 21:27:51 -05:00
|
|
|
/// This process is designed to support mostly arbitrary combinations of 'send'
|
|
|
|
/// and 'recv' operations on the shared buffer as long as these operations are
|
|
|
|
/// mirrored by the other process. These operations exchange ownership of the
|
|
|
|
/// fixed-size buffer between the users of the protocol. The assumptions when
|
|
|
|
/// using this process are as follows:
|
|
|
|
/// - The client will always start with a 'send' operation
|
|
|
|
/// - The server will always start with a 'recv' operation
|
|
|
|
/// - For every 'send' / 'recv' call on one side of the process there is a
|
|
|
|
/// mirrored 'recv' / 'send' call.
|
|
|
|
///
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool InvertInbox> struct Process {
|
2023-03-29 15:24:58 -05:00
|
|
|
LIBC_INLINE Process() = default;
|
2023-05-05 11:58:06 -05:00
|
|
|
LIBC_INLINE Process(const Process &) = delete;
|
|
|
|
LIBC_INLINE Process &operator=(const Process &) = delete;
|
|
|
|
LIBC_INLINE Process(Process &&) = default;
|
|
|
|
LIBC_INLINE Process &operator=(Process &&) = default;
|
2023-03-29 15:24:58 -05:00
|
|
|
LIBC_INLINE ~Process() = default;
|
|
|
|
|
2023-05-01 12:10:04 -05:00
|
|
|
uint64_t port_count;
|
2023-05-04 14:53:28 -05:00
|
|
|
uint32_t lane_size;
|
2023-03-10 16:48:53 -06:00
|
|
|
cpp::Atomic<uint32_t> *inbox;
|
|
|
|
cpp::Atomic<uint32_t> *outbox;
|
2023-05-01 12:10:04 -05:00
|
|
|
Packet *packet;
|
2023-03-10 16:48:53 -06:00
|
|
|
|
2023-05-11 00:39:54 +01:00
|
|
|
cpp::Atomic<uint32_t> lock[default_port_count] = {0};
|
|
|
|
|
2023-03-10 16:48:53 -06:00
|
|
|
/// Initialize the communication channels.
|
2023-05-11 00:39:54 +01:00
|
|
|
LIBC_INLINE void reset(uint64_t port_count, uint32_t lane_size, void *inbox,
|
|
|
|
void *outbox, void *packet) {
|
|
|
|
this->port_count = port_count;
|
|
|
|
this->lane_size = lane_size;
|
|
|
|
this->inbox = reinterpret_cast<cpp::Atomic<uint32_t> *>(inbox);
|
|
|
|
this->outbox = reinterpret_cast<cpp::Atomic<uint32_t> *>(outbox);
|
|
|
|
this->packet = reinterpret_cast<Packet *>(packet);
|
2023-05-01 12:10:04 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// The length of the packet is flexible because the server needs to look up
|
|
|
|
/// the lane size at runtime. This helper indexes at the proper offset.
|
|
|
|
LIBC_INLINE Packet &get_packet(uint64_t index) {
|
|
|
|
return *reinterpret_cast<Packet *>(
|
|
|
|
reinterpret_cast<uint8_t *>(packet) +
|
|
|
|
index * align_up(sizeof(Header) + lane_size * sizeof(Buffer),
|
|
|
|
alignof(Packet)));
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
|
2023-05-04 00:21:18 +01:00
|
|
|
/// Inverting the bits loaded from the inbox in exactly one of the pair of
|
|
|
|
/// processes means that each can use the same state transitions.
|
|
|
|
/// Whichever process has InvertInbox==false is the initial owner.
|
|
|
|
/// Inbox equal Outbox => current process owns the buffer
|
|
|
|
/// Inbox difer Outbox => current process does not own the buffer
|
|
|
|
/// At startup, memory is zero initialised and raw loads of either mailbox
|
|
|
|
/// would return zero. Thus both would succeed in opening a port and data
|
|
|
|
/// races result. If either inbox or outbox is inverted for one process, that
|
|
|
|
/// process interprets memory as Inbox!=Outbox and thus waits for the other.
|
|
|
|
/// It is simpler to invert reads from the inbox than writes to the outbox.
|
|
|
|
LIBC_INLINE uint32_t load_inbox(uint64_t index) {
|
|
|
|
uint32_t i = inbox[index].load(cpp::MemoryOrder::RELAXED);
|
|
|
|
return InvertInbox ? !i : i;
|
|
|
|
}
|
|
|
|
|
2023-05-08 17:37:53 +01:00
|
|
|
/// Retrieve the outbox state from memory shared between processes.
|
|
|
|
/// Never needs to invert the associated read.
|
|
|
|
LIBC_INLINE uint32_t load_outbox(uint64_t index) {
|
|
|
|
return outbox[index].load(cpp::MemoryOrder::RELAXED);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Signal to the other process that this one is finished with the buffer.
|
|
|
|
/// Equivalent to loading outbox followed by store of the inverted value
|
|
|
|
/// The outbox is write only by this warp and tracking the value locally is
|
|
|
|
/// cheaper than calling load_outbox to get the value to store.
|
|
|
|
LIBC_INLINE uint32_t invert_outbox(uint64_t index, uint32_t current_outbox) {
|
|
|
|
uint32_t inverted_outbox = !current_outbox;
|
|
|
|
outbox[index].store(inverted_outbox, cpp::MemoryOrder::RELAXED);
|
|
|
|
return inverted_outbox;
|
|
|
|
}
|
|
|
|
|
2023-05-04 13:58:24 +01:00
|
|
|
/// Determines if this process needs to wait for ownership of the buffer.
|
2023-05-04 13:09:34 +01:00
|
|
|
LIBC_INLINE static bool buffer_unavailable(uint32_t in, uint32_t out) {
|
|
|
|
return in != out;
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
2023-05-04 13:58:24 +01:00
|
|
|
|
|
|
|
/// Attempt to claim the lock at index. Return true on lock taken.
|
2023-05-04 22:30:53 +01:00
|
|
|
/// lane_mask is a bitmap of the threads in the warp that would hold the
|
|
|
|
/// single lock on success, e.g. the result of gpu::get_lane_mask()
|
2023-05-04 13:58:24 +01:00
|
|
|
/// The lock is held when the zeroth bit of the uint32_t at lock[index]
|
|
|
|
/// is set, and available when that bit is clear. Bits [1, 32) are zero.
|
|
|
|
/// Or with one is a no-op when the lock is already held.
|
2023-05-04 22:30:53 +01:00
|
|
|
[[clang::convergent]] LIBC_INLINE bool try_lock(uint64_t lane_mask,
|
|
|
|
uint64_t index) {
|
|
|
|
// On amdgpu, test and set to lock[index] and a sync_lane would suffice
|
|
|
|
// On volta, need to handle differences between the threads running and
|
|
|
|
// the threads that were detected in the previous call to get_lane_mask()
|
|
|
|
//
|
|
|
|
// All threads in lane_mask try to claim the lock. At most one can succeed.
|
|
|
|
// There may be threads active which are not in lane mask which must not
|
|
|
|
// succeed in taking the lock, as otherwise it will leak. This is handled
|
|
|
|
// by making threads which are not in lane_mask or with 0, a no-op.
|
|
|
|
uint32_t id = gpu::get_lane_id();
|
|
|
|
bool id_in_lane_mask = lane_mask & (1ul << id);
|
|
|
|
|
|
|
|
// All threads in the warp call fetch_or. Possibly at the same time.
|
|
|
|
bool before =
|
|
|
|
lock[index].fetch_or(id_in_lane_mask, cpp::MemoryOrder::RELAXED);
|
|
|
|
uint64_t packed = gpu::ballot(lane_mask, before);
|
|
|
|
|
|
|
|
// If every bit set in lane_mask is also set in packed, every single thread
|
|
|
|
// in the warp failed to get the lock. Ballot returns unset for threads not
|
|
|
|
// in the lane mask.
|
|
|
|
//
|
|
|
|
// Cases, per thread:
|
|
|
|
// mask==0 -> unspecified before, discarded by ballot -> 0
|
|
|
|
// mask==1 and before==0 (success), set zero by ballot -> 0
|
|
|
|
// mask==1 and before==1 (failure), set one by ballot -> 1
|
|
|
|
//
|
|
|
|
// mask != packed implies at least one of the threads got the lock
|
|
|
|
// atomic semantics of fetch_or mean at most one of the threads for the lock
|
|
|
|
return lane_mask != packed;
|
2023-05-04 13:58:24 +01:00
|
|
|
}
|
|
|
|
|
2023-05-04 14:53:28 -05:00
|
|
|
/// Unlock the lock at index. We need a lane sync to keep this function
|
|
|
|
/// convergent, otherwise the compiler will sink the store and deadlock.
|
2023-05-04 22:30:53 +01:00
|
|
|
[[clang::convergent]] LIBC_INLINE void unlock(uint64_t lane_mask,
|
|
|
|
uint64_t index) {
|
|
|
|
// Wait for other threads in the warp to finish using the lock
|
|
|
|
gpu::sync_lane(lane_mask);
|
|
|
|
|
|
|
|
// Use exactly one thread to clear the bit at position 0 in lock[index]
|
|
|
|
// Must restrict to a single thread to avoid one thread dropping the lock,
|
|
|
|
// then an unrelated warp claiming the lock, then a second thread in this
|
|
|
|
// warp dropping the lock again.
|
|
|
|
uint32_t and_mask = ~(rpc::is_first_lane(lane_mask) ? 1 : 0);
|
|
|
|
lock[index].fetch_and(and_mask, cpp::MemoryOrder::RELAXED);
|
2023-05-04 14:53:28 -05:00
|
|
|
gpu::sync_lane(lane_mask);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Invokes a function accross every active buffer across the total lane size.
|
|
|
|
LIBC_INLINE void invoke_rpc(cpp::function<void(Buffer *)> fn,
|
2023-05-01 12:10:04 -05:00
|
|
|
Packet &packet) {
|
2023-05-04 14:53:28 -05:00
|
|
|
if constexpr (is_process_gpu()) {
|
2023-05-01 12:10:04 -05:00
|
|
|
fn(&packet.payload.slot[gpu::get_lane_id()]);
|
2023-05-04 14:53:28 -05:00
|
|
|
} else {
|
|
|
|
for (uint32_t i = 0; i < lane_size; i += gpu::get_lane_size())
|
2023-05-01 12:10:04 -05:00
|
|
|
if (packet.header.mask & 1ul << i)
|
|
|
|
fn(&packet.payload.slot[i]);
|
2023-05-04 14:53:28 -05:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Alternate version that also provides the index of the current lane.
|
|
|
|
LIBC_INLINE void invoke_rpc(cpp::function<void(Buffer *, uint32_t)> fn,
|
2023-05-01 12:10:04 -05:00
|
|
|
Packet &packet) {
|
2023-05-04 14:53:28 -05:00
|
|
|
if constexpr (is_process_gpu()) {
|
2023-05-01 12:10:04 -05:00
|
|
|
fn(&packet.payload.slot[gpu::get_lane_id()], gpu::get_lane_id());
|
2023-05-04 14:53:28 -05:00
|
|
|
} else {
|
|
|
|
for (uint32_t i = 0; i < lane_size; i += gpu::get_lane_size())
|
2023-05-01 12:10:04 -05:00
|
|
|
if (packet.header.mask & 1ul << i)
|
|
|
|
fn(&packet.payload.slot[i], i);
|
2023-05-04 14:53:28 -05:00
|
|
|
}
|
2023-05-04 13:58:24 +01:00
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
};
|
|
|
|
|
|
|
|
/// The port provides the interface to communicate between the multiple
|
|
|
|
/// processes. A port is conceptually an index into the memory provided by the
|
|
|
|
/// underlying process that is guarded by a lock bit.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T> struct Port {
|
2023-05-04 12:33:19 -05:00
|
|
|
LIBC_INLINE Port(Process<T> &process, uint64_t lane_mask, uint64_t index,
|
|
|
|
uint32_t out)
|
2023-05-10 18:14:51 -05:00
|
|
|
: process(process), lane_mask(lane_mask), index(index), out(out),
|
|
|
|
receive(false) {}
|
2023-05-08 09:04:14 -05:00
|
|
|
LIBC_INLINE ~Port() = default;
|
|
|
|
|
|
|
|
private:
|
2023-05-05 11:58:06 -05:00
|
|
|
LIBC_INLINE Port(const Port &) = delete;
|
2023-04-13 21:27:51 -05:00
|
|
|
LIBC_INLINE Port &operator=(const Port &) = delete;
|
2023-05-05 11:58:06 -05:00
|
|
|
LIBC_INLINE Port(Port &&) = default;
|
|
|
|
LIBC_INLINE Port &operator=(Port &&) = default;
|
2023-04-13 21:27:51 -05:00
|
|
|
|
2023-05-08 09:04:14 -05:00
|
|
|
friend struct Client;
|
|
|
|
friend struct Server;
|
|
|
|
friend class cpp::optional<Port<T>>;
|
|
|
|
|
|
|
|
public:
|
2023-04-13 21:27:51 -05:00
|
|
|
template <typename U> LIBC_INLINE void recv(U use);
|
|
|
|
template <typename F> LIBC_INLINE void send(F fill);
|
|
|
|
template <typename F, typename U>
|
|
|
|
LIBC_INLINE void send_and_recv(F fill, U use);
|
|
|
|
template <typename W> LIBC_INLINE void recv_and_send(W work);
|
|
|
|
LIBC_INLINE void send_n(const void *src, uint64_t size);
|
|
|
|
template <typename A> LIBC_INLINE void recv_n(A alloc);
|
|
|
|
|
|
|
|
LIBC_INLINE uint16_t get_opcode() const {
|
2023-05-01 12:10:04 -05:00
|
|
|
return process.get_packet(index).header.opcode;
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
2023-05-10 18:14:51 -05:00
|
|
|
LIBC_INLINE void close() {
|
|
|
|
// If the server last did a receive it needs to exchange ownership before
|
|
|
|
// closing the port.
|
|
|
|
if (receive && T)
|
|
|
|
out = process.invert_outbox(index, out);
|
|
|
|
process.unlock(lane_mask, index);
|
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
|
|
|
|
private:
|
2023-05-04 00:21:18 +01:00
|
|
|
Process<T> &process;
|
2023-05-04 12:33:19 -05:00
|
|
|
uint64_t lane_mask;
|
2023-04-13 21:27:51 -05:00
|
|
|
uint64_t index;
|
|
|
|
uint32_t out;
|
2023-05-10 18:14:51 -05:00
|
|
|
bool receive;
|
2023-03-10 16:48:53 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
/// The RPC client used to make requests to the server.
|
2023-05-04 00:21:18 +01:00
|
|
|
struct Client : public Process<false> {
|
2023-03-29 15:24:58 -05:00
|
|
|
LIBC_INLINE Client() = default;
|
2023-05-05 11:58:06 -05:00
|
|
|
LIBC_INLINE Client(const Client &) = delete;
|
|
|
|
LIBC_INLINE Client &operator=(const Client &) = delete;
|
2023-03-29 15:24:58 -05:00
|
|
|
LIBC_INLINE ~Client() = default;
|
|
|
|
|
2023-05-04 00:21:18 +01:00
|
|
|
using Port = rpc::Port<false>;
|
2023-05-08 08:38:24 -05:00
|
|
|
template <uint16_t opcode> LIBC_INLINE cpp::optional<Port> try_open();
|
|
|
|
template <uint16_t opcode> LIBC_INLINE Port open();
|
2023-03-10 16:48:53 -06:00
|
|
|
};
|
|
|
|
|
|
|
|
/// The RPC server used to respond to the client.
|
2023-05-04 00:21:18 +01:00
|
|
|
struct Server : public Process<true> {
|
2023-03-29 15:24:58 -05:00
|
|
|
LIBC_INLINE Server() = default;
|
2023-05-05 11:58:06 -05:00
|
|
|
LIBC_INLINE Server(const Server &) = delete;
|
|
|
|
LIBC_INLINE Server &operator=(const Server &) = delete;
|
2023-03-29 15:24:58 -05:00
|
|
|
LIBC_INLINE ~Server() = default;
|
|
|
|
|
2023-05-04 00:21:18 +01:00
|
|
|
using Port = rpc::Port<true>;
|
2023-04-13 21:27:51 -05:00
|
|
|
LIBC_INLINE cpp::optional<Port> try_open();
|
|
|
|
LIBC_INLINE Port open();
|
2023-03-10 16:48:53 -06:00
|
|
|
};
|
|
|
|
|
2023-04-13 21:27:51 -05:00
|
|
|
/// Applies \p fill to the shared buffer and initiates a send operation.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T> template <typename F> LIBC_INLINE void Port<T>::send(F fill) {
|
|
|
|
uint32_t in = process.load_inbox(index);
|
2023-04-13 21:27:51 -05:00
|
|
|
|
|
|
|
// We need to wait until we own the buffer before sending.
|
2023-05-04 13:09:34 +01:00
|
|
|
while (Process<T>::buffer_unavailable(in, out)) {
|
2023-04-13 21:27:51 -05:00
|
|
|
sleep_briefly();
|
2023-05-04 00:21:18 +01:00
|
|
|
in = process.load_inbox(index);
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
|
|
|
|
// Apply the \p fill function to initialize the buffer and release the memory.
|
2023-05-01 12:10:04 -05:00
|
|
|
process.invoke_rpc(fill, process.get_packet(index));
|
2023-04-13 21:27:51 -05:00
|
|
|
atomic_thread_fence(cpp::MemoryOrder::RELEASE);
|
2023-05-08 17:37:53 +01:00
|
|
|
out = process.invert_outbox(index, out);
|
2023-05-10 18:14:51 -05:00
|
|
|
receive = false;
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Applies \p use to the shared buffer and acknowledges the send.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T> template <typename U> LIBC_INLINE void Port<T>::recv(U use) {
|
2023-05-10 18:14:51 -05:00
|
|
|
// We only exchange ownership of the buffer during a receive if we are waiting
|
|
|
|
// for a previous receive to finish.
|
|
|
|
if (receive)
|
|
|
|
out = process.invert_outbox(index, out);
|
|
|
|
|
2023-05-04 00:21:18 +01:00
|
|
|
uint32_t in = process.load_inbox(index);
|
2023-04-13 21:27:51 -05:00
|
|
|
|
|
|
|
// We need to wait until we own the buffer before receiving.
|
2023-05-04 13:09:34 +01:00
|
|
|
while (Process<T>::buffer_unavailable(in, out)) {
|
2023-04-13 21:27:51 -05:00
|
|
|
sleep_briefly();
|
2023-05-04 00:21:18 +01:00
|
|
|
in = process.load_inbox(index);
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
atomic_thread_fence(cpp::MemoryOrder::ACQUIRE);
|
|
|
|
|
|
|
|
// Apply the \p use function to read the memory out of the buffer.
|
2023-05-01 12:10:04 -05:00
|
|
|
process.invoke_rpc(use, process.get_packet(index));
|
2023-05-10 18:14:51 -05:00
|
|
|
receive = true;
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Combines a send and receive into a single function.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T>
|
2023-04-13 21:27:51 -05:00
|
|
|
template <typename F, typename U>
|
2023-05-04 00:21:18 +01:00
|
|
|
LIBC_INLINE void Port<T>::send_and_recv(F fill, U use) {
|
2023-04-13 21:27:51 -05:00
|
|
|
send(fill);
|
|
|
|
recv(use);
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Combines a receive and send operation into a single function. The \p work
|
|
|
|
/// function modifies the buffer in-place and the send is only used to initiate
|
|
|
|
/// the copy back.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T>
|
|
|
|
template <typename W>
|
|
|
|
LIBC_INLINE void Port<T>::recv_and_send(W work) {
|
2023-04-13 21:27:51 -05:00
|
|
|
recv(work);
|
|
|
|
send([](Buffer *) { /* no-op */ });
|
|
|
|
}
|
|
|
|
|
|
|
|
/// Sends an arbitrarily sized data buffer \p src across the shared channel in
|
|
|
|
/// multiples of the packet length.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T>
|
|
|
|
LIBC_INLINE void Port<T>::send_n(const void *src, uint64_t size) {
|
2023-04-13 21:27:51 -05:00
|
|
|
// TODO: We could send the first bytes in this call and potentially save an
|
|
|
|
// extra send operation.
|
2023-05-04 14:53:28 -05:00
|
|
|
// TODO: We may need a way for the CPU to send different strings per thread.
|
|
|
|
send([=](Buffer *buffer) {
|
|
|
|
reinterpret_cast<uint64_t *>(buffer->data)[0] = size;
|
|
|
|
});
|
2023-04-13 21:27:51 -05:00
|
|
|
const uint8_t *ptr = reinterpret_cast<const uint8_t *>(src);
|
|
|
|
for (uint64_t idx = 0; idx < size; idx += sizeof(Buffer::data)) {
|
|
|
|
send([=](Buffer *buffer) {
|
|
|
|
const uint64_t len =
|
|
|
|
size - idx > sizeof(Buffer::data) ? sizeof(Buffer::data) : size - idx;
|
|
|
|
inline_memcpy(buffer->data, ptr + idx, len);
|
|
|
|
});
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
2023-05-01 12:10:04 -05:00
|
|
|
gpu::sync_lane(process.get_packet(index).header.mask);
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Receives an arbitrarily sized data buffer across the shared channel in
|
|
|
|
/// multiples of the packet length. The \p alloc function is called with the
|
|
|
|
/// size of the data so that we can initialize the size of the \p dst buffer.
|
2023-05-04 00:21:18 +01:00
|
|
|
template <bool T>
|
|
|
|
template <typename A>
|
|
|
|
LIBC_INLINE void Port<T>::recv_n(A alloc) {
|
2023-05-04 14:53:28 -05:00
|
|
|
// The GPU handles thread private variables and masking implicitly through its
|
|
|
|
// execution model. If this is the CPU we need to manually handle the
|
|
|
|
// possibility that the sent data is of different length.
|
|
|
|
if constexpr (is_process_gpu()) {
|
|
|
|
uint64_t size = 0;
|
|
|
|
recv([&](Buffer *buffer) {
|
|
|
|
size = reinterpret_cast<uint64_t *>(buffer->data)[0];
|
|
|
|
});
|
|
|
|
uint8_t *dst = reinterpret_cast<uint8_t *>(alloc(size), gpu::get_lane_id());
|
|
|
|
for (uint64_t idx = 0; idx < size; idx += sizeof(Buffer::data)) {
|
|
|
|
recv([=](Buffer *buffer) {
|
|
|
|
uint64_t len = size - idx > sizeof(Buffer::data) ? sizeof(Buffer::data)
|
|
|
|
: size - idx;
|
|
|
|
inline_memcpy(dst + idx, buffer->data, len);
|
|
|
|
});
|
|
|
|
}
|
|
|
|
return;
|
|
|
|
} else {
|
|
|
|
uint64_t size[MAX_LANE_SIZE];
|
|
|
|
uint8_t *dst[MAX_LANE_SIZE];
|
|
|
|
uint64_t max = 0;
|
|
|
|
recv([&](Buffer *buffer, uint32_t id) {
|
|
|
|
size[id] = reinterpret_cast<uint64_t *>(buffer->data)[0];
|
|
|
|
dst[id] = reinterpret_cast<uint8_t *>(alloc(size[id], id));
|
|
|
|
max = size[id] > max ? size[id] : max;
|
2023-04-13 21:27:51 -05:00
|
|
|
});
|
2023-05-04 14:53:28 -05:00
|
|
|
for (uint64_t idx = 0; idx < max; idx += sizeof(Buffer::data)) {
|
|
|
|
recv([=](Buffer *buffer, uint32_t id) {
|
|
|
|
uint64_t len = size[id] - idx > sizeof(Buffer::data)
|
|
|
|
? sizeof(Buffer::data)
|
|
|
|
: size[id] - idx;
|
|
|
|
if (idx < size[id])
|
|
|
|
inline_memcpy(dst[id] + idx, buffer->data, len);
|
|
|
|
});
|
|
|
|
}
|
|
|
|
return;
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
|
|
|
}
|
|
|
|
|
2023-04-13 21:27:51 -05:00
|
|
|
/// Attempts to open a port to use as the client. The client can only open a
|
|
|
|
/// port if we find an index that is in a valid sending state. That is, there
|
|
|
|
/// are send operations pending that haven't been serviced on this port. Each
|
|
|
|
/// port instance uses an associated \p opcode to tell the server what to do.
|
2023-05-08 08:38:24 -05:00
|
|
|
template <uint16_t opcode>
|
2023-05-04 14:53:28 -05:00
|
|
|
[[clang::convergent]] LIBC_INLINE cpp::optional<Client::Port>
|
2023-05-08 08:38:24 -05:00
|
|
|
Client::try_open() {
|
2023-05-01 12:10:04 -05:00
|
|
|
// Perform a naive linear scan for a port that can be opened to send data.
|
|
|
|
for (uint64_t index = 0; index < port_count; ++index) {
|
|
|
|
// Attempt to acquire the lock on this index.
|
|
|
|
uint64_t lane_mask = gpu::get_lane_mask();
|
|
|
|
if (!try_lock(lane_mask, index))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// The mailbox state must be read with the lock held.
|
|
|
|
atomic_thread_fence(cpp::MemoryOrder::ACQUIRE);
|
|
|
|
|
|
|
|
uint32_t in = load_inbox(index);
|
2023-05-08 17:37:53 +01:00
|
|
|
uint32_t out = load_outbox(index);
|
2023-05-01 12:10:04 -05:00
|
|
|
|
|
|
|
// Once we acquire the index we need to check if we are in a valid sending
|
|
|
|
// state.
|
|
|
|
if (buffer_unavailable(in, out)) {
|
|
|
|
unlock(lane_mask, index);
|
|
|
|
continue;
|
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
|
2023-05-01 12:10:04 -05:00
|
|
|
if (is_first_lane(lane_mask)) {
|
|
|
|
get_packet(index).header.opcode = opcode;
|
|
|
|
get_packet(index).header.mask = lane_mask;
|
|
|
|
}
|
|
|
|
gpu::sync_lane(lane_mask);
|
|
|
|
return Port(*this, lane_mask, index, out);
|
2023-05-04 14:53:28 -05:00
|
|
|
}
|
2023-05-01 12:10:04 -05:00
|
|
|
return cpp::nullopt;
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
2023-05-08 08:38:24 -05:00
|
|
|
template <uint16_t opcode> LIBC_INLINE Client::Port Client::open() {
|
2023-04-13 21:27:51 -05:00
|
|
|
for (;;) {
|
2023-05-08 08:38:24 -05:00
|
|
|
if (cpp::optional<Client::Port> p = try_open<opcode>())
|
2023-05-05 11:58:06 -05:00
|
|
|
return cpp::move(p.value());
|
2023-04-13 21:27:51 -05:00
|
|
|
sleep_briefly();
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
|
|
|
/// Attempts to open a port to use as the server. The server can only open a
|
|
|
|
/// port if it has a pending receive operation
|
2023-05-04 14:53:28 -05:00
|
|
|
[[clang::convergent]] LIBC_INLINE cpp::optional<Server::Port>
|
|
|
|
Server::try_open() {
|
2023-05-01 12:10:04 -05:00
|
|
|
// Perform a naive linear scan for a port that has a pending request.
|
|
|
|
for (uint64_t index = 0; index < port_count; ++index) {
|
|
|
|
uint32_t in = load_inbox(index);
|
2023-05-08 17:37:53 +01:00
|
|
|
uint32_t out = load_outbox(index);
|
2023-05-01 12:10:04 -05:00
|
|
|
|
|
|
|
// The server is passive, if there is no work pending don't bother
|
|
|
|
// opening a port.
|
|
|
|
if (buffer_unavailable(in, out))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// Attempt to acquire the lock on this index.
|
|
|
|
uint64_t lane_mask = gpu::get_lane_mask();
|
|
|
|
// Attempt to acquire the lock on this index.
|
|
|
|
if (!try_lock(lane_mask, index))
|
|
|
|
continue;
|
|
|
|
|
|
|
|
// The mailbox state must be read with the lock held.
|
|
|
|
atomic_thread_fence(cpp::MemoryOrder::ACQUIRE);
|
|
|
|
|
|
|
|
in = load_inbox(index);
|
2023-05-08 17:37:53 +01:00
|
|
|
out = load_outbox(index);
|
2023-05-01 12:10:04 -05:00
|
|
|
|
|
|
|
if (buffer_unavailable(in, out)) {
|
|
|
|
unlock(lane_mask, index);
|
|
|
|
continue;
|
|
|
|
}
|
2023-04-13 21:27:51 -05:00
|
|
|
|
2023-05-01 12:10:04 -05:00
|
|
|
return Port(*this, lane_mask, index, out);
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
2023-05-01 12:10:04 -05:00
|
|
|
return cpp::nullopt;
|
2023-04-13 21:27:51 -05:00
|
|
|
}
|
|
|
|
|
2023-05-04 00:21:18 +01:00
|
|
|
LIBC_INLINE Server::Port Server::open() {
|
2023-04-13 21:27:51 -05:00
|
|
|
for (;;) {
|
2023-05-04 00:21:18 +01:00
|
|
|
if (cpp::optional<Server::Port> p = try_open())
|
2023-05-05 11:58:06 -05:00
|
|
|
return cpp::move(p.value());
|
2023-04-13 21:27:51 -05:00
|
|
|
sleep_briefly();
|
|
|
|
}
|
2023-03-10 16:48:53 -06:00
|
|
|
}
|
|
|
|
|
|
|
|
} // namespace rpc
|
|
|
|
} // namespace __llvm_libc
|
|
|
|
|
|
|
|
#endif
|