Batch 21 (20261027-A-bos-redo-21) rebuilt 40 of the 53 rejected Bos-qiao environments: hidden assertions that ran inside the candidate's process now run in a trusted parent that reads observations from a low-UID worker; gold bytes are unchanged. 9 were excluded for scope (ROS2, oversize, security core), 3 are blocked because the source requires an exec bit the platform does not freeze, 1 lacks requests/bs4 in trace6. Batch 18 (20261026-C-hwe-codegen-18) adds its last 34 of 134 tasks; the first 100 landed in 2f32624d. Claude reviewed 74/74 USABLE against current digests, canonical families, no ID or source overlap with main, plain public docs. Only the new task directories are taken; the stale pre-batch-20 copies of concur-release-capsule and resource-temp-link on the batch 21 branch and both branches' progress notes stay as main has them. Difficulty is unmeasured. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
31 lines
966 B
C++
31 lines
966 B
C++
#include "journal.hpp"
|
|
#include <algorithm>
|
|
namespace journal {
|
|
std::string assemble_plan(Int mode, Int capacity, const std::vector<Point>& points) {
|
|
std::string result = "set pagination off\nset logging overwrite on\n";
|
|
result += capacity == 0 ? "set logging enabled off\n" : "set logging enabled on\n";
|
|
result += "file program\n";
|
|
if (mode == 1) {
|
|
result += "target remote board:1234\n";
|
|
}
|
|
if (mode == 2) {
|
|
result += "core-file core\n";
|
|
}
|
|
std::vector<Point> ordered = points;
|
|
std::sort(ordered.begin(), ordered.end(), [](const Point& a, const Point& b) {
|
|
return a.slot < b.slot;
|
|
});
|
|
if (mode == 0) {
|
|
result += "run\n";
|
|
}
|
|
if (mode == 1) {
|
|
result += "continue\n";
|
|
}
|
|
for (const Point& point : ordered) {
|
|
result += "break *" + std::to_string(point.address) + "\n";
|
|
}
|
|
result += "thread apply all bt full\ninfo registers\nquit\n";
|
|
return result;
|
|
}
|
|
}
|