Thread

1. MiroslavPokorny · 1789694571 · focus · HN ↗

   What does Goose change about memory management ?

   1. bobbydigitales · 1789694815 · focus · HN ↗

      [dead]

   2. kenferry · 1789695664 · focus · HN ↗

      A lot - title could probably use editing. The language has no heap, only stack memory, so the only deallocation is returning from a call stack frame.

      1. yndoendo · 1789697119 · focus · HN ↗

         How big is the stack? Too often large data will blow the top and destroy adjacent stacks in multi-thread environments. Are memory barrier fences used to check against overflow?

         1. gcoakes · 1789697780 · focus · HN ↗

            I think it is supposed to be stacks in the general sense of the data structure, not the literal `sp` register. I imagine they could be arbitrarily sized up to physical limits if you do some mmap magic. I'm still a bit fuzzy about how you could make useful programs with that, but it seems interesting.

            1. MiroslavPokorny · 1789704590 · focus · HN ↗

               Stack allocations will be lost when the enclosing call exits.

               How does this help for long term values ?

         2. bobbydigitales · 1789699253 · focus · HN ↗

            [dead]

   3. zamalek · 1789697121 · focus · HN ↗

      If I am reading it correctly, the compiler creates N bump allocators per function (or possibly globally) - where N is (I'm guessing at this point) determined by liveness or similar.

      1. [deleted] · 1789717552 · focus · HN ↗

         [deleted]

Unofficial Hacker News client; not affiliated with Y Combinator.