From the 101 lk/man/pth code-gen sources: 63 tasks (C11 36, C++17 27, 11 canonical families), 38 skipped for scope or duplication. Each task has at least one independent contract-edge defect, boundary types rotate, and public docs state trap clauses as plain contract prose. Claude reviewed 63/63 USABLE against current digests. Difficulty is unmeasured. Co-Authored-By: Claude Opus 5.5 <noreply@anthropic.com>
48 lines
1.9 KiB
C
48 lines
1.9 KiB
C
#include "reduction.h"
|
|
#include <limits.h>
|
|
#include <string.h>
|
|
int rp_run(const struct rp_request *r, struct rp_result *out)
|
|
{
|
|
__int128 prefix[RP_MAX_ITEMS + 1];
|
|
struct rp_result value;
|
|
if (!r || !out || r->count > RP_MAX_ITEMS || !r->workers ||
|
|
r->workers > RP_MAX_WORKERS || r->lower >= r->upper) return RP_INVALID;
|
|
for (size_t i = 0; i < r->count; ++i)
|
|
if (r->values[i] < r->lower || r->values[i] >= r->upper) return RP_INVALID;
|
|
prefix[0] = 0;
|
|
for (size_t i = 0; i < r->count; ++i) prefix[i+1] = prefix[i] + r->values[i];
|
|
memset(&value, 0, sizeof value);
|
|
value.workers = r->workers;
|
|
for (size_t w = r->workers; w-- > 0;) {
|
|
struct rp_span span;
|
|
rp_span_for(r->count, r->workers, w, &span);
|
|
__int128 sum = prefix[span.end] - prefix[span.begin];
|
|
if (sum < INT64_MIN || sum > INT64_MAX) return RP_OVERFLOW;
|
|
struct rp_chunk *c = &value.chunks[w];
|
|
c->count = span.end-span.begin; c->sum = (int64_t)sum;
|
|
if (c->count) {
|
|
c->minimum = c->maximum = r->values[span.begin];
|
|
for (size_t j = span.begin+1; j < span.end; ++j) {
|
|
if (r->values[j] < c->minimum) c->minimum = r->values[j];
|
|
if (r->values[j] > c->maximum) c->maximum = r->values[j];
|
|
}
|
|
}
|
|
}
|
|
if (prefix[r->count] < INT64_MIN || prefix[r->count] > INT64_MAX) return RP_OVERFLOW;
|
|
value.total.count = r->count; value.total.sum = (int64_t)prefix[r->count];
|
|
if (r->count) {
|
|
value.total.minimum = value.total.maximum = r->values[0];
|
|
for (size_t j = 1; j < r->count; ++j) {
|
|
if (r->values[j] < value.total.minimum) value.total.minimum = r->values[j];
|
|
if (r->values[j] > value.total.maximum) value.total.maximum = r->values[j];
|
|
}
|
|
}
|
|
*out = value;
|
|
return RP_OK;
|
|
}
|
|
int main(int argc, char **argv)
|
|
{
|
|
(void)argc; (void)argv;
|
|
return rp_console(stdin, stdout);
|
|
}
|