tla-ts 0.0.4-dev.66582d4 → 0.0.4-dev.702eb98
This diff represents the content of publicly available package versions that have been released to one of the supported registries. The information contained in this diff is provided for informational purposes only and reflects changes between package versions as they appear in their respective public registries.
- package/README.md +26 -141
- package/dist/deciders.cjs +366 -0
- package/dist/deciders.js +366 -0
- package/dist/index.cjs +1 -1
- package/dist/index.d.cts +37 -1
- package/dist/index.d.ts +37 -1
- package/dist/index.js +1 -1
- package/dist/parallel-worker.cjs +1 -4
- package/dist/parallel-worker.js +1 -4
- package/dist/prove-worker.cjs +9 -0
- package/dist/prove-worker.d.cts +9 -0
- package/dist/prove-worker.d.ts +9 -0
- package/dist/prove-worker.js +9 -0
- package/dist/prove.cjs +515 -0
- package/dist/prove.js +515 -0
- package/dist/run-cli.cjs +30 -47
- package/dist/run-cli.js +30 -47
- package/dist/tlapm.cjs +10 -0
- package/dist/tlapm.js +10 -0
- package/dist/transfer.cjs +38 -44
- package/dist/transfer.js +38 -44
- package/dist/worker.cjs +21 -0
- package/dist/worker.js +21 -0
- package/package.json +21 -12
- package/src/check.ts +1 -0
- package/src/codegen.ts +26 -7
- package/src/errors.ts +86 -0
- package/src/evaluate.ts +280 -80
- package/src/index.ts +10 -0
- package/src/{obligation-action.ts → obligations/action.ts} +258 -37
- package/src/{obligation-anon.ts → obligations/anon.ts} +13 -7
- package/src/obligations/ctx.ts +64 -0
- package/src/{obligation-deref.ts → obligations/deref.ts} +2 -2
- package/src/{obligation-expression.ts → obligations/expression.ts} +54 -8
- package/src/{obligation-generate.ts → obligations/generate.ts} +134 -61
- package/src/{obligations.ts → obligations/index.ts} +26 -12
- package/src/{obligation-levels.ts → obligations/levels.ts} +12 -2
- package/src/{obligation-module.ts → obligations/module.ts} +46 -20
- package/src/obligations/pickle.ts +100 -0
- package/src/obligations/pragma.ts +189 -0
- package/src/{obligation-printer.ts → obligations/printer.ts} +5 -59
- package/src/{obligation-proof.ts → obligations/proof.ts} +7 -1
- package/src/{obligation-source.ts → obligations/source.ts} +91 -35
- package/src/obligations/temporal.ts +319 -0
- package/src/{obligation-tuples.ts → obligations/tuples.ts} +1 -1
- package/src/parallel-worker.ts +2 -18
- package/src/parallel.ts +10 -43
- package/src/prove/decide-pool.ts +100 -0
- package/src/prove/deciders.ts +27 -0
- package/src/prove/isabelle/LICENSE +36 -0
- package/src/prove/isabelle/LICENSE-tlapm +26 -0
- package/src/prove/isabelle/decide.ts +47 -0
- package/src/prove/isabelle/encode.ts +477 -0
- package/src/prove/isabelle/isar/inner-syntax.ts +579 -0
- package/src/prove/isabelle/isar/method.ts +367 -0
- package/src/prove/isabelle/isar/proof.ts +28 -0
- package/src/prove/isabelle/isar/statement.ts +57 -0
- package/src/prove/isabelle/isar/theory.ts +192 -0
- package/src/prove/isabelle/isar/type-check.ts +278 -0
- package/src/prove/isabelle/provers/blast/blast.ts +258 -0
- package/src/prove/isabelle/provers/blast/branch.ts +322 -0
- package/src/prove/isabelle/provers/blast/prove.ts +347 -0
- package/src/prove/isabelle/provers/blast/rules.ts +330 -0
- package/src/prove/isabelle/provers/blast/state.ts +180 -0
- package/src/prove/isabelle/provers/blast/term.ts +547 -0
- package/src/prove/isabelle/provers/clasimp.ts +150 -0
- package/src/prove/isabelle/provers/classical.ts +389 -0
- package/src/prove/isabelle/provers/hypsubst.ts +441 -0
- package/src/prove/isabelle/pure/bicompose.ts +174 -0
- package/src/prove/isabelle/pure/consts.ts +32 -0
- package/src/prove/isabelle/pure/conv.ts +79 -0
- package/src/prove/isabelle/pure/drule.ts +264 -0
- package/src/prove/isabelle/pure/envir.ts +363 -0
- package/src/prove/isabelle/pure/goal.ts +53 -0
- package/src/prove/isabelle/pure/interrupt.ts +16 -0
- package/src/prove/isabelle/pure/list.ts +12 -0
- package/src/prove/isabelle/pure/logic.ts +402 -0
- package/src/prove/isabelle/pure/name.ts +110 -0
- package/src/prove/isabelle/pure/net.ts +262 -0
- package/src/prove/isabelle/pure/object-logic.ts +41 -0
- package/src/prove/isabelle/pure/pattern.ts +650 -0
- package/src/prove/isabelle/pure/raw-simplifier.ts +353 -0
- package/src/prove/isabelle/pure/rewriter.ts +602 -0
- package/src/prove/isabelle/pure/search.ts +68 -0
- package/src/prove/isabelle/pure/seq.ts +156 -0
- package/src/prove/isabelle/pure/simplifier.ts +112 -0
- package/src/prove/isabelle/pure/table.ts +208 -0
- package/src/prove/isabelle/pure/tactic.ts +276 -0
- package/src/prove/isabelle/pure/tactical.ts +347 -0
- package/src/prove/isabelle/pure/term-ord.ts +159 -0
- package/src/prove/isabelle/pure/term.ts +808 -0
- package/src/prove/isabelle/pure/thm.ts +806 -0
- package/src/prove/isabelle/pure/type.ts +133 -0
- package/src/prove/isabelle/pure/unify.ts +753 -0
- package/src/prove/isabelle/pure/variable.ts +25 -0
- package/src/prove/isabelle/tla/classical-setup.ts +101 -0
- package/src/prove/isabelle/tla/context.ts +74 -0
- package/src/prove/isabelle/tla/logic-data.ts +5 -0
- package/src/prove/isabelle/tla/logic.ts +215 -0
- package/src/prove/isabelle/tla/simpdata.ts +241 -0
- package/src/prove/isabelle/tools/intuitionistic.ts +132 -0
- package/src/prove/ocaml.ts +22 -0
- package/src/prove/prep/action.ts +520 -0
- package/src/prove/prep/defs.ts +27 -0
- package/src/prove/prep/elab.ts +156 -0
- package/src/prove/prep/enabled-axioms.ts +189 -0
- package/src/prove/prep/enabled.ts +43 -0
- package/src/prove/prep/fingerprint.ts +388 -0
- package/src/prove/prep/flatten.ts +70 -0
- package/src/prove/prep/level-comparison.ts +552 -0
- package/src/prove/prep/md5.ts +67 -0
- package/src/prove/prep/pragma.ts +221 -0
- package/src/prove/prep/trivial.ts +22 -0
- package/src/prove/prove-worker.ts +29 -0
- package/src/prove/prove.ts +417 -0
- package/src/prove/ptl/decide.ts +68 -0
- package/src/prove/ptl/encode.ts +256 -0
- package/src/prove/ptl/sat.ts +151 -0
- package/src/prove/ptl/tableau.ts +276 -0
- package/src/prove/smt/axiomatize.ts +69 -0
- package/src/prove/smt/axioms.ts +210 -0
- package/src/prove/smt/context.ts +108 -0
- package/src/prove/smt/data.ts +665 -0
- package/src/prove/smt/encode.ts +169 -0
- package/src/prove/smt/extensionality.ts +63 -0
- package/src/prove/smt/flatten.ts +127 -0
- package/src/prove/smt/format.ts +143 -0
- package/src/prove/smt/instances.ts +182 -0
- package/src/prove/smt/rewrite.ts +784 -0
- package/src/prove/smt/simplify.ts +57 -0
- package/src/prove/smt/solver/act-cache.ts +265 -0
- package/src/prove/smt/solver/arith-rewriter.ts +962 -0
- package/src/prove/smt/solver/array.ts +22 -0
- package/src/prove/smt/solver/asserted-formulas.ts +469 -0
- package/src/prove/smt/solver/ast-lt.ts +157 -0
- package/src/prove/smt/solver/ast-util.ts +147 -0
- package/src/prove/smt/solver/ast.ts +1315 -0
- package/src/prove/smt/solver/auf-solver.ts +572 -0
- package/src/prove/smt/solver/case-split-queue.ts +178 -0
- package/src/prove/smt/solver/cg-table.ts +175 -0
- package/src/prove/smt/solver/clause.ts +276 -0
- package/src/prove/smt/solver/conflict-resolution.ts +343 -0
- package/src/prove/smt/solver/context.ts +1292 -0
- package/src/prove/smt/solver/ctx-simplify.ts +334 -0
- package/src/prove/smt/solver/der.ts +224 -0
- package/src/prove/smt/solver/dyn-ack.ts +141 -0
- package/src/prove/smt/solver/e-matching.ts +659 -0
- package/src/prove/smt/solver/enode.ts +259 -0
- package/src/prove/smt/solver/expr-ref.ts +21 -0
- package/src/prove/smt/solver/expr-safe-replace.ts +172 -0
- package/src/prove/smt/solver/fingerprints.ts +92 -0
- package/src/prove/smt/solver/flat-literals.ts +51 -0
- package/src/prove/smt/solver/goal.ts +138 -0
- package/src/prove/smt/solver/hash.ts +173 -0
- package/src/prove/smt/solver/hashtable.ts +166 -0
- package/src/prove/smt/solver/internalizer.ts +1381 -0
- package/src/prove/smt/solver/lbool.ts +5 -0
- package/src/prove/smt/solver/literal.ts +24 -0
- package/src/prove/smt/solver/lp/bound-propagator.ts +391 -0
- package/src/prove/smt/solver/lp/constraints.ts +78 -0
- package/src/prove/smt/solver/lp/containers.ts +296 -0
- package/src/prove/smt/solver/lp/core-solver.ts +504 -0
- package/src/prove/smt/solver/lp/cross-nested.ts +224 -0
- package/src/prove/smt/solver/lp/dep-intervals.ts +656 -0
- package/src/prove/smt/solver/lp/dependency.ts +51 -0
- package/src/prove/smt/solver/lp/dioph-eq.ts +1181 -0
- package/src/prove/smt/solver/lp/explanation.ts +46 -0
- package/src/prove/smt/solver/lp/gomory.ts +255 -0
- package/src/prove/smt/solver/lp/hnf-cutter.ts +125 -0
- package/src/prove/smt/solver/lp/hnf.ts +281 -0
- package/src/prove/smt/solver/lp/int-cube.ts +295 -0
- package/src/prove/smt/solver/lp/int-solver.ts +514 -0
- package/src/prove/smt/solver/lp/lar-solver.ts +816 -0
- package/src/prove/smt/solver/lp/lar-term.ts +62 -0
- package/src/prove/smt/solver/lp/lp-settings.ts +91 -0
- package/src/prove/smt/solver/lp/maximize-term.ts +347 -0
- package/src/prove/smt/solver/lp/nex-creator.ts +381 -0
- package/src/prove/smt/solver/lp/nex.ts +120 -0
- package/src/prove/smt/solver/lp/nla-backoff.ts +43 -0
- package/src/prove/smt/solver/lp/nla-basics.ts +398 -0
- package/src/prove/smt/solver/lp/nla-core.ts +968 -0
- package/src/prove/smt/solver/lp/nla-divisions.ts +332 -0
- package/src/prove/smt/solver/lp/nla-emonics.ts +373 -0
- package/src/prove/smt/solver/lp/nla-factorization.ts +30 -0
- package/src/prove/smt/solver/lp/nla-grobner.ts +904 -0
- package/src/prove/smt/solver/lp/nla-horner.ts +126 -0
- package/src/prove/smt/solver/lp/nla-intervals.ts +265 -0
- package/src/prove/smt/solver/lp/nla-monomial-bounds.ts +715 -0
- package/src/prove/smt/solver/lp/nla-monotone.ts +59 -0
- package/src/prove/smt/solver/lp/nla-order.ts +307 -0
- package/src/prove/smt/solver/lp/nla-patcher.ts +112 -0
- package/src/prove/smt/solver/lp/nla-tangents.ts +251 -0
- package/src/prove/smt/solver/lp/nla-throttle.ts +85 -0
- package/src/prove/smt/solver/lp/nla-types.ts +124 -0
- package/src/prove/smt/solver/lp/nla-var-eqs.ts +141 -0
- package/src/prove/smt/solver/lp/nra-solver.ts +440 -0
- package/src/prove/smt/solver/lp/numeric-pair.ts +65 -0
- package/src/prove/smt/solver/lp/pdd-interval.ts +31 -0
- package/src/prove/smt/solver/lp/pdd-simplifier.ts +184 -0
- package/src/prove/smt/solver/lp/pdd-solver.ts +408 -0
- package/src/prove/smt/solver/lp/pdd.ts +971 -0
- package/src/prove/smt/solver/lp/random-updater.ts +138 -0
- package/src/prove/smt/solver/lp/static-matrix.ts +246 -0
- package/src/prove/smt/solver/lp/union-find.ts +96 -0
- package/src/prove/smt/solver/mam-compiler.ts +847 -0
- package/src/prove/smt/solver/mam-interpreter.ts +400 -0
- package/src/prove/smt/solver/maximize-ac-sharing.ts +118 -0
- package/src/prove/smt/solver/model-checker.ts +347 -0
- package/src/prove/smt/solver/model-evaluator.ts +262 -0
- package/src/prove/smt/solver/model-finder.ts +155 -0
- package/src/prove/smt/solver/model-generator.ts +97 -0
- package/src/prove/smt/solver/model-macro-solver.ts +728 -0
- package/src/prove/smt/solver/nlsat/algebraic.ts +1161 -0
- package/src/prove/smt/solver/nlsat/atoms.ts +238 -0
- package/src/prove/smt/solver/nlsat/evaluator.ts +303 -0
- package/src/prove/smt/solver/nlsat/explain.ts +607 -0
- package/src/prove/smt/solver/nlsat/interval-set.ts +351 -0
- package/src/prove/smt/solver/nlsat/levelwise.ts +740 -0
- package/src/prove/smt/solver/nlsat/mpbq.ts +161 -0
- package/src/prove/smt/solver/nlsat/polynomial.ts +1722 -0
- package/src/prove/smt/solver/nlsat/solver.ts +911 -0
- package/src/prove/smt/solver/nlsat/types.ts +43 -0
- package/src/prove/smt/solver/nlsat/upolynomial-factorization.ts +648 -0
- package/src/prove/smt/solver/nlsat/upolynomial.ts +996 -0
- package/src/prove/smt/solver/nnf.ts +469 -0
- package/src/prove/smt/solver/pattern-inference.ts +351 -0
- package/src/prove/smt/solver/poly-rewriter.ts +477 -0
- package/src/prove/smt/solver/propagate-values.ts +83 -0
- package/src/prove/smt/solver/proto-model.ts +551 -0
- package/src/prove/smt/solver/pull-quant.ts +139 -0
- package/src/prove/smt/solver/qe-lite-der.ts +526 -0
- package/src/prove/smt/solver/qe-lite-fm.ts +576 -0
- package/src/prove/smt/solver/qe-lite.ts +381 -0
- package/src/prove/smt/solver/qi-queue.ts +362 -0
- package/src/prove/smt/solver/quant-tactics.ts +117 -0
- package/src/prove/smt/solver/quantifier-analyzer.ts +562 -0
- package/src/prove/smt/solver/quantifier-manager.ts +186 -0
- package/src/prove/smt/solver/random-gen.ts +10 -0
- package/src/prove/smt/solver/rational.ts +165 -0
- package/src/prove/smt/solver/ref-vector.ts +62 -0
- package/src/prove/smt/solver/relevancy.ts +247 -0
- package/src/prove/smt/solver/rewriter-tpl.ts +1159 -0
- package/src/prove/smt/solver/rewriter.ts +843 -0
- package/src/prove/smt/solver/rlimit.ts +79 -0
- package/src/prove/smt/solver/smtlib-parser.ts +526 -0
- package/src/prove/smt/solver/solver.ts +71 -0
- package/src/prove/smt/solver/sort.ts +35 -0
- package/src/prove/smt/solver/sticky-generations.ts +69 -0
- package/src/prove/smt/solver/theory-lra-axioms.ts +340 -0
- package/src/prove/smt/solver/theory-lra-bounds.ts +226 -0
- package/src/prove/smt/solver/theory-lra-final-check.ts +252 -0
- package/src/prove/smt/solver/theory-lra-internalize.ts +476 -0
- package/src/prove/smt/solver/theory-lra-model.ts +243 -0
- package/src/prove/smt/solver/theory-lra-propagate.ts +405 -0
- package/src/prove/smt/solver/theory-lra-state.ts +43 -0
- package/src/prove/smt/solver/theory-lra.ts +56 -0
- package/src/prove/smt/solver/var-subst.ts +258 -0
- package/src/prove/smt/solver/z3-license.txt +10 -0
- package/src/prove/smt/table.ts +170 -0
- package/src/prove/tlapm/tlapm.ts +97 -0
- package/src/prove/tlaps-module.ts +510 -0
- package/src/prove/verdict.ts +13 -0
- package/src/prove/zenon/LICENSE +32 -0
- package/src/prove/zenon/check/check.ts +105 -0
- package/src/prove/zenon/check/definitions.ts +144 -0
- package/src/prove/zenon/check/equality.ts +182 -0
- package/src/prove/zenon/check/functions.ts +62 -0
- package/src/prove/zenon/check/keys.ts +125 -0
- package/src/prove/zenon/check/propositional.ts +104 -0
- package/src/prove/zenon/check/records.ts +188 -0
- package/src/prove/zenon/check/relations.ts +121 -0
- package/src/prove/zenon/check/rewrites.ts +224 -0
- package/src/prove/zenon/check/sets.ts +302 -0
- package/src/prove/zenon/check/terms.ts +127 -0
- package/src/prove/zenon/check/tla.ts +126 -0
- package/src/prove/zenon/decide.ts +113 -0
- package/src/prove/zenon/encode.ts +444 -0
- package/src/prove/zenon/eqrel.ts +300 -0
- package/src/prove/zenon/equality-rules.ts +435 -0
- package/src/prove/zenon/expr.ts +551 -0
- package/src/prove/zenon/index-table.ts +350 -0
- package/src/prove/zenon/isar-case.ts +513 -0
- package/src/prove/zenon/isar.ts +1249 -0
- package/src/prove/zenon/limits.ts +15 -0
- package/src/prove/zenon/llproof.ts +173 -0
- package/src/prove/zenon/mltoll.ts +1566 -0
- package/src/prove/zenon/node.ts +297 -0
- package/src/prove/zenon/ocaml.ts +169 -0
- package/src/prove/zenon/parse.ts +247 -0
- package/src/prove/zenon/phrase.ts +191 -0
- package/src/prove/zenon/proof.ts +198 -0
- package/src/prove/zenon/propositional-rules.ts +387 -0
- package/src/prove/zenon/rules.ts +94 -0
- package/src/prove/zenon/search.ts +288 -0
- package/src/prove/zenon/tla/functions.ts +151 -0
- package/src/prove/zenon/tla/llproof.ts +480 -0
- package/src/prove/zenon/tla/records.ts +225 -0
- package/src/prove/zenon/tla/rewrites.ts +447 -0
- package/src/prove/zenon/tla/sets.ts +304 -0
- package/src/prove/zenon/tla/terms.ts +181 -0
- package/src/prove/zenon/tla/tla.ts +506 -0
- package/src/run-cli.ts +78 -35
- package/src/standard-modules.ts +5 -2
- package/src/successors.ts +25 -6
- package/src/tlc-random.ts +55 -32
- package/src/tlc-version.ts +8 -7
- package/src/values.ts +97 -47
- package/src/worker.ts +65 -0
- package/dist/parallel.cjs +0 -12
- package/dist/parallel.js +0 -12
- /package/src/{obligation-format.ts → obligations/format.ts} +0 -0
|
@@ -0,0 +1,57 @@
|
|
|
1
|
+
// The rewrites of encode/n_rewrite.ml that run on the sequent before Type.Synthesize.
|
|
2
|
+
|
|
3
|
+
import { applyBuiltin, at, mapChildren, type Expr } from "../../obligations/expression";
|
|
4
|
+
import { compareStrings } from "../ocaml";
|
|
5
|
+
|
|
6
|
+
type RecordExpr = Extract<Expr, { kind: "Record" }>;
|
|
7
|
+
|
|
8
|
+
const isSameFieldSet = (left: RecordExpr, right: RecordExpr) =>
|
|
9
|
+
left.fields.length === right.fields.length &&
|
|
10
|
+
left.fields.every((field) => right.fields.some((other) => other.name === field.name)) &&
|
|
11
|
+
right.fields.every((field) => left.fields.some((other) => other.name === field.name));
|
|
12
|
+
|
|
13
|
+
// mk_conj: e1 /\ (e2 /\ ...).
|
|
14
|
+
const conjoinRight = (items: Expr[]): Expr =>
|
|
15
|
+
items.length === 1
|
|
16
|
+
? items[0]
|
|
17
|
+
: applyBuiltin("Conj", [items[0], conjoinRight(items.slice(1))], items[0]);
|
|
18
|
+
|
|
19
|
+
const decompose = (left: Expr, right: Expr, from: Expr): Expr => {
|
|
20
|
+
if (left.kind !== "Record" || right.kind !== "Record" || !isSameFieldSet(left, right))
|
|
21
|
+
return applyBuiltin("Eq", [left, right], from);
|
|
22
|
+
return conjoinRight(
|
|
23
|
+
left.fields.map((field) =>
|
|
24
|
+
decompose(
|
|
25
|
+
field.value,
|
|
26
|
+
right.fields.find((other) => other.name === field.name)?.value ?? field.value,
|
|
27
|
+
from,
|
|
28
|
+
),
|
|
29
|
+
),
|
|
30
|
+
);
|
|
31
|
+
};
|
|
32
|
+
|
|
33
|
+
// simpl_receq: an equality of two record constructors with the same fields is the conjunction of
|
|
34
|
+
// the equalities of their fields, paired by name.
|
|
35
|
+
export const simplifyRecordEqualities = (expression: Expr): Expr => {
|
|
36
|
+
const inner = mapChildren(expression, simplifyRecordEqualities);
|
|
37
|
+
const isRecordEquality =
|
|
38
|
+
inner.kind === "Apply" &&
|
|
39
|
+
inner.operator.kind === "Internal" &&
|
|
40
|
+
inner.operator.builtin === "Eq" &&
|
|
41
|
+
inner.args.length === 2 &&
|
|
42
|
+
inner.args[0].kind === "Record" &&
|
|
43
|
+
inner.args[1].kind === "Record";
|
|
44
|
+
return isRecordEquality && inner.kind === "Apply"
|
|
45
|
+
? at(decompose(inner.args[0], inner.args[1], inner), inner)
|
|
46
|
+
: inner;
|
|
47
|
+
};
|
|
48
|
+
|
|
49
|
+
// sort_recfields: a record's or a record set's fields in order. Like tlapm, it doesn't visit the
|
|
50
|
+
// field values, so a record inside a record keeps the order it's written in.
|
|
51
|
+
export const sortRecordFields = (expression: Expr): Expr =>
|
|
52
|
+
expression.kind === "Record" || expression.kind === "Rect"
|
|
53
|
+
? {
|
|
54
|
+
...expression,
|
|
55
|
+
fields: expression.fields.toSorted((left, right) => compareStrings(left.name, right.name)),
|
|
56
|
+
}
|
|
57
|
+
: mapChildren(expression, sortRecordFields);
|
|
@@ -0,0 +1,265 @@
|
|
|
1
|
+
// Ported from Z3 (src/ast/act_cache.cpp, src/util/chashtable.h), MIT license, see z3-license.txt.
|
|
2
|
+
// The rewriter's cache from an expression and a shift to its result. It holds a reference to each
|
|
3
|
+
// key and value, and keeps at most maxUnused entries that were never looked up. Z3 releases the
|
|
4
|
+
// entries in the order of its chained hash table, so the table is ported cell for cell.
|
|
5
|
+
import type { AstManager } from "./ast";
|
|
6
|
+
import { shrink } from "./array";
|
|
7
|
+
|
|
8
|
+
const INIT_SLOTS = 8;
|
|
9
|
+
const INIT_CELLAR = 2;
|
|
10
|
+
const MIN_MAX_UNUSED = 1024;
|
|
11
|
+
const NO_CELL = -1;
|
|
12
|
+
// m_next of a free cell, which Z3 tags.
|
|
13
|
+
const FREE_CELL = -2;
|
|
14
|
+
const MAX_SPARE_CAPACITY = 1024;
|
|
15
|
+
|
|
16
|
+
interface Cells {
|
|
17
|
+
keys: Int32Array<ArrayBuffer>;
|
|
18
|
+
offsets: Int32Array<ArrayBuffer>;
|
|
19
|
+
values: Int32Array<ArrayBuffer>;
|
|
20
|
+
isUsed: Uint8Array<ArrayBuffer>;
|
|
21
|
+
nexts: Int32Array<ArrayBuffer>;
|
|
22
|
+
}
|
|
23
|
+
|
|
24
|
+
export class ActCache {
|
|
25
|
+
private slots = INIT_SLOTS;
|
|
26
|
+
private capacity = INIT_SLOTS + INIT_CELLAR;
|
|
27
|
+
private keys = new Int32Array(0);
|
|
28
|
+
private offsets = new Int32Array(0);
|
|
29
|
+
private values = new Int32Array(0);
|
|
30
|
+
// Whether client code looked the entry up, the tag of Z3's value pointer.
|
|
31
|
+
private isUsed = new Uint8Array(0);
|
|
32
|
+
private nexts = new Int32Array(0);
|
|
33
|
+
private nextCell = INIT_SLOTS;
|
|
34
|
+
private freeCell = NO_CELL;
|
|
35
|
+
private size = 0;
|
|
36
|
+
// The entries in insertion order from qhead on, where the oldest unused entry is searched.
|
|
37
|
+
private queueKeys: number[] = [];
|
|
38
|
+
private queueOffsets: number[] = [];
|
|
39
|
+
private qhead = 0;
|
|
40
|
+
private numUnused = 0;
|
|
41
|
+
private maxUnused: number;
|
|
42
|
+
// The cells of the small tables that reset and expand_table let go, by capacity. Z3 frees them and
|
|
43
|
+
// takes the next table from its small-object allocator, which is cheap, where V8 allocates each
|
|
44
|
+
// typed array slowly, so the next table of the same capacity reuses them.
|
|
45
|
+
private spares = new Map<number, Cells>();
|
|
46
|
+
|
|
47
|
+
constructor(
|
|
48
|
+
private manager: AstManager,
|
|
49
|
+
maxUnused: number,
|
|
50
|
+
) {
|
|
51
|
+
this.maxUnused = Math.max(maxUnused, MIN_MAX_UNUSED);
|
|
52
|
+
this.initTable(INIT_SLOTS, INIT_CELLAR);
|
|
53
|
+
}
|
|
54
|
+
|
|
55
|
+
private initTable(slots: number, cellar: number) {
|
|
56
|
+
this.slots = slots;
|
|
57
|
+
this.capacity = slots + cellar;
|
|
58
|
+
const spare = this.spares.get(this.capacity);
|
|
59
|
+
if (spare !== undefined) this.spares.delete(this.capacity);
|
|
60
|
+
this.keys = spare?.keys ?? new Int32Array(this.capacity);
|
|
61
|
+
this.offsets = spare?.offsets ?? new Int32Array(this.capacity);
|
|
62
|
+
this.values = spare?.values ?? new Int32Array(this.capacity);
|
|
63
|
+
this.isUsed = spare?.isUsed ?? new Uint8Array(this.capacity);
|
|
64
|
+
this.nexts = (spare?.nexts ?? new Int32Array(this.capacity)).fill(FREE_CELL);
|
|
65
|
+
this.nextCell = slots;
|
|
66
|
+
this.freeCell = NO_CELL;
|
|
67
|
+
this.size = 0;
|
|
68
|
+
}
|
|
69
|
+
|
|
70
|
+
private retireTable() {
|
|
71
|
+
if (this.capacity > MAX_SPARE_CAPACITY) return;
|
|
72
|
+
this.spares.set(this.capacity, {
|
|
73
|
+
keys: this.keys,
|
|
74
|
+
offsets: this.offsets,
|
|
75
|
+
values: this.values,
|
|
76
|
+
isUsed: this.isUsed,
|
|
77
|
+
nexts: this.nexts,
|
|
78
|
+
});
|
|
79
|
+
}
|
|
80
|
+
|
|
81
|
+
private getHash(key: number, offset: number) {
|
|
82
|
+
return (this.manager.hashes[key] + offset) >>> 0;
|
|
83
|
+
}
|
|
84
|
+
|
|
85
|
+
private findCell(key: number, offset: number) {
|
|
86
|
+
let cell = this.getHash(key, offset) & (this.slots - 1);
|
|
87
|
+
if (this.nexts[cell] === FREE_CELL) return NO_CELL;
|
|
88
|
+
while (cell !== NO_CELL) {
|
|
89
|
+
if (this.keys[cell] === key && this.offsets[cell] === offset) return cell;
|
|
90
|
+
cell = this.nexts[cell];
|
|
91
|
+
}
|
|
92
|
+
return NO_CELL;
|
|
93
|
+
}
|
|
94
|
+
|
|
95
|
+
private getFreeCell() {
|
|
96
|
+
if (this.freeCell !== NO_CELL) {
|
|
97
|
+
const cell = this.freeCell;
|
|
98
|
+
this.freeCell = this.nexts[cell];
|
|
99
|
+
return cell;
|
|
100
|
+
}
|
|
101
|
+
return this.nextCell++;
|
|
102
|
+
}
|
|
103
|
+
|
|
104
|
+
private copyCell(target: number, source: number) {
|
|
105
|
+
this.keys[target] = this.keys[source];
|
|
106
|
+
this.offsets[target] = this.offsets[source];
|
|
107
|
+
this.values[target] = this.values[source];
|
|
108
|
+
this.isUsed[target] = this.isUsed[source];
|
|
109
|
+
this.nexts[target] = this.nexts[source];
|
|
110
|
+
}
|
|
111
|
+
|
|
112
|
+
// expand_table: copy_table into twice the slots and cellar, doubling the cellar again while it is
|
|
113
|
+
// too small.
|
|
114
|
+
private expandTable() {
|
|
115
|
+
const old = {
|
|
116
|
+
slots: this.slots,
|
|
117
|
+
keys: this.keys,
|
|
118
|
+
offsets: this.offsets,
|
|
119
|
+
values: this.values,
|
|
120
|
+
isUsed: this.isUsed,
|
|
121
|
+
nexts: this.nexts,
|
|
122
|
+
};
|
|
123
|
+
const size = this.size;
|
|
124
|
+
this.retireTable();
|
|
125
|
+
for (let cellar = (this.capacity - this.slots) * 2; ; cellar *= 2) {
|
|
126
|
+
this.initTable(old.slots * 2, cellar);
|
|
127
|
+
let isCopied = true;
|
|
128
|
+
for (let slot = 0; slot < old.slots && isCopied; slot++) {
|
|
129
|
+
if (old.nexts[slot] === FREE_CELL) continue;
|
|
130
|
+
for (let cell = slot; cell !== NO_CELL; cell = old.nexts[cell]) {
|
|
131
|
+
const target = this.getHash(old.keys[cell], old.offsets[cell]) & (this.slots - 1);
|
|
132
|
+
if (this.nexts[target] !== FREE_CELL) {
|
|
133
|
+
if (this.nextCell === this.capacity) {
|
|
134
|
+
isCopied = false;
|
|
135
|
+
break;
|
|
136
|
+
}
|
|
137
|
+
this.copyCell(this.nextCell, target);
|
|
138
|
+
this.nexts[target] = this.nextCell++;
|
|
139
|
+
} else this.nexts[target] = NO_CELL;
|
|
140
|
+
this.keys[target] = old.keys[cell];
|
|
141
|
+
this.offsets[target] = old.offsets[cell];
|
|
142
|
+
this.values[target] = old.values[cell];
|
|
143
|
+
this.isUsed[target] = old.isUsed[cell];
|
|
144
|
+
}
|
|
145
|
+
}
|
|
146
|
+
if (isCopied) break;
|
|
147
|
+
}
|
|
148
|
+
this.size = size;
|
|
149
|
+
}
|
|
150
|
+
|
|
151
|
+
// del_unused: deletes the oldest entry that was never looked up.
|
|
152
|
+
private delUnused() {
|
|
153
|
+
while (this.qhead < this.queueKeys.length) {
|
|
154
|
+
const key = this.queueKeys[this.qhead];
|
|
155
|
+
const offset = this.queueOffsets[this.qhead];
|
|
156
|
+
this.qhead++;
|
|
157
|
+
const cell = this.findCell(key, offset);
|
|
158
|
+
if (!this.isUsed[cell]) {
|
|
159
|
+
this.numUnused--;
|
|
160
|
+
const value = this.values[cell];
|
|
161
|
+
this.erase(key, offset);
|
|
162
|
+
this.manager.decRef(key);
|
|
163
|
+
this.manager.decRef(value);
|
|
164
|
+
break;
|
|
165
|
+
}
|
|
166
|
+
}
|
|
167
|
+
if (this.qhead === this.queueKeys.length) {
|
|
168
|
+
shrink(this.queueKeys, 0);
|
|
169
|
+
shrink(this.queueOffsets, 0);
|
|
170
|
+
this.qhead = 0;
|
|
171
|
+
} else if (this.qhead > this.maxUnused) {
|
|
172
|
+
this.queueKeys = this.queueKeys.slice(this.qhead);
|
|
173
|
+
this.queueOffsets = this.queueOffsets.slice(this.qhead);
|
|
174
|
+
this.qhead = 0;
|
|
175
|
+
}
|
|
176
|
+
}
|
|
177
|
+
|
|
178
|
+
private erase(key: number, offset: number) {
|
|
179
|
+
let cell = this.getHash(key, offset) & (this.slots - 1);
|
|
180
|
+
let prev = NO_CELL;
|
|
181
|
+
while (this.keys[cell] !== key || this.offsets[cell] !== offset) {
|
|
182
|
+
prev = cell;
|
|
183
|
+
cell = this.nexts[cell];
|
|
184
|
+
}
|
|
185
|
+
this.size--;
|
|
186
|
+
const next = this.nexts[cell];
|
|
187
|
+
if (prev === NO_CELL) {
|
|
188
|
+
if (next === NO_CELL) this.nexts[cell] = FREE_CELL;
|
|
189
|
+
else {
|
|
190
|
+
this.copyCell(cell, next);
|
|
191
|
+
this.recycleCell(next);
|
|
192
|
+
}
|
|
193
|
+
} else {
|
|
194
|
+
this.nexts[prev] = next;
|
|
195
|
+
this.recycleCell(cell);
|
|
196
|
+
}
|
|
197
|
+
}
|
|
198
|
+
|
|
199
|
+
private recycleCell(cell: number) {
|
|
200
|
+
this.nexts[cell] = this.freeCell;
|
|
201
|
+
this.freeCell = cell;
|
|
202
|
+
}
|
|
203
|
+
|
|
204
|
+
insert(key: number, offset: number, value: number) {
|
|
205
|
+
if (this.numUnused >= this.maxUnused) this.delUnused();
|
|
206
|
+
if (this.freeCell === NO_CELL && this.nextCell >= this.capacity) this.expandTable();
|
|
207
|
+
const slot = this.getHash(key, offset) & (this.slots - 1);
|
|
208
|
+
if (this.nexts[slot] !== FREE_CELL) {
|
|
209
|
+
for (let cell = slot; cell !== NO_CELL; cell = this.nexts[cell]) {
|
|
210
|
+
if (this.keys[cell] !== key || this.offsets[cell] !== offset) continue;
|
|
211
|
+
// A new value replaces the old one and clears the tag, though it is not counted as unused.
|
|
212
|
+
if (this.values[cell] !== value) {
|
|
213
|
+
this.manager.incRef(value);
|
|
214
|
+
this.manager.decRef(this.values[cell]);
|
|
215
|
+
this.values[cell] = value;
|
|
216
|
+
this.isUsed[cell] = 0;
|
|
217
|
+
}
|
|
218
|
+
return;
|
|
219
|
+
}
|
|
220
|
+
// The new entry takes the slot, and the old head moves to a free cell after it.
|
|
221
|
+
const moved = this.getFreeCell();
|
|
222
|
+
this.copyCell(moved, slot);
|
|
223
|
+
this.nexts[slot] = moved;
|
|
224
|
+
} else this.nexts[slot] = NO_CELL;
|
|
225
|
+
this.manager.incRef(key);
|
|
226
|
+
this.manager.incRef(value);
|
|
227
|
+
this.queueKeys.push(key);
|
|
228
|
+
this.queueOffsets.push(offset);
|
|
229
|
+
this.numUnused++;
|
|
230
|
+
this.size++;
|
|
231
|
+
this.keys[slot] = key;
|
|
232
|
+
this.offsets[slot] = offset;
|
|
233
|
+
this.values[slot] = value;
|
|
234
|
+
this.isUsed[slot] = 0;
|
|
235
|
+
}
|
|
236
|
+
|
|
237
|
+
find(key: number, offset: number) {
|
|
238
|
+
const cell = this.findCell(key, offset);
|
|
239
|
+
if (cell === NO_CELL) return undefined;
|
|
240
|
+
if (!this.isUsed[cell]) {
|
|
241
|
+
this.isUsed[cell] = 1;
|
|
242
|
+
this.numUnused--;
|
|
243
|
+
}
|
|
244
|
+
return this.values[cell];
|
|
245
|
+
}
|
|
246
|
+
|
|
247
|
+
// reset: releases the entries in the table's order.
|
|
248
|
+
reset() {
|
|
249
|
+
for (let slot = 0; slot < this.slots && this.size > 0; slot++) {
|
|
250
|
+
if (this.nexts[slot] === FREE_CELL) continue;
|
|
251
|
+
for (let cell = slot; cell !== NO_CELL; cell = this.nexts[cell]) {
|
|
252
|
+
this.manager.decRef(this.keys[cell]);
|
|
253
|
+
this.manager.decRef(this.values[cell]);
|
|
254
|
+
}
|
|
255
|
+
}
|
|
256
|
+
if (this.size > 0) {
|
|
257
|
+
this.retireTable();
|
|
258
|
+
this.initTable(INIT_SLOTS, INIT_CELLAR);
|
|
259
|
+
}
|
|
260
|
+
shrink(this.queueKeys, 0);
|
|
261
|
+
shrink(this.queueOffsets, 0);
|
|
262
|
+
this.qhead = 0;
|
|
263
|
+
this.numUnused = 0;
|
|
264
|
+
}
|
|
265
|
+
}
|