Skip to content
Snippets Groups Projects
  1. Mar 15, 2005
  2. Mar 14, 2005
  3. Mar 11, 2005
  4. Mar 10, 2005
  5. Mar 07, 2005
    • Eelco Dolstra's avatar
      * In the checker, do traversals of the dependency graph explicitly. A · 97c93526
      Eelco Dolstra authored
        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.)
      97c93526
    • Eelco Dolstra's avatar
      * Use XML::LibXML. · bfbc55cb
      Eelco Dolstra authored
      bfbc55cb
    • Eelco Dolstra's avatar
      * Automatically add propagated build inputs to user environments. · 543d7a41
      Eelco Dolstra authored
        Maybe this is a bad idea.
      543d7a41
  6. Mar 04, 2005
  7. Mar 03, 2005
  8. Mar 02, 2005
  9. Mar 01, 2005
    • Eelco Dolstra's avatar
      * Doh! · 9e50e648
      Eelco Dolstra authored
      9e50e648
    • Eelco Dolstra's avatar
      * Add missing file to dist. · 8d364e5b
      Eelco Dolstra authored
      8d364e5b
    • Eelco Dolstra's avatar
      * Use a weighted use heuristic to disambiguate between multiple · db322a47
      Eelco Dolstra authored
        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).
      db322a47
  10. Feb 28, 2005
  11. Feb 25, 2005
  12. Feb 24, 2005
  13. Feb 23, 2005
  14. Feb 22, 2005
  15. Feb 18, 2005
Loading