mirror of
https://github.com/privatevoid-net/nix-super.git
synced 2024-11-22 14:06:16 +02:00
* A primitive operation `dependencyClosure' to do automatic dependency
determination (e.g., finding the header files dependencies of a C file) in Nix low-level builds automatically. For instance, in the function `compileC' in make/lib/default.nix, we find the header file dependencies of C file `main' as follows: localIncludes = dependencyClosure { scanner = file: import (findIncludes { inherit file; }); startSet = [main]; }; The function works by "growing" the set of dependencies, starting with the set `startSet', and calling the function `scanner' for each file to get its dependencies (which should yield a list of strings representing relative paths). For instance, when `scanner' is called on a file `foo.c' that includes the line #include "../bar/fnord.h" then `scanner' should yield ["../bar/fnord.h"]. This list of dependencies is absolutised relative to the including file and added to the set of dependencies. The process continues until no more dependencies are found (hence its a closure). `dependencyClosure' yields a list that contains in alternation a dependency, and its relative path to the directory of the start file, e.g., [ /bla/bla/foo.c "foo.c" /bla/bar/fnord.h "../bar/fnord.h" ] These relative paths are necessary for the builder that compiles foo.c to reconstruct the relative directory structure expected by foo.c. The advantage of `dependencyClosure' over the old approach (using the impure `__currentTime') is that it's completely pure, and more efficient because it only rescans for dependencies (i.e., by building the derivations yielded by `scanner') if sources have actually changed. The old approach rescanned every time.
This commit is contained in:
parent
714b7256cd
commit
08c53923db
6 changed files with 147 additions and 30 deletions
|
@ -1,11 +1,13 @@
|
||||||
let {
|
with import ../../lib;
|
||||||
|
|
||||||
inherit (import ../../lib) compileC findIncludes link;
|
let {
|
||||||
|
|
||||||
hello = link {programName = "hello"; objects = compileC {
|
hello = link {programName = "hello"; objects = compileC {
|
||||||
main = ./foo/hello.c;
|
main = ./foo/hello.c;
|
||||||
localIncludes = "auto";
|
localIncludes = "auto";
|
||||||
};};
|
};};
|
||||||
|
|
||||||
|
# body = findIncludes {main = ./foo/hello.c;};
|
||||||
|
|
||||||
body = [hello];
|
body = [hello];
|
||||||
}
|
}
|
||||||
|
|
|
@ -70,4 +70,5 @@ fi
|
||||||
|
|
||||||
mkdir $out
|
mkdir $out
|
||||||
test "$prefix" && cd $prefix
|
test "$prefix" && cd $prefix
|
||||||
|
ls -l
|
||||||
gcc -Wall $cFlags -c $mainName -o $out/$mainName.o
|
gcc -Wall $cFlags -c $mainName -o $out/$mainName.o
|
||||||
|
|
|
@ -14,11 +14,13 @@ rec {
|
||||||
builder = ./compile-c.sh;
|
builder = ./compile-c.sh;
|
||||||
localIncludes =
|
localIncludes =
|
||||||
if localIncludes == "auto" then
|
if localIncludes == "auto" then
|
||||||
import (findIncludes {
|
dependencyClosure {
|
||||||
main = toString main;
|
scanner = main:
|
||||||
hack = __currentTime;
|
import (findIncludes {
|
||||||
inherit cFlags;
|
inherit main;
|
||||||
})
|
});
|
||||||
|
startSet = [main];
|
||||||
|
}
|
||||||
else
|
else
|
||||||
localIncludes;
|
localIncludes;
|
||||||
inherit main;
|
inherit main;
|
||||||
|
@ -36,10 +38,11 @@ rec {
|
||||||
};
|
};
|
||||||
*/
|
*/
|
||||||
|
|
||||||
findIncludes = {main, hack, cFlags ? ""}: stdenv.mkDerivation {
|
findIncludes = {main}: stdenv.mkDerivation {
|
||||||
name = "find-includes";
|
name = "find-includes";
|
||||||
builder = ./find-includes.sh;
|
realBuilder = pkgs.perl ~ "bin/perl";
|
||||||
inherit main hack cFlags;
|
args = [ ./find-includes.pl ];
|
||||||
|
inherit main;
|
||||||
};
|
};
|
||||||
|
|
||||||
link = {objects, programName ? "program", libraries ? []}: stdenv.mkDerivation {
|
link = {objects, programName ? "program", libraries ? []}: stdenv.mkDerivation {
|
||||||
|
|
19
make/lib/find-includes.pl
Normal file
19
make/lib/find-includes.pl
Normal file
|
@ -0,0 +1,19 @@
|
||||||
|
use strict;
|
||||||
|
|
||||||
|
my $root = $ENV{"main"};
|
||||||
|
my $out = $ENV{"out"};
|
||||||
|
|
||||||
|
open OUT, ">$out" or die "$!";
|
||||||
|
print OUT "[\n";
|
||||||
|
|
||||||
|
open IN, "<$root" or die "$!";
|
||||||
|
while (<IN>) {
|
||||||
|
if (/^\#include\s+\"(.*)\"/) {
|
||||||
|
print "DEP $1\n";
|
||||||
|
print OUT "\"$1\"\n";
|
||||||
|
}
|
||||||
|
}
|
||||||
|
close IN;
|
||||||
|
|
||||||
|
print OUT "]\n";
|
||||||
|
close OUT;
|
|
@ -1,20 +0,0 @@
|
||||||
. $stdenv/setup
|
|
||||||
|
|
||||||
echo "finding includes of \`$(basename $main)'..."
|
|
||||||
|
|
||||||
makefile=$NIX_BUILD_TOP/makefile
|
|
||||||
|
|
||||||
mainDir=$(dirname $main)
|
|
||||||
(cd $mainDir && gcc $cFlags -MM $(basename $main) -MF $makefile) || false
|
|
||||||
|
|
||||||
echo "[" >$out
|
|
||||||
|
|
||||||
while read line; do
|
|
||||||
line=$(echo "$line" | sed 's/.*://')
|
|
||||||
for i in $line; do
|
|
||||||
fullPath=$(readlink -f $mainDir/$i)
|
|
||||||
echo " [ $fullPath \"$i\" ]" >>$out
|
|
||||||
done
|
|
||||||
done < $makefile
|
|
||||||
|
|
||||||
echo "]" >>$out
|
|
|
@ -410,6 +410,117 @@ static Expr primIsNull(EvalState & state, const ATermVector & args)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static Path findDependency(Path start, string dep)
|
||||||
|
{
|
||||||
|
if (dep[0] == '/') throw Error(
|
||||||
|
format("illegal absolute dependency `%1%'") % dep);
|
||||||
|
|
||||||
|
Path p = canonPath(dirOf(start) + "/" + dep);
|
||||||
|
|
||||||
|
if (pathExists(p))
|
||||||
|
return p;
|
||||||
|
else
|
||||||
|
return "";
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
/* Make path `p' relative to directory `pivot'. E.g.,
|
||||||
|
relativise("/a/b/c", "a/b/x/y") => "../x/y". Both input paths
|
||||||
|
should be in absolute canonical form. */
|
||||||
|
static string relativise(Path pivot, Path p)
|
||||||
|
{
|
||||||
|
assert(pivot.size() > 0 && pivot[0] == '/');
|
||||||
|
assert(p.size() > 0 && p[0] == '/');
|
||||||
|
|
||||||
|
if (pivot == p) return ".";
|
||||||
|
|
||||||
|
/* `p' is in `pivot'? */
|
||||||
|
Path pivot2 = pivot + "/";
|
||||||
|
if (p.substr(0, pivot2.size()) == pivot2) {
|
||||||
|
return p.substr(pivot2.size());
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Otherwise, `p' is in a parent of `pivot'. Find up till which
|
||||||
|
path component `p' and `pivot' match, and add an appropriate
|
||||||
|
number of `..' components. */
|
||||||
|
unsigned int i = 1;
|
||||||
|
while (1) {
|
||||||
|
unsigned int j = pivot.find('/', i);
|
||||||
|
if (j == string::npos) break;
|
||||||
|
j++;
|
||||||
|
if (pivot.substr(0, j) != p.substr(0, j)) break;
|
||||||
|
i = j;
|
||||||
|
}
|
||||||
|
|
||||||
|
string prefix;
|
||||||
|
unsigned int slashes = count(pivot.begin() + i, pivot.end(), '/') + 1;
|
||||||
|
while (slashes--) {
|
||||||
|
prefix += "../";
|
||||||
|
}
|
||||||
|
|
||||||
|
return prefix + p.substr(i);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
|
static Expr primDependencyClosure(EvalState & state, const ATermVector & args)
|
||||||
|
{
|
||||||
|
Expr attrs = evalExpr(state, args[0]);
|
||||||
|
|
||||||
|
Expr scanner = queryAttr(attrs, "scanner");
|
||||||
|
if (!scanner) throw Error("attribute `scanner' required");
|
||||||
|
|
||||||
|
Expr startSet = queryAttr(attrs, "startSet");
|
||||||
|
if (!startSet) throw Error("attribute `startSet' required");
|
||||||
|
ATermList startSet2 = evalList(state, startSet);
|
||||||
|
|
||||||
|
Path pivot;
|
||||||
|
PathSet workSet;
|
||||||
|
for (ATermIterator i(startSet2); i; ++i) {
|
||||||
|
Path p = evalPath(state, *i);
|
||||||
|
workSet.insert(p);
|
||||||
|
pivot = dirOf(p);
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Construct the dependency closure by querying the dependency of
|
||||||
|
each path in `workSet', adding the dependencies to
|
||||||
|
`workSet'. */
|
||||||
|
PathSet doneSet;
|
||||||
|
while (!workSet.empty()) {
|
||||||
|
Path path = *(workSet.begin());
|
||||||
|
workSet.erase(path);
|
||||||
|
|
||||||
|
if (doneSet.find(path) != doneSet.end()) continue;
|
||||||
|
doneSet.insert(path);
|
||||||
|
|
||||||
|
/* Call the `scanner' function with `path' as argument. */
|
||||||
|
printMsg(lvlError, format("finding dependencies in `%1%'") % path);
|
||||||
|
ATermList deps = evalList(state, makeCall(scanner, makePath(toATerm(path))));
|
||||||
|
|
||||||
|
/* Try to find the dependencies relative to the `path'. */
|
||||||
|
for (ATermIterator i(deps); i; ++i) {
|
||||||
|
Path dep = findDependency(path, evalString(state, *i));
|
||||||
|
if (dep == "")
|
||||||
|
printMsg(lvlError, format("did NOT find dependency `%1%'") % dep);
|
||||||
|
else {
|
||||||
|
printMsg(lvlError, format("found dependency `%1%'") % dep);
|
||||||
|
workSet.insert(dep);
|
||||||
|
}
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
|
/* Return a list of the dependencies we've just found. */
|
||||||
|
ATermList deps = ATempty;
|
||||||
|
for (PathSet::iterator i = doneSet.begin(); i != doneSet.end(); ++i) {
|
||||||
|
deps = ATinsert(deps, makeStr(toATerm(relativise(pivot, *i))));
|
||||||
|
deps = ATinsert(deps, makePath(toATerm(*i)));
|
||||||
|
}
|
||||||
|
|
||||||
|
printMsg(lvlError, format("RESULT is `%1%'") % makeList(deps));
|
||||||
|
|
||||||
|
return makeList(deps);
|
||||||
|
}
|
||||||
|
|
||||||
|
|
||||||
/* Apply a function to every element of a list. */
|
/* Apply a function to every element of a list. */
|
||||||
static Expr primMap(EvalState & state, const ATermVector & args)
|
static Expr primMap(EvalState & state, const ATermVector & args)
|
||||||
{
|
{
|
||||||
|
@ -469,6 +580,7 @@ void EvalState::addPrimOps()
|
||||||
addPrimOp("baseNameOf", 1, primBaseNameOf);
|
addPrimOp("baseNameOf", 1, primBaseNameOf);
|
||||||
addPrimOp("toString", 1, primToString);
|
addPrimOp("toString", 1, primToString);
|
||||||
addPrimOp("isNull", 1, primIsNull);
|
addPrimOp("isNull", 1, primIsNull);
|
||||||
|
addPrimOp("dependencyClosure", 1, primDependencyClosure);
|
||||||
|
|
||||||
addPrimOp("map", 2, primMap);
|
addPrimOp("map", 2, primMap);
|
||||||
addPrimOp("removeAttrs", 2, primRemoveAttrs);
|
addPrimOp("removeAttrs", 2, primRemoveAttrs);
|
||||||
|
|
Loading…
Reference in a new issue