amos 9d633e9e67 Batch 15 (20261023-C-hwe-scale-15): 320 HWE-derived repair tasks
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>
2026-10-27 01:55:56 +08:00

6 lines
12 KiB
JSON

{
"rules.h": "#ifndef RULES_H\n#define RULES_H\n#include <stddef.h>\n#include <stdint.h>\n#define RULE_LIMIT 32\n#define PATTERN_LIMIT 128\n#define MESSAGE_LIMIT 256\n#define TERM_LIMIT 128\n#define PORT_OK 0\n#define PORT_SYNTAX 1\n#define PORT_MEMORY 2\n#define PORT_ARGUMENT 3\ntypedef struct compiled_rule compiled_rule;\ntypedef struct {\n int identifier;\n int priority;\n const unsigned char *pattern;\n size_t length;\n} rule_input;\ntypedef struct {\n void *state;\n size_t count;\n unsigned generation;\n} rule_bank;\ntypedef struct {\n size_t hits;\n int identifier;\n int priority;\n int input_index;\n} rule_result;\ntypedef struct {\n size_t programs;\n size_t terms;\n} port_usage;\nvoid port_budget(int budget);\nint port_compile(const unsigned char *pattern, size_t length, compiled_rule **out);\nint port_matches(const compiled_rule *program, const unsigned char *message, size_t length);\nvoid port_release(compiled_rule *program);\nport_usage port_current_usage(void);\nvoid bank_init(rule_bank *bank);\nint bank_replace(rule_bank *bank, const rule_input *rules, size_t count);\nint bank_match(const rule_bank *bank, const unsigned char *message, size_t length, rule_result *out);\nvoid bank_clear(rule_bank *bank);\n#endif\n",
"compiler.c": "#include \"rules.h\"\n#include <stdlib.h>\n#include <string.h>\ntypedef struct {\n unsigned char set[32];\n unsigned char minimum;\n unsigned char repeated;\n} term;\nstruct compiled_rule {\n size_t count;\n int anchored_start;\n int anchored_end;\n term sequence[TERM_LIMIT];\n};\nstatic int remaining = -1;\nstatic port_usage usage;\nvoid port_budget(int budget)\n{\n remaining = budget;\n}\nport_usage port_current_usage(void)\n{\n return usage;\n}\nstatic void put_byte(term *item, unsigned byte)\n{\n item->set[byte / 8] |= (unsigned char)(1u << (byte % 8));\n}\nstatic int contains(const term *item, unsigned byte)\n{\n return (item->set[byte / 8] >> (byte % 8)) & 1u;\n}\nstatic int escaped_byte(const unsigned char *pattern, size_t length, size_t *position, unsigned *byte)\n{\n if (*position >= length)\n return PORT_SYNTAX;\n *byte = pattern[(*position)++];\n if (*byte == '\\\\') {\n if (*position >= length)\n return PORT_SYNTAX;\n *byte = pattern[(*position)++];\n }\n return PORT_OK;\n}\nstatic int parse_class(const unsigned char *pattern, size_t length, size_t *position, term *item)\n{\n int negate = 0;\n size_t members = 0;\n if (*position < length && pattern[*position] == '^') {\n negate = 1;\n (*position)++;\n }\n while (*position < length && pattern[*position] != ']') {\n unsigned first;\n if (escaped_byte(pattern, length, position, &first) != PORT_OK)\n return PORT_SYNTAX;\n if (first == 0 || first > 127)\n return PORT_SYNTAX;\n if (*position < length && pattern[*position] == '-') {\n unsigned last;\n (*position)++;\n if (*position >= length || pattern[*position] == ']')\n return PORT_SYNTAX;\n if (escaped_byte(pattern, length, position, &last) != PORT_OK)\n return PORT_SYNTAX;\n if (last < first || last > 127)\n return PORT_SYNTAX;\n for (unsigned byte = first; byte <= last; byte++)\n put_byte(item, byte);\n } else {\n put_byte(item, first);\n }\n members++;\n }\n if (*position >= length || members == 0)\n return PORT_SYNTAX;\n (*position)++;\n if (negate)\n for (size_t i = 0; i < sizeof(item->set); i++)\n item->set[i] = (unsigned char)~item->set[i];\n return PORT_OK;\n}\nstatic int parse_atom(const unsigned char *pattern, size_t length, size_t *position, term *item)\n{\n unsigned byte = pattern[(*position)++];\n memset(item, 0, sizeof(*item));\n item->minimum = 1;\n if (byte == '.') {\n memset(item->set, 255, sizeof(item->set));\n } else if (byte == '[') {\n return parse_class(pattern, length, position, item);\n } else if (byte == '\\\\') {\n if (*position >= length)\n return PORT_SYNTAX;\n byte = pattern[(*position)++];\n if (byte == 0 || byte > 127)\n return PORT_SYNTAX;\n put_byte(item, byte);\n } else {\n if (byte == '^' || byte == '$' || byte == '*' || byte == '+' || byte == '?' || byte == ']')\n return PORT_SYNTAX;\n if (byte == 0 || byte > 127)\n return PORT_SYNTAX;\n put_byte(item, byte);\n }\n return PORT_OK;\n}\nstatic int parse_program(const unsigned char *pattern, size_t length, compiled_rule *result)\n{\n size_t position = 0;\n memset(result, 0, sizeof(*result));\n if (length > PATTERN_LIMIT || (!pattern && length))\n return PORT_ARGUMENT;\n if (length && pattern[0] == '^') {\n result->anchored_start = 1;\n position++;\n }\n while (position < length) {\n term item;\n if (pattern[position] == '$' && position + 1 == length) {\n result->anchored_end = 1;\n position++;\n break;\n }\n int status = parse_atom(pattern, length, &position, &item);\n if (status != PORT_OK)\n return status;\n if (position < length) {\n unsigned suffix = pattern[position];\n if (suffix == '*' || suffix == '+' || suffix == '?') {\n item.minimum = suffix == '+';\n item.repeated = suffix != '?';\n position++;\n }\n }\n if (result->count >= TERM_LIMIT)\n return PORT_ARGUMENT;\n result->sequence[result->count++] = item;\n }\n return PORT_OK;\n}\nint port_compile(const unsigned char *pattern, size_t length, compiled_rule **out)\n{\n compiled_rule parsed;\n compiled_rule *owned;\n if (!out)\n return PORT_ARGUMENT;\n *out = NULL;\n int status = parse_program(pattern, length, &parsed);\n if (status != PORT_OK)\n return status;\n if (remaining == 0)\n return PORT_MEMORY;\n owned = malloc(sizeof(*owned));\n if (!owned)\n return PORT_MEMORY;\n *owned = parsed;\n if (remaining > 0)\n remaining--;\n usage.programs++;\n usage.terms += owned->count;\n *out = owned;\n return PORT_OK;\n}\nvoid port_release(compiled_rule *program)\n{\n if (!program)\n return;\n usage.programs--;\n usage.terms -= program->count;\n free(program);\n}\nstatic void apply_term(const term *item, const unsigned char *message, size_t length,\n const unsigned char *before, unsigned char *after)\n{\n memset(after, 0, MESSAGE_LIMIT + 1);\n for (size_t start = 0; start <= length; start++) {\n if (!before[start])\n continue;\n if (!item->minimum)\n after[start] = 1;\n size_t stop = start;\n while (stop < length && contains(item, message[stop])) {\n stop++;\n after[stop] = 1;\n if (!item->repeated)\n break;\n }\n }\n}\nint port_matches(const compiled_rule *program, const unsigned char *message, size_t length)\n{\n unsigned char reachable[MESSAGE_LIMIT + 1];\n unsigned char next[MESSAGE_LIMIT + 1];\n if (!program || (!message && length) || length > MESSAGE_LIMIT)\n return 0;\n memset(reachable, 0, sizeof(reachable));\n if (program->anchored_start)\n reachable[0] = 1;\n else\n memset(reachable, 1, length + 1);\n for (size_t i = 0; i < program->count; i++) {\n apply_term(&program->sequence[i], message, length, reachable, next);\n memcpy(reachable, next, sizeof(reachable));\n }\n if (program->anchored_end)\n return reachable[length] != 0;\n for (size_t i = 0; i <= length; i++)\n if (reachable[i])\n return 1;\n return 0;\n}\n",
"driver.c": "#include \"rules.h\"\n#include <stdio.h>\n#include <stdlib.h>\n#include <string.h>\nstatic int hex_digit(int byte)\n{\n if (byte >= '0' && byte <= '9')\n return byte - '0';\n if (byte >= 'a' && byte <= 'f')\n return byte - 'a' + 10;\n if (byte >= 'A' && byte <= 'F')\n return byte - 'A' + 10;\n return -1;\n}\nstatic int read_bytes(unsigned char *destination, size_t capacity, size_t *length)\n{\n char encoded[2049];\n if (scanf(\"%2048s\", encoded) != 1)\n return 0;\n if (strcmp(encoded, \"-\") == 0) {\n *length = 0;\n return 1;\n }\n size_t size = strlen(encoded);\n if (size % 2 || size / 2 > capacity)\n return 0;\n for (size_t i = 0; i < size / 2; i++) {\n int high = hex_digit(encoded[2 * i]);\n int low = hex_digit(encoded[2 * i + 1]);\n if (high < 0 || low < 0)\n return 0;\n destination[i] = (unsigned char)(high * 16 + low);\n }\n *length = size / 2;\n return 1;\n}\nstatic void bank_observation(int status, const rule_bank *bank)\n{\n port_usage usage = port_current_usage();\n printf(\"%d %zu %u %zu %zu\\n\", status, bank->count, bank->generation,\n usage.programs, usage.terms);\n}\nstatic int read_replacement(rule_bank *bank)\n{\n rule_input rules[64];\n unsigned char storage[64][1024];\n size_t count;\n if (scanf(\"%zu\", &count) != 1 || count > 64)\n return 0;\n for (size_t i = 0; i < count; i++) {\n if (scanf(\"%d %d\", &rules[i].identifier, &rules[i].priority) != 2)\n return 0;\n if (!read_bytes(storage[i], sizeof(storage[i]), &rules[i].length))\n return 0;\n rules[i].pattern = storage[i];\n }\n int status = bank_replace(bank, rules, count);\n bank_observation(status, bank);\n return 1;\n}\nstatic int read_match(rule_bank *bank)\n{\n unsigned char message[1024];\n size_t length;\n if (!read_bytes(message, sizeof(message), &length))\n return 0;\n rule_result result = {999, 999, 999, 999};\n int status = bank_match(bank, message, length, &result);\n port_usage usage = port_current_usage();\n printf(\"%d %zu %d %d %d %u %zu %zu\\n\", status, result.hits,\n result.identifier, result.priority, result.input_index,\n bank->generation, usage.programs, usage.terms);\n return 1;\n}\nstatic void default_demo(rule_bank *bank)\n{\n const unsigned char first[] = \"^err\";\n const unsigned char second[] = \"warn\";\n const unsigned char third[] = \"fatal\";\n rule_input rules[] = {\n {11, 4, first, sizeof(first) - 1},\n {12, 2, second, sizeof(second) - 1},\n {13, 8, third, sizeof(third) - 1}\n };\n bank_observation(bank_replace(bank, rules, 3), bank);\n rule_result result = {999, 999, 999, 999};\n const unsigned char text[] = \"warning: disk full\";\n int status = bank_match(bank, text, sizeof(text) - 1, &result);\n port_usage usage = port_current_usage();\n printf(\"%d %zu %d %d %d %u %zu %zu\\n\", status, result.hits,\n result.identifier, result.priority, result.input_index,\n bank->generation, usage.programs, usage.terms);\n bank_clear(bank);\n bank_observation(0, bank);\n}\nint main(int argc, char **argv)\n{\n rule_bank bank;\n bank_init(&bank);\n port_budget(-1);\n if (argc == 2 && strcmp(argv[1], \"--demo\") == 0) {\n default_demo(&bank);\n return 0;\n }\n char operation[16];\n while (scanf(\"%15s\", operation) == 1) {\n if (strcmp(operation, \"B\") == 0) {\n if (!read_replacement(&bank))\n return 20;\n } else if (strcmp(operation, \"M\") == 0) {\n if (!read_match(&bank))\n return 21;\n } else if (strcmp(operation, \"F\") == 0) {\n int budget;\n if (scanf(\"%d\", &budget) != 1 || budget < -1)\n return 22;\n port_budget(budget);\n printf(\"%d\\n\", budget);\n } else if (strcmp(operation, \"C\") == 0) {\n bank_clear(&bank);\n bank_observation(0, &bank);\n } else if (strcmp(operation, \"S\") == 0) {\n bank_observation(0, &bank);\n } else {\n return 23;\n }\n }\n bank_clear(&bank);\n bank_observation(0, &bank);\n return 0;\n}\n"
}