One user-space repair task per eligible HWE debug-diag / compile-deploy base ID: 320 admitted (C 218, C++ 97, build scripts 5), 1 skipped by the content filter. Each ships a public spec with a check-to-basis table, at least two defects with single-fix fixtures, a symptom-masking fixture and an alternative correct implementation. Claude re-checked all 320: structure, the HWE quality items and trace6 Docker calibration receipts against current digests (320/320 USABLE). Difficulty is unmeasured. Known follow-up: 212 tasks use 120 ad-hoc family names; the next batch maps them to the canonical list. The batch's 1,256-line progress log stays in its factory report and the 36-local branch batch15-hwe. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
69 lines
1.6 KiB
C++
69 lines
1.6 KiB
C++
#include "packet.hpp"
|
|
#include <cstdlib>
|
|
#include <new>
|
|
namespace packet {
|
|
Memory::Memory() : countdown_(0) {
|
|
}
|
|
Memory::~Memory() {
|
|
for (const Allocation& allocation : live_) {
|
|
std::free(allocation.address);
|
|
}
|
|
}
|
|
void* Memory::acquire(Kind kind, std::size_t bytes) {
|
|
counters_.attempts += 1;
|
|
if (countdown_ != 0) {
|
|
countdown_ -= 1;
|
|
if (countdown_ == 0) {
|
|
counters_.failures += 1;
|
|
return nullptr;
|
|
}
|
|
}
|
|
void* address = std::malloc(bytes);
|
|
if (address == nullptr) {
|
|
counters_.failures += 1;
|
|
return nullptr;
|
|
}
|
|
try {
|
|
live_.push_back(Allocation{address, bytes, kind});
|
|
} catch (...) {
|
|
std::free(address);
|
|
throw;
|
|
}
|
|
counters_.allocated += 1;
|
|
counters_.bytes += bytes;
|
|
if (kind == Kind::Node) {
|
|
counters_.nodes += 1;
|
|
} else {
|
|
counters_.payloads += 1;
|
|
}
|
|
return address;
|
|
}
|
|
void Memory::release(void* address) {
|
|
if (address == nullptr) {
|
|
return;
|
|
}
|
|
for (auto iterator = live_.begin(); iterator != live_.end(); ++iterator) {
|
|
if (iterator->address != address) {
|
|
continue;
|
|
}
|
|
counters_.released += 1;
|
|
counters_.bytes -= iterator->bytes;
|
|
if (iterator->kind == Kind::Node) {
|
|
counters_.nodes -= 1;
|
|
} else {
|
|
counters_.payloads -= 1;
|
|
}
|
|
std::free(iterator->address);
|
|
live_.erase(iterator);
|
|
return;
|
|
}
|
|
counters_.invalid += 1;
|
|
}
|
|
void Memory::fail_after(std::uint64_t count) {
|
|
countdown_ = count;
|
|
}
|
|
MemoryView Memory::view() const {
|
|
return counters_;
|
|
}
|
|
}
|