![]() $ guile ~/src/guix-debugging/prof-packages.scm (sigaction SIGINT (lambda (_) (display-timings))) (call-with-progress-reporter (progress-reporter/bar (length packages)) (define* (display-timings #:optional (port (current-output-port))) (drv (inferior-package-derivation store package)) (package (car (lookup-inferior-packages inferior name version))) (define (time-package-derivation name version) (packages (inferior-available-packages inferior))) (let* ((inferior (open-inferior %inferior-directory)) (string-append (getenv "HOME") "/.config/guix/current")) (define (package->derivation* package system. You’ll find that something’s fishy, who knows. ![]() Interesting to see is the time normalized by the number of nodes in theĪnyway, perhaps if you look at the ranking of your favorite packages, ![]() Now, this list gives us timing, but not outliers. The derivation graph, so no wonder it takes time.įor “win64” and “win64-staging”, I found that we’re dragging all of the Has 1,316 nodes in its package graph, which map to almost 5K nodes in ![]() That doesn’t necessarily reveal anything surprising. I came up with the attached script, which led to theĪttached result here’s an excerpt, showing the most “expensive” packageĭerivations (measurements performed on an i7 laptop with only one run ![]() I wanted to time ‘package-derivation’ for each package, to see if there 19:15 ` zimoun 0 siblings, 1 reply 2+ messages in threadįrom: Ludovic Courtès 21:44 UTC ( / raw) How long to compute a package derivation? all messages for Guix-related lists mirrored at help / color / mirror / code / Atom feed * How long to compute a package derivation? 21:44 Ludovic Courtès ![]()
0 Comments
Leave a Reply. |
AuthorWrite something about yourself. No need to be fancy, just an overview. ArchivesCategories |