Age | Commit message (Collapse) | Author | Files | Lines | |
---|---|---|---|---|---|
2005-03-23 | * `nix-store --register-validity': allow a path to refer to a path | Eelco Dolstra | 3 | -25/+63 | |
listed later in the list of new valid paths. | |||||
2005-03-23 | * Canonicalise path meta-data in `nix-store --register-validity'. | Eelco Dolstra | 1 | -1/+4 | |
2005-03-23 | * nix-store: `--isvalid' -> `--check-validity', `--validpath' -> | Eelco Dolstra | 4 | -17/+34 | |
`--register-validity'. * `nix-store --register-validity': read arguments from stdin, and allow the references and deriver to be set. | |||||
2005-03-21 | * Remove non-POSIX flag. | Eelco Dolstra | 1 | -1/+1 | |
2005-03-21 | * Fink compatibility. | Eelco Dolstra | 1 | -3/+3 | |
2005-03-18 | * Ignore hash conflicts in gc-releases.pl. | Eelco Dolstra | 3 | -5/+10 | |
2005-03-17 | * Manual updates. | Eelco Dolstra | 5 | -104/+133 | |
2005-03-16 | * Documented common environment variables. | Eelco Dolstra | 8 | -165/+298 | |
2005-03-16 | * Update the user environments figure to show multiple profiles and | Eelco Dolstra | 4 | -53/+52 | |
users. * Change to base-32 hashes. | |||||
2005-03-16 | * Automake 1.9 compatibility. | Eelco Dolstra | 1 | -5/+5 | |
2005-03-15 | * Some more updates. | Eelco Dolstra | 2 | -119/+97 | |
2005-03-15 | * Remove Docbook EBNF dependency. | Eelco Dolstra | 1 | -5/+0 | |
2005-03-15 | * XInclude all the way. | Eelco Dolstra | 8 | -52/+43 | |
2005-03-15 | * Manual updates. | Eelco Dolstra | 4 | -71/+13 | |
2005-03-15 | * Purify all corepkgs builders. | Eelco Dolstra | 5 | -15/+17 | |
2005-03-15 | * Use SHA-256 for nix-push. | Eelco Dolstra | 4 | -23/+34 | |
2005-03-14 | * Upgrade information. | Eelco Dolstra | 1 | -0/+21 | |
2005-03-14 | * Idem. | Eelco Dolstra | 1 | -1/+1 | |
2005-03-14 | * Pass `--base32' unless using MD5. | Eelco Dolstra | 1 | -1/+3 | |
2005-03-14 | * Bug in clearSubstitutes(). | Eelco Dolstra | 1 | -1/+2 | |
2005-03-14 | * Parse new hash format properly. | Eelco Dolstra | 1 | -6/+15 | |
2005-03-14 | * Print SHA-1 hashes in base-32 by default. | Eelco Dolstra | 1 | -2/+7 | |
2005-03-14 | * Prefix hash algorithm in patch generator too. | Eelco Dolstra | 1 | -8/+9 | |
2005-03-14 | * Set NAR name to content hash; previous nix-push names were not | Eelco Dolstra | 3 | -26/+16 | |
unique. * Drop `hashAlgo' attribute in manifests; prefix hashes with the hash algorithm instead. | |||||
2005-03-14 | * Script to garbage collect nix-push directories. It prints out all | Eelco Dolstra | 1 | -0/+75 | |
file names in the directory not included in any of the manifests specified on the command line. | |||||
2005-03-11 | * Preliminary NEWS for 0.8. | Eelco Dolstra | 1 | -0/+142 | |
2005-03-11 | * nix-install-package: install outPath, not drvPath, for now. | Eelco Dolstra | 2 | -2/+3 | |
* nix-prefecth-url: print out in base-16. | |||||
2005-03-10 | * Check for duplicate attributes and formal parameters in Nix | Eelco Dolstra | 7 | -1/+93 | |
expressions. | |||||
2005-03-07 | * In the checker, do traversals of the dependency graph explicitly. A | Eelco Dolstra | 2 | -45/+152 | |
conditional expression in the blacklist can specify when to continue/stop a traversal. For example, in <condition> <within> <traverse> <not><hasAttr name='outputHash' value='.+' /></not> </traverse> <hasAttr name='outputHash' value='ef1cb003448b4a53517b8f25adb12452' /> </within> </condition> we traverse the dependency graph, not following the dependencies of `fetchurl' derivations (as indicated by the presence of an `outputHash' attribute - this is a bit ugly). The resulting set of paths is scanned for a fetch of a file with the given hash, in this case, the hash of zlib-1.2.1.tar.gz (which has a security bug). The intent is that a dependency on zlib is not a problem if it is in a `fetchurl' derivation, since that's build-time only. (Other build-time uses of zlib *might* be a problem, e.g., static linking.) | |||||
2005-03-07 | * Use XML::LibXML. | Eelco Dolstra | 2 | -41/+87 | |
2005-03-07 | * Automatically add propagated build inputs to user environments. | Eelco Dolstra | 1 | -1/+15 | |
Maybe this is a bad idea. | |||||
2005-03-04 | * Basic blacklist checker. Each element in a user environment is | Eelco Dolstra | 2 | -3/+122 | |
checked against every item in a blacklist. | |||||
2005-03-03 | * Don't use fork() in copyPath(), but a string buffer. | Eelco Dolstra | 2 | -47/+17 | |
2005-03-03 | * Channel fix. | Eelco Dolstra | 1 | -1/+1 | |
2005-03-03 | * Increase Berkeley DB limits a bit more. | Eelco Dolstra | 2 | -7/+26 | |
* Maintain the cleanup invariant in clearSubstitutes(). | |||||
2005-03-02 | * Concept for a simple blacklist. | Eelco Dolstra | 1 | -0/+48 | |
2005-03-02 | * `nix-store -q --hash' to quickly query the hash of the contents of a | Eelco Dolstra | 3 | -6/+28 | |
store path (which is stored in the database). | |||||
2005-03-01 | * Doh! | Eelco Dolstra | 1 | -1/+1 | |
2005-03-01 | * Add missing file to dist. | Eelco Dolstra | 1 | -1/+2 | |
2005-03-01 | * Use a weighted use heuristic to disambiguate between multiple | Eelco Dolstra | 1 | -8/+77 | |
occurances of a component. If the shortest path distance between a component P and Q in the referers graph is D, then the contribution of Q to the use of P is 1 / R^D, where R >= 1, typically 2. This expresses that distant indirect uses are less important than nearby uses. For instance, this can disambiguate between the bootstrap GCC in Nixpkgs and the GCC of the final stdenv (the former has more uses, but they are further away), and between the GCC of the final stdenv and the GCC+G77 build (the latter has very few uses). | |||||
2005-02-28 | * Added a disambiguation heuristic: if two components have the same | Eelco Dolstra | 2 | -4/+24 | |
name but differ to much in sice (by more than a factor of 3), then never generate a patch. | |||||
2005-02-25 | * Add a version number to manifests. | Eelco Dolstra | 3 | -2/+16 | |
2005-02-25 | * Pause if errors occur. | Eelco Dolstra | 1 | -1/+1 | |
2005-02-25 | * nix-install-package: Use the new (trivial) package format generated | Eelco Dolstra | 1 | -21/+34 | |
by the build farm. See e.g., http://catamaran.labs.cs.uu.nl/dist/nixpkgs-0.8/nixpkgs-0.7pre2302/; the user can click on packages, and they will be installed (assuming the `application/nix-package' MIME type has been associated with `nix-install-package'). Nix expressions are no longer involved: a "package" is just a pointer to a manifest, and the top-level store derivation to be added to the user environment. This makes these packages independent from Nix expression evolution. Note that we install the store derivation ($drvPath), not the resulting output path ($outPath). This is equivalent, except that installing the derivation maintains the back-link from the output path to the derivation that built it. This is useful for maintenance. * Automatically re-exec in an xterm so that the user sees something when `nix-install-package' is run from a browser. | |||||
2005-02-24 | * Properly specify the hash algorithm in the manifests, and read it | Eelco Dolstra | 4 | -13/+31 | |
too. * Change the default hash for nix-prefetch-url back to md5, since that's what we use in Nixpkgs (for now; a birthday attack is rather unlikely there). | |||||
2005-02-24 | * (Unnecessary) refactoring. | Eelco Dolstra | 1 | -29/+36 | |
2005-02-23 | * When multiple derivations are specified in `nix-store -r', don't | Eelco Dolstra | 1 | -62/+50 | |
continue building when one fails unless `--keep-going' is specified. * When `--keep-going' is specified, print out the set of failing derivations at the end (otherwise it can be hard to find out which failed). | |||||
2005-02-22 | * Support for fixed-output hashes over directory trees (i.e., over the | Eelco Dolstra | 3 | -16/+35 | |
NAR dump of the path). | |||||
2005-02-22 | * Compatibility hack so that Nixpkgs can continue to do hash checking | Eelco Dolstra | 2 | -1/+10 | |
in `fetchurl' in Nix <= 0.7, but doesn't in Nix 0.8. | |||||
2005-02-18 | * Subtle bug in the builder: if a subgoal that is instantiated | Eelco Dolstra | 1 | -31/+30 | |
multiple times is also a top-level goal, then the second and later instantiations would never be created because there would be a stable pointer to the first one that would keep it alive in the WeakGoalMap. * Some tracing code for debugging this kind of problem. |