about summary refs log tree commit diff
AgeCommit message (Collapse)AuthorFilesLines
2005-09-15 * Use a proper temporary directory.Eelco Dolstra1-7/+19
2005-09-15 * This is not a GNU project :-PEelco Dolstra1-1/+1
2005-09-14 * Remove dead code.Eelco Dolstra1-6/+0
2005-09-14 * Release notes in Docbook; ASCII release notes (i.e., the `NEWS'Eelco Dolstra6-332/+581
file) is now generated from that using `w3m' and some XSL hackery.
2005-09-14 * List concatenation must be right-associative for efficiency.Eelco Dolstra1-1/+1
2005-09-13 * Remove debugging code.Eelco Dolstra1-9/+0
2005-09-13 * More debugging.Eelco Dolstra1-0/+7
2005-09-13 * Debugging.Eelco Dolstra1-0/+2
2005-09-13 * Missing #include.Eelco Dolstra1-0/+2
2005-09-13 * Release notes.Eelco Dolstra1-3/+53
2005-09-01 * Use aterm 2.4.Eelco Dolstra1-3/+3
2005-09-01 * `nix-env -e' corrupts memory due to incorrect use of iterators.Eelco Dolstra1-2/+6
Reported by Rob Vermaas.
2005-08-14 * `dependencyClosure' now allows a search path, e.g.,Eelco Dolstra5-33/+90
dependencyClosure { ... searchPath = [ ../foo ../bar ]; ... } * Primop `dirOf' to return the directory part of a path (e.g., dirOf /a/b/c == /a/b). * Primop `relativise' (according to Webster that's a real word!) that given paths A and B returns a string representing path B relative path to A; e.g., relativise /a/b/c a/b/x/y => "../x/y".
2005-08-14 * A primitive operation `dependencyClosure' to do automatic dependencyEelco Dolstra6-30/+147
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.
2005-08-14 * Cleanup; sync with thesis.Eelco Dolstra3-19/+12
2005-08-14 * nix-hash: option `--truncate' to truncate the hash to 160 bits. Hmm,Eelco Dolstra2-0/+4
kind of ad hoc ;-)
2005-08-01 * Add .libs to svn:ignore. Commit 3500 ;-)Eelco Dolstra0-0/+0
2005-08-01 * Escape ASCII characters < 32 to Unicode FFFD (REPLACEMENT CHARACTER)Eelco Dolstra1-1/+2
so that we don't produce un-wellformed XML.
2005-08-01 * Oops. XSL stylesheet to mark errors.Eelco Dolstra1-0/+24
2005-08-01 * Mark error lines in red, and expand subtrees containing errorsEelco Dolstra2-2/+14
automatically.
2005-08-01 * channels -> channels-v3, catamaran -> nix.cs.uu.nl.Eelco Dolstra3-10/+9
2005-07-25 * Added a list concatenation operator:Eelco Dolstra8-12/+29
[1 2 3] ++ [4 5 6] => [1 2 3 4 5 6]
2005-07-25 * Add $prefix/lib to the RPM.Eelco Dolstra1-0/+1
2005-07-25 * Hack to get around the libtool wrapper script around nix-store notEelco Dolstra2-1/+5
working when PATH is unset.
2005-07-22 * Adhockery.Eelco Dolstra1-0/+1
2005-07-22 * Build dynamic libraries.Eelco Dolstra11-21/+27
2005-07-19 * Release notes.Eelco Dolstra1-0/+16
2005-07-19 * Prevent repeated wrapping of closed termsEelco Dolstra1-1/+6
(closed(closed(closed(...)))) since this reduces performance by producing bigger terms and killing caching (which incidentally also prevents useful infinite recursion detection).
2005-07-16 * Wat cleanups.Eelco Dolstra1-10/+5
2005-07-16 * Define paths using regexps, as is done in the Flex definition.Eelco Dolstra1-5/+2
2005-07-16 * Make the rejects a bit more compact.Eelco Dolstra1-7/+2
* Add lexical restrictions for keywords.
2005-07-16 * Fix ambiguity.Eelco Dolstra1-0/+1
2005-07-16 * Revive and update the SDF grammar for Nix expressions.Eelco Dolstra2-0/+149
2005-07-13 * nix-build: default to `./default.nix' if no paths are specified.Eelco Dolstra3-29/+43
So when using Nix as a build tool, you can just say `nix-build' and it will build the top-level derivation defined in `default.nix'.
2005-07-12 * Add curl to the RPM dependencies. Should fix NIX-11.Eelco Dolstra1-0/+1
2005-07-12 * In nix-instantiate, at top-level, call functions that have argumentsEelco Dolstra1-0/+17
with default values automatically. I.e., e -> e {}. This feature makes convenience expressions such as pkgs/system/i686-linux.nix in Nixpkgs obsolete, since we can just do $ nix-instantiate ./pkgs/system/all-packages.nix since all-packages.nix takes a single argument (system) that has a default value (__thisSystem).
2005-06-18 * Don't create patches for archives >= 150 MB because bsdiff can'tEelco Dolstra1-1/+13
handle it. It crashed on the 234 MB tetex archive. Probably we will never be able to handle archives of that size on 32-bit machines (because bsdiff does everything in memory requiring max(17*n,9*n+m)+O(1) bytes, so the address space simply isn't there).
2005-05-18 * Added a primop `removeAttrs' to remove attributes from a set, e.g.,Eelco Dolstra4-0/+29
`removeAttrs attrs ["x", "y"]' returns the set `attrs' with the attributes named `x' and `y' removed. It is not an error for the named attributes to be missing from the input set.
2005-05-10 * Ignore (with a warning) invalid garbage collector roots.Eelco Dolstra1-1/+6
2005-05-10 * Some svn:ignores.Eelco Dolstra0-0/+0
2005-05-10 * Another typo.Eelco Dolstra1-1/+1
2005-05-10 * Make unpacking of patch sequences much faster by not doing redundantEelco Dolstra2-16/+38
unpacking and repacking of intermediate paths.
2005-05-10 * Typo.Eelco Dolstra1-1/+1
2005-05-09 * Handle store path arguments in `nix-env -i' correctly again.Eelco Dolstra1-9/+30
2005-05-09 * Use Berkeley DB 4.3.38.Eelco Dolstra1-3/+3
2005-05-09 * Automatically upgrade the Berkeley DB environment if necessary.Eelco Dolstra2-106/+133
2005-05-09 * Crazy: don't use real hashes of real components in examples, sinceEelco Dolstra2-5/+5
they cause Nix builds to have unnecessary retained dependences (e.g., on Subversion).
2005-05-08 * Lazily compute the derivation and output paths of derivations. ThisEelco Dolstra1-40/+63
makes most query and installation operations much faster (e.g., `nix-env -qa' on the current Nixpkgs is about 10 times faster).
2005-05-08 * ATermMap needs an assignment operator, otherwise we are screwed.Eelco Dolstra2-6/+36
2005-05-07 Commit 3000!Eelco Dolstra1-7/+23
* Make the `derivation' primitive much more lazy. The expression `derivation attrs' now evaluates to (essentially) attrs // { type = "derivation"; outPath = derivation! attrs; drvPath = derivation! attrs; } where `derivation!' is a primop that does the actual derivation instantiation (i.e., it does what `derivation' used to do). The advantage is that it allows commands such as `nix-env -qa' and `nix-env -i' to be much faster since they no longer need to instantiate all derivations, just the `name' attribute. (However, `nix-env' doesn't yet take advantage of this since it still always evaluates the `outPath' and `drvPath' attributes). Also, this allows derivations to cyclically reference each other, for example, webServer = derivation { ... hostName = "svn.cs.uu.nl"; services = [svnService]; }; svnService = derivation { ... hostName = webServer.hostName; }; Previously, this would yield a black hole (infinite recursion).