iobroker.javascript 10.2.5 → 10.4.0

package/build/lib/fb/analyze.js

@@ -0,0 +1,288 @@
+"use strict";
+Object.defineProperty(exports, "__esModule", { value: true });
+exports.formatIssue = formatIssue;
+exports.analyzeGraph = analyzeGraph;
+const graph_1 = require("./graph");
+const js_1 = require("./js");
+const library_1 = require("./library");
+const user_1 = require("./user");
+/**
+ * Strongly connected components (Tarjan). A component of one node only counts as a loop when the
+ * node feeds itself - the caller checks that.
+ */
+function findComponents(ids, edges) {
+    let index = 0;
+    const indices = new Map();
+    const lowLinks = new Map();
+    const stack = [];
+    const onStack = new Set();
+    const components = [];
+    const visit = (id) => {
+        indices.set(id, index);
+        lowLinks.set(id, index);
+        index++;
+        stack.push(id);
+        onStack.add(id);
+        for (const next of edges.get(id) || []) {
+            if (!indices.has(next)) {
+                visit(next);
+                lowLinks.set(id, Math.min(lowLinks.get(id), lowLinks.get(next)));
+            }
+            else if (onStack.has(next)) {
+                lowLinks.set(id, Math.min(lowLinks.get(id), indices.get(next)));
+            }
+        }
+        if (lowLinks.get(id) === indices.get(id)) {
+            const component = [];
+            let member;
+            do {
+                member = stack.pop();
+                onStack.delete(member);
+                component.push(member);
+            } while (member !== id);
+            components.push(component);
+        }
+    };
+    ids.forEach(id => !indices.has(id) && visit(id));
+    return components;
+}
+function isLoop(component, edges) {
+    return component.length > 1 || !!edges.get(component[0])?.has(component[0]);
+}
+function buildEdges(ids, links, skip) {
+    const edges = new Map(ids.map(id => [id, new Set()]));
+    for (const link of links) {
+        if (!skip?.(link)) {
+            edges.get(link.from[0])?.add(link.to[0]);
+        }
+    }
+    return edges;
+}
+/** A pin name becomes a property of the instance next to `run()` */
+const PIN_NAME = /^[A-Za-z_][A-Za-z0-9_]*$/;
+const RESERVED_PINS = ['run', 'self', 'constructor', 'prototype', '__proto__'];
+function formatIssue(issue) {
+    let index = 0;
+    return issue.message.replace(/%s/g, () => issue.args?.[index++] ?? '');
+}
+/** Checks a user block once per analysis; its errors become one error of the instance */
+function checkUserBlock(user, options) {
+    if (options.visiting.has(user.type)) {
+        return 'The block %s contains itself';
+    }
+    let analysis = options.cache.get(user.type);
+    if (!analysis) {
+        options.visiting.add(user.type);
+        analysis = analyzeGraph(user.graph, { ...options, isBlock: true });
+        options.visiting.delete(user.type);
+        options.cache.set(user.type, analysis);
+    }
+    return analysis.issues.some(issue => issue.severity === 'error') ? 'The block %s has errors: %s' : null;
+}
+/**
+ * Checks a diagram and works out the execution order.
+ *
+ * The order follows the data flow. A loop is only allowed when it runs through a block with a
+ * state (a timer, a flip-flop, a user block, ...): the link that leads back reads what that block
+ * put out in the previous cycle, as in any SPS. A loop without such a block has no solution and is
+ * an error.
+ */
+function analyzeGraph(graph, analyzeOptions) {
+    const options = {
+        userBlocks: analyzeOptions?.userBlocks || graph.userBlocks || {},
+        isBlock: analyzeOptions?.isBlock ?? !!graph.block,
+        visiting: analyzeOptions?.visiting || new Set(graph.block ? [graph.block.type] : []),
+        cache: analyzeOptions?.cache || new Map(),
+    };
+    const issues = [];
+    const nodes = new Map();
+    if (graph.block && !user_1.FB_USER_TYPE_PATTERN.test(graph.block.type)) {
+        issues.push({ severity: 'error', message: 'Invalid block type %s', args: [graph.block.type] });
+    }
+    const pins = new Set();
+    for (const block of graph.blocks) {
+        if (!graph_1.FB_ID_PATTERN.test(block.id || '')) {
+            issues.push({ severity: 'error', message: 'Invalid block ID %s', args: [String(block.id)] });
+            continue;
+        }
+        if (nodes.has(block.id)) {
+            issues.push({ severity: 'error', message: 'Duplicate block ID %s', args: [block.id], blockId: block.id });
+            continue;
+        }
+        const def = (0, library_1.getBlockDef)(block.type, options.userBlocks);
+        if (!def) {
+            issues.push({ severity: 'error', message: 'Unknown block type %s', args: [block.type], blockId: block.id });
+            continue;
+        }
+        nodes.set(block.id, { block, def });
+        for (const param of def.params || []) {
+            const value = block.params?.[param.id] ?? param.default;
+            if (param.required && (value === undefined || value === null || value === '')) {
+                issues.push({
+                    severity: 'error',
+                    message: 'Parameter "%s" is not set',
+                    args: [param.id],
+                    blockId: block.id,
+                });
+            }
+        }
+        if (def.category === 'interface') {
+            if (!options.isBlock) {
+                issues.push({
+                    severity: 'error',
+                    message: 'Inputs and outputs of a block only work in the diagram of a block',
+                    blockId: block.id,
+                });
+            }
+            const pin = String(block.params?.pin ?? '');
+            if (pin && (!PIN_NAME.test(pin) || RESERVED_PINS.includes(pin))) {
+                issues.push({ severity: 'error', message: 'Invalid pin name %s', args: [pin], blockId: block.id });
+            }
+            else if (pin && pins.has(pin)) {
+                issues.push({
+                    severity: 'error',
+                    message: 'The pin name %s is used twice',
+                    args: [pin],
+                    blockId: block.id,
+                });
+            }
+            pins.add(pin);
+        }
+        else if (options.isBlock && (block.type === 'STATE_IN' || block.type === 'STATE_OUT')) {
+            issues.push({
+                severity: 'error',
+                message: 'A block cannot read or write states - give it inputs and outputs instead',
+                blockId: block.id,
+            });
+        }
+        if (def.user) {
+            const problem = checkUserBlock(def.user, options);
+            if (problem) {
+                const inner = options.cache.get(def.user.type)?.issues.find(issue => issue.severity === 'error');
+                issues.push({
+                    severity: 'error',
+                    message: problem,
+                    args: inner ? [def.user.name, formatIssue(inner)] : [def.user.name],
+                    blockId: block.id,
+                });
+            }
+        }
+        if (block.type === 'JS') {
+            const problem = (0, js_1.checkJsCode)((0, js_1.jsCode)(block, def), (0, js_1.jsParameters)(block, def));
+            if (problem) {
+                issues.push({
+                    severity: 'error',
+                    message: 'The code has an error: %s',
+                    args: [problem],
+                    blockId: block.id,
+                });
+            }
+        }
+    }
+    // links: both ends must exist, the types must fit, and an input takes one signal only
+    const links = [];
+    const driven = new Set();
+    for (const link of graph.links) {
+        const from = nodes.get(link.from[0]);
+        const to = nodes.get(link.to[0]);
+        const output = from && (0, graph_1.getOutputs)(from.block, from.def).find(pin => pin.id === link.from[1]);
+        const input = to && (0, graph_1.getInputs)(to.block, to.def).find(pin => pin.id === link.to[1]);
+        if (!output || !input) {
+            issues.push({
+                severity: 'error',
+                message: 'The connection refers to a missing block or pin',
+                linkId: link.id,
+                blockId: to ? link.to[0] : from ? link.from[0] : undefined,
+            });
+            continue;
+        }
+        if (!(0, graph_1.isCompatible)(output.type, input.type)) {
+            issues.push({
+                severity: 'error',
+                message: 'Types do not match: %s cannot be connected to %s',
+                args: [output.type, input.type],
+                linkId: link.id,
+                blockId: link.to[0],
+            });
+            continue;
+        }
+        const key = `${link.to[0]}.${link.to[1]}`;
+        if (driven.has(key)) {
+            issues.push({
+                severity: 'error',
+                message: 'Input %s is connected more than once',
+                args: [link.to[1]],
+                linkId: link.id,
+                blockId: link.to[0],
+            });
+            continue;
+        }
+        driven.add(key);
+        links.push(link);
+    }
+    // Loops: inside a loop, the links that start at a block with a state may lead back. Whatever
+    // is still a loop without them has no block to take the value of the previous cycle from.
+    const ids = [...nodes.keys()];
+    const allEdges = buildEdges(ids, links);
+    const inLoop = new Map();
+    findComponents(ids, allEdges)
+        .filter(component => isLoop(component, allEdges))
+        .forEach((component, i) => component.forEach(id => inLoop.set(id, i)));
+    const breakable = (link) => !!nodes.get(link.from[0])?.def.stateful &&
+        inLoop.has(link.from[0]) &&
+        inLoop.get(link.from[0]) === inLoop.get(link.to[0]);
+    const orderEdges = buildEdges(ids, links, breakable);
+    for (const component of findComponents(ids, orderEdges)) {
+        if (isLoop(component, orderEdges)) {
+            const names = component
+                .map(id => nodes.get(id).block)
+                .sort(byPosition)
+                .map(block => block.name || block.id);
+            issues.push({
+                severity: 'error',
+                message: 'Loop without a block that stores a value: %s',
+                args: [names.join(', ')],
+                blockIds: component,
+            });
+        }
+    }
+    // topological order; blocks that are ready at the same time run from left to right, then top down
+    const incoming = new Map(ids.map(id => [id, 0]));
+    orderEdges.forEach(targets => targets.forEach(id => incoming.set(id, incoming.get(id) + 1)));
+    const ready = ids.filter(id => !incoming.get(id));
+    const sequence = [];
+    while (ready.length) {
+        ready.sort((a, b) => byPosition(nodes.get(a).block, nodes.get(b).block));
+        const id = ready.shift();
+        sequence.push(id);
+        for (const next of orderEdges.get(id)) {
+            const count = incoming.get(next) - 1;
+            incoming.set(next, count);
+            if (!count) {
+                ready.push(next);
+            }
+        }
+    }
+    // blocks of an unsolvable loop still get a number, so the editor can show one
+    ids.filter(id => !sequence.includes(id))
+        .sort((a, b) => byPosition(nodes.get(a).block, nodes.get(b).block))
+        .forEach(id => sequence.push(id));
+    const order = {};
+    sequence.forEach((id, i) => (order[id] = (i + 1) * 10));
+    const feedback = links.filter(link => order[link.from[0]] >= order[link.to[0]]).map(link => link.id);
+    const timeDependent = [...nodes.values()].some(node => node.def.timeDependent);
+    const mode = graph.cycle.mode === 'auto' ? (timeDependent ? 'cyclic' : 'event') : graph.cycle.mode;
+    const ms = Math.max(graph_1.FB_CYCLE_MIN_MS, Math.min(graph_1.FB_CYCLE_MAX_MS, Math.round(Number(graph.cycle.ms) || graph_1.FB_CYCLE_DEFAULT_MS)));
+    // the mode of a block is the one of the diagram it is used in
+    if (mode === 'event' && timeDependent && !options.isBlock) {
+        issues.push({
+            severity: 'warning',
+            message: 'Timers need the cyclic mode, in the event mode they only run when an input changes',
+        });
+    }
+    return { issues, order, feedback, links, mode, ms };
+}
+function byPosition(a, b) {
+    return a.pos[0] - b.pos[0] || a.pos[1] - b.pos[1] || (a.id < b.id ? -1 : a.id > b.id ? 1 : 0);
+}
+//# sourceMappingURL=analyze.js.map

package/build/lib/fb/analyze.js.map

@@ -0,0 +1 @@
+{"version":3,"file":"analyze.js","sourceRoot":"","sources":["../../../src/lib/fb/analyze.ts"],"names":[],"mappings":";;AA0GA,kCAGC;AAyBD,oCAmNC;AAzVD,mCAQiB;AACjB,6BAAyD;AACzD,uCAAwC;AAExC,iCAA8C;AAqB9C;;;GAGG;AACH,SAAS,cAAc,CAAC,GAAa,EAAE,KAA+B;IAClE,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,MAAM,OAAO,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC1C,MAAM,QAAQ,GAAG,IAAI,GAAG,EAAkB,CAAC;IAC3C,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,OAAO,GAAG,IAAI,GAAG,EAAU,CAAC;IAClC,MAAM,UAAU,GAAe,EAAE,CAAC;IAElC,MAAM,KAAK,GAAG,CAAC,EAAU,EAAQ,EAAE;QAC/B,OAAO,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACvB,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,KAAK,CAAC,CAAC;QACxB,KAAK,EAAE,CAAC;QACR,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QACf,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC;QAEhB,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,EAAE,EAAE,CAAC;YACrC,IAAI,CAAC,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBACrB,KAAK,CAAC,IAAI,CAAC,CAAC;gBACZ,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;YACvE,CAAC;iBAAM,IAAI,OAAO,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC;gBAC3B,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,IAAI,CAAC,GAAG,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,OAAO,CAAC,GAAG,CAAC,IAAI,CAAE,CAAC,CAAC,CAAC;YACtE,CAAC;QACL,CAAC;QAED,IAAI,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,KAAK,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC;YACvC,MAAM,SAAS,GAAa,EAAE,CAAC;YAC/B,IAAI,MAAc,CAAC;YACnB,GAAG,CAAC;gBACA,MAAM,GAAG,KAAK,CAAC,GAAG,EAAG,CAAC;gBACtB,OAAO,CAAC,MAAM,CAAC,MAAM,CAAC,CAAC;gBACvB,SAAS,CAAC,IAAI,CAAC,MAAM,CAAC,CAAC;YAC3B,CAAC,QAAQ,MAAM,KAAK,EAAE,EAAE;YACxB,UAAU,CAAC,IAAI,CAAC,SAAS,CAAC,CAAC;QAC/B,CAAC;IACL,CAAC,CAAC;IAEF,GAAG,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,OAAO,CAAC,GAAG,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC,CAAC;IACjD,OAAO,UAAU,CAAC;AACtB,CAAC;AAED,SAAS,MAAM,CAAC,SAAmB,EAAE,KAA+B;IAChE,OAAO,SAAS,CAAC,MAAM,GAAG,CAAC,IAAI,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,SAAS,CAAC,CAAC,CAAC,CAAC,CAAC;AAChF,CAAC;AAED,SAAS,UAAU,CAAC,GAAa,EAAE,KAAe,EAAE,IAAgC;IAChF,MAAM,KAAK,GAAG,IAAI,GAAG,CAAsB,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,IAAI,GAAG,EAAU,CAAC,CAAC,CAAC,CAAC;IACnF,KAAK,MAAM,IAAI,IAAI,KAAK,EAAE,CAAC;QACvB,IAAI,CAAC,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC;YAChB,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7C,CAAC;IACL,CAAC;IACD,OAAO,KAAK,CAAC;AACjB,CAAC;AAaD,oEAAoE;AACpE,MAAM,QAAQ,GAAG,0BAA0B,CAAC;AAC5C,MAAM,aAAa,GAAG,CAAC,KAAK,EAAE,MAAM,EAAE,aAAa,EAAE,WAAW,EAAE,WAAW,CAAC,CAAC;AAE/E,SAAgB,WAAW,CAAC,KAAc;IACtC,IAAI,KAAK,GAAG,CAAC,CAAC;IACd,OAAO,KAAK,CAAC,OAAO,CAAC,OAAO,CAAC,KAAK,EAAE,GAAG,EAAE,CAAC,KAAK,CAAC,IAAI,EAAE,CAAC,KAAK,EAAE,CAAC,IAAI,EAAE,CAAC,CAAC;AAC3E,CAAC;AAED,yFAAyF;AACzF,SAAS,cAAc,CAAC,IAAiB,EAAE,OAAmC;IAC1E,IAAI,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC;QAClC,OAAO,8BAA8B,CAAC;IAC1C,CAAC;IACD,IAAI,QAAQ,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IAC5C,IAAI,CAAC,QAAQ,EAAE,CAAC;QACZ,OAAO,CAAC,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QAChC,QAAQ,GAAG,YAAY,CAAC,IAAI,CAAC,KAAK,EAAE,EAAE,GAAG,OAAO,EAAE,OAAO,EAAE,IAAI,EAAE,CAAC,CAAC;QACnE,OAAO,CAAC,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;QACnC,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,QAAQ,CAAC,CAAC;IAC3C,CAAC;IACD,OAAO,QAAQ,CAAC,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC,CAAC,CAAC,6BAA6B,CAAC,CAAC,CAAC,IAAI,CAAC;AAC5G,CAAC;AAED;;;;;;;GAOG;AACH,SAAgB,YAAY,CAAC,KAAc,EAAE,cAAiC;IAC1E,MAAM,OAAO,GAA+B;QACxC,UAAU,EAAE,cAAc,EAAE,UAAU,IAAI,KAAK,CAAC,UAAU,IAAI,EAAE;QAChE,OAAO,EAAE,cAAc,EAAE,OAAO,IAAI,CAAC,CAAC,KAAK,CAAC,KAAK;QACjD,QAAQ,EAAE,cAAc,EAAE,QAAQ,IAAI,IAAI,GAAG,CAAC,KAAK,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,CAAC;QACpF,KAAK,EAAE,cAAc,EAAE,KAAK,IAAI,IAAI,GAAG,EAAE;KAC5C,CAAC;IACF,MAAM,MAAM,GAAc,EAAE,CAAC;IAC7B,MAAM,KAAK,GAAG,IAAI,GAAG,EAAgB,CAAC;IAEtC,IAAI,KAAK,CAAC,KAAK,IAAI,CAAC,2BAAoB,CAAC,IAAI,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;QAC9D,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IACnG,CAAC;IACD,MAAM,IAAI,GAAG,IAAI,GAAG,EAAU,CAAC;IAE/B,KAAK,MAAM,KAAK,IAAI,KAAK,CAAC,MAAM,EAAE,CAAC;QAC/B,IAAI,CAAC,qBAAa,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,IAAI,EAAE,CAAC,EAAE,CAAC;YACtC,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,qBAAqB,EAAE,IAAI,EAAE,CAAC,MAAM,CAAC,KAAK,CAAC,EAAE,CAAC,CAAC,EAAE,CAAC,CAAC;YAC7F,SAAS;QACb,CAAC;QACD,IAAI,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,CAAC;YACtB,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YAC1G,SAAS;QACb,CAAC;QACD,MAAM,GAAG,GAAG,IAAA,qBAAW,EAAC,KAAK,CAAC,IAAI,EAAE,OAAO,CAAC,UAAU,CAAC,CAAC;QACxD,IAAI,CAAC,GAAG,EAAE,CAAC;YACP,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,uBAAuB,EAAE,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YAC5G,SAAS;QACb,CAAC;QACD,KAAK,CAAC,GAAG,CAAC,KAAK,CAAC,EAAE,EAAE,EAAE,KAAK,EAAE,GAAG,EAAE,CAAC,CAAC;QAEpC,KAAK,MAAM,KAAK,IAAI,GAAG,CAAC,MAAM,IAAI,EAAE,EAAE,CAAC;YACnC,MAAM,KAAK,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,KAAK,CAAC,OAAO,CAAC;YACxD,IAAI,KAAK,CAAC,QAAQ,IAAI,CAAC,KAAK,KAAK,SAAS,IAAI,KAAK,KAAK,IAAI,IAAI,KAAK,KAAK,EAAE,CAAC,EAAE,CAAC;gBAC5E,MAAM,CAAC,IAAI,CAAC;oBACR,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,2BAA2B;oBACpC,IAAI,EAAE,CAAC,KAAK,CAAC,EAAE,CAAC;oBAChB,OAAO,EAAE,KAAK,CAAC,EAAE;iBACpB,CAAC,CAAC;YACP,CAAC;QACL,CAAC;QAED,IAAI,GAAG,CAAC,QAAQ,KAAK,WAAW,EAAE,CAAC;YAC/B,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;gBACnB,MAAM,CAAC,IAAI,CAAC;oBACR,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,mEAAmE;oBAC5E,OAAO,EAAE,KAAK,CAAC,EAAE;iBACpB,CAAC,CAAC;YACP,CAAC;YACD,MAAM,GAAG,GAAG,MAAM,CAAC,KAAK,CAAC,MAAM,EAAE,GAAG,IAAI,EAAE,CAAC,CAAC;YAC5C,IAAI,GAAG,IAAI,CAAC,CAAC,QAAQ,CAAC,IAAI,CAAC,GAAG,CAAC,IAAI,aAAa,CAAC,QAAQ,CAAC,GAAG,CAAC,CAAC,EAAE,CAAC;gBAC9D,MAAM,CAAC,IAAI,CAAC,EAAE,QAAQ,EAAE,OAAO,EAAE,OAAO,EAAE,qBAAqB,EAAE,IAAI,EAAE,CAAC,GAAG,CAAC,EAAE,OAAO,EAAE,KAAK,CAAC,EAAE,EAAE,CAAC,CAAC;YACvG,CAAC;iBAAM,IAAI,GAAG,IAAI,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;gBAC9B,MAAM,CAAC,IAAI,CAAC;oBACR,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,+BAA+B;oBACxC,IAAI,EAAE,CAAC,GAAG,CAAC;oBACX,OAAO,EAAE,KAAK,CAAC,EAAE;iBACpB,CAAC,CAAC;YACP,CAAC;YACD,IAAI,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAClB,CAAC;aAAM,IAAI,OAAO,CAAC,OAAO,IAAI,CAAC,KAAK,CAAC,IAAI,KAAK,UAAU,IAAI,KAAK,CAAC,IAAI,KAAK,WAAW,CAAC,EAAE,CAAC;YACtF,MAAM,CAAC,IAAI,CAAC;gBACR,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,0EAA0E;gBACnF,OAAO,EAAE,KAAK,CAAC,EAAE;aACpB,CAAC,CAAC;QACP,CAAC;QAED,IAAI,GAAG,CAAC,IAAI,EAAE,CAAC;YACX,MAAM,OAAO,GAAG,cAAc,CAAC,GAAG,CAAC,IAAI,EAAE,OAAO,CAAC,CAAC;YAClD,IAAI,OAAO,EAAE,CAAC;gBACV,MAAM,KAAK,GAAG,OAAO,CAAC,KAAK,CAAC,GAAG,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,MAAM,CAAC,IAAI,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,QAAQ,KAAK,OAAO,CAAC,CAAC;gBACjG,MAAM,CAAC,IAAI,CAAC;oBACR,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,OAAO;oBAChB,IAAI,EAAE,KAAK,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,EAAE,WAAW,CAAC,KAAK,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC;oBACnE,OAAO,EAAE,KAAK,CAAC,EAAE;iBACpB,CAAC,CAAC;YACP,CAAC;QACL,CAAC;QAED,IAAI,KAAK,CAAC,IAAI,KAAK,IAAI,EAAE,CAAC;YACtB,MAAM,OAAO,GAAG,IAAA,gBAAW,EAAC,IAAA,WAAM,EAAC,KAAK,EAAE,GAAG,CAAC,EAAE,IAAA,iBAAY,EAAC,KAAK,EAAE,GAAG,CAAC,CAAC,CAAC;YAC1E,IAAI,OAAO,EAAE,CAAC;gBACV,MAAM,CAAC,IAAI,CAAC;oBACR,QAAQ,EAAE,OAAO;oBACjB,OAAO,EAAE,2BAA2B;oBACpC,IAAI,EAAE,CAAC,OAAO,CAAC;oBACf,OAAO,EAAE,KAAK,CAAC,EAAE;iBACpB,CAAC,CAAC;YACP,CAAC;QACL,CAAC;IACL,CAAC;IAED,sFAAsF;IACtF,MAAM,KAAK,GAAa,EAAE,CAAC;IAC3B,MAAM,MAAM,GAAG,IAAI,GAAG,EAAU,CAAC;IACjC,KAAK,MAAM,IAAI,IAAI,KAAK,CAAC,KAAK,EAAE,CAAC;QAC7B,MAAM,IAAI,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QACrC,MAAM,EAAE,GAAG,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACjC,MAAM,MAAM,GAAG,IAAI,IAAI,IAAA,kBAAU,EAAC,IAAI,CAAC,KAAK,EAAE,IAAI,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC;QAC7F,MAAM,KAAK,GAAG,EAAE,IAAI,IAAA,iBAAS,EAAC,EAAE,CAAC,KAAK,EAAE,EAAE,CAAC,GAAG,CAAC,CAAC,IAAI,CAAC,GAAG,CAAC,EAAE,CAAC,GAAG,CAAC,EAAE,KAAK,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;QACnF,IAAI,CAAC,MAAM,IAAI,CAAC,KAAK,EAAE,CAAC;YACpB,MAAM,CAAC,IAAI,CAAC;gBACR,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,iDAAiD;gBAC1D,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,OAAO,EAAE,EAAE,CAAC,CAAC,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,SAAS;aAC7D,CAAC,CAAC;YACH,SAAS;QACb,CAAC;QACD,IAAI,CAAC,IAAA,oBAAY,EAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC;YACzC,MAAM,CAAC,IAAI,CAAC;gBACR,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,kDAAkD;gBAC3D,IAAI,EAAE,CAAC,MAAM,CAAC,IAAI,EAAE,KAAK,CAAC,IAAI,CAAC;gBAC/B,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aACtB,CAAC,CAAC;YACH,SAAS;QACb,CAAC;QACD,MAAM,GAAG,GAAG,GAAG,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,IAAI,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,EAAE,CAAC;QAC1C,IAAI,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC;YAClB,MAAM,CAAC,IAAI,CAAC;gBACR,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,sCAAsC;gBAC/C,IAAI,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC;gBAClB,MAAM,EAAE,IAAI,CAAC,EAAE;gBACf,OAAO,EAAE,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;aACtB,CAAC,CAAC;YACH,SAAS;QACb,CAAC;QACD,MAAM,CAAC,GAAG,CAAC,GAAG,CAAC,CAAC;QAChB,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;IACrB,CAAC;IAED,6FAA6F;IAC7F,0FAA0F;IAC1F,MAAM,GAAG,GAAG,CAAC,GAAG,KAAK,CAAC,IAAI,EAAE,CAAC,CAAC;IAC9B,MAAM,QAAQ,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,CAAC,CAAC;IACxC,MAAM,MAAM,GAAG,IAAI,GAAG,EAAkB,CAAC;IACzC,cAAc,CAAC,GAAG,EAAE,QAAQ,CAAC;SACxB,MAAM,CAAC,SAAS,CAAC,EAAE,CAAC,MAAM,CAAC,SAAS,EAAE,QAAQ,CAAC,CAAC;SAChD,OAAO,CAAC,CAAC,SAAS,EAAE,CAAC,EAAE,EAAE,CAAC,SAAS,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,MAAM,CAAC,GAAG,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAE3E,MAAM,SAAS,GAAG,CAAC,IAAY,EAAW,EAAE,CACxC,CAAC,CAAC,KAAK,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,QAAQ;QACvC,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC;QACxB,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,KAAK,MAAM,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IAExD,MAAM,UAAU,GAAG,UAAU,CAAC,GAAG,EAAE,KAAK,EAAE,SAAS,CAAC,CAAC;IACrD,KAAK,MAAM,SAAS,IAAI,cAAc,CAAC,GAAG,EAAE,UAAU,CAAC,EAAE,CAAC;QACtD,IAAI,MAAM,CAAC,SAAS,EAAE,UAAU,CAAC,EAAE,CAAC;YAChC,MAAM,KAAK,GAAG,SAAS;iBAClB,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,KAAK,CAAC,GAAG,CAAC,EAAE,CAAE,CAAC,KAAK,CAAC;iBAC/B,IAAI,CAAC,UAAU,CAAC;iBAChB,GAAG,CAAC,KAAK,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,IAAI,KAAK,CAAC,EAAE,CAAC,CAAC;YAC1C,MAAM,CAAC,IAAI,CAAC;gBACR,QAAQ,EAAE,OAAO;gBACjB,OAAO,EAAE,8CAA8C;gBACvD,IAAI,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;gBACxB,QAAQ,EAAE,SAAS;aACtB,CAAC,CAAC;QACP,CAAC;IACL,CAAC;IAED,kGAAkG;IAClG,MAAM,QAAQ,GAAG,IAAI,GAAG,CAAiB,GAAG,CAAC,GAAG,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,EAAE,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC;IACjE,UAAU,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,OAAO,CAAC,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,EAAE,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAE,GAAG,CAAC,CAAC,CAAC,CAAC,CAAC;IAC9F,MAAM,KAAK,GAAG,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,GAAG,CAAC,EAAE,CAAC,CAAC,CAAC;IAClD,MAAM,QAAQ,GAAa,EAAE,CAAC;IAC9B,OAAO,KAAK,CAAC,MAAM,EAAE,CAAC;QAClB,KAAK,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC,CAAC;QAC3E,MAAM,EAAE,GAAG,KAAK,CAAC,KAAK,EAAG,CAAC;QAC1B,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;QAClB,KAAK,MAAM,IAAI,IAAI,UAAU,CAAC,GAAG,CAAC,EAAE,CAAE,EAAE,CAAC;YACrC,MAAM,KAAK,GAAG,QAAQ,CAAC,GAAG,CAAC,IAAI,CAAE,GAAG,CAAC,CAAC;YACtC,QAAQ,CAAC,GAAG,CAAC,IAAI,EAAE,KAAK,CAAC,CAAC;YAC1B,IAAI,CAAC,KAAK,EAAE,CAAC;gBACT,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC;YACrB,CAAC;QACL,CAAC;IACL,CAAC;IACD,8EAA8E;IAC9E,GAAG,CAAC,MAAM,CAAC,EAAE,CAAC,EAAE,CAAC,CAAC,QAAQ,CAAC,QAAQ,CAAC,EAAE,CAAC,CAAC;SACnC,IAAI,CAAC,CAAC,CAAC,EAAE,CAAC,EAAE,EAAE,CAAC,UAAU,CAAC,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,KAAK,EAAE,KAAK,CAAC,GAAG,CAAC,CAAC,CAAE,CAAC,KAAK,CAAC,CAAC;SACpE,OAAO,CAAC,EAAE,CAAC,EAAE,CAAC,QAAQ,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC;IAEtC,MAAM,KAAK,GAA2B,EAAE,CAAC;IACzC,QAAQ,CAAC,OAAO,CAAC,CAAC,EAAE,EAAE,CAAC,EAAE,EAAE,CAAC,CAAC,KAAK,CAAC,EAAE,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,EAAE,CAAC,CAAC,CAAC;IAExD,MAAM,QAAQ,GAAG,KAAK,CAAC,MAAM,CAAC,IAAI,CAAC,EAAE,CAAC,KAAK,CAAC,IAAI,CAAC,IAAI,CAAC,CAAC,CAAC,CAAC,IAAI,KAAK,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,GAAG,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,EAAE,CAAC,CAAC;IAErG,MAAM,aAAa,GAAG,CAAC,GAAG,KAAK,CAAC,MAAM,EAAE,CAAC,CAAC,IAAI,CAAC,IAAI,CAAC,EAAE,CAAC,IAAI,CAAC,GAAG,CAAC,aAAa,CAAC,CAAC;IAC/E,MAAM,IAAI,GAAG,KAAK,CAAC,KAAK,CAAC,IAAI,KAAK,MAAM,CAAC,CAAC,CAAC,CAAC,aAAa,CAAC,CAAC,CAAC,QAAQ,CAAC,CAAC,CAAC,OAAO,CAAC,CAAC,CAAC,CAAC,KAAK,CAAC,KAAK,CAAC,IAAI,CAAC;IACnG,MAAM,EAAE,GAAG,IAAI,CAAC,GAAG,CACf,uBAAe,EACf,IAAI,CAAC,GAAG,CAAC,uBAAe,EAAE,IAAI,CAAC,KAAK,CAAC,MAAM,CAAC,KAAK,CAAC,KAAK,CAAC,EAAE,CAAC,IAAI,2BAAmB,CAAC,CAAC,CACvF,CAAC;IACF,8DAA8D;IAC9D,IAAI,IAAI,KAAK,OAAO,IAAI,aAAa,IAAI,CAAC,OAAO,CAAC,OAAO,EAAE,CAAC;QACxD,MAAM,CAAC,IAAI,CAAC;YACR,QAAQ,EAAE,SAAS;YACnB,OAAO,EAAE,oFAAoF;SAChG,CAAC,CAAC;IACP,CAAC;IAED,OAAO,EAAE,MAAM,EAAE,KAAK,EAAE,QAAQ,EAAE,KAAK,EAAE,IAAI,EAAE,EAAE,EAAE,CAAC;AACxD,CAAC;AAED,SAAS,UAAU,CAAC,CAAU,EAAE,CAAU;IACtC,OAAO,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,GAAG,CAAC,CAAC,GAAG,CAAC,CAAC,CAAC,IAAI,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,EAAE,GAAG,CAAC,CAAC,EAAE,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC,CAAC;AAClG,CAAC","sourcesContent":["import {\n    FB_CYCLE_DEFAULT_MS,\n    FB_CYCLE_MAX_MS,\n    FB_CYCLE_MIN_MS,\n    FB_ID_PATTERN,\n    getInputs,\n    getOutputs,\n    isCompatible,\n} from './graph';\nimport { checkJsCode, jsCode, jsParameters } from './js';\nimport { getBlockDef } from './library';\nimport type { FbBlock, FbBlockDef, FbGraph, FbIssue, FbLink, FbUserBlock } from './types';\nimport { FB_USER_TYPE_PATTERN } from './user';\n\nexport interface FbAnalysis {\n    issues: FbIssue[];\n    /** Position of each block in the execution order: 10, 20, 30, ... */\n    order: Record<string, number>;\n    /** The links that carry the value of the previous cycle, because they lead back in the order */\n    feedback: string[];\n    /** The links that can be turned into code, in the order of `graph.links` */\n    links: FbLink[];\n    /** How the diagram runs: `auto` resolved */\n    mode: 'cyclic' | 'event';\n    /** Interval of the cyclic mode in ms */\n    ms: number;\n}\n\ninterface Node {\n    block: FbBlock;\n    def: FbBlockDef;\n}\n\n/**\n * Strongly connected components (Tarjan). A component of one node only counts as a loop when the\n * node feeds itself - the caller checks that.\n */\nfunction findComponents(ids: string[], edges: Map<string, Set<string>>): string[][] {\n    let index = 0;\n    const indices = new Map<string, number>();\n    const lowLinks = new Map<string, number>();\n    const stack: string[] = [];\n    const onStack = new Set<string>();\n    const components: string[][] = [];\n\n    const visit = (id: string): void => {\n        indices.set(id, index);\n        lowLinks.set(id, index);\n        index++;\n        stack.push(id);\n        onStack.add(id);\n\n        for (const next of edges.get(id) || []) {\n            if (!indices.has(next)) {\n                visit(next);\n                lowLinks.set(id, Math.min(lowLinks.get(id)!, lowLinks.get(next)!));\n            } else if (onStack.has(next)) {\n                lowLinks.set(id, Math.min(lowLinks.get(id)!, indices.get(next)!));\n            }\n        }\n\n        if (lowLinks.get(id) === indices.get(id)) {\n            const component: string[] = [];\n            let member: string;\n            do {\n                member = stack.pop()!;\n                onStack.delete(member);\n                component.push(member);\n            } while (member !== id);\n            components.push(component);\n        }\n    };\n\n    ids.forEach(id => !indices.has(id) && visit(id));\n    return components;\n}\n\nfunction isLoop(component: string[], edges: Map<string, Set<string>>): boolean {\n    return component.length > 1 || !!edges.get(component[0])?.has(component[0]);\n}\n\nfunction buildEdges(ids: string[], links: FbLink[], skip?: (link: FbLink) => boolean): Map<string, Set<string>> {\n    const edges = new Map<string, Set<string>>(ids.map(id => [id, new Set<string>()]));\n    for (const link of links) {\n        if (!skip?.(link)) {\n            edges.get(link.from[0])?.add(link.to[0]);\n        }\n    }\n    return edges;\n}\n\nexport interface FbAnalyzeOptions {\n    /** The user blocks the diagram may use - by default its own copies */\n    userBlocks?: Record<string, FbUserBlock>;\n    /** The diagram is a block: FB_IN and FB_OUT make its pins, states are not reachable */\n    isBlock?: boolean;\n    /** The user blocks being checked further up, against a block that contains itself */\n    visiting?: Set<string>;\n    /** Results of user blocks checked already */\n    cache?: Map<string, FbAnalysis>;\n}\n\n/** A pin name becomes a property of the instance next to `run()` */\nconst PIN_NAME = /^[A-Za-z_][A-Za-z0-9_]*$/;\nconst RESERVED_PINS = ['run', 'self', 'constructor', 'prototype', '__proto__'];\n\nexport function formatIssue(issue: FbIssue): string {\n    let index = 0;\n    return issue.message.replace(/%s/g, () => issue.args?.[index++] ?? '');\n}\n\n/** Checks a user block once per analysis; its errors become one error of the instance */\nfunction checkUserBlock(user: FbUserBlock, options: Required<FbAnalyzeOptions>): string | null {\n    if (options.visiting.has(user.type)) {\n        return 'The block %s contains itself';\n    }\n    let analysis = options.cache.get(user.type);\n    if (!analysis) {\n        options.visiting.add(user.type);\n        analysis = analyzeGraph(user.graph, { ...options, isBlock: true });\n        options.visiting.delete(user.type);\n        options.cache.set(user.type, analysis);\n    }\n    return analysis.issues.some(issue => issue.severity === 'error') ? 'The block %s has errors: %s' : null;\n}\n\n/**\n * Checks a diagram and works out the execution order.\n *\n * The order follows the data flow. A loop is only allowed when it runs through a block with a\n * state (a timer, a flip-flop, a user block, ...): the link that leads back reads what that block\n * put out in the previous cycle, as in any SPS. A loop without such a block has no solution and is\n * an error.\n */\nexport function analyzeGraph(graph: FbGraph, analyzeOptions?: FbAnalyzeOptions): FbAnalysis {\n    const options: Required<FbAnalyzeOptions> = {\n        userBlocks: analyzeOptions?.userBlocks || graph.userBlocks || {},\n        isBlock: analyzeOptions?.isBlock ?? !!graph.block,\n        visiting: analyzeOptions?.visiting || new Set(graph.block ? [graph.block.type] : []),\n        cache: analyzeOptions?.cache || new Map(),\n    };\n    const issues: FbIssue[] = [];\n    const nodes = new Map<string, Node>();\n\n    if (graph.block && !FB_USER_TYPE_PATTERN.test(graph.block.type)) {\n        issues.push({ severity: 'error', message: 'Invalid block type %s', args: [graph.block.type] });\n    }\n    const pins = new Set<string>();\n\n    for (const block of graph.blocks) {\n        if (!FB_ID_PATTERN.test(block.id || '')) {\n            issues.push({ severity: 'error', message: 'Invalid block ID %s', args: [String(block.id)] });\n            continue;\n        }\n        if (nodes.has(block.id)) {\n            issues.push({ severity: 'error', message: 'Duplicate block ID %s', args: [block.id], blockId: block.id });\n            continue;\n        }\n        const def = getBlockDef(block.type, options.userBlocks);\n        if (!def) {\n            issues.push({ severity: 'error', message: 'Unknown block type %s', args: [block.type], blockId: block.id });\n            continue;\n        }\n        nodes.set(block.id, { block, def });\n\n        for (const param of def.params || []) {\n            const value = block.params?.[param.id] ?? param.default;\n            if (param.required && (value === undefined || value === null || value === '')) {\n                issues.push({\n                    severity: 'error',\n                    message: 'Parameter \"%s\" is not set',\n                    args: [param.id],\n                    blockId: block.id,\n                });\n            }\n        }\n\n        if (def.category === 'interface') {\n            if (!options.isBlock) {\n                issues.push({\n                    severity: 'error',\n                    message: 'Inputs and outputs of a block only work in the diagram of a block',\n                    blockId: block.id,\n                });\n            }\n            const pin = String(block.params?.pin ?? '');\n            if (pin && (!PIN_NAME.test(pin) || RESERVED_PINS.includes(pin))) {\n                issues.push({ severity: 'error', message: 'Invalid pin name %s', args: [pin], blockId: block.id });\n            } else if (pin && pins.has(pin)) {\n                issues.push({\n                    severity: 'error',\n                    message: 'The pin name %s is used twice',\n                    args: [pin],\n                    blockId: block.id,\n                });\n            }\n            pins.add(pin);\n        } else if (options.isBlock && (block.type === 'STATE_IN' || block.type === 'STATE_OUT')) {\n            issues.push({\n                severity: 'error',\n                message: 'A block cannot read or write states - give it inputs and outputs instead',\n                blockId: block.id,\n            });\n        }\n\n        if (def.user) {\n            const problem = checkUserBlock(def.user, options);\n            if (problem) {\n                const inner = options.cache.get(def.user.type)?.issues.find(issue => issue.severity === 'error');\n                issues.push({\n                    severity: 'error',\n                    message: problem,\n                    args: inner ? [def.user.name, formatIssue(inner)] : [def.user.name],\n                    blockId: block.id,\n                });\n            }\n        }\n\n        if (block.type === 'JS') {\n            const problem = checkJsCode(jsCode(block, def), jsParameters(block, def));\n            if (problem) {\n                issues.push({\n                    severity: 'error',\n                    message: 'The code has an error: %s',\n                    args: [problem],\n                    blockId: block.id,\n                });\n            }\n        }\n    }\n\n    // links: both ends must exist, the types must fit, and an input takes one signal only\n    const links: FbLink[] = [];\n    const driven = new Set<string>();\n    for (const link of graph.links) {\n        const from = nodes.get(link.from[0]);\n        const to = nodes.get(link.to[0]);\n        const output = from && getOutputs(from.block, from.def).find(pin => pin.id === link.from[1]);\n        const input = to && getInputs(to.block, to.def).find(pin => pin.id === link.to[1]);\n        if (!output || !input) {\n            issues.push({\n                severity: 'error',\n                message: 'The connection refers to a missing block or pin',\n                linkId: link.id,\n                blockId: to ? link.to[0] : from ? link.from[0] : undefined,\n            });\n            continue;\n        }\n        if (!isCompatible(output.type, input.type)) {\n            issues.push({\n                severity: 'error',\n                message: 'Types do not match: %s cannot be connected to %s',\n                args: [output.type, input.type],\n                linkId: link.id,\n                blockId: link.to[0],\n            });\n            continue;\n        }\n        const key = `${link.to[0]}.${link.to[1]}`;\n        if (driven.has(key)) {\n            issues.push({\n                severity: 'error',\n                message: 'Input %s is connected more than once',\n                args: [link.to[1]],\n                linkId: link.id,\n                blockId: link.to[0],\n            });\n            continue;\n        }\n        driven.add(key);\n        links.push(link);\n    }\n\n    // Loops: inside a loop, the links that start at a block with a state may lead back. Whatever\n    // is still a loop without them has no block to take the value of the previous cycle from.\n    const ids = [...nodes.keys()];\n    const allEdges = buildEdges(ids, links);\n    const inLoop = new Map<string, number>();\n    findComponents(ids, allEdges)\n        .filter(component => isLoop(component, allEdges))\n        .forEach((component, i) => component.forEach(id => inLoop.set(id, i)));\n\n    const breakable = (link: FbLink): boolean =>\n        !!nodes.get(link.from[0])?.def.stateful &&\n        inLoop.has(link.from[0]) &&\n        inLoop.get(link.from[0]) === inLoop.get(link.to[0]);\n\n    const orderEdges = buildEdges(ids, links, breakable);\n    for (const component of findComponents(ids, orderEdges)) {\n        if (isLoop(component, orderEdges)) {\n            const names = component\n                .map(id => nodes.get(id)!.block)\n                .sort(byPosition)\n                .map(block => block.name || block.id);\n            issues.push({\n                severity: 'error',\n                message: 'Loop without a block that stores a value: %s',\n                args: [names.join(', ')],\n                blockIds: component,\n            });\n        }\n    }\n\n    // topological order; blocks that are ready at the same time run from left to right, then top down\n    const incoming = new Map<string, number>(ids.map(id => [id, 0]));\n    orderEdges.forEach(targets => targets.forEach(id => incoming.set(id, incoming.get(id)! + 1)));\n    const ready = ids.filter(id => !incoming.get(id));\n    const sequence: string[] = [];\n    while (ready.length) {\n        ready.sort((a, b) => byPosition(nodes.get(a)!.block, nodes.get(b)!.block));\n        const id = ready.shift()!;\n        sequence.push(id);\n        for (const next of orderEdges.get(id)!) {\n            const count = incoming.get(next)! - 1;\n            incoming.set(next, count);\n            if (!count) {\n                ready.push(next);\n            }\n        }\n    }\n    // blocks of an unsolvable loop still get a number, so the editor can show one\n    ids.filter(id => !sequence.includes(id))\n        .sort((a, b) => byPosition(nodes.get(a)!.block, nodes.get(b)!.block))\n        .forEach(id => sequence.push(id));\n\n    const order: Record<string, number> = {};\n    sequence.forEach((id, i) => (order[id] = (i + 1) * 10));\n\n    const feedback = links.filter(link => order[link.from[0]] >= order[link.to[0]]).map(link => link.id);\n\n    const timeDependent = [...nodes.values()].some(node => node.def.timeDependent);\n    const mode = graph.cycle.mode === 'auto' ? (timeDependent ? 'cyclic' : 'event') : graph.cycle.mode;\n    const ms = Math.max(\n        FB_CYCLE_MIN_MS,\n        Math.min(FB_CYCLE_MAX_MS, Math.round(Number(graph.cycle.ms) || FB_CYCLE_DEFAULT_MS)),\n    );\n    // the mode of a block is the one of the diagram it is used in\n    if (mode === 'event' && timeDependent && !options.isBlock) {\n        issues.push({\n            severity: 'warning',\n            message: 'Timers need the cyclic mode, in the event mode they only run when an input changes',\n        });\n    }\n\n    return { issues, order, feedback, links, mode, ms };\n}\n\nfunction byPosition(a: FbBlock, b: FbBlock): number {\n    return a.pos[0] - b.pos[0] || a.pos[1] - b.pos[1] || (a.id < b.id ? -1 : a.id > b.id ? 1 : 0);\n}\n"]}