phf came back from the woods again ☟︎

phf: http://btcbase.org/log/2017-06-30#1677284 << i'll take a look. i've been periodically seeings parts of that lisp profiling and optimization thread ☝︎

phf: it's a special thread alright.

phf: i think ascii already made that point, that if you're profiling lisp with the vm startup, then you should also profile c machine from boot time. at the very least the vm should be warmed up by loading all the dependencies into the core, doing save-lisp on it, and then making sure that your foo.lisp has an up to date fasl. inside lisp though to achieve the optimizations you run variants of your function inside (time ...) until you bring it within the ra ☟︎

phf: nge you want

phf: you can do sampling profiler to get some idea of what your mainloop looks like, but in the code of that size you should be able to reason about it. you then ensure that you have best possible type for your task, and type annotate the mainloop functions. type annotation for speed is tricky and unless you know both the standard and your implementation in and out, you have to look at the assemble of the resulting function

phf: i think maybe it's worthwhile as an auxiliary exploration. you can run it and it will either confirm what you already understood, but sometimes it'll correct your understanding. either way you have to understand how sampling profiler works (particularly when it comes to sampling freq), to use it effectively

phf: if you quicklisp bulk of your code, you're still basically in honeywagon territory