Re:LLVM’s garbage collection facilities and SBCL’s generatio...
by Groxx on Tuesday February 13, 2018 @10:58PM
(#16373341)
Yeah, it was fuzzy to me too. Found this in the article though:
> First, a description of how SBCL’s generational GC works:
> ...
> Being conservative with regards to the stack. That creates a major clash with LLVM which expects a stack map. A stack map declares which data type can be found where on the stack for a function (as in every invocation of that function needs to comply to it), whereas SBCL’s compiler can and does generate code that just places anything anywhere. This makes the stack a lot more compact in some call patterns.
> First, a description of how SBCL’s generational GC works:
> ...
> Being conservative with regards to the stack. That creates a major clash with LLVM which expects a stack map. A stack map declares which data type can be found where on the stack for a function (as in every invocation of that function needs to comply to it), whereas SBCL’s compiler can and does generate code that just places anything anywhere. This makes the stack a lot more compact in some call patterns.
So those were intended as corrections.