Faster Array#/MutableArray# copies

[Nathan Howell]

On Mon, Feb 28, 2011 at 9:01 AM, Simon Marlow <marlowsd at gmail.com> wrote:

> Ideally you'd want the heap check in the primop to be aggregated into the
> calling function's heap check, and the primop should allocate directly from
> the heap instead of calling out to the RTS allocate(). All this is a bit
> much to expect LLVM to do, but we could do it in the Glorious New Code
> Generator...
>

It's probably (certainly) better to do it in the code generator but it is
rather easy to perform in LLVM and might be a worthwhile optimization during
LTO/LTCG.
-------------- next part --------------
An HTML attachment was scrubbed...
URL: <http://www.haskell.org/pipermail/glasgow-haskell-users/attachments/20110301/a4b95e23/attachment.htm>