2019-11-11 18:38:42 +01:00
|
|
|
{ lib }:
|
|
|
|
|
|
|
|
with builtins;
|
|
|
|
with lib;
|
|
|
|
|
|
|
|
rec {
|
|
|
|
ifelse = a: b: c: if a then b else c;
|
2020-03-11 01:53:04 +01:00
|
|
|
fileContentsOr = a: b: (ifelse
|
|
|
|
(pathIsRegularFile a)
|
|
|
|
a b);
|
2020-06-01 02:24:25 +02:00
|
|
|
cwd = builtins.getEnv "PWD";
|
2020-05-10 17:16:08 +02:00
|
|
|
|
|
|
|
# lst (string PATH) (string FILETYPE) (bool RETURNFULLPATH)
|
2019-11-11 18:38:42 +01:00
|
|
|
lst = { p ? cwd, t ? "regular", b ? false }: (lists.forEach
|
|
|
|
(attrNames
|
|
|
|
(filterAttrs (n: v: v == t)
|
|
|
|
(readDir p)))
|
|
|
|
(v: ((optionalString b "${p}/") + v)));
|
|
|
|
lsf = p: (lst { p = p; });
|
|
|
|
lsd = p: (lst { p = p; t = "directory"; b = true; });
|
|
|
|
lsfRec = p: b: flatten ((map (np: lsfRec np b) (lsd p)) ++ (lst { p = p; b = b; }));
|
2020-03-27 13:25:54 +01:00
|
|
|
hasAttrs = aList: d: (map
|
|
|
|
(a:
|
|
|
|
(ifelse (isList a)
|
|
|
|
(hasAttrByPath a d)
|
|
|
|
(hasAttr a d)))
|
|
|
|
aList);
|
2020-06-01 02:24:25 +02:00
|
|
|
|
|
|
|
# Not sure how list operations are implemented in Nix
|
|
|
|
# This might be a tad bit inefficient.
|
|
|
|
# TODO: look for better implementation (map is a builtin function so checking that probably won't help)
|
|
|
|
# Sequentially checks elements of list (l) for condition (cond) and executes do on first match.
|
|
|
|
meetsConDo = cond: do: l: ifelse (l == []) false
|
|
|
|
(let
|
|
|
|
h = (head l);
|
|
|
|
t = (tail l);
|
|
|
|
in ifelse (cond h) (do h)
|
|
|
|
(meetsConDo (cond) (do) (t)));
|
2020-05-10 17:16:08 +02:00
|
|
|
deps = p: ifelse (isAttrs p) (filter (p: isAttrs p)
|
|
|
|
(p.buildInputs ++ p.nativeBuildInputs ++ p.propagatedBuildInputs ++ p.propagatedNativeBuildInputs)
|
|
|
|
) [];
|
|
|
|
importFilter = l: p: filter (n: elem (nameFromURL (toString n) ".") l) p;
|
|
|
|
depsRec = ld: ifelse (ld == []) [] ((toList ld) ++ (depsRec (lists.unique (lists.flatten (map (d: deps d) (toList ld))))));
|
2020-06-01 02:24:25 +02:00
|
|
|
isBroken = p: meetsConDo (s: ((hasAttrByPath s.path p) && (s.check (getAttrFromPath s.path p)))) (s: s.msg)
|
|
|
|
[
|
|
|
|
{ path = ["meta" "broken"]; msg = (warn "Package ${p.name} is marked as broken." true); check = m: m; }
|
|
|
|
{ path = ["meta" "knownVulnerabilities" ]; msg = (warn "Package ${p.name} has known Vulnerabilities.." true); check = m: m != []; }
|
2021-10-28 10:36:06 +02:00
|
|
|
{ path = ["name"]; msg = (warn "${p.name}: python2 is depricated." false); check = m: (strings.hasInfix "python2" m) || (strings.hasInfix "python-2" m); }
|
2020-06-01 02:24:25 +02:00
|
|
|
# not sure if the following test creates false positives (AFAIK every derivation/package needs to have an outPath)
|
|
|
|
# , definitely should catch all corner cases/everything that fails to evaluate.
|
|
|
|
{ path = [ "outPath" ]; msg = (warn "Package ${p.name} has no outPath" true); check = m: !(tryEval m).success; }
|
|
|
|
];
|
2020-05-10 17:16:08 +02:00
|
|
|
depsBroken = p: lists.any (p: (isBroken p)) (deps p);
|
2020-06-01 02:24:25 +02:00
|
|
|
# No more magic 🧙 here 😢
|
|
|
|
# But at least it now (hopefully) checks ONLY dependencies (and all of them at that).
|
|
|
|
depsBrokenRec = p: (meetsConDo
|
|
|
|
(p: ifelse (depsBroken p) true (depsBrokenRec (deps p)))
|
|
|
|
(p: true) (deps p)
|
|
|
|
);
|
2020-05-10 17:16:08 +02:00
|
|
|
pkgFilter = ld: (filter
|
2020-03-27 13:25:54 +01:00
|
|
|
(p: (
|
2020-05-10 17:16:08 +02:00
|
|
|
ifelse (isBroken p)
|
|
|
|
false
|
|
|
|
(ifelse (depsBrokenRec p)
|
|
|
|
(warn "Dependency of ${p.name} is marked as broken." false)
|
|
|
|
true)
|
|
|
|
))
|
|
|
|
ld);
|
2019-11-11 18:38:42 +01:00
|
|
|
}
|