On 15/06/2015 10:54 p.m., ketmar wrote:
that is, this approach to reduce compilation times is wrong. storing
partially analyzed ASTs on disk as easily parsable binary representations
(preferably ones that can be mmaped and used as-is) is right. updating
the caches when more templates are semanticed is right. even moving off
the system linker in favor of much simplier and faster homegrown linker
is right for some cases. too much work, though...
I'm personally very interested in a D based linker. Preferably using ranges.
Unfortunately mine is going take quite a while to get anywhere and that
is just for PE-COFF support.
I theorize for a language like C it could be quite a fast compile + link
when using ranges.
