Files
CoopAllTheThings/common/include/coop/log_ring.hpp
BlackMark 9557b9ca69 Log window: stream the hook's logs over IPC into an in-app Log panel
Add a shared log ring (common/coop/log_ring.hpp): a lossy multi-producer /
single-consumer ring named coop_log_<pid>. The hook logs from several threads,
so producers claim a slot with fetch_add and publish each record with a
release store of its sequence; the consumer reads in order and tolerates
losing the oldest lines if it falls a whole ring behind.

The DLL's logf() now formats once and pushes every line to the ring (the file
trace stays as an opt-in mirror); the worker attaches the ring right after IPC
connect so bring-up is captured. The host (IpcServer) creates the ring at
injection time and exposes drain_logs(); a new LogPanel pulls new lines each
frame into a bounded rolling buffer and renders them with auto-scroll, a
filter, and clear. Added to the View menu (and UiState.show_log).

Verified against Phantom Brave via coop_audio_probe, which now also creates the
ring and drains it: the full hook bring-up trace streamed over IPC. All four
tests pass.

Co-Authored-By: Claude Opus 4.8 <noreply@anthropic.com>
2026-06-19 20:25:04 +02:00

129 lines
4.2 KiB
C++

// Shared-memory log channel: the injected hook (coop_hook.dll) streams its log
// lines to the host (coop_host.exe), which shows them in a Log window. Separate
// mapping from the input/status SharedBlock, named coop_log_<pid>.
//
// Lossy multi-producer / single-consumer ring: the hook logs from several threads
// (worker, audio render thread, window thread), so producers claim a slot with an
// atomic fetch_add and publish each record with a release store of its sequence;
// the host consumer reads in order and tolerates losing the oldest lines if it
// ever falls a whole ring behind (fine for diagnostics). POD + version-locked.
#pragma once
#include <atomic>
#include <cstdint>
#include <cstring>
#include <string>
namespace coop
{
// 'CLOG' little-endian.
inline constexpr std::uint32_t kLogRingMagic = 0x474F4C43u;
inline constexpr std::uint32_t kLogRingVersion = 1;
// Per-pid mapping name, mirroring the other channels: coop_log_<pid>.
inline constexpr wchar_t kLogRingPrefix[] = L"Local\\coop_log_";
inline constexpr std::uint32_t kLogMsgLen = 192; // chars per line (incl. NUL)
inline constexpr std::uint32_t kLogCapacity = 1024; // ring records
struct LogRecord
{
std::atomic<std::uint64_t> seq; // 0 = empty; else (global index + 1) once written
std::uint32_t pid;
std::uint32_t level; // reserved (0)
std::uint64_t millis; // producer timestamp (GetTickCount64)
char text[kLogMsgLen];
};
struct LogRing
{
std::uint32_t magic;
std::uint32_t version;
std::uint32_t capacity; // number of records
std::uint32_t msg_len; // kLogMsgLen (sanity)
std::atomic<std::uint64_t> write_index; // total records ever claimed (free-running)
std::uint8_t reserved[32];
// LogRecord records[capacity] follows immediately.
};
static_assert(std::atomic<std::uint64_t>::is_always_lock_free,
"log ring needs a lock-free 64-bit atomic for cross-process use");
inline constexpr std::size_t log_ring_total_size(std::uint32_t capacity)
{
return sizeof(LogRing) + static_cast<std::size_t>(capacity) * sizeof(LogRecord);
}
inline LogRecord* log_ring_records(LogRing* r)
{
return reinterpret_cast<LogRecord*>(reinterpret_cast<std::uint8_t*>(r) + sizeof(LogRing));
}
// Host: stamp a freshly created (zero-filled) mapping. Records start empty (seq 0).
inline void log_ring_init(LogRing& r, std::uint32_t capacity)
{
r.capacity = capacity;
r.msg_len = kLogMsgLen;
r.write_index.store(0, std::memory_order_relaxed);
std::memset(r.reserved, 0, sizeof(r.reserved));
r.version = kLogRingVersion;
r.magic = kLogRingMagic; // last
}
inline bool log_ring_valid(const LogRing& r)
{
return r.magic == kLogRingMagic && r.version == kLogRingVersion && r.capacity != 0 &&
r.msg_len == kLogMsgLen;
}
// Producer (hook): append a line. Multi-producer safe.
inline void log_ring_push(LogRing& r, std::uint32_t pid, std::uint64_t millis, const char* text)
{
const std::uint64_t idx = r.write_index.fetch_add(1, std::memory_order_acq_rel);
LogRecord& rec = log_ring_records(&r)[idx % r.capacity];
rec.pid = pid;
rec.level = 0;
rec.millis = millis;
std::strncpy(rec.text, text, kLogMsgLen - 1);
rec.text[kLogMsgLen - 1] = '\0';
rec.seq.store(idx + 1, std::memory_order_release); // publish: record is ready
}
// Consumer (host): emit each new record since `cursor` (advanced in place). Skips
// records lost to ring wrap; stops at an in-flight record and retries next call.
template <typename F>
inline void log_ring_drain(LogRing& r, std::uint64_t& cursor, F&& emit)
{
const std::uint64_t w = r.write_index.load(std::memory_order_acquire);
if (w <= cursor)
{
return;
}
const std::uint64_t lo = (w > r.capacity) ? (w - r.capacity) : 0;
std::uint64_t i = cursor < lo ? lo : cursor; // skip records already overwritten
LogRecord* recs = log_ring_records(&r);
for (; i < w; ++i)
{
LogRecord& rec = recs[i % r.capacity];
const std::uint64_t s = rec.seq.load(std::memory_order_acquire);
if (s == i + 1)
{
emit(rec); // ready
}
else if (s <= i)
{
break; // slot not written for this generation yet (in-flight); retry later
}
// s > i + 1: overwritten before we read it; skip (lost)
}
cursor = i;
}
inline std::wstring log_ring_name(unsigned long target_pid)
{
return std::wstring(kLogRingPrefix) + std::to_wstring(target_pid);
}
} // namespace coop