2022-12-08 22:19:22 +01:00
|
|
|
[package]
|
|
|
|
|
name = "tvix-cli"
|
|
|
|
|
version = "0.1.0"
|
|
|
|
|
edition = "2021"
|
|
|
|
|
|
2022-12-12 19:40:29 +01:00
|
|
|
[[bin]]
|
|
|
|
|
name = "tvix"
|
|
|
|
|
path = "src/main.rs"
|
|
|
|
|
|
2022-12-08 22:19:22 +01:00
|
|
|
[dependencies]
|
2023-01-31 14:45:42 +01:00
|
|
|
nix-compat = { path = "../nix-compat" }
|
2022-12-08 22:19:22 +01:00
|
|
|
tvix-eval = { path = "../eval" }
|
|
|
|
|
rustyline = "10.0.0"
|
2022-12-16 12:54:22 +01:00
|
|
|
clap = { version = "4.0", features = ["derive", "env"] }
|
2022-12-08 22:19:22 +01:00
|
|
|
dirs = "4.0.0"
|
2022-12-13 18:17:00 +01:00
|
|
|
smol_str = "0.1"
|
fix(tvix/cli): handle SRI hashes in outputHash
Instead of being called with `md5`, `sha1`, `sha256` or `sha512`,
`fetchurl.nix` (from corepkgs / `<nix`) can also be called with a `hash`
attribute, being an SRI hash.
In that case, `builtin.derivation` is called with `outputHashAlgo` being
an empty string, and `outputHash` being an SRI hash string.
In other cases, an SRI hash is passed as outputHash, but outputHashAlgo
is set too.
Nix does modify these values in (single, fixed) output specification it
serializes to ATerm, but keeps it unharmed in `env`.
Move this into a construct_output_hash helper function, that can be
tested better in isolation.
Change-Id: Id9d716a119664c44ea7747540399966752e20187
Reviewed-on: https://cl.tvl.fyi/c/depot/+/7933
Reviewed-by: tazjin <tazjin@tvl.su>
Autosubmit: flokli <flokli@flokli.de>
Tested-by: BuildkiteCI
2023-01-26 14:18:12 +01:00
|
|
|
ssri = "7.0.0"
|
|
|
|
|
data-encoding = "2.3.3"
|
2023-01-26 23:42:10 +01:00
|
|
|
thiserror = "1.0.38"
|
refactor(tvix/cli): use Wu-Manber string scanning for drv references
Switch out the string-scanning algorithm used in the reference scanner.
The construction of aho-corasick automata made up the vast majority of
runtime when evaluating nixpkgs previously. While the actual scanning
with a constructed automaton is relatively fast, we almost never scan
for the same set of strings twice and the cost is not worth it.
An algorithm that better matches our needs is the Wu-Manber multiple
string match algorithm, which works efficiently on *long* and *random*
strings of the *same length*, which describes store paths (up to their
hash component).
This switches the refscanner crate to a Rust implementation[0][1] of
this algorithm.
This has several implications:
1. This crate does not provide a way to scan streams. I'm not sure if
this is an inherent problem with the algorithm (probably not, but
it would need buffering). Either way, related functions and
tests (which were actually unused) have been removed.
2. All strings need to be of the same length. For this reason, we
truncate the known paths after their hash part (they are still
unique, of course).
3. Passing an empty set of matches, or a match that is shorter than
the length of a store path, causes the crate to panic. We safeguard
against this by completely skipping the refscanning if there are no
known paths (i.e. when evaluating the first derivation of an eval),
and by bailing out of scanning a string that is shorter than a
store path.
On the upside, this reduces overall runtime to less 1/5 of what it was
before when evaluating `pkgs.stdenv.drvPath`.
[0]: Frankly, it's a random, research-grade MIT-licensed
crate that I found on Github:
https://github.com/jneem/wu-manber
[1]: We probably want to rewrite or at least fork the above crate, and
add things like a three-byte wide scanner. Evaluating large
portions of nixpkgs can easily lead to more than 65k derivations
being scanned for.
Change-Id: I08926778e1e5d5a87fc9ac26e0437aed8bbd9eb0
Reviewed-on: https://cl.tvl.fyi/c/depot/+/8017
Tested-by: BuildkiteCI
Reviewed-by: flokli <flokli@flokli.de>
2023-02-02 13:51:59 +01:00
|
|
|
|
|
|
|
|
[dependencies.wu-manber]
|
2023-02-04 10:05:13 +01:00
|
|
|
git = "https://github.com/tvlfyi/wu-manber.git"
|
