#include "module.h" #include "module-save.h" #include "log.h" #include "module-text.h" #include #include #include #include enum { STATE_BYTES = 16, COLLECTION_BYTES = 12, INPUT_BYTES = 16, FIELD_BYTES = 8, CONSTANT_BYTES = 8, RECORD_BYTES = 8, RECORD_FIELD_BYTES = 16, VIEW_BYTES = 16, HANDLER_BYTES = 12, OP_BYTES = 16 }; /* T_FIELD and T_ITEM stand for the type of the message or record field * named, T_KEY for the type of the named keyed list's key, T_LOCAL for what * the named local holds. */ enum { T_NUM = 1, T_BYTES = 2, T_TEXT = 3, T_CURSOR = 4, T_FIELD = 5, T_INDEX = 6, T_ITEM = 7, T_KEY = 8, T_LOCAL = 9 }; enum { FROM_PAYLOAD, FROM_DOCUMENT, FROM_COPY, FROM_CONSTANT, FROM_TEXT, FROM_ARENA, FROM_ARGUMENTS }; /* Where an opcode may appear. */ /* IN_ARGUMENTS: fields read where nothing is done with them (a view's arguments, a message's fields in a fold). */ /* IN_LOCALS: a handler's locals, read in its walks and the folds in them. */ enum { IN_VIEW = 1, IN_HANDLER = 2, IN_MESSAGE = 4, IN_KEYED = 8, IN_TEXT = 16, IN_ROW = 32, IN_OUTER = 64, IN_ARGUMENTS = 128, IN_LOCALS = 256 }; enum { READ = IN_VIEW | IN_HANDLER }; /* What an argument names: nothing (it is 0), a state of one type (A_STATE + * the type), a list and one of its record's fields, a message field, the * collection, a constant, a unit, the column's row, a branch target, a stack * depth, a fold, a relation, a keyed list, an output, or the row of the * column a fold runs in. */ enum { A_NONE, A_STATE, A_ITEM = A_STATE + PURE_STATE_INDEX + 1, A_FIELD, A_COLLECTION, A_CONSTANT, A_UNIT, A_ROW, A_TARGET, A_DEPTH, A_FOLD, A_RELATION, A_KEYED, A_OUTPUT, A_OUTER, A_EACH, A_LOCAL }; /* A fold's block is verified as a column that leaves one number (count) or * two (a value and whether to include it), a table's filter as a column that * leaves one: these stand for a view type. A walk's block (EACH) is verified * as its handler's code that may read the item it runs for (WALK). */ enum { FOLD_ONE = 100, FOLD_TWO, FILTER, WALK }; /* The text or list an opcode works on: its cursor and index operands belong * to it, and so does a cursor or index it pushes. O_ANY: no rule. O_OPERAND: * it pushes a position in its operand's text or list. O_ARG: the argument. * O_REF: the text or list of the argument's cursor or index state. O_LIST: * the list of an item argument. */ enum { O_ANY, O_OPERAND, O_ARG, O_REF, O_LIST }; static const unsigned char magic[8] = {'P','U','R','E','M','O','D','5'}; /* Operand types popped (bottom to top), the type pushed, where allowed, what * the argument names and the text or list worked on. */ #define NUMS(pops) {pops, {T_NUM, T_NUM, T_NUM}, T_NUM, READ, A_NONE, O_ANY} #define STATE(type) A_STATE + PURE_STATE_##type static const struct { unsigned char pops, in[3], out; unsigned short where; unsigned char arg, of; } signature[PURE_OP_COUNT] = { [PURE_OP_CONST] = NUMS(0), [PURE_OP_ADD] = NUMS(2), [PURE_OP_SUB] = NUMS(2), [PURE_OP_MUL] = NUMS(2), [PURE_OP_DIV] = NUMS(2), [PURE_OP_NEG] = NUMS(1), [PURE_OP_LT] = NUMS(2), [PURE_OP_LE] = NUMS(2), [PURE_OP_GT] = NUMS(2), [PURE_OP_GE] = NUMS(2), [PURE_OP_EQ] = NUMS(2), [PURE_OP_NE] = NUMS(2), [PURE_OP_AND] = NUMS(2), [PURE_OP_OR] = NUMS(2), [PURE_OP_NOT] = NUMS(1), [PURE_OP_MIN] = NUMS(2), [PURE_OP_MAX] = NUMS(2), [PURE_OP_CLAMP] = NUMS(3), [PURE_OP_LOAD] = {0, {0}, T_NUM, READ, STATE(NUM), O_ANY}, [PURE_OP_DT] = {0, {0}, T_NUM, IN_HANDLER, A_NONE, O_ANY}, [PURE_OP_STORE] = {1, {T_NUM}, 0, IN_HANDLER, STATE(NUM), O_ANY}, [PURE_OP_JZ] = {1, {T_NUM}, 0, READ, A_TARGET, O_ANY}, [PURE_OP_JMP] = {0, {0}, 0, READ, A_TARGET, O_ANY}, [PURE_OP_FIELD] = {0, {0}, T_FIELD, IN_MESSAGE | IN_ARGUMENTS, A_FIELD, O_ANY}, [PURE_OP_DOC] = {0, {0}, T_BYTES, IN_KEYED, A_COLLECTION, O_ANY}, [PURE_OP_DOC_SIZE] = {0, {0}, T_NUM, IN_KEYED, A_COLLECTION, O_ANY}, [PURE_OP_LEN] = {1, {T_BYTES}, T_NUM, IN_HANDLER, A_NONE, O_ANY}, [PURE_OP_REPLACE] = {3, {T_NUM, T_NUM, T_BYTES}, 0, IN_KEYED, A_COLLECTION, O_ANY}, [PURE_OP_REPLY] = {1, {T_BYTES}, 0, IN_MESSAGE, A_NONE, O_ANY}, [PURE_OP_REQUIRE] = {1, {T_NUM}, 0, IN_HANDLER, A_NONE, O_ANY}, [PURE_OP_TEXT_CONST] = {0, {0}, T_TEXT, READ, A_CONSTANT, O_ANY}, [PURE_OP_TEXT_LOAD] = {0, {0}, T_TEXT, READ, STATE(TEXT), O_ANY}, [PURE_OP_TEXT_INPUT] = {0, {0}, T_TEXT, IN_TEXT, A_NONE, O_ANY}, [PURE_OP_NUM_TEXT] = {1, {T_NUM}, T_TEXT, READ, A_NONE, O_ANY}, [PURE_OP_CONCAT] = {2, {T_TEXT, T_TEXT}, T_TEXT, READ, A_NONE, O_ANY}, [PURE_OP_CHARS] = {1, {T_TEXT}, T_NUM, READ, A_NONE, O_ANY}, [PURE_OP_LINES] = {1, {T_TEXT}, T_NUM, READ, A_NONE, O_ANY}, [PURE_OP_TEXT_BYTES] = {1, {T_TEXT}, T_NUM, READ, A_NONE, O_ANY}, [PURE_OP_CUR_LOAD] = {0, {0}, T_CURSOR, READ, STATE(CURSOR), O_REF}, [PURE_OP_CUR_START] = {0, {0}, T_CURSOR, READ, STATE(TEXT), O_ARG}, [PURE_OP_CUR_END] = {0, {0}, T_CURSOR, READ, STATE(TEXT), O_ARG}, [PURE_OP_CUR_MOVE] = {2, {T_CURSOR, T_NUM}, T_CURSOR, READ, A_UNIT, O_OPERAND}, [PURE_OP_CUR_STORE] = {1, {T_CURSOR}, 0, IN_HANDLER, STATE(CURSOR), O_REF}, [PURE_OP_TEXT_INSERT] = {2, {T_CURSOR, T_TEXT}, 0, IN_HANDLER, STATE(TEXT), O_ARG}, [PURE_OP_TEXT_REMOVE] = {2, {T_CURSOR, T_CURSOR}, 0, IN_HANDLER, STATE(TEXT), O_ARG}, [PURE_OP_TEXT_LINE] = {1, {T_CURSOR}, T_TEXT, READ, STATE(TEXT), O_ARG}, [PURE_OP_TEXT_SET] = {1, {T_TEXT}, 0, IN_HANDLER, STATE(TEXT), O_ANY}, [PURE_OP_TEXT_FROM] = {1, {T_BYTES}, T_TEXT, READ, A_NONE, O_ANY}, [PURE_OP_BYTES_FROM] = {1, {T_TEXT}, T_BYTES, READ, A_NONE, O_ANY}, [PURE_OP_CUR_COUNT] = {1, {T_CURSOR}, T_NUM, READ, A_UNIT, O_ANY}, /* Record operations also take as many values as the list's record has fields. */ [PURE_OP_LIST_COUNT] = {0, {0}, T_NUM, READ, STATE(LIST), O_ANY}, [PURE_OP_LIST_APPEND] = {0, {0}, 0, IN_HANDLER, STATE(LIST), O_ANY}, [PURE_OP_LIST_INSERT] = {1, {T_INDEX}, 0, IN_HANDLER, STATE(LIST), O_ARG}, [PURE_OP_LIST_REMOVE] = {1, {T_INDEX}, 0, IN_HANDLER, STATE(LIST), O_ARG}, [PURE_OP_ITEM_GET] = {1, {T_INDEX}, T_ITEM, READ, A_ITEM, O_LIST}, [PURE_OP_ITEM_SET] = {1, {T_INDEX}, 0, IN_HANDLER, A_ITEM, O_LIST}, [PURE_OP_INDEX_LOAD] = {0, {0}, T_INDEX, READ, STATE(INDEX), O_REF}, [PURE_OP_INDEX_STORE] = {1, {T_INDEX}, 0, IN_HANDLER, STATE(INDEX), O_REF}, [PURE_OP_INDEX_MOVE] = {2, {T_INDEX, T_NUM}, T_INDEX, READ, A_NONE, O_OPERAND}, [PURE_OP_INDEX_FIRST] = {0, {0}, T_INDEX, READ, STATE(LIST), O_ARG}, [PURE_OP_INDEX_LAST] = {0, {0}, T_INDEX, READ, STATE(LIST), O_ARG}, [PURE_OP_INDEX_NUM] = {1, {T_INDEX}, T_NUM, READ, A_NONE, O_ANY}, [PURE_OP_ROW] = {0, {0}, T_INDEX, IN_ROW, A_ROW, O_ARG}, /* In a fold that runs in a column, the column's row (the fold's own item is ROW's). */ [PURE_OP_OUTER_ROW] = {0, {0}, T_INDEX, IN_OUTER, A_OUTER, O_ARG}, /* Stack copies: their types come from the values they move. */ [PURE_OP_PICK] = {0, {0}, 0, READ, A_DEPTH, O_ANY}, [PURE_OP_SLIDE] = {0, {0}, 0, READ, A_DEPTH, O_ANY}, [PURE_OP_FOLD] = {0, {0}, T_NUM, READ, A_FOLD, O_ANY}, [PURE_OP_TEXT_COMPARE] = {2, {T_TEXT, T_TEXT}, T_NUM, READ, A_RELATION, O_ANY}, [PURE_OP_LIST_FIND] = {1, {T_KEY}, T_INDEX, READ, A_KEYED, O_ARG}, [PURE_OP_LIST_HAS] = {1, {T_KEY}, T_NUM, READ, A_KEYED, O_ANY}, [PURE_OP_NOW] = {0, {0}, T_NUM, IN_HANDLER, A_NONE, O_ANY}, [PURE_OP_SEND] = {0, {0}, 0, IN_HANDLER, A_OUTPUT, O_ANY}, [PURE_OP_EACH] = {0, {0}, 0, IN_HANDLER, A_EACH, O_ANY}, [PURE_OP_LOCAL_LOAD] = {0, {0}, T_LOCAL, IN_LOCALS, A_LOCAL, O_ANY}, [PURE_OP_LOCAL_STORE] = {1, {T_LOCAL}, 0, IN_HANDLER, A_LOCAL, O_ANY}, [PURE_OP_FLOOR] = NUMS(1), [PURE_OP_MOD] = NUMS(2), }; #undef NUMS #undef STATE static uint32_t read16(const unsigned char *p) { return (uint32_t)p[0] | (uint32_t)p[1] << 8; } static uint32_t read32(const unsigned char *p) { return (uint32_t)p[0] | (uint32_t)p[1] << 8 | (uint32_t)p[2] << 16 | (uint32_t)p[3] << 24; } static void write32(unsigned char *p, uint32_t value) { for (unsigned i = 0; i < 4; ++i) p[i] = (unsigned char)(value >> (8 * i)); } static double read_double(const unsigned char *p) { uint64_t bits = read32(p) | (uint64_t)read32(p + 4) << 32; double value; memcpy(&value, &bits, sizeof(value)); return value; } PURE_COLD static bool key_name(const char *key) { static const char *const named[] = {"Space", "Enter", "ArrowLeft", "ArrowRight", "ArrowUp", "ArrowDown", "Backspace", "Delete", "Home", "End", "Tab", "Escape", "PageUp", "PageDown"}; for (size_t i = 0; i < sizeof(named) / sizeof(*named); ++i) if (!strcmp(key, named[i])) return true; if (!strncmp(key, "Key", 3)) return key[3] >= 'A' && key[3] <= 'Z' && !key[4]; if (!strncmp(key, "Digit", 5)) return key[5] >= '0' && key[5] <= '9' && !key[6]; return false; } /* A document key: 1..64 bytes of [A-Za-z0-9_-], as every Pure store accepts. */ static bool document_key(const char *key) { size_t length = key ? strlen(key) : 0; if (!length || length > 64) return false; for (size_t i = 0; i < length; ++i) { char c = key[i]; if (!((c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || (c >= '0' && c <= '9') || c == '-' || c == '_')) return false; } return true; } /* Strings are [u8 length][bytes]; a name is 1..31 bytes: an ASCII identifier, * a path of identifiers joined by dots (a message field inside a group, as * user.name), or any printable ASCII (a key's name). */ enum { NAME_IDENTIFIER, NAME_PATH, NAME_PRINTABLE }; PURE_COLD static bool name_at(const unsigned char *strings, uint32_t size, uint32_t offset, int kind, char out[PURE_MODULE_NAME]) { if (offset >= size) return false; uint32_t length = strings[offset]; if (!length || length >= PURE_MODULE_NAME || length > size - offset - 1) return false; for (uint32_t i = 0, start = 0; i < length; ++i) { unsigned char c = strings[offset + 1 + i]; bool letter = (c >= 'a' && c <= 'z') || (c >= 'A' && c <= 'Z') || c == '_'; if (kind == NAME_PATH && c == '.' && i > start && i + 1 < length) { start = i + 1; continue; } if (!letter && !(i > start && c >= '0' && c <= '9') && (kind != NAME_PRINTABLE || c < 32 || c > 126)) return false; } memcpy(out, strings + offset + 1, length); out[length] = 0; return true; } /* The input whose handler this is, or -1 for frame. */ static int event_input(uint32_t event) { return event ? (int)((event - 1) / 2) : -1; } /* The state an argument names must have this type. */ static bool state_of(const PureModule *m, uint32_t state, uint8_t type) { return state < m->states && m->state_type[state] == type; } /* The list an item operation names: its low 16 bits (the field is above). */ static uint32_t list_of(uint32_t arg) { return arg & 0xFFFF; } static uint32_t item_field(uint32_t arg) { return arg >> 16; } static unsigned char field_type(const PureModule *m, uint32_t list, uint32_t field) { return m->record_field_text[m->record[m->state_ref[list]].first + field] ? T_TEXT : T_NUM; } PURE_COLD static bool names_arg(const PureModule *m, unsigned kind, uint32_t arg, const PureInputShape *shape, int row, int outer) { switch (kind) { case A_ITEM: return state_of(m, list_of(arg), PURE_STATE_LIST) && item_field(arg) < m->record[m->state_ref[list_of(arg)]].count; case A_FIELD: return arg < shape->field_count && m->field[shape->field_start + arg].type != PURE_FIELD_ROWS; case A_COLLECTION: return arg < m->collections; case A_CONSTANT: return arg < m->constants; case A_UNIT: return arg <= PURE_UNIT_LINE; case A_ROW: return (int)arg == row; case A_OUTER: return outer >= 0 && (int)arg == outer; case A_FOLD: case A_EACH: { /* a slice's list is keyed by a number */ uint32_t list = arg >> 8 & 0xFF, flags = arg & 0xFF; bool sliced = kind == A_FOLD ? flags & PURE_FOLD_SLICED : flags & PURE_EACH_SLICED; return (kind == A_FOLD ? (flags & 0x7F) <= PURE_FOLD_DISTINCT : flags <= PURE_EACH_SLICED) && state_of(m, list, PURE_STATE_LIST) && arg >> 16 && (!sliced || (m->state_key[list] && field_type(m, list, m->state_key[list] - 1u) == T_NUM)); } case A_LOCAL: /* a slot, and a number or an index of a list */ return (arg & 0xFF) < PURE_MODULE_LOCALS && (arg >> 8 & 0xFF) <= 1 && ((arg >> 8 & 0xFF) ? state_of(m, arg >> 16, PURE_STATE_LIST) : !(arg >> 16)); case A_RELATION: return arg <= PURE_NOT_EQUAL; case A_KEYED: return state_of(m, arg, PURE_STATE_LIST) && m->state_key[arg]; case A_OUTPUT: return arg < m->inputs && m->input[arg].kind == PURE_KIND_OUTPUT; case A_NONE: case A_TARGET: case A_DEPTH: return true; default: return state_of(m, arg, (uint8_t)(kind - A_STATE)); } } /* The stack a branch brings to its target, while the target is ahead. */ typedef struct { uint32_t target; int height; unsigned char types[PURE_MODULE_STACK], owners[PURE_MODULE_STACK]; } Join; static bool same_stack(const Join *join, int height, const unsigned char *types, const unsigned char *owners) { return join->height == height && !memcmp(join->types, types, (size_t)height) && !memcmp(join->owners, owners, (size_t)height); } /* Types and heights are checked per instruction; a cursor's type records * which text it belongs to and an index's type which list (other values * belong to nothing). Branches go forward within the block. Every path into * a join brings the same stack (types and owners), so a value may cross a * join, as in a conditional expression; at most 8 joins with a non-empty * stack are ahead at once. Handlers end empty, views with one value of their * type. A column (row is its list) may read the row it is evaluated for. * A fold's block is verified as a column of its list (reads only, no fold * in it); the block around treats it as one instruction and may not branch * into it. Returns why the block is refused, with at moved to the * instruction when one is at fault, or NULL. */ PURE_COLD static const char *verify_block(const PureModule *, PureBlock, int view, int row, int outer, uint32_t event, bool locals, uint32_t *at); /* target marks, per instruction of the block, a branch into it with an empty stack. */ /* outer: the row of the column a fold's block runs in (-1: none). */ /* locals: the block is a handler's, or runs in one (a walk, a fold): it reads the handler's locals. */ PURE_COLD static const char *verify_code(const PureModule *m, PureBlock block, int view, int row, int outer, uint32_t event, bool locals, uint32_t *at, unsigned char *target) { #define REFUSE(why) do { *at = pc; return why; } while (0) bool handler = view < 0 || view == WALK, folding = view == FOLD_ONE || view == FOLD_TWO; if (!handler && !block.length) return "empty view"; /* A handler's message or text; a view's arguments, or the message of the handler a fold is in. */ int input = event_input(event); const PureInputShape *shape = input >= 0 ? &m->input[input] : NULL; unsigned where = !handler ? IN_VIEW | (row >= 0 ? IN_ROW : 0) | (folding && outer >= 0 ? IN_OUTER : 0) : IN_HANDLER | (view == WALK ? IN_ROW : 0); if (shape && handler && shape->kind == PURE_KIND_MESSAGE) where |= IN_MESSAGE | (shape->keyed ? IN_KEYED : 0); if (shape && handler && shape->kind == PURE_KIND_TEXT) where |= IN_TEXT; if (shape && !handler && (shape->kind == PURE_KIND_MESSAGE || shape->kind == PURE_KIND_ARGUMENTS)) where |= IN_ARGUMENTS; if (locals) where |= IN_LOCALS; unsigned char types[PURE_MODULE_STACK], owners[PURE_MODULE_STACK]; Join joins[PURE_MODULE_JOINS]; unsigned open = 0; int height = 0; bool reachable = true; for (uint32_t i = 0; i <= block.length; ++i) { uint32_t pc = block.start + i; /* Branches here brought an empty stack (target) or the stack of a join. */ unsigned join = open; for (unsigned k = 0; k < open; ++k) if (joins[k].target == pc) join = k; if (join < open) { if (target[i] || (reachable && !same_stack(&joins[join], height, types, owners))) REFUSE("join with different stacks"); height = joins[join].height; memcpy(types, joins[join].types, (size_t)height); memcpy(owners, joins[join].owners, (size_t)height); joins[join] = joins[--open]; reachable = true; } else if (target[i]) { if (reachable && height) REFUSE("join with different stacks"); height = 0; reachable = true; } if (i == block.length) break; if (!reachable) REFUSE("unreachable instruction"); const PureOp *op = &m->code[pc]; if (op->op >= PURE_OP_COUNT) REFUSE("unknown opcode"); unsigned allowed = signature[op->op].where, kind = signature[op->op].arg, of = signature[op->op].of; if (!(allowed & where)) { if (allowed & IN_ROW) REFUSE("row outside a column"); if (allowed & IN_OUTER) REFUSE("outer row outside a fold in a column"); if (allowed & IN_LOCALS) REFUSE("local outside a handler"); if (view == FILTER) REFUSE("filter with an effect"); if (folding) REFUSE("fold with an effect"); if (!handler) REFUSE("view with an effect"); if (allowed & IN_KEYED) REFUSE("document operation outside a keyed message handler"); if (allowed & IN_TEXT) REFUSE("text input outside a text handler"); REFUSE("message operation outside a message handler"); } uint32_t arg = op->arg; if ((kind == A_NONE && arg) || (op->op == PURE_OP_CONST ? !isfinite(op->value) : op->value != 0)) REFUSE("non-canonical operand"); if (!names_arg(m, kind, arg, shape, row, outer)) REFUSE("operand names no such state, field, constant or unit"); /* A keyed list places its items by key, and an item's key stays. */ if (op->op == PURE_OP_LIST_INSERT && m->state_key[arg]) REFUSE("insert by position into a keyed list"); /* A walk ends: its list only shrinks while it runs, and it runs no walk within. */ if (view == WALK && (op->op == PURE_OP_LIST_APPEND || op->op == PURE_OP_LIST_INSERT) && (int)arg == row) REFUSE("insert into the list walked"); if (view == WALK && op->op == PURE_OP_EACH) REFUSE("each inside each"); if (view == WALK && op->op == PURE_OP_REPLY) REFUSE("reply inside each"); if (op->op == PURE_OP_ITEM_SET && m->state_key[list_of(arg)] == item_field(arg) + 1) REFUSE("change of a keyed list's key"); /* PICK copies the value arg below the top; SLIDE drops arg values under the top. */ if (kind == A_DEPTH) { bool pick = op->op == PURE_OP_PICK; if (pick ? arg >= (uint32_t)height : !arg || arg >= (uint32_t)height) REFUSE("stack underflow"); if (pick && height == PURE_MODULE_STACK) REFUSE("stack overflow"); int from = height - 1 - (int)arg, to = pick ? height++ : from; types[to] = pick ? types[from] : types[height - 1]; owners[to] = pick ? owners[from] : owners[height - 1]; if (!pick) height = from + 1; continue; } uint32_t skip = 0; if (kind == A_FOLD || kind == A_EACH) { uint32_t inner = pc; skip = arg >> 16; if (kind == A_FOLD && (folding || view == FILTER)) REFUSE(view == FILTER ? "fold inside a filter" : "fold inside a fold"); if (skip > block.length - i - 1) REFUSE(kind == A_FOLD ? "fold block outside its block" : "each block outside its block"); unsigned how = arg & 0x7F; /* A fold in a walk reads the walk's item as a fold in a column reads its row. */ const char *why = kind == A_EACH ? verify_block(m, (PureBlock){pc + 1, skip}, WALK, (int)(arg >> 8 & 0xFF), -1, event, locals, &inner) : verify_block(m, (PureBlock){pc + 1, skip}, how == PURE_FOLD_COUNT || how == PURE_FOLD_FIRST ? FOLD_ONE : FOLD_TWO, (int)(arg >> 8 & 0xFF), row, event, locals, &inner); if (why) { *at = inner; return why; } for (uint32_t k = i + 1; k <= i + skip; ++k) { const char *into = kind == A_FOLD ? "branch into a fold" : "branch into an each"; if (target[k]) REFUSE(into); for (unsigned j = 0; j < open; ++j) if (joins[j].target == block.start + k) REFUSE(into); } } /* Operand types, bottom to top; record operations take their fields. */ unsigned char need[PURE_MODULE_FIELDS + 2]; unsigned pops = signature[op->op].pops; memcpy(need, signature[op->op].in, sizeof(signature[op->op].in)); if (op->op == PURE_OP_SEND) { const PureInputShape *output = &m->input[arg]; for (unsigned f = 0; f < output->field_count; ++f) { uint8_t type = m->field[output->field_start + f].type; need[f] = type == PURE_FIELD_TEXT ? T_TEXT : type == PURE_FIELD_BYTES ? T_BYTES : T_NUM; } pops = output->field_count; } else if (op->op == PURE_OP_LIST_APPEND || op->op == PURE_OP_LIST_INSERT) { const PureRecord *record = &m->record[m->state_ref[arg]]; for (unsigned f = 0; f < record->count; ++f) need[pops + f] = field_type(m, arg, f); pops += record->count; } else if (op->op == PURE_OP_ITEM_SET) { need[pops++] = field_type(m, list_of(arg), item_field(arg)); } else if (need[0] == T_KEY) { need[0] = field_type(m, arg, m->state_key[arg] - 1u); } else if (need[0] == T_LOCAL) { need[0] = arg >> 8 & 0xFF ? T_INDEX : T_NUM; } else if ((kind == A_FOLD && arg & PURE_FOLD_SLICED) || (kind == A_EACH && arg & PURE_EACH_SLICED)) { need[0] = need[1] = T_NUM; /* a slice's low and high keys */ pops = 2; } if (height < (int)pops) REFUSE("stack underflow"); height -= (int)pops; for (unsigned k = 0; k < pops; ++k) if (types[height + (int)k] != need[k]) REFUSE("operand type"); unsigned owner = of == O_ARG ? arg : of == O_REF ? m->state_ref[arg] : of == O_LIST ? list_of(arg) : 0; if (kind == A_LOCAL && arg >> 8 & 0xFF) { /* an index local belongs to its list */ owner = arg >> 16; of = O_ARG; } for (unsigned k = 0; of >= O_ARG && k < pops; ++k) { unsigned char type = types[height + (int)k]; if ((type == T_CURSOR || type == T_INDEX) && owners[height + (int)k] != owner) REFUSE(type == T_CURSOR ? "cursor of another text" : "index of another list"); } unsigned char out = signature[op->op].out; if (kind == A_FOLD && (arg & 0x7F) == PURE_FOLD_FIRST) { /* an index of its list */ out = T_INDEX; of = O_ARG; owner = arg >> 8 & 0xFF; } if (out == T_FIELD) { uint8_t type = m->field[shape->field_start + arg].type; out = type == PURE_FIELD_TEXT ? T_TEXT : type == PURE_FIELD_BYTES ? T_BYTES : T_NUM; } if (out == T_ITEM) out = field_type(m, list_of(arg), item_field(arg)); if (out == T_LOCAL) out = arg >> 8 & 0xFF ? T_INDEX : T_NUM; if (out) { if (height == PURE_MODULE_STACK) REFUSE("stack overflow"); owners[height] = (unsigned char)(out != T_CURSOR && out != T_INDEX ? 0 : of == O_OPERAND ? owners[height] : owner); types[height++] = out; } if (kind == A_TARGET) { if (arg <= pc || arg > block.start + block.length) REFUSE("branch not forward within its block"); join = open; for (unsigned k = 0; k < open; ++k) if (joins[k].target == arg) join = k; if (!height) { if (join < open) REFUSE("join with different stacks"); target[arg - block.start] = 1; } else if (join < open) { if (!same_stack(&joins[join], height, types, owners)) REFUSE("join with different stacks"); } else { if (target[arg - block.start]) REFUSE("join with different stacks"); if (open == PURE_MODULE_JOINS) REFUSE("more than 8 joins ahead"); joins[open] = (Join){.target = arg, .height = height}; memcpy(joins[open].types, types, (size_t)height); memcpy(joins[open++].owners, owners, (size_t)height); } if (op->op == PURE_OP_JMP) reachable = false; } i += skip; } if (!reachable) return "block end is unreachable"; if (view == FILTER) return height != 1 || types[0] != T_NUM ? "filter must leave one number" : NULL; if (folding) { int want = view - FOLD_ONE + 1; return height != want || types[0] != T_NUM || types[want - 1] != T_NUM ? "fold block must leave its numbers" : NULL; } unsigned char result = view == PURE_VIEW_TEXT ? T_TEXT : T_NUM; if (!handler ? height != 1 || types[0] != result : height != 0) return !handler ? "view must leave one value of its type" : "handler must leave no value"; return NULL; #undef REFUSE } PURE_COLD static const char *verify_block(const PureModule *m, PureBlock block, int view, int row, int outer, uint32_t event, bool locals, uint32_t *at) { if (block.start > m->code_count || block.length > m->code_count - block.start) return "code range outside module"; unsigned char *target = calloc((size_t)block.length + 1, 1); if (!target) return "out of memory"; const char *why = verify_code(m, block, view, row, outer, event, locals, at, target); free(target); return why; } /* Whether an instruction has a form that works on the items of a run at * once: numbers and indexes, with no branch and no text. */ PURE_COLD static bool has_lanes(const PureModule *m, const PureOp *op, int input) { switch (op->op) { case PURE_OP_FIELD: { /* a number the message or the arguments give, the same for every item */ uint8_t type = input >= 0 ? m->field[m->input[input].field_start + op->arg].type : 0; return type == PURE_FIELD_U32 || type == PURE_FIELD_NUMBER; } case PURE_OP_CONST: case PURE_OP_ADD: case PURE_OP_SUB: case PURE_OP_MUL: case PURE_OP_DIV: case PURE_OP_NEG: case PURE_OP_LT: case PURE_OP_LE: case PURE_OP_GT: case PURE_OP_GE: case PURE_OP_EQ: case PURE_OP_NE: case PURE_OP_AND: case PURE_OP_OR: case PURE_OP_NOT: case PURE_OP_MIN: case PURE_OP_MAX: case PURE_OP_CLAMP: case PURE_OP_FLOOR: case PURE_OP_MOD: case PURE_OP_LOAD: case PURE_OP_LIST_COUNT: case PURE_OP_INDEX_LOAD: case PURE_OP_INDEX_MOVE: case PURE_OP_INDEX_FIRST: case PURE_OP_INDEX_LAST: case PURE_OP_INDEX_NUM: case PURE_OP_ROW: case PURE_OP_OUTER_ROW: case PURE_OP_PICK: case PURE_OP_SLIDE: case PURE_OP_LOCAL_LOAD: return true; case PURE_OP_ITEM_GET: return field_type(m, list_of(op->arg), item_field(op->arg)) == T_NUM; case PURE_OP_LIST_FIND: case PURE_OP_LIST_HAS: return field_type(m, op->arg, m->state_key[op->arg] - 1u) == T_NUM; default: return false; } } PURE_COLD static bool block_has_lanes(const PureModule *m, PureBlock block, int input) { for (uint32_t pc = block.start; pc < block.start + block.length; ++pc) if (!has_lanes(m, &m->code[pc], input)) return false; return true; } /* A fold in a verified block whose own block has lane forms throughout runs * a leaf of its list at a time. */ PURE_COLD static void plan_folds(PureModule *m, PureBlock block, int input) { for (uint32_t pc = block.start; pc < block.start + block.length; ++pc) { PureOp *op = &m->code[pc]; if (op->op != PURE_OP_FOLD) continue; op->plan = block_has_lanes(m, (PureBlock){pc + 1, op->arg >> 16}, input); pc += op->arg >> 16; } } /* A planned fold's block as a tree (its lane forms have no branch; one * with PICK or SLIDE is left alone): per instruction, its operands' nodes * and the first instruction of its subtree, whether it reads the fold's * item (item), and whether it reads nothing but the fold's list, its item * and constants (own): what one pass over the list can compute. */ typedef struct { uint32_t first; int kid[3]; bool item, own; } Node; PURE_COLD static unsigned arity(uint8_t op) { switch (op) { case PURE_OP_CONST: case PURE_OP_LOAD: case PURE_OP_INDEX_LOAD: case PURE_OP_ROW: case PURE_OP_OUTER_ROW: case PURE_OP_LIST_COUNT: case PURE_OP_INDEX_FIRST: case PURE_OP_INDEX_LAST: case PURE_OP_FIELD: case PURE_OP_LOCAL_LOAD: return 0; case PURE_OP_ITEM_GET: case PURE_OP_LIST_FIND: case PURE_OP_LIST_HAS: case PURE_OP_NEG: case PURE_OP_NOT: case PURE_OP_FLOOR: case PURE_OP_INDEX_NUM: return 1; case PURE_OP_CLAMP: return 3; default: return 2; } } /* The list an instruction reads, if any (-1: none). */ PURE_COLD static int list_read(const PureOp *op) { switch (op->op) { case PURE_OP_ITEM_GET: return (int)list_of(op->arg); case PURE_OP_LIST_COUNT: case PURE_OP_INDEX_FIRST: case PURE_OP_INDEX_LAST: case PURE_OP_LIST_FIND: case PURE_OP_LIST_HAS: case PURE_OP_ROW: return (int)op->arg; default: return -1; } } PURE_COLD static bool block_tree(const PureModule *m, PureBlock block, int list, Node *nodes, int *roots, unsigned *count) { int stack[PURE_MODULE_STACK]; unsigned sp = 0; for (uint32_t i = 0; i < block.length; ++i) { const PureOp *op = &m->code[block.start + i]; if (op->op == PURE_OP_PICK || op->op == PURE_OP_SLIDE) return false; unsigned pops = arity(op->op); Node *node = &nodes[i]; int read = list_read(op); node->first = block.start + i; node->item = op->op == PURE_OP_ROW; node->own = op->op != PURE_OP_LOAD && op->op != PURE_OP_INDEX_LOAD && op->op != PURE_OP_OUTER_ROW && op->op != PURE_OP_FIELD && op->op != PURE_OP_LOCAL_LOAD && (read < 0 || read == list); for (unsigned k = 0; k < 3; ++k) node->kid[k] = -1; for (unsigned k = 0; k < pops; ++k) { int kid = stack[sp - pops + k]; node->kid[k] = kid; node->item = node->item || nodes[kid].item; node->own = node->own && nodes[kid].own; } if (pops) node->first = nodes[stack[sp - pops]].first; sp -= pops; stack[sp++] = (int)i; } memcpy(roots, stack, sp * sizeof(*stack)); *count = sp; return true; } /* The comparisons a test ANDs together (at most 16). */ PURE_COLD static bool conjuncts(const PureModule *m, PureBlock block, const Node *nodes, int at, int *out, unsigned *count) { if (m->code[block.start + at].op == PURE_OP_AND) return conjuncts(m, block, nodes, nodes[at].kid[0], out, count) && conjuncts(m, block, nodes, nodes[at].kid[1], out, count); if (*count == 16) return false; out[(*count)++] = at; return true; } /* The shape of a planned fold in a column, if it has one (see PureShape). */ PURE_COLD static void shape_fold(PureModule *m, uint32_t pc) { PureOp *fold = &m->code[pc]; unsigned how = fold->arg & 0x7F; int list = (int)(fold->arg >> 8 & 0xFF); PureBlock block = {pc + 1, fold->arg >> 16}; if (!fold->plan || m->shapes == PURE_MODULE_SHAPES || how == PURE_FOLD_DISTINCT || fold->arg & PURE_FOLD_SLICED) return; Node *nodes = malloc(block.length * sizeof(*nodes)); int roots[PURE_MODULE_STACK], tests[16]; unsigned count = 0, tested = 0; if (!nodes) return; if (!block_tree(m, block, list, nodes, roots, &count) || !conjuncts(m, block, nodes, roots[count - 1], tests, &tested) || (count == 2 && !nodes[roots[0]].own)) { free(nodes); return; } /* One comparison of the item's field with a key; the rest the item's own. */ int test = -1; for (unsigned k = 0; k < tested; ++k) { if (nodes[tests[k]].own) continue; if (test >= 0) test = -2; else test = tests[k]; } PureShape shape = {0}; if (test >= 0) { const PureOp *compare = &m->code[block.start + test]; const Node *node = &nodes[test]; uint8_t op = compare->op; for (unsigned side = 0; side < 2 && !shape.form && (op == PURE_OP_EQ || op == PURE_OP_LT || op == PURE_OP_LE || op == PURE_OP_GT || op == PURE_OP_GE); ++side) { int field = node->kid[side], key = node->kid[1 - side]; const PureOp *get = &m->code[block.start + field]; if (get->op != PURE_OP_ITEM_GET || m->code[block.start + nodes[field].kid[0]].op != PURE_OP_ROW || nodes[key].item) continue; static const uint8_t flipped[] = {[PURE_OP_LT] = PURE_OP_GT, [PURE_OP_LE] = PURE_OP_GE, [PURE_OP_GT] = PURE_OP_LT, [PURE_OP_GE] = PURE_OP_LE}; shape = (PureShape){op == PURE_OP_EQ ? PURE_SHAPE_GROUP : PURE_SHAPE_RANK, op == PURE_OP_EQ || !side ? op : flipped[op], (uint16_t)item_field(get->arg), block.start + (uint32_t)test, {nodes[key].first, block.start + (uint32_t)key + 1 - nodes[key].first}}; } /* A rank answers a count tested by the comparison alone. */ if (shape.form == PURE_SHAPE_RANK && (how != PURE_FOLD_COUNT || tested != 1)) shape.form = 0; } if (shape.form) { m->shape[m->shapes++] = shape; fold->shape = m->shapes; } free(nodes); } /* A handler (its walks and folds within) uses each local for one thing: a * number, or an index of one list. */ PURE_COLD static bool locals_agree(const PureModule *m, PureBlock block) { uint32_t used[PURE_MODULE_LOCALS] = {0}; /* what a slot holds + 1 */ for (uint32_t pc = block.start; pc < block.start + block.length; ++pc) { const PureOp *op = &m->code[pc]; if (op->op != PURE_OP_LOCAL_LOAD && op->op != PURE_OP_LOCAL_STORE) continue; uint32_t slot = op->arg & 0xFF, what = (op->arg >> 8) + 1; if (used[slot] && used[slot] != what) return false; used[slot] = what; } return true; } /* Whether a node's subtree cannot fault: no division, no overflow of a sum * or product, no key or item that may be missing (an item read through the * item itself or the column's row is there). */ PURE_COLD static bool faultless(const PureModule *m, PureBlock block, const Node *nodes, int at) { const PureOp *op = &m->code[block.start + at]; switch (op->op) { case PURE_OP_CONST: case PURE_OP_LOAD: case PURE_OP_FIELD: case PURE_OP_LOCAL_LOAD: case PURE_OP_ROW: case PURE_OP_OUTER_ROW: case PURE_OP_LIST_COUNT: case PURE_OP_INDEX_FIRST: case PURE_OP_INDEX_LAST: case PURE_OP_INDEX_LOAD: case PURE_OP_INDEX_NUM: case PURE_OP_LT: case PURE_OP_LE: case PURE_OP_GT: case PURE_OP_GE: case PURE_OP_EQ: case PURE_OP_NE: case PURE_OP_AND: case PURE_OP_OR: case PURE_OP_NOT: case PURE_OP_NEG: case PURE_OP_FLOOR: case PURE_OP_MIN: case PURE_OP_MAX: case PURE_OP_LIST_HAS: break; case PURE_OP_ITEM_GET: { uint8_t index = m->code[block.start + nodes[at].kid[0]].op; if (index != PURE_OP_ROW && index != PURE_OP_OUTER_ROW) return false; break; } default: return false; } for (unsigned k = 0; k < 3; ++k) if (nodes[at].kid[k] >= 0 && !faultless(m, block, nodes, nodes[at].kid[k])) return false; return true; } /* The range of a keyed list's keys a planned block's test allows (see * PureRange): a filter's other parts may fault, a fold's or walk's may not; * a fold's value (the first of two) neither. */ PURE_COLD static bool block_range(const PureModule *m, PureBlock block, int list, bool faults, PureRange *out) { if (!m->state_key[list] || field_type(m, (uint32_t)list, m->state_key[list] - 1u) != T_NUM || !block.length) return false; uint32_t key = m->state_key[list] - 1u; Node *nodes = malloc(block.length * sizeof(*nodes)); int roots[PURE_MODULE_STACK], tests[16]; unsigned count = 0, tested = 0; bool ok = nodes && block_tree(m, block, list, nodes, roots, &count) && count >= 1 && conjuncts(m, block, nodes, roots[count - 1], tests, &tested) && (faults || count == 1 || faultless(m, block, nodes, roots[0])); PureRange range = {0}; for (unsigned k = 0; ok && k < tested; ++k) { const Node *node = &nodes[tests[k]]; uint8_t op = m->code[block.start + tests[k]].op; bool bounded = false; for (unsigned side = 0; side < 2 && !bounded && op >= PURE_OP_LT && op <= PURE_OP_EQ; ++side) { int item = node->kid[side], value = node->kid[1 - side]; const PureOp *get = &m->code[block.start + item]; if (get->op != PURE_OP_ITEM_GET || list_of(get->arg) != (uint32_t)list || item_field(get->arg) != key || m->code[block.start + nodes[item].kid[0]].op != PURE_OP_ROW || nodes[value].item) continue; static const uint8_t flipped[] = {[PURE_OP_LT] = PURE_OP_GT, [PURE_OP_LE] = PURE_OP_GE, [PURE_OP_GT] = PURE_OP_LT, [PURE_OP_GE] = PURE_OP_LE, [PURE_OP_EQ] = PURE_OP_EQ}; uint8_t relation = side ? flipped[op] : op; /* the key REL the value */ PureBlock bound = {nodes[value].first, block.start + (uint32_t)value + 1 - nodes[value].first}; bool lower = relation == PURE_OP_GT || relation == PURE_OP_GE || relation == PURE_OP_EQ, upper = relation == PURE_OP_LT || relation == PURE_OP_LE || relation == PURE_OP_EQ; if ((lower && range.lower_relation) || (upper && range.upper_relation)) continue; /* one of each */ if (lower) range.lower_relation = relation == PURE_OP_EQ ? PURE_OP_GE : relation, range.lower = bound; if (upper) range.upper_relation = relation == PURE_OP_EQ ? PURE_OP_LE : relation, range.upper = bound; bounded = true; } if (!bounded && !faults && !faultless(m, block, nodes, tests[k])) ok = false; } free(nodes); if (!ok || (!range.lower_relation && !range.upper_relation)) return false; *out = range; return true; } PURE_COLD static uint8_t keep_range(PureModule *m, const PureRange *range) { if (m->ranges == PURE_MODULE_RANGES) return 0; m->range[m->ranges++] = *range; return m->ranges; } /* Whether a walk's bounds read nothing its block writes: the states and * locals it stores, the lists it changes, and what those changes move with * them (an insert or remove moves the indices into the list, a text's * change the cursors in it). A bound is found once, before the walk; the * walk's where reads it anew for every item. */ PURE_COLD static bool bounds_fixed(const PureModule *m, const PureRange *range, PureBlock body) { uint64_t states = 0, locals = 0, lists = 0; for (uint32_t pc = body.start; pc < body.start + body.length; ++pc) { const PureOp *op = &m->code[pc]; switch (op->op) { case PURE_OP_STORE: case PURE_OP_CUR_STORE: case PURE_OP_INDEX_STORE: case PURE_OP_TEXT_INSERT: case PURE_OP_TEXT_REMOVE: case PURE_OP_TEXT_SET: states |= (uint64_t)1 << (op->arg & 63); break; case PURE_OP_LOCAL_STORE: locals |= (uint64_t)1 << (op->arg & 63); break; case PURE_OP_LIST_APPEND: case PURE_OP_LIST_INSERT: case PURE_OP_LIST_REMOVE: lists |= (uint64_t)1 << (op->arg & 63); break; case PURE_OP_ITEM_SET: lists |= (uint64_t)1 << (list_of(op->arg) & 63); break; default: break; } } for (uint32_t s = 0; s < m->states; ++s) { uint32_t ref = m->state_ref[s]; if ((m->state_type[s] == PURE_STATE_INDEX && lists >> (ref & 63) & 1) || (m->state_type[s] == PURE_STATE_CURSOR && states >> (ref & 63) & 1)) states |= (uint64_t)1 << (s & 63); } for (unsigned side = 0; side < 2; ++side) { PureBlock bound = side ? range->upper : range->lower; if (!(side ? range->upper_relation : range->lower_relation)) continue; for (uint32_t pc = bound.start; pc < bound.start + bound.length; ++pc) { const PureOp *op = &m->code[pc]; int list = list_read(op); if ((op->op == PURE_OP_LOAD || op->op == PURE_OP_INDEX_LOAD || op->op == PURE_OP_CUR_LOAD) && states >> (op->arg & 63) & 1) return false; if (op->op == PURE_OP_LOCAL_LOAD && locals >> (op->arg & 63) & 1) return false; if (list >= 0 && lists >> (list & 63) & 1) return false; if (op->op == PURE_OP_INDEX_MOVE && lists) return false; /* the count of its index's list, whichever */ } } return true; } /* A walk whose block begins with its where (a test, then a jump to the * block's end when it fails) and a planned fold: the range their test allows. */ PURE_COLD static void range_code(PureModule *m, PureBlock block, int input) { for (uint32_t pc = block.start; pc < block.start + block.length; ++pc) { PureOp *op = &m->code[pc]; PureRange range; if (op->op == PURE_OP_FOLD) { /* a slice has its range already */ if (op->plan && !(op->arg & PURE_FOLD_SLICED) && block_range(m, (PureBlock){pc + 1, op->arg >> 16}, (int)(op->arg >> 8 & 0xFF), false, &range)) op->range = keep_range(m, &range); pc += op->arg >> 16; continue; } if (op->op != PURE_OP_EACH || op->arg & PURE_EACH_SLICED) continue; uint32_t end = pc + 1 + (op->arg >> 16); int height = 0; for (uint32_t at = pc + 1; at < end; ++at) { const PureOp *next = &m->code[at]; if (next->op == PURE_OP_JZ) { PureBlock where = {pc + 1, at - pc - 1}; if (height == 1 && next->arg == end && block_has_lanes(m, where, input) && block_range(m, where, (int)(op->arg >> 8 & 0xFF), false, &range) && bounds_fixed(m, &range, (PureBlock){at + 1, end - at - 1})) op->range = keep_range(m, &range); break; } if (!has_lanes(m, next, input) || next->op == PURE_OP_PICK || next->op == PURE_OP_SLIDE) break; height += 1 - (int)arity(next->op); } } } PURE_COLD PureResult pure_module_read(const char *path, PureModule *out, char *error, size_t error_size) { FILE *file = fopen(path, "rb"); unsigned char *bytes = NULL; size_t size = 0, capacity = 0; bool ok = file != NULL; /* The largest module is some 2 MiB: code, strings and constants at their limits. */ while (ok && !feof(file) && capacity < (8u << 20)) { capacity = capacity ? capacity * 2 : 1 << 16; unsigned char *grown = realloc(bytes, capacity); if (!grown) { ok = false; break; } bytes = grown; size += fread(bytes + size, 1, capacity - size, file); ok = !ferror(file); } ok = ok && feof(file); if (file) fclose(file); PureResult result = PURE_NOT_FOUND; if (!ok) { if (error_size) snprintf(error, error_size, "cannot read %s", path); pure_module_release(out); } else result = pure_module_load(bytes, size, out, error, error_size); free(bytes); return result; } void pure_module_release(PureModule *m) { free(m->storage); m->storage = NULL; m->code = NULL; m->constant_offset = m->constant_length = NULL; m->constant_data = NULL; } PURE_COLD PureResult pure_module_load(const void *bytes, size_t size, PureModule *out, char *error, size_t error_size) { const unsigned char *p = bytes; const char *why; uint32_t bad = 0; PureResult result = PURE_INVALID; #define REFUSE(message, index) do { why = message; bad = (uint32_t)(index); goto refused; } while (0) if (error_size) error[0] = 0; pure_module_release(out); memset(out, 0, sizeof(*out)); if (!p || size < PURE_MODULE_HEADER || memcmp(p, magic, sizeof(magic))) REFUSE("not a Pure module v5", 0); out->states = (uint16_t)read16(p + 8); out->inputs = (uint16_t)read16(p + 10); out->views = (uint16_t)read16(p + 12); out->handlers = (uint16_t)read16(p + 14); out->code_count = read32(p + 16); uint32_t strings = read32(p + 20); out->fields = (uint16_t)read16(p + 24); out->collections = (uint16_t)read16(p + 26); out->constants = (uint16_t)read16(p + 28); out->records = (uint16_t)read16(p + 30); uint32_t constant_bytes = read32(p + 32); out->record_fields = (uint16_t)read16(p + 36); if (read16(p + 38)) REFUSE("reserved header bytes", 38); if (out->states > PURE_MODULE_STATES || out->inputs > PURE_MODULE_INPUTS || out->views > PURE_MODULE_VIEWS || out->handlers > PURE_MODULE_HANDLERS || out->code_count > PURE_MODULE_CODE || strings > PURE_MODULE_STRINGS || out->fields > PURE_MODULE_FIELDS || out->collections > PURE_MODULE_COLLECTIONS || out->constants > PURE_MODULE_CONSTANTS || constant_bytes > PURE_MODULE_CONSTANT_BYTES || out->records > PURE_MODULE_RECORDS || out->record_fields > PURE_MODULE_RECORD_FIELDS) { result = PURE_LIMIT; REFUSE("module exceeds a limit", 8); } size_t expected = PURE_MODULE_HEADER + (size_t)out->states * STATE_BYTES + (size_t)out->collections * COLLECTION_BYTES + (size_t)out->inputs * INPUT_BYTES + (size_t)out->fields * FIELD_BYTES + (size_t)out->constants * CONSTANT_BYTES + (size_t)out->records * RECORD_BYTES + (size_t)out->record_fields * RECORD_FIELD_BYTES + (size_t)out->views * VIEW_BYTES + (size_t)out->handlers * HANDLER_BYTES + (size_t)out->code_count * OP_BYTES + strings + constant_bytes; if (size != expected) REFUSE("module size", expected); /* The code, the constants' offsets and lengths, then their bytes, in one block. */ size_t storage = (size_t)out->code_count * sizeof(PureOp) + (size_t)out->constants * 2 * sizeof(uint32_t) + constant_bytes; if (!(out->storage = malloc(storage ? storage : 1))) { result = PURE_ALLOCATION; REFUSE("out of memory", 0); } out->code = out->storage; out->constant_offset = (uint32_t *)(out->code + out->code_count); out->constant_length = out->constant_offset + out->constants; out->constant_data = (unsigned char *)(out->constant_length + out->constants); const unsigned char *at = p + PURE_MODULE_HEADER; const unsigned char *text = p + size - constant_bytes - strings; if (constant_bytes) memcpy(out->constant_data, p + size - constant_bytes, constant_bytes); for (uint32_t i = 0; i < out->states; ++i, at += STATE_BYTES) { out->state_type[i] = (uint8_t)read32(at + 4); if (read32(at + 4) > PURE_STATE_INDEX) REFUSE("state type", i); /* Flags: a mark (cursor), a keyed list's key field + 1, or a list of a message's rows. */ uint32_t flags = out->state_type[i] == PURE_STATE_NUM ? 0 : read32(at + 12); bool cursor = out->state_type[i] == PURE_STATE_CURSOR, list = out->state_type[i] == PURE_STATE_LIST; bool rows = list && flags == PURE_LIST_ROWS; /* A list of a message's rows is named by the field's path (input.field), no other state. */ if (!name_at(text, strings, read32(at), rows ? NAME_PATH : NAME_IDENTIFIER, out->state_names[i]) || (rows && !strchr(out->state_names[i], '.'))) REFUSE("state name", i); if (out->state_type[i] == PURE_STATE_NUM) { out->initial[i] = read_double(at + 8); if (!isfinite(out->initial[i])) REFUSE("non-finite initial value", i); } else { if ((flags && !(cursor && flags == PURE_CURSOR_STAYS) && !(list && flags <= PURE_RECORD_FIELDS) && !rows) || read32(at + 8) > UINT16_MAX) REFUSE("state reference", i); out->state_ref[i] = (uint16_t)read32(at + 8); out->state_flags[i] = cursor ? (uint8_t)flags : rows ? PURE_LIST_ROWS >> 8 : 0; out->state_key[i] = list && !rows ? (uint8_t)flags : 0; } } for (uint32_t i = 0; i < out->collections; ++i, at += COLLECTION_BYTES) { if (!name_at(text, strings, read32(at), NAME_IDENTIFIER, out->collection_names[i])) REFUSE("collection name", i); if (read32(at + 4) != 1 || read32(at + 8) != 1) REFUSE("collection must hold bytes by key", i); } uint32_t next_field = 0; const unsigned char *fields = at + (size_t)out->inputs * INPUT_BYTES; for (uint32_t i = 0; i < out->inputs; ++i, at += INPUT_BYTES) { PureInputShape *shape = &out->input[i]; shape->kind = at[4]; shape->keyed = at[5]; shape->field_start = (uint16_t)read16(at + 12); shape->field_count = (uint16_t)read16(at + 14); /* Arguments bear their view's name (view.args); other inputs are identifiers. */ if (!name_at(text, strings, read32(at), shape->kind == PURE_KIND_ARGUMENTS ? NAME_PATH : NAME_IDENTIFIER, out->input_names[i])) REFUSE("input name", i); if (read16(at + 6) || at[5] > 1) REFUSE("input flags", i); if (shape->kind == PURE_KIND_KEY) { if (shape->keyed || shape->field_start || shape->field_count || !name_at(text, strings, read32(at + 8), NAME_PRINTABLE, out->input_keys[i]) || !key_name(out->input_keys[i])) REFUSE("input key", i); for (uint32_t k = 0; k < i; ++k) if (out->input[k].kind == PURE_KIND_KEY && !strcmp(out->input_keys[k], out->input_keys[i])) REFUSE("duplicate key", i); continue; } if (shape->kind == PURE_KIND_TEXT) { if (shape->keyed || shape->field_start || shape->field_count || read32(at + 8)) REFUSE("text input shape", i); continue; } if (shape->kind == PURE_KIND_TIMER) { shape->period = read32(at + 8); if (shape->keyed || shape->field_start || shape->field_count || !shape->period || shape->period > PURE_TIMER_LONGEST) REFUSE("timer input", i); continue; } bool arguments = shape->kind == PURE_KIND_ARGUMENTS; if ((shape->kind != PURE_KIND_MESSAGE && shape->kind != PURE_KIND_OUTPUT && !arguments) || (!arguments && read32(at + 8)) || ((shape->kind == PURE_KIND_OUTPUT || arguments) && shape->keyed) || shape->field_start != next_field || shape->field_count > out->fields - next_field) REFUSE("message shape", i); shape->view = arguments ? read32(at + 8) : 0; /* The prefix holds the fixed fields and the variable fields' lengths * in order, but the last variable field's: it takes the rest. */ uint32_t last = UINT32_MAX; for (uint32_t f = 0; f < shape->field_count; ++f) { uint32_t type = read32(fields + (size_t)(next_field + f) * FIELD_BYTES + 4) & 0xFF; if (type == PURE_FIELD_BYTES || type == PURE_FIELD_TEXT || type == PURE_FIELD_ROWS) last = f; } for (uint32_t f = 0; f < shape->field_count; ++f) { const unsigned char *entry = fields + (size_t)(next_field + f) * FIELD_BYTES; PureField *field = &out->field[next_field + f]; uint32_t type = read32(entry + 4); field->type = (uint8_t)type; field->rows = (uint16_t)(type >> 8); /* a rows field's list state */ if (!name_at(text, strings, read32(entry), NAME_PATH, field->name) || field->type < PURE_FIELD_U32 || field->type > PURE_FIELD_ROWS || (field->type != PURE_FIELD_ROWS && type >> 8) || type >> 24) REFUSE("message field", next_field + f); /* Rows fill the list named by the input's name and the field's path; an output sends none. */ if (field->type == PURE_FIELD_ROWS) { char path[2 * PURE_MODULE_NAME + 2]; snprintf(path, sizeof(path), "%s.%s", out->input_names[i], field->name); if (shape->kind != PURE_KIND_MESSAGE || field->rows >= out->states || out->state_type[field->rows] != PURE_STATE_LIST || !(out->state_flags[field->rows] & PURE_LIST_ROWS >> 8) || strcmp(out->state_names[field->rows], path)) REFUSE("rows field", next_field + f); } /* A name is a field or a group, never both (user and user.name). */ for (uint32_t k = 0; k < f; ++k) { const char *a = out->field[next_field + k].name, *b = field->name; size_t la = strlen(a), lb = strlen(b); if (!strcmp(a, b)) REFUSE("duplicate field", next_field + f); if ((la < lb && !memcmp(a, b, la) && b[la] == '.') || (lb < la && !memcmp(a, b, lb) && a[lb] == '.')) REFUSE("field and group", next_field + f); } field->offset = f == last ? PURE_FIELD_REST : shape->prefix; if (f != last) shape->prefix += field->type == PURE_FIELD_NUMBER ? 8 : 4; } next_field += shape->field_count; } if (next_field != out->fields) REFUSE("unused message fields", next_field); at = fields + (size_t)out->fields * FIELD_BYTES; for (uint32_t i = 0; i < out->constants; ++i, at += CONSTANT_BYTES) { out->constant_offset[i] = read32(at); out->constant_length[i] = read32(at + 4); if (out->constant_offset[i] > constant_bytes || out->constant_length[i] > constant_bytes - out->constant_offset[i] || !pure_utf8_valid((PureSpan){out->constant_data + out->constant_offset[i], out->constant_length[i]})) REFUSE("text constant", i); } /* Records: fields in order, numbered from first; a text default is a constant. */ const unsigned char *fields_at = at + (size_t)out->records * RECORD_BYTES; uint32_t next_record_field = 0; for (uint32_t i = 0; i < out->records; ++i, at += RECORD_BYTES) { PureRecord *record = &out->record[i]; record->first = (uint16_t)read16(at + 4); record->count = (uint16_t)read16(at + 6); if (!name_at(text, strings, read32(at), NAME_IDENTIFIER, out->record_names[i]) || record->first != next_record_field || !record->count || record->count > PURE_RECORD_FIELDS || record->count > out->record_fields - next_record_field) REFUSE("record", i); for (uint32_t f = record->first; f < record->first + record->count; ++f) { const unsigned char *entry = fields_at + (size_t)f * RECORD_FIELD_BYTES; uint32_t type = read32(entry + 4); out->record_field_text[f] = type == 1; if (!name_at(text, strings, read32(entry), NAME_IDENTIFIER, out->record_field_names[f]) || type > 1) REFUSE("record field", f); for (uint32_t k = record->first; k < f; ++k) if (!strcmp(out->record_field_names[k], out->record_field_names[f])) REFUSE("duplicate record field", f); out->record_field_default[f] = type ? read32(entry + 8) : read_double(entry + 8); if (type ? read32(entry + 12) || read32(entry + 8) >= out->constants : !isfinite(out->record_field_default[f])) REFUSE("record field default", f); } next_record_field += record->count; } if (next_record_field != out->record_fields) REFUSE("unused record fields", next_record_field); at = fields_at + (size_t)out->record_fields * RECORD_FIELD_BYTES; for (uint32_t i = 0; i < out->states; ++i) if ((out->state_type[i] == PURE_STATE_TEXT && out->state_ref[i] >= out->constants) || (out->state_type[i] == PURE_STATE_CURSOR && !state_of(out, out->state_ref[i], PURE_STATE_TEXT)) || (out->state_type[i] == PURE_STATE_LIST && (out->state_ref[i] >= out->records || out->state_key[i] > out->record[out->state_ref[i]].count)) || (out->state_type[i] == PURE_STATE_INDEX && !state_of(out, out->state_ref[i], PURE_STATE_LIST))) REFUSE("state reference", i); /* A table names its list in place of code; its columns follow it. */ for (uint32_t i = 0; i < out->views; ++i, at += VIEW_BYTES) { if (!name_at(text, strings, read32(at), NAME_IDENTIFIER, out->view_names[i])) REFUSE("view name", i); out->view_type[i] = at[4]; out->view_table[i] = (uint16_t)read16(at + 6); out->view_code[i] = (PureBlock){read32(at + 8), read32(at + 12)}; uint32_t table = out->view_table[i]; if (at[4] > PURE_VIEW_TABLE || (at[5] && at[4] != PURE_VIEW_TABLE) || (table && (table > i || out->view_type[table - 1] != PURE_VIEW_TABLE || at[4] == PURE_VIEW_TABLE))) REFUSE("view type", i); /* A table names its list in start, or, filtered, in the byte after its * type (list + 1) with its filter's block in start and length. */ if (at[4] == PURE_VIEW_TABLE) { uint32_t list = at[5] ? at[5] - 1u : out->view_code[i].start; if (!state_of(out, list, PURE_STATE_LIST) || !at[5] != !out->view_code[i].length) REFUSE("table list", i); out->view_list[i] = (uint16_t)list; } else if (table) out->view_list[i] = out->view_list[table - 1]; } /* Arguments are a view's (not a column's: a table's columns and filter * read the table's), one set a view, bearing its name. */ for (uint32_t i = 0; i < out->inputs; ++i) { const PureInputShape *shape = &out->input[i]; if (shape->kind != PURE_KIND_ARGUMENTS) continue; char path[PURE_MODULE_NAME + 8]; if (shape->view >= out->views || out->view_table[shape->view] || out->view_arguments[shape->view]) REFUSE("arguments", i); snprintf(path, sizeof(path), "%s.args", out->view_names[shape->view]); if (strcmp(path, out->input_names[i])) REFUSE("arguments", i); out->view_arguments[shape->view] = (uint8_t)(i + 1); } for (uint32_t i = 0; i < out->views; ++i) if (out->view_table[i]) out->view_arguments[i] = out->view_arguments[out->view_table[i] - 1]; for (uint32_t i = 0; i < out->handlers; ++i, at += HANDLER_BYTES) { uint32_t event = read32(at); out->handler[i] = (PureHandler){event, {read32(at + 4), read32(at + 8)}}; int input = event_input(event); if (event > 2u * out->inputs || (input >= 0 && out->input[input].kind != PURE_KIND_KEY && !(event & 1)) || (input >= 0 && (out->input[input].kind == PURE_KIND_OUTPUT || out->input[input].kind == PURE_KIND_ARGUMENTS))) REFUSE("handler event", i); } for (uint32_t i = 0; i < out->code_count; ++i, at += OP_BYTES) { if (at[1] || at[2] || at[3]) REFUSE("instruction padding", i); out->code[i] = (PureOp){.op = at[0], .arg = read32(at + 4), .value = read_double(at + 8)}; } /* States, records, collections, inputs and views share one namespace. */ const char *names[PURE_MODULE_STATES + PURE_MODULE_RECORDS + PURE_MODULE_COLLECTIONS + PURE_MODULE_INPUTS + PURE_MODULE_VIEWS]; size_t count = 0; for (uint32_t i = 0; i < out->states; ++i) names[count++] = out->state_names[i]; for (uint32_t i = 0; i < out->records; ++i) names[count++] = out->record_names[i]; for (uint32_t i = 0; i < out->collections; ++i) names[count++] = out->collection_names[i]; for (uint32_t i = 0; i < out->inputs; ++i) names[count++] = out->input_names[i]; for (uint32_t i = 0; i < out->views; ++i) if (!out->view_table[i]) names[count++] = out->view_names[i]; for (size_t i = 0; i < count; ++i) for (size_t k = 0; k < i; ++k) if (!strcmp(names[i], names[k])) REFUSE("duplicate name", i); /* Column names are unique within their table. */ for (uint32_t i = 0; i < out->views; ++i) for (uint32_t k = 0; k < i; ++k) if (out->view_table[i] && out->view_table[k] == out->view_table[i] && !strcmp(out->view_names[i], out->view_names[k])) REFUSE("duplicate column", i); for (uint32_t i = 0; i < out->views; ++i) { bad = i; bool table = out->view_type[i] == PURE_VIEW_TABLE; uint32_t event = out->view_arguments[i] ? 2u * out->view_arguments[i] - 1u : 0; /* the arguments' input, as an arrival */ if ((!table || out->view_code[i].length) && (why = verify_block(out, out->view_code[i], table ? FILTER : out->view_type[i], table || out->view_table[i] ? out->view_list[i] : -1, -1, event, false, &bad))) goto refused; } for (uint32_t i = 0; i < out->handlers; ++i) { bad = i; if ((why = verify_block(out, out->handler[i].code, -1, -1, -1, out->handler[i].event, true, &bad))) goto refused; if (!locals_agree(out, out->handler[i].code)) { why = "local used as two things"; goto refused; } } for (uint32_t i = 0; i < out->views; ++i) { int given = (int)out->view_arguments[i] - 1; plan_folds(out, out->view_code[i], given); out->view_plan[i] = out->view_type[i] == PURE_VIEW_TABLE && out->view_code[i].length && block_has_lanes(out, out->view_code[i], given); PureRange range; if (out->view_plan[i] && block_range(out, out->view_code[i], out->view_list[i], true, &range)) out->view_range[i] = keep_range(out, &range); if (out->view_type[i] != PURE_VIEW_TABLE) range_code(out, out->view_code[i], given); /* A fold in a column runs for every row: one pass may answer them all. */ for (uint32_t pc = out->view_code[i].start; out->view_table[i] && pc < out->view_code[i].start + out->view_code[i].length; ++pc) if (out->code[pc].op == PURE_OP_FOLD) { shape_fold(out, pc); pc += out->code[pc].arg >> 16; } } for (uint32_t i = 0; i < out->handlers; ++i) { int input = event_input(out->handler[i].event); input = input >= 0 && out->input[input].kind == PURE_KIND_MESSAGE ? input : -1; plan_folds(out, out->handler[i].code, input); range_code(out, out->handler[i].code, input); } return PURE_OK; refused: if (error_size) snprintf(error, error_size, "%s (%u)", why, bad); pure_module_release(out); return result; #undef REFUSE } static int find(const char (*names)[PURE_MODULE_NAME], unsigned count, const char *name) { for (unsigned i = 0; i < count; ++i) if (!strcmp(names[i], name)) return (int)i; return -1; } int pure_module_state(const PureModule *m, const char *name) { return find(m->state_names, m->states, name); } int pure_module_input(const PureModule *m, const char *name) { return find(m->input_names, m->inputs, name); } static uint32_t fnv(uint32_t h, const void *bytes, size_t size) { const unsigned char *p = bytes; for (size_t i = 0; i < size; ++i) h = (h ^ p[i]) * 16777619u; return h; } uint32_t pure_module_shape(const PureModule *m, uint32_t input) { const PureInputShape *s = &m->input[input]; uint32_t h = fnv(2166136261u, &s->prefix, sizeof(s->prefix)); for (uint32_t f = 0; f < s->field_count; ++f) { const PureField *field = &m->field[s->field_start + f]; unsigned char fixed[7] = {field->type, (unsigned char)field->rows, (unsigned char)(field->rows >> 8), (unsigned char)field->offset, (unsigned char)(field->offset >> 8), (unsigned char)(field->offset >> 16), (unsigned char)(field->offset >> 24)}; h = fnv(fnv(h, field->name, strlen(field->name) + 1), fixed, sizeof(fixed)); } return h; } int pure_module_view(const PureModule *m, const char *name) { for (uint32_t i = 0; i < m->views; ++i) if (!m->view_table[i] && !strcmp(m->view_names[i], name)) return (int)i; return -1; } int pure_module_position(const PureModule *m, uint32_t view) { if (view >= m->views || m->view_type[view] != PURE_VIEW_NUM || m->view_table[view]) return -1; const PureBlock *block = &m->view_code[view]; const PureOp *code = &m->code[block->start]; return block->length == 2 && code[0].op == PURE_OP_INDEX_LOAD && code[1].op == PURE_OP_INDEX_NUM ? (int)code[0].arg : -1; } int pure_module_text_state(const PureModule *m, uint32_t view) { if (view >= m->views || m->view_type[view] != PURE_VIEW_TEXT || m->view_table[view]) return -1; const PureBlock *block = &m->view_code[view]; return block->length == 1 && m->code[block->start].op == PURE_OP_TEXT_LOAD ? (int)m->code[block->start].arg : -1; } int pure_module_column(const PureModule *m, uint32_t table, const char *name) { for (uint32_t i = 0; i < m->views; ++i) if (m->view_table[i] == table + 1 && !strcmp(m->view_names[i], name)) return (int)i; return -1; } /* ---- Execution ------------------------------------------------------ */ /* IEEE 754-2019 minimum/maximum on finite values: -0 orders below +0. */ static double minimum(double a, double b) { return a < b || (a == b && signbit(a)) ? a : b; } static double maximum(double a, double b) { return a > b || (a == b && !signbit(a)) ? a : b; } typedef struct { double num; PureBytes bytes; } Slot; /* A walk (EACH): the list, the item it runs for, where it ends (items the * walk removes move it), and whether that item left. */ typedef struct { uint32_t list; size_t at, end; bool removed; } Walk; typedef struct { PureApp *app; const PureInputShape *shape; /* message, or NULL */ const char *key; /* a keyed message's key */ int64_t base; /* the revision a message's edit was made against, or -1 */ PureArena *arena; double dt; size_t row; /* the row a column is evaluated for (in a fold, the fold's item) */ size_t outer; /* in a fold, the row of the column it runs in */ Walk *walk; /* the walk the code runs in, or NULL */ double *locals; /* the event's locals (a handler's, and what runs in it), or NULL */ bool arguments; /* FIELD reads the arguments given for a view, not the message */ bool modified, exists; uint32_t (*spans)[2]; /* a message's variable fields: start and size in the payload */ } Event; static PureResult fault(PureApp *app, PureFault kind, uint32_t pc) { app->fault = kind; app->fault_pc = pc; return kind == PURE_FAULT_LIMIT ? PURE_LIMIT : kind == PURE_FAULT_NOT_FOUND ? PURE_NOT_FOUND : kind == PURE_FAULT_EXISTS ? PURE_CONFLICT : kind == PURE_FAULT_MEMORY ? PURE_BUDGET : PURE_INVALID; } static bool reserve(PureArena *arena, size_t more) { if (more <= arena->capacity - arena->used) return true; size_t capacity = arena->capacity ? arena->capacity : 256; while (capacity - arena->used < more) { if (capacity > SIZE_MAX / 2) return false; capacity *= 2; } unsigned char *bytes = realloc(arena->bytes, capacity); if (!bytes) return false; arena->bytes = bytes; arena->capacity = capacity; return true; } /* Visit a value's bytes in order, from wherever they live. */ static PureResult visit_value(const PureApp *app, const PureArena *arena, PureBytes v, bool (*visit)(void *, PureSpan), void *context) { if (!v.length) return PURE_OK; const unsigned char *direct = NULL; switch (v.source) { case FROM_PAYLOAD: direct = app->payload.data + v.offset; break; case FROM_ARGUMENTS: direct = app->arguments.data + v.offset; break; case FROM_COPY: direct = app->copied + v.offset; break; case FROM_CONSTANT: direct = app->module->constant_data + v.offset; break; case FROM_ARENA: direct = arena->bytes + v.offset; break; case FROM_TEXT: return pure_draft_read_version(app->texts[v.owner], v.version, (size_t)v.offset, (size_t)v.length, visit, context); default: return app->data.read(app->data.context, app->document, v.version, (size_t)v.offset, (size_t)v.length, visit, context); } visit(context, (PureSpan){direct, (size_t)v.length}); return PURE_OK; } static bool append_span(void *context, PureSpan span) { PureArena *arena = context; memmove(arena->bytes + arena->used, span.data, span.size); arena->used += span.size; return true; } /* Copy a value to the end of the arena. Room is reserved first, so reading * an arena value while appending never follows a moved buffer. */ static PureResult append_value(const PureApp *app, PureArena *arena, PureBytes v) { if (!reserve(arena, (size_t)v.length)) return PURE_ALLOCATION; return visit_value(app, arena, v, append_span, arena); } /* A contiguous span of a value, copying into the arena when it is spread out. */ static PureResult contiguous(const PureApp *app, PureArena *arena, PureBytes v, PureSpan *out) { if (v.source == FROM_PAYLOAD || v.source == FROM_COPY || v.source == FROM_CONSTANT || v.source == FROM_ARGUMENTS) { const unsigned char *base = v.source == FROM_PAYLOAD ? app->payload.data : v.source == FROM_ARGUMENTS ? app->arguments.data : v.source == FROM_COPY ? app->copied : app->module->constant_data; *out = (PureSpan){v.length ? base + v.offset : NULL, (size_t)v.length}; return PURE_OK; } if (v.source == FROM_ARENA) { *out = (PureSpan){arena->bytes + v.offset, (size_t)v.length}; return PURE_OK; } size_t start = arena->used; PureResult result = append_value(app, arena, v); *out = (PureSpan){arena->bytes + start, (size_t)v.length}; return result; } typedef struct { size_t count; unsigned unit; unsigned utf8; bool valid; } Measure; static bool measure(void *context, PureSpan span) { Measure *m = context; if (m->unit == 2) m->valid = m->valid && pure_utf8_step(&m->utf8, span); else m->count += m->unit ? pure_utf8_newlines(span) : pure_utf8_scalars(span); return true; } static PureBytes text_of(const PureApp *app, uint32_t state) { PureVersion version = pure_draft_version(app->texts[state]); return (PureBytes){FROM_TEXT, (uint16_t)state, version, 0, version.bytes}; } static void move_cursors(const PureModule *m, double *values, uint32_t text, size_t at, size_t removed, size_t inserted) { for (uint32_t c = 0; c < m->states; ++c) { if (m->state_type[c] != PURE_STATE_CURSOR || m->state_ref[c] != text) continue; double position = values[c]; if (removed) { if (position >= at + removed) position -= (double)removed; else if (position > at) position = (double)at; } else if (position > at || (position == at && !(m->state_flags[c] & PURE_CURSOR_STAYS))) position += (double)inserted; values[c] = position; } } /* Indices follow their item across an insert or remove; an index whose item * was removed names the next item (or the last, or 0 in an empty list). */ static void move_indices(const PureModule *m, double *values, uint32_t list, size_t count, size_t at, bool inserted) { double last = count ? (double)(count - 1) : 0; for (uint32_t i = 0; i < m->states; ++i) { if (m->state_type[i] != PURE_STATE_INDEX || m->state_ref[i] != list) continue; if (inserted) { if (count > 1 && values[i] >= (double)at) ++values[i]; } else { if (values[i] > (double)at) --values[i]; values[i] = minimum(values[i], last); } } } static bool text_field(const PureModule *m, uint32_t list, uint32_t field) { return m->record_field_text[m->record[m->state_ref[list]].first + field]; } /* Append bytes to the arena as a value of it. */ static PureResult keep_bytes(PureArena *arena, const void *bytes, size_t length, PureBytes *out) { if (!reserve(arena, length)) return PURE_ALLOCATION; if (length) memcpy(arena->bytes + arena->used, bytes, length); *out = (PureBytes){FROM_ARENA, 0, {0, 0}, arena->used, length}; arena->used += length; return PURE_OK; } /* Run a verified block. Types and stack bounds were proven at load. A change * the data refuses (a size limit, a missing item) fails the event with its * fault; other failures pass through. */ typedef struct { unsigned char *at; } Copy; static bool copy_out(void *context, PureSpan span) { Copy *copy = context; if (span.size) memcpy(copy->at, span.data, span.size); copy->at += span.size; return true; } /* An output's message from its field values, laid out as a message's * payload (size bytes), numbered and kept with the event's changes. */ static PureResult send(PureApp *app, uint32_t output, const Slot *fields, const PureArena *arena, size_t size) { const PureModule *m = app->module; const PureInputShape *shape = &m->input[output]; unsigned char *payload = malloc(size ? size : 1); if (!payload) return PURE_ALLOCATION; Copy copy = {payload + shape->prefix}; for (uint32_t f = 0; f < shape->field_count; ++f) { const PureField *field = &m->field[shape->field_start + f]; if (field->type == PURE_FIELD_U32) write32(payload + field->offset, (uint32_t)fields[f].num); else if (field->type == PURE_FIELD_NUMBER) { uint64_t bits; memcpy(&bits, &fields[f].num, 8); write32(payload + field->offset, (uint32_t)bits); write32(payload + field->offset + 4, (uint32_t)(bits >> 32)); } else { if (field->offset != PURE_FIELD_REST) write32(payload + field->offset, (uint32_t)fields[f].bytes.length); PureResult result = visit_value(app, arena, fields[f].bytes, copy_out, ©); if (result != PURE_OK) { free(payload); return result; } } } /* The outbox's next item: a change of the list, undone with the event. */ const char *name = m->input_names[output]; PureCell item[3] = {{.text = (unsigned char *)name, .size = strlen(name)}, {.num = (double)(app->last_sent[output] + 1)}, {.text = payload, .size = size}}; PureResult result = pure_list_insert(app->outbox, pure_list_count(app->outbox), item, &app->undo); free(payload); if (result != PURE_OK) return result; ++app->last_sent[output]; app->links_changed = true; return PURE_OK; } /* The undo log a list's changes go to: none for a list of a message's rows, * which is emptied when the event ends whatever it did. */ static PureUndo *undo_for(PureApp *app, uint32_t list) { return app->module->state_flags[list] & PURE_LIST_ROWS >> 8 && app->module->state_type[list] == PURE_STATE_LIST ? NULL : &app->undo; } static PureResult run(const PureModule *m, double *values, PureBlock block, Event *ev, Slot *result); /* ---- Folds and filters a leaf at a time ------------------------------ * A block whose instructions all have lane forms (has_lanes) runs for a run * of its list's items at once: each value is one per item (a lane), the * items' own positions, or one for all. An item for which run would fault * makes the whole run go again item by item through run, so a fold faults, * and a filter leaves an item out, exactly as they would have; the lanes * only see what run would compute. */ typedef struct { const double *lane; /* a value per item, or NULL */ double value; /* without lanes: the value for all */ bool rows; /* without lanes: the items' own positions */ uint16_t owner; /* an index's list */ } Lanes; static bool uniform(const Lanes *v) { return !v->lane && !v->rows; } /* A lookup by a value for all items reads no item of the run: every run of * a fold (or a filter) finds the same, so it is made once, by instruction. */ enum { MEMO = 64 }; typedef struct { double value[MEMO]; uint64_t known; } Memo; static bool recalled(const Memo *memo, uint32_t slot, double *value) { if (slot >= MEMO || !(memo->known >> slot & 1)) return false; *value = memo->value[slot]; return true; } static void remember(Memo *memo, uint32_t slot, double value) { if (slot >= MEMO) return; memo->value[slot] = value; memo->known |= (uint64_t)1 << slot; } /* A value per item, in scratch when it is not one already. */ static const double *lanes_of(const Lanes *v, double *scratch, const PureRun *items) { if (v->lane) return v->lane; for (unsigned i = 0; i < items->count; ++i) scratch[i] = v->rows ? (double)(items->start + i) : v->value; return scratch; } /* a op b as run computes it; false where run faults. */ static bool number_op(uint8_t op, double a, double b, double *out) { double value; switch (op) { case PURE_OP_ADD: value = a + b; break; case PURE_OP_SUB: value = a - b; break; case PURE_OP_MUL: value = a * b; break; case PURE_OP_DIV: if (b == 0) return false; value = a / b; break; case PURE_OP_LT: value = a < b; break; case PURE_OP_LE: value = a <= b; break; case PURE_OP_GT: value = a > b; break; case PURE_OP_GE: value = a >= b; break; case PURE_OP_EQ: value = a == b; break; case PURE_OP_NE: value = a != b; break; case PURE_OP_AND: value = a != 0 && b != 0; break; case PURE_OP_OR: value = a != 0 || b != 0; break; case PURE_OP_MIN: value = minimum(a, b); break; case PURE_OP_MOD: if (b == 0) return false; value = fmod(a, b); if (value != 0 && (value < 0) != (b < 0)) value += b; else if (value == 0) value = copysign(0.0, b); break; default: value = maximum(a, b); break; } *out = value; return isfinite(value); } /* a op b for every item into out: a loop per operation, reading a value for * all with stride 0. false where run faults for some item. */ static bool lanes_op(uint8_t op, const double *a, size_t sa, const double *b, size_t sb, double *out, unsigned n) { bool bad = false; #define EACH(expr) for (unsigned i = 0; i < n; ++i) { double x = a[i * sa], y = b[i * sb]; out[i] = (expr); } switch (op) { case PURE_OP_ADD: EACH(x + y) break; case PURE_OP_SUB: EACH(x - y) break; case PURE_OP_MUL: EACH(x * y) break; case PURE_OP_LT: EACH(x < y) return true; case PURE_OP_LE: EACH(x <= y) return true; case PURE_OP_GT: EACH(x > y) return true; case PURE_OP_GE: EACH(x >= y) return true; case PURE_OP_EQ: EACH(x == y) return true; case PURE_OP_NE: EACH(x != y) return true; case PURE_OP_AND: EACH(x != 0 && y != 0) return true; case PURE_OP_OR: EACH(x != 0 || y != 0) return true; case PURE_OP_MIN: EACH(minimum(x, y)) return true; case PURE_OP_MAX: EACH(maximum(x, y)) return true; default: for (unsigned i = 0; i < n; ++i) bad |= !number_op(op, a[i * sa], b[i * sb], &out[i]); return !bad; } #undef EACH for (unsigned i = 0; i < n; ++i) bad |= !isfinite(out[i]); return !bad; } /* The block for the items of a run at once, as a column of their list: * result holds what it leaves (lanes may point into store, a row of lanes * per stack depth, or into the list's leaf). false when run would fault for * some item. */ static bool run_lanes(const PureModule *m, const double *values, PureBlock block, const Event *ev, const PureRun *items, Lanes *result, double (*store)[PURE_LIST_RUN], Memo *memo, const PureShape *shape) { PureApp *app = ev->app; Lanes stack[PURE_MODULE_STACK]; double scratch[2][PURE_LIST_RUN]; size_t sp = 0; unsigned n = items->count; for (uint32_t pc = block.start, end = block.start + block.length; pc < end; ++pc) { const PureOp *op = &m->code[pc]; uint32_t arg = op->arg; Lanes *top = sp ? &stack[sp - 1] : stack; double *out = store[sp ? sp - 1 : 0]; /* where the top's new lanes go */ /* A group's pass: every group at once, so its key is not needed and its test holds. */ if (shape && pc == shape->key.start) { stack[sp++] = (Lanes){NULL, 0, false, 0}; pc = shape->key.start + shape->key.length - 1; continue; } if (shape && pc == shape->test) { stack[--sp - 1] = (Lanes){NULL, 1, false, 0}; continue; } switch (op->op) { case PURE_OP_CONST: stack[sp++] = (Lanes){NULL, op->value, false, 0}; continue; case PURE_OP_LOAD: stack[sp++] = (Lanes){NULL, values[arg], false, 0}; continue; case PURE_OP_FIELD: { const PureField *field = &m->field[ev->shape->field_start + arg]; const unsigned char *given = ev->arguments ? app->arguments.data : app->payload.data; double value = field->type == PURE_FIELD_U32 ? read32(given + field->offset) : read_double(given + field->offset); stack[sp++] = (Lanes){NULL, value, false, 0}; continue; } case PURE_OP_INDEX_LOAD: stack[sp++] = (Lanes){NULL, values[arg], false, m->state_ref[arg]}; continue; case PURE_OP_ROW: stack[sp++] = (Lanes){NULL, 0, true, (uint16_t)arg}; continue; case PURE_OP_LOCAL_LOAD: stack[sp++] = (Lanes){NULL, ev->locals[arg & 0xFF], false, (uint16_t)(arg >> 16)}; continue; case PURE_OP_OUTER_ROW: stack[sp++] = (Lanes){NULL, (double)ev->outer, false, (uint16_t)arg}; continue; case PURE_OP_LIST_COUNT: stack[sp++] = (Lanes){NULL, (double)pure_list_count(app->lists[arg]), false, 0}; continue; case PURE_OP_INDEX_FIRST: case PURE_OP_INDEX_LAST: { size_t last = op->op == PURE_OP_INDEX_LAST ? pure_list_count(app->lists[arg]) : 0; stack[sp++] = (Lanes){NULL, last ? (double)(last - 1) : 0, false, (uint16_t)arg}; continue; } case PURE_OP_INDEX_NUM: continue; case PURE_OP_PICK: stack[sp] = stack[sp - 1 - arg]; ++sp; continue; case PURE_OP_SLIDE: { /* The top moves down: lanes kept in a depth it leaves come along. */ Lanes moved = stack[sp - 1]; size_t to = sp - 1 - arg; if ((uintptr_t)moved.lane >= (uintptr_t)store[to + 1] && (uintptr_t)moved.lane < (uintptr_t)store[sp]) { memcpy(store[to], moved.lane, n * sizeof(double)); moved.lane = store[to]; } stack[to] = moved; sp = to + 1; continue; } case PURE_OP_ITEM_GET: { uint32_t list = list_of(arg), field = item_field(arg); const PureList *from = app->lists[list]; size_t count = pure_list_count(from); if (top->rows) { /* the items themselves: the leaf's column */ *top = (Lanes){items->column[field].numbers, 0, false, 0}; continue; } if (!top->lane) { top->owner = 0; if (recalled(memo, pc - block.start, &top->value)) continue; if (top->value >= (double)count) return false; top->value = pure_list_get(from, (size_t)top->value, field).num; remember(memo, pc - block.start, top->value); continue; } for (unsigned i = 0; i < n; ++i) { if (top->lane[i] >= (double)count) return false; out[i] = pure_list_get(from, (size_t)top->lane[i], field).num; } *top = (Lanes){out, 0, false, 0}; continue; } case PURE_OP_LIST_FIND: case PURE_OP_LIST_HAS: { const PureList *keyed = app->lists[arg]; unsigned key = m->state_key[arg] - 1u; bool find = op->op == PURE_OP_LIST_FIND, found; if (uniform(top)) { double value; if (!recalled(memo, pc - block.start, &value)) { size_t at = pure_list_seek(keyed, key, (PureCell){top->value, NULL, 0}, &found); if (find && !found) return false; remember(memo, pc - block.start, value = find ? (double)at : found); } *top = (Lanes){NULL, value, false, find ? (uint16_t)arg : 0}; continue; } const double *keys = lanes_of(top, scratch[0], items); for (unsigned i = 0; i < n; ++i) { size_t at = pure_list_seek(keyed, key, (PureCell){keys[i], NULL, 0}, &found); if (find && !found) return false; out[i] = find ? (double)at : found; } *top = (Lanes){out, 0, false, find ? (uint16_t)arg : 0}; continue; } case PURE_OP_INDEX_MOVE: { Lanes by = stack[--sp]; top = &stack[sp - 1]; out = store[sp - 1]; size_t count = pure_list_count(app->lists[top->owner]); double last = count ? (double)(count - 1) : 0; if (uniform(top) && uniform(&by)) { if (by.value != floor(by.value)) return false; top->value = maximum(0, minimum(top->value + by.value, last)); continue; } const double *at = lanes_of(top, scratch[0], items), *step = lanes_of(&by, scratch[1], items); for (unsigned i = 0; i < n; ++i) { if (step[i] != floor(step[i])) return false; out[i] = maximum(0, minimum(at[i] + step[i], last)); } *top = (Lanes){out, 0, false, top->owner}; continue; } case PURE_OP_NEG: case PURE_OP_NOT: case PURE_OP_FLOOR: { if (uniform(top)) { top->value = op->op == PURE_OP_NEG ? -top->value : op->op == PURE_OP_NOT ? top->value == 0 : floor(top->value); top->owner = 0; continue; } const double *a = lanes_of(top, scratch[0], items); if (op->op == PURE_OP_NEG) for (unsigned i = 0; i < n; ++i) out[i] = -a[i]; else if (op->op == PURE_OP_NOT) for (unsigned i = 0; i < n; ++i) out[i] = a[i] == 0; else for (unsigned i = 0; i < n; ++i) out[i] = floor(a[i]); *top = (Lanes){out, 0, false, 0}; continue; } case PURE_OP_CLAMP: { Lanes high = stack[--sp], low = stack[--sp]; top = &stack[sp - 1]; out = store[sp - 1]; if (uniform(top) && uniform(&low) && uniform(&high)) { if (low.value > high.value) return false; top->value = maximum(low.value, minimum(top->value, high.value)); continue; } double spare[PURE_LIST_RUN]; const double *x = lanes_of(top, scratch[0], items), *lo = lanes_of(&low, scratch[1], items), *hi = lanes_of(&high, spare, items); for (unsigned i = 0; i < n; ++i) { if (lo[i] > hi[i]) return false; out[i] = maximum(lo[i], minimum(x[i], hi[i])); } *top = (Lanes){out, 0, false, 0}; continue; } default: { /* two numbers */ Lanes b = stack[--sp]; top = &stack[sp - 1]; out = store[sp - 1]; if (uniform(top) && uniform(&b)) { if (!number_op(op->op, top->value, b.value, &top->value)) return false; top->owner = 0; continue; } const double *x = top->rows ? lanes_of(top, scratch[0], items) : top->lane ? top->lane : &top->value; const double *y = b.rows ? lanes_of(&b, scratch[1], items) : b.lane ? b.lane : &b.value; if (!lanes_op(op->op, x, uniform(top) ? 0 : 1, y, uniform(&b) ? 0 : 1, out, n)) return false; *top = (Lanes){out, 0, false, 0}; continue; } } } memcpy(result, stack, sp * sizeof(*stack)); return true; } /* The values a distinct fold has seen: open addressing over their bits (-0 * as 0), UINT64_MAX free (no finite number's bits). */ typedef struct { uint64_t *keys; size_t capacity, count; } Seen; /* A fold's running value: what count, sum, max, min, first or distinct has so far. */ typedef struct { unsigned how; double total; bool any, done; Seen seen; } Fold; static size_t seen_slot(uint64_t bits, size_t capacity) { bits ^= bits >> 33, bits *= 0xff51afd7ed558ccdu, bits ^= bits >> 33; return (size_t)bits & (capacity - 1); } /* Whether value is new to the set (added); false without memory too (*full). */ static bool seen_new(Seen *seen, double value, bool *full) { uint64_t bits; value = value == 0 ? 0 : value; memcpy(&bits, &value, sizeof(bits)); if (2 * (seen->count + 1) > seen->capacity) { /* half the slots free */ size_t capacity = seen->capacity ? 2 * seen->capacity : 64; uint64_t *keys = malloc(capacity * sizeof(*keys)); if (!keys) { *full = true; return false; } memset(keys, 0xFF, capacity * sizeof(*keys)); for (size_t i = 0; i < seen->capacity; ++i) { if (seen->keys[i] == UINT64_MAX) continue; size_t at = seen_slot(seen->keys[i], capacity); while (keys[at] != UINT64_MAX) at = (at + 1) & (capacity - 1); keys[at] = seen->keys[i]; } free(seen->keys); seen->keys = keys; seen->capacity = capacity; } size_t at = seen_slot(bits, seen->capacity); for (; seen->keys[at] != UINT64_MAX; at = (at + 1) & (seen->capacity - 1)) if (seen->keys[at] == bits) return false; seen->keys[at] = bits; ++seen->count; return true; } /* One item: its value, and whether it counts (for count and first, the * value is). false without memory (a distinct fold's set). */ static bool fold_in(Fold *fold, size_t row, double value, double counts) { if (counts == 0) return true; unsigned how = fold->how; if (how == PURE_FOLD_FIRST) { fold->total = (double)row; fold->any = fold->done = true; return true; } if (how == PURE_FOLD_DISTINCT) { bool full = false; fold->total += seen_new(&fold->seen, value, &full); fold->any = true; return !full; } fold->total = how == PURE_FOLD_COUNT ? fold->total + 1 : how == PURE_FOLD_SUM ? fold->total + value : !fold->any ? value : how == PURE_FOLD_MAX ? maximum(fold->total, value) : minimum(fold->total, value); fold->any = true; return true; } /* The fold's block for its items from first to last, one at a time. */ static PureResult fold_rows(const PureModule *m, double *values, PureBlock inner, Event *per, size_t first, size_t last, Fold *fold) { bool one = fold->how == PURE_FOLD_COUNT || fold->how == PURE_FOLD_FIRST; for (size_t row = first; row < last && !fold->done; ++row) { Slot out[2]; size_t mark = per->arena->used; per->row = row; PureResult status = run(m, values, inner, per, out); per->arena->used = mark; if (status != PURE_OK) return status; if (!fold_in(fold, row, out[0].num, one ? out[0].num : out[1].num)) return PURE_ALLOCATION; } return PURE_OK; } /* The fold's block a leaf of its list at a time; a run where an item would * fault goes item by item. The items join the fold in order, so a sum adds * as it would one at a time. */ static PureResult fold_runs(const PureModule *m, double *values, PureBlock inner, const PureList *list, Event *per, Fold *fold, size_t from, size_t to) { double store[PURE_MODULE_STACK][PURE_LIST_RUN], scratch[2][PURE_LIST_RUN]; bool one = fold->how == PURE_FOLD_COUNT || fold->how == PURE_FOLD_FIRST; PureRun items; Memo memo; memo.known = 0; /* The items from and up to before to (a slice's, or a range's): a leaf * at a time, its lanes out of them left out (a slice's may fault: the * leaf then runs item by item, its items in them alone). */ for (bool more = from < to && pure_list_run(list, from, &items); more && !fold->done && items.start < to; more = pure_list_next(list, &items)) { unsigned first = from > items.start ? (unsigned)(from - items.start) : 0, last = to - items.start < items.count ? (unsigned)(to - items.start) : items.count; Lanes out[2]; if (!run_lanes(m, values, inner, per, &items, out, store, &memo, NULL)) { PureResult status = fold_rows(m, values, inner, per, items.start + first, items.start + last, fold); if (status != PURE_OK) return status; continue; } const Lanes *counts = &out[one ? 0 : 1]; if (uniform(counts) && counts->value == 0) continue; const double *c = lanes_of(counts, scratch[0], &items), *v = lanes_of(&out[0], scratch[1], &items); if (fold->how == PURE_FOLD_COUNT) { size_t counted = 0; for (unsigned i = first; i < last; ++i) counted += c[i] != 0; fold->total += (double)counted; fold->any = fold->any || counted; } else if (fold->how == PURE_FOLD_SUM) { double total = fold->total; bool any = fold->any; for (unsigned i = first; i < last; ++i) if (c[i] != 0) total += v[i], any = true; fold->total = total; fold->any = any; } else for (unsigned i = first; i < last && !fold->done; ++i) if (!fold_in(fold, items.start + i, v[i], c[i])) return PURE_ALLOCATION; } return PURE_OK; } /* The positions of the items whose keys are from low up to before high. */ static void slice_of(const PureList *list, unsigned key, double low, double high, size_t *from, size_t *to) { bool found; *from = pure_list_seek(list, key, (PureCell){low, NULL, 0}, &found); *to = pure_list_seek(list, key, (PureCell){high, NULL, 0}, &found); if (*to < *from) *to = *from; } /* The positions of the items whose keys a range allows: its bounds run * alone, then found by key. false when a bound faults: the test then runs * for every item, as written (and faults as it would). */ static bool range_bounds(const PureModule *m, double *values, const PureRange *range, const PureList *list, unsigned key, Event *ev, size_t *from, size_t *to) { PureApp *app = ev->app; PureFault fault = app->fault; uint32_t fault_pc = app->fault_pc; bool ok = true; *from = 0; *to = pure_list_count(list); for (unsigned side = 0; side < 2 && ok; ++side) { uint8_t relation = side ? range->upper_relation : range->lower_relation; if (!relation) continue; Slot bound; size_t mark = ev->arena->used; ok = run(m, values, side ? range->upper : range->lower, ev, &bound) == PURE_OK; ev->arena->used = mark; if (!ok) break; bool found; size_t at = pure_list_seek(list, key, (PureCell){bound.num, NULL, 0}, &found); at += (relation == PURE_OP_GT || relation == PURE_OP_LE) && found; /* past the key itself */ if (side) *to = at < *to ? at : *to; else *from = at; } app->fault = fault, app->fault_pc = fault_pc; if (*from > *to) *from = *to; return ok; } /* ---- Passes: a shaped fold in a column answered for every row -------- * A fold in a column runs once per row, over its whole list each time. A * shaped one (PureShape) is answered from one pass over the list instead, * kept by the app for the list's version: a group pass folds the items of * every group at once (the fold's test with its comparison taken as true, * the item's field naming its group), a rank pass orders the field's values. * A row then runs the key alone and looks it up. The pass is made at the * second row that asks for the same list, so a fold asked once scans once. * * It answers exactly as the fold would: items join a group in order (a sum * adds as it would), a key that faults leaves the row to run the fold as * written (which faults, or not over no item, as it would), and an item * that would fault in the pass leaves every row to run it as written. */ typedef struct { double key; Fold fold; bool used; } Group; struct PurePass { const PureModule *module; uint32_t pc; /* the fold's */ uint64_t list, version; /* its list as it was */ unsigned asked; /* rows that asked before it was made */ bool made, failed; Group *groups; /* a group pass: open addressing by key */ size_t capacity, count; uint64_t *ordered; /* a rank pass: the field's values in order (order_bits) */ size_t items; }; enum { PASSES = 16 }; static void free_pass(struct PurePass *pass) { free(pass->groups); free(pass->ordered); } unsigned pure_app_passes(const PureApp *app) { unsigned made = 0; for (unsigned i = 0; i < app->pass_count; ++i) made += app->passes[i].made; return made; } static void drop_passes(PureApp *app) { for (unsigned i = 0; i < app->pass_count; ++i) free_pass(&app->passes[i]); free(app->passes); app->passes = NULL; app->pass_count = 0; } /* The app's pass for a fold over a list as it is: one kept, or a new one in * place of this fold's older ones (or of the oldest). NULL without room. */ static struct PurePass *pass_for(PureApp *app, const PureModule *m, uint32_t pc, const PureList *list) { uint64_t id, version; pure_list_stamp(list, &id, &version); unsigned kept = 0; struct PurePass *found = NULL; for (unsigned i = 0; i < app->pass_count; ++i) { struct PurePass *pass = &app->passes[i]; if (pass->module == m && pass->pc == pc && pass->list == id && pass->version == version) found = pass; else if (pass->module == m && pass->pc == pc) free_pass(pass); /* the list has moved on */ else app->passes[kept++] = *pass; if (found == pass) app->passes[kept++] = *pass, found = &app->passes[kept - 1]; } app->pass_count = kept; if (found) return found; if (!app->passes && !(app->passes = calloc(PASSES, sizeof(*app->passes)))) return NULL; if (app->pass_count == PASSES) { free_pass(&app->passes[0]); memmove(app->passes, app->passes + 1, (PASSES - 1) * sizeof(*app->passes)); --app->pass_count; } struct PurePass *pass = &app->passes[app->pass_count++]; *pass = (struct PurePass){.module = m, .pc = pc, .list = id, .version = version}; return pass; } /* A key's bits as they order: -0 as 0, negative numbers below positive ones. */ static uint64_t order_bits(double value) { uint64_t bits; value = value == 0 ? 0 : value; memcpy(&bits, &value, sizeof(bits)); return bits >> 63 ? ~bits : bits | (uint64_t)1 << 63; } static size_t group_slot(uint64_t bits, size_t capacity) { bits ^= bits >> 33, bits *= 0xff51afd7ed558ccdu, bits ^= bits >> 33; /* a finalizer's mixing */ return (size_t)bits & (capacity - 1); } /* key's group, added when absent (with add); NULL when absent, or without room. */ static Group *group_of(struct PurePass *pass, double key, unsigned how, bool add) { key = key == 0 ? 0 : key; if (pass->capacity) { for (size_t at = group_slot(order_bits(key), pass->capacity);; at = (at + 1) & (pass->capacity - 1)) { if (!pass->groups[at].used) break; if (pass->groups[at].key == key) return &pass->groups[at]; } } if (!add) return NULL; if (2 * (pass->count + 1) > pass->capacity) { /* grown to keep half the slots free */ size_t capacity = pass->capacity ? 2 * pass->capacity : 64; Group *groups = calloc(capacity, sizeof(*groups)); if (!groups) return NULL; for (size_t i = 0; i < pass->capacity; ++i) { if (!pass->groups[i].used) continue; size_t at = group_slot(order_bits(pass->groups[i].key), capacity); while (groups[at].used) at = (at + 1) & (capacity - 1); groups[at] = pass->groups[i]; } free(pass->groups); pass->groups = groups; pass->capacity = capacity; } size_t at = group_slot(order_bits(key), pass->capacity); while (pass->groups[at].used) at = (at + 1) & (pass->capacity - 1); pass->groups[at] = (Group){key, {how, 0, false, false, {0}}, true}; ++pass->count; return &pass->groups[at]; } /* Every group's fold in one pass over the list, a leaf at a time. */ static bool group_pass(const PureModule *m, double *values, PureBlock inner, const PureShape *shape, unsigned how, const PureList *list, Event *per, struct PurePass *pass) { double store[PURE_MODULE_STACK][PURE_LIST_RUN], scratch[2][PURE_LIST_RUN]; bool one = how == PURE_FOLD_COUNT || how == PURE_FOLD_FIRST; PureRun items; Memo memo; memo.known = 0; for (bool more = pure_list_run(list, 0, &items); more; more = pure_list_next(list, &items)) { Lanes out[2]; if (!run_lanes(m, values, inner, per, &items, out, store, &memo, shape)) return false; const Lanes *counts = &out[one ? 0 : 1]; if (uniform(counts) && counts->value == 0) continue; const double *c = lanes_of(counts, scratch[0], &items), *v = lanes_of(&out[0], scratch[1], &items); const double *keys = items.column[shape->field].numbers; for (unsigned i = 0; i < items.count; ++i) { if (c[i] == 0) continue; Group *group = group_of(pass, keys[i], how, true); if (!group) return false; if (!group->fold.done && !fold_in(&group->fold, items.start + i, v[i], c[i])) return false; } } return true; } /* The field's values in order: a radix sort of their order_bits. */ static bool rank_pass(const PureShape *shape, const PureList *list, struct PurePass *pass) { size_t count = pure_list_count(list), at = 0; uint64_t *keys = malloc((count ? count : 1) * sizeof(*keys)), *spare = malloc((count ? count : 1) * sizeof(*spare)); if (!keys || !spare) { free(keys); free(spare); return false; } PureRun items; for (bool more = pure_list_run(list, 0, &items); more; more = pure_list_next(list, &items)) for (unsigned i = 0; i < items.count; ++i) keys[at++] = order_bits(items.column[shape->field].numbers[i]); for (unsigned shift = 0; shift < 64; shift += 8) { size_t start[257] = {0}; for (size_t i = 0; i < count; ++i) ++start[(keys[i] >> shift & 0xFF) + 1]; if (start[(keys[0] >> shift & 0xFF) + 1] == count) continue; /* one digit for all: in order already */ for (unsigned d = 0; d < 256; ++d) start[d + 1] += start[d]; for (size_t i = 0; i < count; ++i) spare[start[keys[i] >> shift & 0xFF]++] = keys[i]; uint64_t *swap = keys; keys = spare, spare = swap; } free(spare); pass->ordered = keys; pass->items = count; return true; } /* How many of the ordered values relate to key: the first not below key * (or above it), counted from the start or the end. */ static size_t ranked(const struct PurePass *pass, uint8_t relation, double key) { uint64_t bits = order_bits(key); bool above = relation == PURE_OP_GT || relation == PURE_OP_LE; /* the bound past key's equals */ size_t low = 0, high = pass->items; while (low < high) { size_t middle = low + (high - low) / 2; if (above ? pass->ordered[middle] <= bits : pass->ordered[middle] < bits) low = middle + 1; else high = middle; } return relation == PURE_OP_GT || relation == PURE_OP_GE ? pass->items - low : low; } /* A shaped fold from its list's pass: false leaves it to run as written. */ static bool fold_shaped(const PureModule *m, double *values, const PureOp *op, const PureList *list, Event *per, Fold *fold) { PureApp *app = per->app; const PureShape *shape = &m->shape[op->shape - 1]; struct PurePass *pass = pass_for(app, m, (uint32_t)(op - m->code), list); if (!pass || pass->failed || (!pass->made && ++pass->asked < 2)) return false; Slot key; PureFault fault = app->fault; uint32_t fault_pc = app->fault_pc; size_t mark = per->arena->used; PureResult status = run(m, values, shape->key, per, &key); per->arena->used = mark; app->fault = fault, app->fault_pc = fault_pc; if (status != PURE_OK) return false; if (!pass->made) { PureBlock inner = {(uint32_t)(op - m->code) + 1, op->arg >> 16}; pass->made = shape->form == PURE_SHAPE_GROUP ? group_pass(m, values, inner, shape, fold->how, list, per, pass) : rank_pass(shape, list, pass); if (!pass->made) { free_pass(pass); pass->groups = NULL, pass->ordered = NULL; pass->failed = true; return false; } } if (shape->form == PURE_SHAPE_RANK) { size_t count = ranked(pass, shape->relation, key.num); fold->total = (double)count; fold->any = count > 0; return true; } const Group *group = group_of(pass, key.num, fold->how, false); if (group) *fold = group->fold; return true; } static PureResult run(const PureModule *m, double *values, PureBlock block, Event *ev, Slot *result) { Slot stack[PURE_MODULE_STACK]; size_t sp = 0; PureApp *app = ev->app; PureArena *arena = ev->arena; PureResult status; PureFault kind; const PureOp *op = NULL; for (uint32_t pc = block.start, end = block.start + block.length; pc < end;) { op = &m->code[pc++]; uint32_t arg = op->arg; Slot *top = sp ? &stack[sp - 1] : stack; switch (op->op) { case PURE_OP_CONST: stack[sp++].num = op->value; continue; case PURE_OP_LOAD: stack[sp++].num = values[arg]; continue; case PURE_OP_DT: stack[sp++].num = ev->dt; continue; case PURE_OP_NOW: stack[sp++].num = app->now; continue; case PURE_OP_FLOOR: top->num = floor(top->num); continue; case PURE_OP_STORE: case PURE_OP_CUR_STORE: values[arg] = stack[--sp].num; continue; case PURE_OP_JZ: if (stack[--sp].num == 0) pc = arg; continue; case PURE_OP_JMP: pc = arg; continue; case PURE_OP_NEG: top->num = -top->num; continue; case PURE_OP_NOT: top->num = top->num == 0; continue; case PURE_OP_CLAMP: { double high = stack[--sp].num, low = stack[--sp].num; if (low > high) { kind = PURE_FAULT_CLAMP; goto failed; } stack[sp - 1].num = maximum(low, minimum(stack[sp - 1].num, high)); continue; } case PURE_OP_FIELD: { const PureField *field = &m->field[ev->shape->field_start + arg]; const unsigned char *given = ev->arguments ? app->arguments.data : app->payload.data; if (field->type == PURE_FIELD_U32) stack[sp++].num = read32(given + field->offset); else if (field->type == PURE_FIELD_NUMBER) stack[sp++].num = read_double(given + field->offset); else stack[sp++].bytes = (PureBytes){ev->arguments ? FROM_ARGUMENTS : FROM_PAYLOAD, 0, {0, 0}, ev->spans[arg][0], ev->spans[arg][1]}; continue; } case PURE_OP_DOC: case PURE_OP_DOC_SIZE: { if (op->op == PURE_OP_DOC && !ev->exists) { kind = PURE_FAULT_NOT_FOUND; goto failed; } PureVersion version = app->data.version(app->data.context, app->document); if (op->op == PURE_OP_DOC) stack[sp++].bytes = (PureBytes){FROM_DOCUMENT, 0, version, 0, version.bytes}; else stack[sp++].num = (double)version.bytes; continue; } case PURE_OP_LEN: case PURE_OP_TEXT_BYTES: top->num = (double)top->bytes.length; continue; case PURE_OP_REPLACE: { PureBytes insert = stack[--sp].bytes; double last = stack[--sp].num, first = stack[--sp].num; double size = (double)app->data.version(app->data.context, app->document).bytes; if (first != floor(first) || last != floor(last) || first < 0 || last < first || last > size) { kind = PURE_FAULT_LIMIT; goto failed; } PureSpan span; size_t mark = arena->used; if ((status = contiguous(app, arena, insert, &span)) == PURE_OK) status = app->data.splice(app->data.context, app->document, (size_t)first, (size_t)(last - first), span); arena->used = mark; if (status != PURE_OK) goto refused; ev->modified = ev->exists = true; continue; } /* A reply outlives the arena mark of later statements: keep it by value. */ case PURE_OP_REPLY: app->reply = stack[--sp].bytes; app->has_reply = true; continue; case PURE_OP_REQUIRE: if (stack[--sp].num == 0) { kind = PURE_FAULT_LIMIT; goto failed; } continue; case PURE_OP_TEXT_CONST: stack[sp++].bytes = (PureBytes){FROM_CONSTANT, 0, {0, 0}, m->constant_offset[arg], m->constant_length[arg]}; continue; case PURE_OP_TEXT_LOAD: stack[sp++].bytes = text_of(app, arg); continue; case PURE_OP_TEXT_INPUT: stack[sp++].bytes = (PureBytes){FROM_PAYLOAD, 0, {0, 0}, 0, app->payload.size}; continue; case PURE_OP_NUM_TEXT: { char digits[32]; if ((status = keep_bytes(arena, digits, pure_format_number(top->num, digits), &top->bytes)) != PURE_OK) return status; continue; } case PURE_OP_CONCAT: { PureBytes right = stack[--sp].bytes, left = stack[sp - 1].bytes; size_t start = arena->used; if ((status = append_value(app, arena, left)) != PURE_OK || (status = append_value(app, arena, right)) != PURE_OK) return status; stack[sp - 1].bytes = (PureBytes){FROM_ARENA, 0, {0, 0}, start, left.length + right.length}; continue; } case PURE_OP_CHARS: case PURE_OP_LINES: case PURE_OP_TEXT_FROM: { Measure count = {0, op->op == PURE_OP_LINES ? 1 : op->op == PURE_OP_TEXT_FROM ? 2 : 0, 0, true}; if ((status = visit_value(app, arena, top->bytes, measure, &count)) != PURE_OK) return status; if (op->op != PURE_OP_TEXT_FROM) top->num = (double)(count.count + (op->op == PURE_OP_LINES)); else if (!count.valid || !pure_utf8_complete(count.utf8)) { kind = PURE_FAULT_ENCODING; goto failed; } continue; } /* Positions: a cursor or an index, with the text or list it is in. */ case PURE_OP_CUR_LOAD: case PURE_OP_INDEX_LOAD: stack[sp].num = values[arg]; stack[sp++].bytes.owner = m->state_ref[arg]; continue; case PURE_OP_CUR_START: case PURE_OP_CUR_END: case PURE_OP_INDEX_FIRST: case PURE_OP_INDEX_LAST: case PURE_OP_ROW: { size_t last = op->op == PURE_OP_CUR_END ? pure_draft_size(app->texts[arg]) : op->op == PURE_OP_INDEX_LAST ? pure_list_count(app->lists[arg]) : 0; stack[sp].num = op->op == PURE_OP_ROW ? (double)ev->row : op->op == PURE_OP_INDEX_LAST && last ? (double)(last - 1) : (double)last; stack[sp++].bytes.owner = (uint16_t)arg; continue; } case PURE_OP_OUTER_ROW: stack[sp].num = (double)ev->outer; stack[sp++].bytes.owner = (uint16_t)arg; continue; case PURE_OP_LOCAL_LOAD: stack[sp].num = ev->locals[arg & 0xFF]; stack[sp++].bytes.owner = (uint16_t)(arg >> 16); /* an index's list */ continue; case PURE_OP_LOCAL_STORE: ev->locals[arg & 0xFF] = stack[--sp].num; continue; case PURE_OP_CUR_MOVE: case PURE_OP_INDEX_MOVE: { double count = stack[--sp].num; Slot *at = &stack[sp - 1]; if (count != floor(count)) { kind = PURE_FAULT_LIMIT; goto failed; } if (op->op == PURE_OP_INDEX_MOVE) { size_t items = pure_list_count(app->lists[at->bytes.owner]); at->num = maximum(0, minimum(at->num + count, items ? (double)(items - 1) : 0)); continue; } PureDraft *text = app->texts[at->bytes.owner]; PureVersion version = pure_draft_version(text); at->num = (double)(arg == PURE_UNIT_CHAR ? pure_text_step(text, version, (size_t)at->num, count) : pure_text_line_step(text, version, (size_t)at->num, count)); continue; } case PURE_OP_CUR_COUNT: { PureDraft *text = app->texts[top->bytes.owner]; top->num = (double)pure_text_count(text, pure_draft_version(text), (size_t)top->num, arg); continue; } case PURE_OP_TEXT_INSERT: case PURE_OP_TEXT_SET: { PureBytes insert = stack[--sp].bytes; size_t at = op->op == PURE_OP_TEXT_INSERT ? (size_t)stack[--sp].num : 0; size_t removed = op->op == PURE_OP_TEXT_SET ? pure_draft_size(app->texts[arg]) : 0; PureSpan span; size_t mark = arena->used; if ((status = contiguous(app, arena, insert, &span)) == PURE_OK) status = pure_draft_splice(app->texts[arg], at, removed, span); arena->used = mark; if (status != PURE_OK) goto refused; if (op->op == PURE_OP_TEXT_SET) { for (uint32_t c = 0; c < m->states; ++c) if (m->state_type[c] == PURE_STATE_CURSOR && m->state_ref[c] == arg) values[c] = 0; } else move_cursors(m, values, arg, at, 0, span.size); continue; } case PURE_OP_TEXT_REMOVE: { double y = stack[--sp].num, x = stack[--sp].num; size_t first = (size_t)minimum(x, y), last = (size_t)maximum(x, y); if ((status = pure_draft_splice(app->texts[arg], first, last - first, (PureSpan){0})) != PURE_OK) goto refused; if (last > first) move_cursors(m, values, arg, first, last - first, 0); continue; } case PURE_OP_TEXT_LINE: { PureDraft *text = app->texts[arg]; PureVersion version = pure_draft_version(text); size_t first = pure_text_line_start(text, version, (size_t)top->num); size_t last = pure_text_line_end(text, version, (size_t)top->num); top->bytes = (PureBytes){FROM_TEXT, (uint16_t)arg, version, first, last - first}; continue; } case PURE_OP_BYTES_FROM: case PURE_OP_INDEX_NUM: continue; /* the same bytes or position, retyped */ case PURE_OP_LIST_COUNT: stack[sp++].num = (double)pure_list_count(app->lists[arg]); continue; case PURE_OP_SEND: { const PureInputShape *output = &m->input[arg]; size_t base = sp - output->field_count, size = output->prefix; sp = base; for (uint32_t f = 0; f < output->field_count; ++f) { uint8_t type = m->field[output->field_start + f].type; double number = stack[base + f].num; if (type == PURE_FIELD_BYTES || type == PURE_FIELD_TEXT) size += (size_t)stack[base + f].bytes.length; else if (type == PURE_FIELD_U32 && !(number >= 0 && number <= UINT32_MAX && number == floor(number))) { kind = PURE_FAULT_LIMIT; goto failed; } } if (size > UINT32_MAX) { kind = PURE_FAULT_LIMIT; goto failed; } if ((status = send(app, arg, stack + base, arena, size)) != PURE_OK) return status; continue; } case PURE_OP_LIST_APPEND: case PURE_OP_LIST_INSERT: { PureList *list = app->lists[arg]; const PureRecord *record = &m->record[m->state_ref[arg]]; size_t base = sp - record->count, count = pure_list_count(list), at = count; sp = base; if (op->op == PURE_OP_LIST_INSERT && (at = (size_t)stack[--sp].num) > count) { kind = PURE_FAULT_NOT_FOUND; goto failed; } /* Room for every text first, so no span moves while the next is copied. */ size_t mark = arena->used, total = 0; for (unsigned f = 0; f < record->count; ++f) if (text_field(m, arg, f)) total += (size_t)stack[base + f].bytes.length; if (!reserve(arena, total)) return PURE_ALLOCATION; PureCell cells[PURE_RECORD_FIELDS]; for (unsigned f = 0; f < record->count; ++f) { PureSpan span = {0}; if (text_field(m, arg, f) && (status = contiguous(app, arena, stack[base + f].bytes, &span)) != PURE_OK) return status; cells[f] = (PureCell){stack[base + f].num, (unsigned char *)span.data, span.size}; } if (m->state_key[arg]) { /* a keyed list places the item by its key */ bool found; unsigned key = m->state_key[arg] - 1u; at = pure_list_seek(list, key, cells[key], &found); if (found) { arena->used = mark; kind = PURE_FAULT_EXISTS; goto failed; } } status = pure_list_insert(list, at, cells, undo_for(app, arg)); arena->used = mark; if (status != PURE_OK) goto refused; move_indices(m, values, arg, pure_list_count(list), at, true); continue; } case PURE_OP_LIST_REMOVE: { size_t at = (size_t)stack[--sp].num; if ((status = pure_list_remove(app->lists[arg], at, undo_for(app, arg))) != PURE_OK) goto refused; move_indices(m, values, arg, pure_list_count(app->lists[arg]), at, false); if (ev->walk && ev->walk->list == arg) { /* the walk goes on with the item after */ if (at < ev->walk->at) --ev->walk->at; else if (at == ev->walk->at) ev->walk->removed = true; if (at < ev->walk->end && ev->walk->end != SIZE_MAX) --ev->walk->end; } continue; } case PURE_OP_ITEM_GET: { uint32_t list = list_of(arg), field = item_field(arg); size_t at = (size_t)top->num; if (at >= pure_list_count(app->lists[list])) { kind = PURE_FAULT_NOT_FOUND; goto failed; } PureCell cell = pure_list_get(app->lists[list], at, field); /* A text is copied: the item may change or go before the value is used. */ if (!text_field(m, list, field)) top->num = cell.num; else if ((status = keep_bytes(arena, cell.text, cell.size, &top->bytes)) != PURE_OK) return status; continue; } case PURE_OP_ITEM_SET: { uint32_t list = list_of(arg), field = item_field(arg); Slot value = stack[--sp]; size_t at = (size_t)stack[--sp].num, mark = arena->used; PureSpan span = {0}; status = text_field(m, list, field) ? contiguous(app, arena, value.bytes, &span) : PURE_OK; if (status == PURE_OK) status = pure_list_set(app->lists[list], at, field, (PureCell){value.num, (unsigned char *)span.data, span.size}, undo_for(app, list)); arena->used = mark; if (status != PURE_OK) goto refused; continue; } case PURE_OP_INDEX_STORE: { /* An index from before a remove may be past the end. */ double position = stack[--sp].num; if (position && position >= (double)pure_list_count(app->lists[m->state_ref[arg]])) { kind = PURE_FAULT_NOT_FOUND; goto failed; } values[arg] = position; continue; } case PURE_OP_FOLD: { /* The block that follows runs once per item, as a column of the * list: a leaf of it at a time when planned so. */ PureBlock inner = {pc, arg >> 16}; PureList *list = app->lists[arg >> 8 & 0xFF]; pc += inner.length; Fold fold = {arg & 0x7F, 0, false, false, {0}}; Event per = *ev; per.outer = ev->row; size_t from = 0, to = pure_list_count(list); if (arg & PURE_FOLD_SLICED) { /* the items with keys from low up to before high */ double high = stack[--sp].num, low = stack[--sp].num; slice_of(list, m->state_key[arg >> 8 & 0xFF] - 1u, low, high, &from, &to); } if (!op->shape || !fold_shaped(m, values, op, list, &per, &fold)) { if (op->range) /* only the items a range of keys allows can count */ range_bounds(m, values, &m->range[op->range - 1], list, m->state_key[arg >> 8 & 0xFF] - 1u, &per, &from, &to); status = op->plan ? fold_runs(m, values, inner, list, &per, &fold, from, to) : fold_rows(m, values, inner, &per, from, to, &fold); free(fold.seen.keys); if (status != PURE_OK) return status; } if (!fold.any && (fold.how == PURE_FOLD_MAX || fold.how == PURE_FOLD_MIN || fold.how == PURE_FOLD_FIRST)) { kind = PURE_FAULT_NOT_FOUND; goto failed; } if (!isfinite(fold.total)) { kind = PURE_FAULT_NON_FINITE; goto failed; } stack[sp].num = fold.total; stack[sp++].bytes.owner = (uint16_t)(arg >> 8 & 0xFF); /* first: the list the index is in */ continue; } case PURE_OP_EACH: { /* The block that follows runs for each item the list has, as the * handler's code with ROW the item; the list only shrinks meanwhile. */ PureBlock inner = {pc, arg >> 16}; Walk walk = {arg >> 8 & 0xFF, 0, SIZE_MAX, false}; pc += inner.length; Event per = *ev; per.walk = &walk; if (arg & PURE_EACH_SLICED) { /* the items with keys from low up to before high */ double high = stack[--sp].num, low = stack[--sp].num; slice_of(app->lists[walk.list], m->state_key[walk.list] - 1u, low, high, &walk.at, &walk.end); } else if (op->range) /* a where that bounds the key: only the items in bounds */ range_bounds(m, values, &m->range[op->range - 1], app->lists[walk.list], m->state_key[walk.list] - 1u, &per, &walk.at, &walk.end); while (walk.at < walk.end && walk.at < pure_list_count(app->lists[walk.list])) { size_t mark = arena->used; per.row = walk.at; walk.removed = false; status = run(m, values, inner, &per, NULL); arena->used = mark; if (status != PURE_OK) return status; if (!walk.removed) ++walk.at; } ev->modified = per.modified; ev->exists = per.exists; continue; } case PURE_OP_TEXT_COMPARE: { /* Texts order by their bytes: a shorter text before a longer one it begins. */ PureBytes right = stack[--sp].bytes, left = stack[sp - 1].bytes; size_t mark = arena->used; PureSpan a, b; if (!reserve(arena, (size_t)(left.length + right.length))) return PURE_ALLOCATION; if ((status = contiguous(app, arena, left, &a)) != PURE_OK || (status = contiguous(app, arena, right, &b)) != PURE_OK) return status; size_t shorter = a.size < b.size ? a.size : b.size; int order = shorter ? memcmp(a.data, b.data, shorter) : 0; if (!order) order = (a.size > b.size) - (a.size < b.size); arena->used = mark; stack[sp - 1].num = arg == PURE_LESS ? order < 0 : arg == PURE_LESS_EQUAL ? order <= 0 : arg == PURE_GREATER ? order > 0 : arg == PURE_GREATER_EQUAL ? order >= 0 : arg == PURE_EQUAL ? order == 0 : order != 0; continue; } case PURE_OP_LIST_FIND: case PURE_OP_LIST_HAS: { /* A keyed list's item by key, found by halving: FIND gives its index, HAS whether it is there. */ unsigned key = m->state_key[arg] - 1u; size_t mark = arena->used; PureCell cell = {top->num, NULL, 0}; if (text_field(m, arg, key)) { PureSpan span; if ((status = contiguous(app, arena, top->bytes, &span)) != PURE_OK) return status; cell = (PureCell){0, (unsigned char *)span.data, span.size}; } bool found; size_t at = pure_list_seek(app->lists[arg], key, cell, &found); arena->used = mark; if (op->op == PURE_OP_LIST_HAS) { top->num = found; continue; } if (!found) { kind = PURE_FAULT_NOT_FOUND; goto failed; } top->num = (double)at; top->bytes.owner = (uint16_t)arg; continue; } case PURE_OP_PICK: stack[sp] = stack[sp - 1 - arg]; ++sp; continue; case PURE_OP_SLIDE: stack[sp - 1 - arg] = stack[sp - 1]; sp -= arg; continue; default: break; } double b = stack[--sp].num, a = stack[sp - 1].num, value; switch (op->op) { case PURE_OP_ADD: value = a + b; break; case PURE_OP_SUB: value = a - b; break; case PURE_OP_MUL: value = a * b; break; case PURE_OP_DIV: if (b == 0) { kind = PURE_FAULT_DIVIDE; goto failed; } value = a / b; break; case PURE_OP_LT: value = a < b; break; case PURE_OP_LE: value = a <= b; break; case PURE_OP_GT: value = a > b; break; case PURE_OP_GE: value = a >= b; break; case PURE_OP_EQ: value = a == b; break; case PURE_OP_NE: value = a != b; break; case PURE_OP_AND: value = a != 0 && b != 0; break; case PURE_OP_OR: value = a != 0 || b != 0; break; case PURE_OP_MIN: value = minimum(a, b); break; case PURE_OP_MOD: /* the divisor's sign, as floor division leaves it (a zero too) */ if (b == 0) { kind = PURE_FAULT_DIVIDE; goto failed; } value = fmod(a, b); if (value != 0 && (value < 0) != (b < 0)) value += b; else if (value == 0) value = copysign(0.0, b); break; default: value = maximum(a, b); break; } if (!isfinite(value)) { kind = PURE_FAULT_NON_FINITE; goto failed; } stack[sp - 1].num = value; } if (result) memcpy(result, stack, sp * sizeof(*stack)); /* a view's value, or a fold block's numbers */ return PURE_OK; refused: kind = status == PURE_LIMIT ? PURE_FAULT_LIMIT : status == PURE_NOT_FOUND ? PURE_FAULT_NOT_FOUND : PURE_FAULT_NONE; if (kind == PURE_FAULT_NONE) return status; failed: return fault(app, kind, (uint32_t)(op - m->code)); } PURE_COLD static PureResult new_text(PureDraft **out, const PureModule *m, uint32_t constant) { *out = pure_draft_new(); if (!*out) return PURE_ALLOCATION; PureSpan initial = {m->constant_data + m->constant_offset[constant], m->constant_length[constant]}; PureResult result = pure_draft_splice(*out, 0, 0, initial); if (result != PURE_OK) { pure_draft_close(*out); *out = NULL; } return result; } PURE_COLD static PureList *new_list(const PureModule *m, uint32_t record) { return pure_list_new(m->record[record].count, m->record_field_text + m->record[record].first); } /* Where key is in the pending index: its slot, or the empty one it would take. */ static unsigned pending_slot(const PureApp *app, const char *key) { uint32_t hash = 2166136261u; /* FNV-1a */ for (const char *c = key; *c; ++c) hash = (hash ^ (unsigned char)*c) * 16777619u; unsigned mask = 2 * PURE_APP_PENDING - 1, slot = hash & mask; while (app->pending_index[slot] && strcmp(app->pending[app->pending_index[slot] - 1].key, key)) slot = (slot + 1) & mask; return slot; } bool pure_app_pending(const PureApp *app, const char *key) { return app->pending_count && app->pending_index[pending_slot(app, key)]; } void pure_app_finish(PureApp *app) { /* A document in the unsaved burst stays open until the save. */ if (app->document && !app->document_pending) app->data.close(app->data.context, app->document); app->document_pending = false; free(app->copied); app->document = NULL; app->copied = NULL; app->has_reply = false; app->payload = (PureSpan){0}; app->arena.used = 0; } /* The start of a burst: what a failed save returns to. Text drafts stay held * until the save, so every version since stays readable; a stored list's * journal is as long as its changes since the last save. */ static void open_burst(PureApp *app) { if (app->open) return; const PureModule *m = app->module; memcpy(app->durable_values, app->values, sizeof(app->values)); app->durable_ticks = app->ticks; app->durable_events = app->events; for (uint32_t i = 0; i < m->states; ++i) { if (app->texts[i]) { pure_draft_hold(app->texts[i], true); app->durable_texts[i] = pure_draft_version(app->texts[i]); } if (app->lists[i]) app->durable_lists[i] = pure_list_changes(app->lists[i]).size; } if (app->heard) app->durable_heard = pure_list_changes(app->heard).size; if (app->outbox) app->durable_outbox = pure_list_changes(app->outbox).size; app->durable_sent_saved = app->sent_saved; app->open = true; } /* End a burst, keeping it (saved) or undoing all of it. The documents it held * close, except the current event's, which pure_app_finish closes. */ static void close_burst(PureApp *app, bool keep) { for (unsigned i = 0; i < app->pending_count; ++i) if (app->pending[i].document != app->document) app->data.close(app->data.context, app->pending[i].document); if (app->pending_count) memset(app->pending_index, 0, sizeof(app->pending_index)); app->pending_count = 0; app->document_pending = false; if (!app->open) return; const PureModule *m = app->module; for (uint32_t i = 0; i < m->states; ++i) { if (app->texts[i]) { if (!keep) pure_draft_restore(app->texts[i], app->durable_texts[i]); pure_draft_hold(app->texts[i], false); } if (app->lists[i] && !keep) pure_list_forget(app->lists[i], app->durable_lists[i]); } if (app->heard && !keep) pure_list_forget(app->heard, app->durable_heard); if (app->outbox && !keep) pure_list_forget(app->outbox, app->durable_outbox); if (keep) pure_undo_commit(&app->undo); else { pure_undo_rollback(&app->undo, 0); memcpy(app->values, app->durable_values, sizeof(app->values)); app->ticks = app->durable_ticks; app->events = app->durable_events; ++app->changes; } app->open = false; } /* After a save: what it stored is the links' saved state, every send in the * outbox saved; or, when it failed, the links return to the last saved * state (the sends, trims and numbers heard go back with the burst's list * changes). */ static void settle_links(PureApp *app, bool saved) { if (saved) { app->sent_saved = app->outbox ? pure_list_count(app->outbox) : 0; memcpy(app->saved_sent, app->last_sent, sizeof(app->saved_sent)); } else { app->sent_saved = app->durable_sent_saved; memcpy(app->last_sent, app->saved_sent, sizeof(app->last_sent)); } app->links_changed = false; } PureResult pure_app_save(PureApp *app) { void *documents[PURE_APP_PENDING]; int64_t revisions[PURE_APP_PENDING]; size_t count = 0; for (unsigned i = 0; i < app->pending_count; ++i) if (app->pending[i].edited) documents[count++] = app->pending[i].document; PureResult result = pure_save_commit(app, app->values, documents, count, revisions); settle_links(app, result == PURE_OK); close_burst(app, result == PURE_OK); /* Images due are written now, unless the host writes them on another thread. */ for (PureCheckpoint *c; result == PURE_OK && !app->background_checkpoints && (c = pure_app_checkpoint(app));) pure_app_checkpointed(app, c, pure_checkpoint_write(c)); return result; } bool pure_app_defer(PureApp *app, bool deferred) { if (deferred && !pure_save_enabled(app)) return false; app->deferred = deferred; return true; } /* ---- Snapshots. An app's snapshots are numbered as they are made (their * epoch), and the ones still held are linked, oldest to newest, under their * register (which each of them holds, so it outlives the app). A list's node * or text the app lets go while a snapshot is its newest may be read by that * snapshot and by older ones made after it was: it goes with that snapshot, * and when that one goes, to the newest older one still held that may read * it (made after it was), or back to the system. So a snapshot held for long * keeps what it shares, the states as they were then, and nothing made * since. The links and retired lists move under the register's lock, a spin * (none holds it long; what is freed is freed outside it). */ typedef struct { unsigned refs; /* the snapshots not yet freed */ bool locked; uint64_t epoch; /* snapshots made */ } Register; struct PureSnapshot { unsigned refs; const PureModule *module; uint64_t changes, epoch; double values[PURE_MODULE_STATES]; PureDraft *texts[PURE_MODULE_STATES]; PureList *lists[PURE_MODULE_STATES]; PureList *runtime[PURE_LISTS_STORED - PURE_LIST_HEARD]; /* only in a checkpoint's of one */ PureRetired retired; struct PureSnapshot *older, *newer; /* the held ones beside it */ Register *all; }; static void lock_register(Register *r) { while (__atomic_test_and_set(&r->locked, __ATOMIC_ACQUIRE)) { /* another thread moves links: a moment */ } } static void unlock_register(Register *r) { __atomic_clear(&r->locked, __ATOMIC_RELEASE); } void pure_snapshot_hold(PureSnapshot *snapshot) { __atomic_add_fetch(&snapshot->refs, 1, __ATOMIC_RELAXED); } const PureList *pure_snapshot_list(const PureSnapshot *snapshot, uint32_t state) { return state >= PURE_LIST_HEARD ? snapshot->runtime[state - PURE_LIST_HEARD] : snapshot->lists[state]; } void pure_snapshot_release(PureSnapshot *snapshot) { if (!snapshot || __atomic_sub_fetch(&snapshot->refs, 1, __ATOMIC_ACQ_REL)) return; Register *all = snapshot->all; PureRetired gone = {0}; if (all) { /* out of the links: what the one before may read goes to it (still linked, so still there) */ lock_register(all); PureSnapshot *older = snapshot->older; if (older) older->newer = snapshot->newer; if (snapshot->newer) snapshot->newer->older = older; pure_retired_pass(&snapshot->retired, older ? older->epoch : 0, older ? &older->retired : NULL, &gone); unlock_register(all); } else gone = snapshot->retired; pure_retired_free(&gone); for (uint32_t i = 0; i < PURE_MODULE_STATES; ++i) { pure_draft_close(snapshot->texts[i]); pure_list_free(snapshot->lists[i]); } for (unsigned r = 0; r < PURE_LISTS_STORED - PURE_LIST_HEARD; ++r) pure_list_free(snapshot->runtime[r]); free(snapshot); if (all && !__atomic_sub_fetch(&all->refs, 1, __ATOMIC_ACQ_REL)) free(all); } void pure_app_stop(PureApp *app) { pure_app_finish(app); close_burst(app, true); /* unsaved changes are dropped with the app */ for (uint32_t i = 0; i < PURE_MODULE_STATES && !app->reading; ++i) { pure_draft_close(app->texts[i]); pure_list_free(app->lists[i]); pure_draft_close(app->list_drafts[i]); } /* Items the newest snapshot may still read go with it. */ if (app->snapshot) { lock_register(app->snapshot->all); pure_retired_pass(&app->retired, UINT64_MAX, &app->snapshot->retired, NULL); unlock_register(app->snapshot->all); pure_snapshot_release(app->snapshot); } else pure_retired_free(&app->retired); pure_draft_close(app->stored_values); pure_list_free(app->outbox); pure_list_free(app->heard); free(app->carried); pure_draft_close(app->stored_links); pure_draft_close(app->stored_seq); pure_save_close_start(app); pure_log_close(app->log); free(app->pending); pure_undo_free(&app->undo); for (unsigned i = 0; i < app->row_tables; ++i) free(app->rows[i].items); free(app->rows); drop_passes(app); free(app->arena.bytes); free(app->view_arena.bytes); memset(app, 0, sizeof(*app)); } /* Where one event began inside the burst: a failed event returns there. */ typedef struct { PureVersion texts[PURE_MODULE_STATES]; size_t lists[PURE_MODULE_STATES], heard, outbox; /* stored lists' journal lengths */ size_t undo, sent_saved; uint64_t last_sent[PURE_MODULE_INPUTS]; bool opened; } Mark; static void mark_event(PureApp *app, Mark *mark) { mark->opened = !app->open; open_burst(app); for (uint32_t i = 0; i < app->module->states; ++i) { if (app->texts[i]) mark->texts[i] = pure_draft_version(app->texts[i]); if (app->lists[i]) mark->lists[i] = pure_list_changes(app->lists[i]).size; } mark->heard = app->heard ? pure_list_changes(app->heard).size : 0; mark->outbox = app->outbox ? pure_list_changes(app->outbox).size : 0; mark->undo = app->undo.count; mark->sent_saved = app->sent_saved; memcpy(mark->last_sent, app->last_sent, sizeof(mark->last_sent)); } static void undo_event(PureApp *app, const Mark *mark) { for (uint32_t i = 0; i < app->module->states; ++i) { if (app->texts[i]) pure_draft_restore(app->texts[i], mark->texts[i]); if (app->lists[i]) pure_list_forget(app->lists[i], mark->lists[i]); } if (app->heard) pure_list_forget(app->heard, mark->heard); if (app->outbox) pure_list_forget(app->outbox, mark->outbox); pure_undo_rollback(&app->undo, mark->undo); app->sent_saved = mark->sent_saved; memcpy(app->last_sent, mark->last_sent, sizeof(app->last_sent)); if (mark->opened) close_burst(app, true); /* nothing happened: release the holds */ } /* Where source's item is in the heard list, or would go; found says which. */ static size_t heard_at(const PureApp *app, const char *source, bool *found) { *found = false; return app->heard ? pure_list_seek(app->heard, 0, (PureCell){.text = (unsigned char *)source, .size = strlen(source)}, found) : 0; } uint64_t pure_app_heard(const PureApp *app, const char *source) { bool found; size_t at = heard_at(app, source, &found); return found ? (uint64_t)pure_list_get(app->heard, at, 1).num : 0; } /* Hear seq from source: a change of the heard list, undone with the burst. */ static PureResult hear(PureApp *app, const char *source, uint64_t seq) { bool found; size_t at = heard_at(app, source, &found); if (found) return pure_list_set(app->heard, at, 1, (PureCell){.num = (double)seq}, &app->undo); PureCell item[2] = {{.text = (unsigned char *)source, .size = strlen(source)}, {.num = (double)seq}}; return pure_list_insert(app->heard, at, item, &app->undo); } /* The output's saved sends through seq leave the outbox: their receiver * stored them, or answered them (in the answer's event). */ static PureResult let_sends_go(PureApp *app, uint32_t output, uint64_t through) { if (!app->outbox) return PURE_OK; const char *name = app->module->input_names[output]; size_t length = strlen(name); for (size_t i = 0; i < app->sent_saved;) { PureCell of = pure_list_get(app->outbox, i, 0); if (of.size != length || memcmp(of.text, name, length)) { ++i; continue; } if ((uint64_t)pure_list_get(app->outbox, i, 1).num > through) break; PureResult removed = pure_list_remove(app->outbox, i, &app->undo); if (removed != PURE_OK) return removed; --app->sent_saved; app->links_changed = true; } return PURE_OK; } static PureResult keep_reply(PureApp *app); /* Every list of a message's rows emptied: an event's rows are its own. */ static void clear_rows(PureApp *app) { const PureModule *m = app->module; for (uint32_t i = 0; i < m->states; ++i) if (m->state_type[i] == PURE_STATE_LIST && m->state_flags[i] & PURE_LIST_ROWS >> 8) pure_list_clear(app->lists[i]); } void pure_app_memory(PureApp *app, size_t bytes) { app->memory = bytes; } size_t pure_app_state_bytes(const PureApp *app) { size_t bytes = (app->outbox ? pure_list_size(app->outbox) : 0) + (app->heard ? pure_list_size(app->heard) : 0); for (uint32_t left = app->counted; left; left &= left - 1) { unsigned i = (unsigned)__builtin_ctz(left); bytes += app->lists[i] ? pure_list_size(app->lists[i]) : app->texts[i] ? pure_draft_size(app->texts[i]) : 0; } return bytes; } /* One event: every handler for it runs in module order against pending * states, all or nothing. A key, text or message event saves before it * returns unless saving is deferred; a frame leaves that to the next event * (frames come 60 times a second). A message's document joins the burst. * With a memory budget, an event that leaves the states over it, and * holding more than before, fails. */ static PureResult dispatch(PureApp *app, uint32_t event, Event *ev) { const PureModule *m = app->module; double pending[PURE_MODULE_STATES], locals[PURE_MODULE_LOCALS] = {0}; ev->locals = locals; size_t held = app->memory ? pure_app_state_bytes(app) : 0; Mark mark; mark_event(app, &mark); memcpy(pending, app->values, sizeof(app->values)); app->fault = PURE_FAULT_NONE; app->fault_pc = UINT32_MAX; PureResult result = PURE_OK; for (uint32_t i = 0; i < m->handlers && result == PURE_OK; ++i) if (m->handler[i].event == event) result = run(m, pending, m->handler[i].code, ev, NULL); /* An edit needs the revision it was made against. A save rebases an * edited document and releasing texts may reclaim earlier text versions: * keep such a reply by copying it first. */ if (result == PURE_OK && ev->modified && ev->base < 0) result = PURE_INVALID; if (result == PURE_OK && app->has_reply && ((app->reply.source == FROM_DOCUMENT && ev->modified) || app->reply.source == FROM_TEXT)) result = keep_reply(app); /* A delivery's number is heard with its changes, and an answer's sends go with it. */ if (result == PURE_OK && app->delivering.pending) result = hear(app, app->delivering.source, app->delivering.seq); if (result == PURE_OK && app->delivering.pending && app->delivering.release) result = let_sends_go(app, app->delivering.release - 1, app->delivering.seq); if (result == PURE_OK && app->memory) { size_t holds = pure_app_state_bytes(app); if (holds > app->memory && holds > held) result = fault(app, PURE_FAULT_MEMORY, UINT32_MAX); } if (result != PURE_OK) { undo_event(app, &mark); clear_rows(app); return result; } clear_rows(app); memcpy(app->values, pending, sizeof(pending)); ++app->events; ++app->changes; if (!event) ++app->ticks; if (app->document) { app->pending_index[pending_slot(app, ev->key)] = (uint16_t)(app->pending_count + 1); /* not there: a key joins once */ app->pending[app->pending_count].document = app->document; app->pending[app->pending_count].edited = ev->modified; memcpy(app->pending[app->pending_count++].key, ev->key, strlen(ev->key) + 1); app->document_pending = true; app->revision += ev->modified; /* a save moves an edited document one revision */ } app->delivering.pending = false; return event && !app->deferred ? pure_app_save(app) : PURE_OK; } PureResult pure_app_frame(PureApp *app) { pure_app_finish(app); Event ev = {.app = app, .arena = &app->arena, .dt = 1.0 / 60.0}; return dispatch(app, 0, &ev); } PureResult pure_app_tick(PureApp *app, uint32_t input) { if (input >= app->module->inputs || app->module->input[input].kind != PURE_KIND_TIMER) return PURE_INVALID; pure_app_finish(app); Event ev = {.app = app, .arena = &app->arena}; return dispatch(app, 1 + 2 * input, &ev); } PureResult pure_app_input(PureApp *app, uint32_t input, PureEdge edge) { if (input >= app->module->inputs || app->module->input[input].kind != PURE_KIND_KEY || (edge != PURE_EDGE_DOWN && edge != PURE_EDGE_UP)) return PURE_INVALID; pure_app_finish(app); Event ev = {.app = app, .arena = &app->arena}; return dispatch(app, 1 + 2 * input + (edge == PURE_EDGE_UP), &ev); } PureResult pure_app_point(PureApp *app, uint32_t state, size_t position) { const PureModule *m = app->module; pure_app_finish(app); if (state >= m->states || m->state_type[state] != PURE_STATE_INDEX) return PURE_INVALID; if (position >= pure_list_count(app->lists[m->state_ref[state]])) return PURE_NOT_FOUND; open_burst(app); /* what a failed save returns to */ app->fault = PURE_FAULT_NONE; app->fault_pc = UINT32_MAX; app->values[state] = (double)position; ++app->events; ++app->changes; return app->deferred ? PURE_OK : pure_app_save(app); } PureResult pure_app_text(PureApp *app, uint32_t input, PureSpan text) { pure_app_finish(app); if (input >= app->module->inputs || app->module->input[input].kind != PURE_KIND_TEXT || (text.size && !text.data) || !pure_utf8_valid(text)) return PURE_INVALID; app->payload = text; Event ev = {.app = app, .arena = &app->arena}; PureResult result = dispatch(app, 1 + 2 * input, &ev); app->payload = (PureSpan){0}; return result; } static PureResult keep_reply(PureApp *app) { size_t length = (size_t)app->reply.length, start = app->arena.used; unsigned char *copy = malloc(length ? length : 1); if (!copy) return PURE_ALLOCATION; PureResult result = append_value(app, &app->arena, app->reply); if (result != PURE_OK) { free(copy); return result; } if (length) memcpy(copy, app->arena.bytes + start, length); app->arena.used = start; app->copied = copy; app->reply = (PureBytes){FROM_COPY, 0, {0, 0}, 0, length}; return PURE_OK; } /* Where each variable field of a payload of shape is: where placed says * (start and size in the payload), or, without it, one after another after * the prefix. A length past the payload, a text that is not UTF-8 or a * number that is not finite is its fault (else NONE). */ static PureFault place_fields(const PureModule *m, const PureInputShape *shape, PureSpan payload, const uint32_t *placed, uint32_t spans[][2]) { if (payload.size < shape->prefix) return PURE_FAULT_LIMIT; size_t at = shape->prefix; for (uint32_t f = 0; f < shape->field_count; ++f) { const PureField *field = &m->field[shape->field_start + f]; if (field->type == PURE_FIELD_NUMBER && !isfinite(read_double(payload.data + field->offset))) return PURE_FAULT_NON_FINITE; if (field->type != PURE_FIELD_BYTES && field->type != PURE_FIELD_TEXT && field->type != PURE_FIELD_ROWS) continue; size_t start = placed ? placed[2 * f] : at; if (start > payload.size) return PURE_FAULT_LIMIT; size_t size = placed ? placed[2 * f + 1] : field->offset == PURE_FIELD_REST ? payload.size - at : read32(payload.data + field->offset); if (size > payload.size - start) return PURE_FAULT_LIMIT; if (field->type == PURE_FIELD_TEXT && !pure_utf8_valid((PureSpan){size ? payload.data + start : NULL, size})) return PURE_FAULT_ENCODING; spans[f][0] = (uint32_t)start; spans[f][1] = (uint32_t)size; at = start + size; } return PURE_FAULT_NONE; } int pure_module_arguments(const PureModule *m, uint32_t view) { return view < m->views && m->view_arguments[view] ? m->view_arguments[view] - 1 : -1; } PureResult pure_app_arguments(PureApp *app, uint32_t view, PureSpan payload, const uint32_t *placed) { const PureModule *m = app->module; int input = pure_module_arguments(m, view); if (input < 0 || (payload.size && !payload.data)) return PURE_INVALID; app->argued = 0; ++app->arguments_given; /* rows a filter kept are for other arguments */ PureFault wrong = place_fields(m, &m->input[input], payload, placed, app->argument_spans); if (wrong != PURE_FAULT_NONE) return wrong == PURE_FAULT_LIMIT ? PURE_LIMIT : PURE_INVALID; app->arguments = payload; app->argued = (unsigned)input + 1; return PURE_OK; } /* A message whose variable fields are where placed says (start and size in * the payload), or, without it, one after another after the prefix. */ static PureResult message(PureApp *app, uint32_t input, const char *key, int64_t base, PureSpan payload, const uint32_t *placed) { pure_app_finish(app); const PureModule *m = app->module; app->fault = PURE_FAULT_NONE; app->fault_pc = UINT32_MAX; app->revision = 0; if (input >= m->inputs || m->input[input].kind != PURE_KIND_MESSAGE || base < -1 || (payload.size && !payload.data) || (m->input[input].keyed ? !document_key(key) : key != NULL)) return PURE_INVALID; const PureInputShape *shape = &m->input[input]; uint32_t spans[PURE_MODULE_FIELDS][2]; PureFault wrong = place_fields(m, shape, payload, placed, spans); if (wrong != PURE_FAULT_NONE) return fault(app, wrong, UINT32_MAX); if (shape->keyed && m->collections) { if (!app->data.open) return PURE_INVALID; /* A key joins a burst once, so its revision moves once per save. */ if (app->pending_count == PURE_APP_PENDING || pure_app_pending(app, key)) { PureResult saved = pure_app_save(app); if (saved != PURE_OK) return saved; } if (app->pending_count == app->pending_capacity) { unsigned capacity = app->pending_capacity ? 2 * app->pending_capacity : 16; struct PurePending *grown = realloc(app->pending, capacity * sizeof(*grown)); if (!grown) return PURE_ALLOCATION; app->pending = grown; app->pending_capacity = capacity; } PureResult opened = app->data.open(app->data.context, 0, key, &app->document, &app->revision); if (opened != PURE_OK) { app->document = NULL; return opened; } if (base >= 0 && base != app->revision) { pure_app_finish(app); return PURE_CONFLICT; } } /* Its rows fill their lists (emptied when the event ends); rows that are not whole fail it. */ for (uint32_t f = 0; f < shape->field_count; ++f) { const PureField *field = &m->field[shape->field_start + f]; if (field->type != PURE_FIELD_ROWS) continue; PureResult filled = pure_list_read(app->lists[field->rows], payload.data + spans[f][0], spans[f][1]); if (filled == PURE_OK) continue; clear_rows(app); pure_app_finish(app); return filled == PURE_ALLOCATION ? filled : fault(app, PURE_FAULT_LIMIT, UINT32_MAX); } app->payload = payload; Event ev = {.app = app, .shape = shape, .key = key, .base = base, .arena = &app->arena, .exists = app->revision > 0, .spans = spans}; PureResult result = dispatch(app, 1 + 2 * input, &ev); if (result != PURE_OK) pure_app_finish(app); return result; } PureResult pure_app_message(PureApp *app, uint32_t input, const char *key, int64_t base, PureSpan payload) { return message(app, input, key, base, payload, NULL); } PureResult pure_app_message_fields(PureApp *app, uint32_t input, const char *key, int64_t base, PureSpan payload, const uint32_t *placed) { return message(app, input, key, base, payload, placed); } /* The outbox's item at: its output (the module's, by name), number and payload. */ static bool sent_at(const PureApp *app, size_t at, uint32_t *output, uint64_t *seq, PureSpan *payload) { PureCell name = pure_list_get(app->outbox, at, 0), bytes = pure_list_get(app->outbox, at, 2); const PureModule *m = app->module; uint32_t i = 0; while (i < m->inputs && (strlen(m->input_names[i]) != name.size || memcmp(m->input_names[i], name.text, name.size))) ++i; *output = i; *seq = (uint64_t)pure_list_get(app->outbox, at, 1).num; *payload = (PureSpan){bytes.text, bytes.size}; return i < m->inputs; } void pure_app_outbox(const PureApp *app, PureSentVisit visit, void *context) { for (size_t i = 0; i < app->sent_saved; ++i) { uint32_t output; uint64_t seq; PureSpan payload; if (sent_at(app, i, &output, &seq, &payload) && !visit(context, output, seq, payload)) return; } } void pure_app_outbox_newest(const PureApp *app, PureSentVisit visit, void *context) { for (size_t i = app->sent_saved; i-- > 0;) { uint32_t output; uint64_t seq; PureSpan payload; if (sent_at(app, i, &output, &seq, &payload) && !visit(context, output, seq, payload)) return; } } /* An output's sends up to through go at once (for the host), and from the * store with the next save; a failed save brings them back. Its sends are * in order among the others: the look stops at its first one kept. */ void pure_app_trim(PureApp *app, uint32_t output, uint64_t through) { if (!app->outbox || output >= app->module->inputs) return; open_burst(app); let_sends_go(app, output, through); } /* A delivery, or an answer to the sends of output (release: its number + 1). */ static PureResult deliver(PureApp *app, uint32_t input, uint32_t release, const char *source, uint64_t seq, PureSpan payload, const uint32_t *placed) { const PureModule *m = app->module; size_t length = source ? strlen(source) : 0; app->duplicate = false; /* Kept states without a directory would not keep the numbers heard. */ if (input >= m->inputs || m->input[input].kind != PURE_KIND_MESSAGE || m->input[input].keyed || !length || length > PURE_SOURCE || !seq || seq > PURE_SEQ_MOST || !app->heard || (pure_save_enabled(app) && !app->log)) return PURE_INVALID; for (size_t i = 0; i < length; ++i) if (source[i] <= ' ' || source[i] > '~') return PURE_INVALID; if (seq <= pure_app_heard(app, source)) { pure_app_finish(app); app->duplicate = true; return PURE_OK; } app->delivering.source = source; app->delivering.seq = seq; app->delivering.release = release; app->delivering.pending = true; PureResult result = message(app, input, NULL, -1, payload, placed); if (!app->delivering.pending) return result; /* Not applied. Refused by the app (a fault), the message was delivered * all the same: its number is heard, saved like a key event's changes. * Refused for memory it was not: its sender sends it again. */ app->delivering.pending = false; if (app->fault == PURE_FAULT_NONE || app->fault == PURE_FAULT_MEMORY) return result; Mark mark; mark_event(app, &mark); PureResult heard = hear(app, source, seq); if (heard == PURE_OK && release) heard = let_sends_go(app, release - 1, seq); if (heard != PURE_OK) { undo_event(app, &mark); return heard; } PureResult saved = app->deferred ? PURE_OK : pure_app_save(app); return saved == PURE_OK ? result : saved; } PureResult pure_app_deliver(PureApp *app, uint32_t input, const char *source, uint64_t seq, PureSpan payload, const uint32_t *placed) { return deliver(app, input, 0, source, seq, payload, placed); } PureResult pure_app_answer(PureApp *app, uint32_t input, uint32_t output, const char *source, uint64_t seq, PureSpan payload, const uint32_t *placed) { if (output >= app->module->inputs || app->module->input[output].kind != PURE_KIND_OUTPUT) return PURE_INVALID; return deliver(app, input, output + 1, source, seq, payload, placed); } PureResult pure_app_reply(const PureApp *app, bool (*visit)(void *, PureSpan), void *context) { if (!app->has_reply) return PURE_OK; return visit_value(app, &app->arena, app->reply, visit, context); } /* A view that fails reports it by its result; the fault stays the last event's. */ /* The arguments a view reads, set in its event; false when it takes some and they were not given. */ static bool argue(const PureApp *app, uint32_t view, Event *ev) { unsigned given = app->module->view_arguments[view]; if (!given) return true; if (app->argued != given) return false; ev->shape = &app->module->input[given - 1]; ev->spans = (uint32_t (*)[2])app->argument_spans; ev->arguments = true; return true; } static PureResult evaluate(PureApp *app, uint32_t view, size_t row, Slot *out) { double values[PURE_MODULE_STATES]; memcpy(values, app->values, sizeof(values)); app->view_arena.used = 0; Event ev = {.app = app, .arena = &app->view_arena, .row = row}; if (!argue(app, view, &ev)) return PURE_INVALID; PureFault fault = app->fault; uint32_t fault_pc = app->fault_pc; PureResult result = run(app->module, values, app->module->view_code[view], &ev, out); app->fault = fault; app->fault_pc = fault_pc; return result; } static bool keep_row(struct PureRows *rows, size_t item) { if (rows->count == rows->capacity) { size_t capacity = rows->capacity ? 2 * rows->capacity : 16; size_t *grown = realloc(rows->items, capacity * sizeof(*grown)); if (!grown) return false; rows->items = grown; rows->capacity = capacity; } rows->items[rows->count++] = item; return true; } /* The item kept when the filter, run for it alone, keeps it; false without room. */ static bool keep_evaluated(PureApp *app, uint32_t table, struct PureRows *rows, size_t item) { Slot kept; return evaluate(app, table, item, &kept) != PURE_OK || kept.num == 0 || keep_row(rows, item); } /* A filtered table's items, as fresh as the app's states: the filter runs * once per item after each change (an item it fails on is left out), not * once per cell. NULL for a table without a filter, or without room. */ static struct PureRows *filtered(PureApp *app, uint32_t table) { const PureModule *m = app->module; if (!m->view_code[table].length) return NULL; struct PureRows *rows = NULL; for (unsigned i = 0; i < app->row_tables && !rows; ++i) if (app->rows[i].table == table) rows = &app->rows[i]; if (!rows) { struct PureRows *grown = realloc(app->rows, (app->row_tables + 1) * sizeof(*grown)); if (!grown) return NULL; app->rows = grown; rows = &app->rows[app->row_tables++]; *rows = (struct PureRows){.table = table, .changes = UINT64_MAX}; } if (rows->changes == app->changes && (!m->view_arguments[table] || rows->given == app->arguments_given)) return rows; rows->count = 0; /* A leaf of the list at a time when the filter has lane forms; a leaf * where an item would fault goes item by item, leaving that item out. */ const PureList *list = app->lists[m->view_list[table]]; PureRun run; if (m->view_plan[table]) { double store[PURE_MODULE_STACK][PURE_LIST_RUN], scratch[PURE_LIST_RUN]; Event ev = {.app = app, .arena = &app->view_arena}; Memo memo; memo.known = 0; if (!argue(app, table, &ev)) return NULL; size_t from = 0, to = pure_list_count(list); if (m->view_range[table]) /* items out of the range fail the filter: they are not read */ range_bounds(m, (double *)app->values, &m->range[m->view_range[table] - 1], list, m->state_key[m->view_list[table]] - 1u, &ev, &from, &to); for (bool more = from < to && pure_list_run(list, from, &run); more && run.start < to; more = pure_list_next(list, &run)) { Lanes keep; if (run_lanes(m, app->values, m->view_code[table], &ev, &run, &keep, store, &memo, NULL)) { const double *kept = lanes_of(&keep, scratch, &run); for (unsigned i = 0; i < run.count; ++i) if (kept[i] != 0 && !keep_row(rows, run.start + i)) return NULL; } else for (size_t item = run.start; item < run.start + run.count; ++item) if (!keep_evaluated(app, table, rows, item)) return NULL; } } else for (size_t item = 0, items = pure_list_count(list); item < items; ++item) if (!keep_evaluated(app, table, rows, item)) return NULL; rows->changes = app->changes; rows->given = app->arguments_given; return rows; } bool pure_app_row_item(PureApp *app, uint32_t table, size_t row, size_t *item) { const PureModule *m = app->module; if (table >= m->views || m->view_type[table] != PURE_VIEW_TABLE) return false; if (!m->view_code[table].length) { *item = row; return row < pure_list_count(app->lists[m->view_list[table]]); } struct PureRows *rows = filtered(app, table); if (!rows || row >= rows->count) return false; *item = rows->items[row]; return true; } bool pure_app_item_row(PureApp *app, uint32_t table, size_t item, size_t *row) { const PureModule *m = app->module; if (table >= m->views || m->view_type[table] != PURE_VIEW_TABLE) return false; if (!m->view_code[table].length) { *row = item; return item < pure_list_count(app->lists[m->view_list[table]]); } struct PureRows *rows = filtered(app, table); size_t low = 0, high = rows ? rows->count : 0; /* the items are in order */ while (low < high) { size_t middle = low + (high - low) / 2; if (rows->items[middle] < item) low = middle + 1; else high = middle; } if (low == (rows ? rows->count : 0) || rows->items[low] != item) return false; *row = low; return true; } /* A view outside a table (column false), or a column and a row of its table. */ static PureResult view_of(PureApp *app, uint32_t view, bool column, size_t row, uint8_t type, Slot *slot) { const PureModule *m = app->module; if (view >= m->views || m->view_type[view] != type || (m->view_table[view] != 0) != column) return PURE_INVALID; if (column && !pure_app_row_item(app, m->view_table[view] - 1u, row, &row)) return PURE_NOT_FOUND; return evaluate(app, view, row, slot); } bool pure_app_view(PureApp *app, uint32_t view, double *out) { Slot slot; if (view_of(app, view, false, 0, PURE_VIEW_NUM, &slot) != PURE_OK) return false; *out = slot.num; return true; } PureResult pure_app_view_text(PureApp *app, uint32_t view, bool (*visit)(void *, PureSpan), void *context) { Slot slot; PureResult result = view_of(app, view, false, 0, PURE_VIEW_TEXT, &slot); return result == PURE_OK ? visit_value(app, &app->view_arena, slot.bytes, visit, context) : result; } size_t pure_app_rows(PureApp *app, uint32_t table) { const PureModule *m = app->module; if (table >= m->views || m->view_type[table] != PURE_VIEW_TABLE) return 0; struct PureRows *rows = filtered(app, table); return rows ? rows->count : m->view_code[table].length ? 0 : pure_list_count(app->lists[m->view_list[table]]); } bool pure_app_cell(PureApp *app, uint32_t column, size_t row, double *out) { Slot slot; if (view_of(app, column, true, row, PURE_VIEW_NUM, &slot) != PURE_OK) return false; *out = slot.num; return true; } PureResult pure_app_cell_text(PureApp *app, uint32_t column, size_t row, bool (*visit)(void *, PureSpan), void *context) { Slot slot; PureResult result = view_of(app, column, true, row, PURE_VIEW_TEXT, &slot); return result == PURE_OK ? visit_value(app, &app->view_arena, slot.bytes, visit, context) : result; } PureSnapshot *pure_app_snapshot(PureApp *app) { return pure_save_snapshot(app, UINT32_MAX); } PureSnapshot *pure_save_snapshot(PureApp *app, uint32_t runtime) { if (app->open || app->reading) return NULL; const PureModule *m = app->module; PureSnapshot *made = calloc(1, sizeof(*made)), *last = app->snapshot; Register *all = last ? last->all : calloc(1, sizeof(*all)); if (!made || !all) { free(made); if (!last) free(all); return NULL; } made->refs = 1; made->module = m; made->changes = app->changes; made->epoch = all->epoch + 1; /* the app's thread alone makes them */ memcpy(made->values, app->values, sizeof(made->values)); bool ok = true; for (uint32_t i = 0; i < m->states && ok; ++i) { if (app->texts[i]) ok = (made->texts[i] = pure_draft_freeze(app->texts[i])) != NULL; if (!ok || !app->lists[i]) continue; if (last && last->lists[i] && pure_list_current(last->lists[i], app->lists[i])) { pure_list_hold(last->lists[i]); made->lists[i] = last->lists[i]; pure_list_mark(app->lists[i], made->epoch); } else ok = (made->lists[i] = pure_list_share(app->lists[i], &app->retired, made->epoch)) != NULL; } if (ok && runtime >= PURE_LIST_HEARD && runtime < PURE_LISTS_STORED) { PureList *list = runtime == PURE_LIST_HEARD ? app->heard : app->outbox; ok = (made->runtime[runtime - PURE_LIST_HEARD] = pure_list_share(list, &app->retired, made->epoch)) != NULL; } if (!ok) { /* never linked: it goes alone */ if (!last) free(all); pure_snapshot_release(made); return NULL; } made->refs = 2; /* the app's and the caller's */ made->all = all; lock_register(all); all->epoch = made->epoch; ++all->refs; made->older = last; if (last) { /* what the app let go while last was its newest goes with it */ last->newer = made; pure_retired_pass(&app->retired, UINT64_MAX, &last->retired, NULL); } unlock_register(all); if (last) pure_snapshot_release(last); else pure_retired_free(&app->retired); /* shared only by a snapshot never made */ app->snapshot = made; return made; } void pure_app_read(PureApp *reader, const PureSnapshot *snapshot) { if (reader->module != snapshot->module) drop_passes(reader); reader->module = snapshot->module; reader->reading = true; reader->changes = snapshot->changes; /* what the row cache is fresh for */ memcpy(reader->values, snapshot->values, sizeof(reader->values)); memcpy(reader->texts, snapshot->texts, sizeof(reader->texts)); memcpy(reader->lists, snapshot->lists, sizeof(reader->lists)); } /* A list with record's fields: each takes the field of `from` with the same * name and kind, or its default. */ PURE_COLD PureResult pure_list_migrate(PureList **out, const PureList *from, const char *const *names, const uint8_t *text, unsigned count, const PureModule *m, uint32_t record) { const PureRecord *r = &m->record[record]; int source[PURE_RECORD_FIELDS]; for (unsigned f = 0; f < r->count; ++f) { source[f] = -1; for (unsigned k = 0; k < count; ++k) if (!strcmp(m->record_field_names[r->first + f], names[k]) && m->record_field_text[r->first + f] == text[k]) source[f] = (int)k; } if (!(*out = new_list(m, record))) return PURE_ALLOCATION; PureResult result = PURE_OK; for (size_t at = 0; result == PURE_OK && at < pure_list_count(from); ++at) { PureCell cells[PURE_RECORD_FIELDS]; for (unsigned f = 0; f < r->count; ++f) { uint32_t field = r->first + f, constant = (uint32_t)m->record_field_default[field]; cells[f] = source[f] >= 0 ? pure_list_get(from, at, (unsigned)source[f]) : m->record_field_text[field] ? (PureCell){0, (unsigned char *)m->constant_data + m->constant_offset[constant], m->constant_length[constant]} : (PureCell){m->record_field_default[field], NULL, 0}; } result = pure_list_insert(*out, at, cells, NULL); } if (result != PURE_OK) { pure_list_free(*out); *out = NULL; } return result; } /* A kept list keeps its items; with the same record it is the same list. */ PURE_COLD static PureResult keep_list(PureList **out, PureList *from, const PureModule *old, uint32_t old_record, const PureModule *m, uint32_t record) { const PureRecord *r = &m->record[record], *o = &old->record[old_record]; const char *names[PURE_RECORD_FIELDS]; bool same = r->count == o->count; for (unsigned k = 0; k < o->count; ++k) { names[k] = old->record_field_names[o->first + k]; same = same && !strcmp(names[k], m->record_field_names[r->first + k]) && old->record_field_text[o->first + k] == m->record_field_text[r->first + k]; } if (same) { *out = from; return PURE_OK; } return pure_list_migrate(out, from, names, old->record_field_text + o->first, o->count, m, record); } /* Open a module in an app. States keep their values by name and kind (texts * their content, cursors their position in it, lists their items, moved by * field name when the record changed); every other state starts from its * stored value, or its initial one. A list whose record changed is stored * again, and the next event or save publishes the module's states; a state * the module drops stays stored as it was. Starting an app opens its module * over none. */ /* Outputs of old that module has by name and with the same fields (their * names and types, in order: what a send's bytes mean) keep their sends and * numbers; one it lacks or changed refuses the module while sends are left * on it (CONFLICT), and otherwise keeps its number for later. */ PURE_COLD static PureResult remap_outputs(PureApp *app, const PureModule *old, const PureModule *module, bool apply) { int map[PURE_MODULE_INPUTS]; for (uint32_t i = 0; i < old->inputs; ++i) { map[i] = -1; if (old->input[i].kind != PURE_KIND_OUTPUT) continue; int to = pure_module_input(module, old->input_names[i]); bool same = to >= 0 && module->input[to].kind == PURE_KIND_OUTPUT && module->input[to].field_count == old->input[i].field_count; for (uint32_t f = 0; same && f < old->input[i].field_count; ++f) { const PureField *now = &module->field[module->input[to].field_start + f], *was = &old->field[old->input[i].field_start + f]; same = now->type == was->type && !strcmp(now->name, was->name); } map[i] = same ? to : -1; size_t length = strlen(old->input_names[i]); for (size_t s = 0, count = app->outbox ? pure_list_count(app->outbox) : 0; !same && s < count; ++s) { PureCell name = pure_list_get(app->outbox, s, 0); if (name.size == length && !memcmp(name.text, old->input_names[i], length)) return PURE_CONFLICT; } } if (!apply) return PURE_OK; uint64_t last[PURE_MODULE_INPUTS] = {0}, saved[PURE_MODULE_INPUTS] = {0}; for (uint32_t i = 0; i < old->inputs; ++i) { if (old->input[i].kind != PURE_KIND_OUTPUT || !app->last_sent[i]) continue; if (map[i] >= 0) { last[map[i]] = app->last_sent[i]; saved[map[i]] = app->saved_sent[i]; continue; } struct PureCarried *grown = realloc(app->carried, (app->carried_count + 1) * sizeof(*grown)); if (!grown) continue; /* its numbers would start again: kept only while memory allows */ app->carried = grown; memcpy(grown[app->carried_count].name, old->input_names[i], PURE_MODULE_NAME); grown[app->carried_count++].last = app->last_sent[i]; app->links_changed = true; } for (unsigned c = 0; c < app->carried_count;) { int to = pure_module_input(module, app->carried[c].name); if (to < 0 || module->input[to].kind != PURE_KIND_OUTPUT || last[to]) { ++c; continue; } last[to] = saved[to] = app->carried[c].last; app->carried[c] = app->carried[--app->carried_count]; app->links_changed = true; } memcpy(app->last_sent, last, sizeof(last)); memcpy(app->saved_sent, saved, sizeof(saved)); return PURE_OK; } PURE_COLD static PureResult open_module(PureApp *app, const PureModule *module) { const PureModule *old = app->module; bool stored = pure_save_enabled(app); double values[PURE_MODULE_STATES] = {0}; PureDraft *texts[PURE_MODULE_STATES] = {0}, *list_drafts[PURE_MODULE_STATES] = {0}; PureList *lists[PURE_MODULE_STATES] = {0}; PureVersion saved[PURE_MODULE_STATES] = {{0, 0}}; PureSaved listed[PURE_MODULE_STATES] = {{0}}; int kept[PURE_MODULE_STATES]; bool rewrite[PURE_MODULE_STATES] = {false}; /* Lists are stored where the host names a directory for them (module-save.c). */ bool lists_stored = stored && app->data.directory && app->data.directory(app->data.context); if (old && app->checkpoint) return PURE_CONFLICT; /* the host has a checkpoint of the running module out */ PureResult result = !old && lists_stored ? pure_save_open_log(app) : PURE_OK; /* The numbers heard and the outbox belong to the app, whatever its module. */ PureSaved heard = {0}, sent = {0}; if (!old && result == PURE_OK) result = lists_stored ? pure_save_open_runtime(app, PURE_LIST_HEARD, &app->heard, &heard) : (app->heard = pure_runtime_list_new(PURE_LIST_HEARD)) ? PURE_OK : PURE_ALLOCATION; if (!old && result == PURE_OK) result = lists_stored ? pure_save_open_runtime(app, PURE_LIST_OUTBOX, &app->outbox, &sent) : (app->outbox = pure_runtime_list_new(PURE_LIST_OUTBOX)) ? PURE_OK : PURE_ALLOCATION; for (uint32_t i = 0; i < module->states; ++i) { int previous = old ? pure_module_state(old, module->state_names[i]) : -1; kept[i] = previous >= 0 && old->state_type[previous] == module->state_type[i] ? previous : -1; if (kept[i] >= 0) saved[i] = app->saved[kept[i]]; if (module->state_type[i] == PURE_STATE_TEXT) { if (kept[i] >= 0) texts[i] = app->texts[kept[i]]; else if (result == PURE_OK) result = stored ? pure_save_open_text(app, module, i, &texts[i], &saved[i]) : new_text(&texts[i], module, module->state_ref[i]); } else if (module->state_type[i] == PURE_STATE_LIST) { if (result != PURE_OK) continue; bool rows = module->state_flags[i] & PURE_LIST_ROWS >> 8; /* rows are never stored */ if (kept[i] >= 0) { result = keep_list(&lists[i], app->lists[kept[i]], old, old->state_ref[kept[i]], module, module->state_ref[i]); list_drafts[i] = app->list_drafts[kept[i]]; listed[i] = (PureSaved){app->image_seq[kept[i]], app->logged_since[kept[i]], app->logged[kept[i]], false}; /* Its record changed: its image, in the new fields, holds it before any change is logged. */ rewrite[i] = result == PURE_OK && lists_stored && !rows && lists[i] != app->lists[kept[i]]; } else if (lists_stored && !rows) { result = pure_save_open_list(app, module, i, &lists[i], &list_drafts[i], &listed[i]); rewrite[i] = result == PURE_OK && listed[i].rewrite; } else if (!(lists[i] = new_list(module, module->state_ref[i]))) result = PURE_ALLOCATION; } else values[i] = kept[i] >= 0 ? app->values[kept[i]] : module->initial[i]; } /* A keyed list keeps its items in key order: one that was not keyed, or * keyed by another field, is put in order and its indices follow their * items. Two items with one key refuse the module: nothing is dropped. */ size_t *moved[PURE_MODULE_STATES] = {0}; for (uint32_t i = 0; i < module->states && result == PURE_OK; ++i) { if (module->state_type[i] != PURE_STATE_LIST || !module->state_key[i]) continue; size_t count = pure_list_count(lists[i]); PureList *sorted = NULL; if (count && !(moved[i] = malloc(count * sizeof(**moved)))) result = PURE_ALLOCATION; else result = pure_list_sorted(lists[i], module->state_key[i] - 1u, &sorted, moved[i]); if (!sorted) { free(moved[i]); moved[i] = NULL; continue; } if (kept[i] < 0 || lists[i] != app->lists[kept[i]]) pure_list_free(lists[i]); lists[i] = sorted; rewrite[i] = lists_stored && !(module->state_flags[i] & PURE_LIST_ROWS >> 8); } /* A cursor or index keeps its position only while its text or list is the * one it belonged to. */ for (uint32_t i = 0; i < module->states; ++i) { if (module->state_type[i] != PURE_STATE_CURSOR && module->state_type[i] != PURE_STATE_INDEX) continue; uint32_t owner = module->state_ref[i]; bool same = kept[i] >= 0 && kept[owner] >= 0 && old->state_ref[kept[i]] == (unsigned)kept[owner]; values[i] = same ? app->values[kept[i]] : 0; } if (result == PURE_OK && stored) result = pure_save_open_values(app, module, values, kept, texts, lists); /* Outputs keep their sends and numbers by name. */ bool heard_moved = false, sent_moved = false; if (result == PURE_OK && !old && !stored) app->sent_saved = pure_list_count(app->outbox); if (result == PURE_OK) result = old ? remap_outputs(app, old, module, false) : stored ? pure_save_open_links(app, module, &heard_moved, &sent_moved) : PURE_OK; heard.rewrite = heard.rewrite || (heard_moved && lists_stored); sent.rewrite = sent.rewrite || (sent_moved && lists_stored); for (uint32_t i = 0; i < module->states; ++i) { uint32_t list = module->state_ref[i]; if (module->state_type[i] == PURE_STATE_INDEX && moved[list] && values[i] < (double)pure_list_count(lists[list])) values[i] = (double)moved[list][(size_t)values[i]]; } for (uint32_t i = 0; i < module->states; ++i) free(moved[i]); if (!old) pure_save_close_start(app); /* Images last, once nothing else can fail: first of the lists the new * module drops whose changes are only logged (the log lets them go), * then of the lists that need one. An image written cannot be taken * back: a running app that fails here saves nothing more until it starts * again, from what the store has. */ bool imaged = result == PURE_OK; for (uint32_t j = 0; result == PURE_OK && old && j < old->states; ++j) { bool dropped = old->state_type[j] == PURE_STATE_LIST && app->logged_since[j]; for (uint32_t i = 0; dropped && i < module->states; ++i) dropped = kept[i] != (int)j; if (dropped) result = pure_save_image(app, old, j, app->lists[j]); } for (uint32_t i = 0; i < module->states && result == PURE_OK; ++i) if (rewrite[i] && (result = pure_save_image(app, module, i, lists[i])) == PURE_OK) listed[i] = (PureSaved){.image = app->seq}; if (result == PURE_OK && heard.rewrite && (result = pure_save_runtime_image(app, PURE_LIST_HEARD)) == PURE_OK) heard = (PureSaved){.image = app->seq}; if (result == PURE_OK && sent.rewrite && (result = pure_save_runtime_image(app, PURE_LIST_OUTBOX)) == PURE_OK) sent = (PureSaved){.image = app->seq}; if (imaged && result != PURE_OK && old) app->uncertain = true; if (result != PURE_OK) { for (uint32_t i = 0; i < module->states; ++i) { if (kept[i] >= 0) { if (lists[i] && lists[i] != app->lists[kept[i]]) pure_list_free(lists[i]); continue; } pure_draft_close(texts[i]); pure_list_free(lists[i]); pure_draft_close(list_drafts[i]); } return result; } for (uint32_t i = 0; old && i < old->states; ++i) { bool reused = false, draft_reused = false; for (uint32_t k = 0; k < module->states; ++k) { reused = reused || (texts[k] && texts[k] == app->texts[i]) || (lists[k] && lists[k] == app->lists[i]); draft_reused = draft_reused || (list_drafts[k] && list_drafts[k] == app->list_drafts[i]); } if (!reused) { pure_draft_close(app->texts[i]); pure_list_free(app->lists[i]); } if (!draft_reused) pure_draft_close(app->list_drafts[i]); } memcpy(app->values, values, sizeof(values)); memcpy(app->texts, texts, sizeof(texts)); memcpy(app->lists, lists, sizeof(lists)); memcpy(app->list_drafts, list_drafts, sizeof(list_drafts)); memcpy(app->saved, saved, sizeof(saved)); for (uint32_t i = 0; i < PURE_MODULE_STATES; ++i) { app->image_seq[i] = listed[i].image; app->logged_since[i] = listed[i].since; app->logged[i] = listed[i].logged; } if (!old) { app->image_seq[PURE_LIST_HEARD] = heard.image; app->logged_since[PURE_LIST_HEARD] = heard.since; app->logged[PURE_LIST_HEARD] = heard.logged; app->image_seq[PURE_LIST_OUTBOX] = sent.image; app->logged_since[PURE_LIST_OUTBOX] = sent.since; app->logged[PURE_LIST_OUTBOX] = sent.logged; if (lists_stored) pure_list_journal(app->heard, true), pure_list_journal(app->outbox, true); } pure_save_release(app); for (uint32_t i = 0; i < module->states; ++i) { /* A stored list's changes are recorded from now on. */ if (lists_stored && module->state_type[i] == PURE_STATE_LIST && !(module->state_flags[i] & PURE_LIST_ROWS >> 8)) pure_list_journal(lists[i], true); /* Without memory for its keys a keyed list is still searched, only slower. */ if (module->state_type[i] == PURE_STATE_LIST) (void)pure_list_keyed(lists[i], module->state_key[i] ? (int)module->state_key[i] - 1 : -1); } if (old) remap_outputs(app, old, module, true); drop_passes(app); /* kept by instruction of the module they were made for */ app->module = module; app->counted = 0; for (uint32_t i = 0; i < module->states; ++i) if (module->state_type[i] == PURE_STATE_TEXT || (module->state_type[i] == PURE_STATE_LIST && !(module->state_flags[i] & PURE_LIST_ROWS >> 8))) app->counted |= UINT32_C(1) << i; /* a message's rows are its own, gone when it ends */ ++app->changes; return PURE_OK; } PURE_COLD PureResult pure_app_start(PureApp *app, const PureModule *module, PureData data) { *app = (PureApp){.data = data, .fault_pc = UINT32_MAX}; PureResult result = open_module(app, module); if (result == PURE_OK) result = pure_app_save(app); if (result != PURE_OK) pure_app_stop(app); return result; } PURE_COLD PureResult pure_app_replace(PureApp *app, const PureModule *module) { pure_app_finish(app); if (app->open || app->pending_count) { PureResult saved = pure_app_save(app); /* the burst belongs to the module that made it */ if (saved != PURE_OK) return saved; } return open_module(app, module); }