Beefy Boxes and Bandwidth Generously Provided by pair Networks
Clear questions and runnable code
get the best and fastest answer

Re^8: Perl 5 Optimizing Compiler, Part 4: LLVM Backend?

by chromatic (Archbishop)
on Aug 28, 2012 at 18:28 UTC ( #990298=note: print w/replies, xml ) Need Help??

in reply to Re^7: Perl 5 Optimizing Compiler, Part 4: LLVM Backend?
in thread Perl 5 Optimizing Compiler, Part 4: LLVM Backend?

My instinct (after not exploring this in much detail) is that you will get some improvements, if you don't blow past the memory limits of LLVM. I believe the 16 MB limit is gone, which will help, but you're still talking about deserializing plenty of bytecode for LLVM to process.

However Reini and I disagree about some things, I think we both agree that improving the typefulness of Perl code to narrow down the dynamic possibilities offer more potential improvements for memory use and optimization. That is probably also compatible with LLVM, but I still think to get real advantages out of LLVM, you have to port the VM to generate IR internally rather than compile the C components to IR with clang.

  • Comment on Re^8: Perl 5 Optimizing Compiler, Part 4: LLVM Backend?

Replies are listed 'Best First'.
Re^9: Perl 5 Optimizing Compiler, Part 4: LLVM Backend?
by BrowserUk (Pope) on Aug 28, 2012 at 19:09 UTC

    It is when you get into the details, that casual discussion starts to get difficult. There are so many phases, it gets very hard to make it clear what we are talking about at any given point. (It is hard to keep them distinct in your (my!) own mind.)

    I *think* we are talking about (roughly) the same things here.

    1. There is the bit of perl that parses the source code and builds the AST from the Perl programs source.

      This would need to be left pretty much as is. The whole perl defines Perl thing. This would need to be compiled (back to) C and then linked into an executable.

    2. Then there is the bit that converts the AST into byte code.

      I believe that this would need to be separated out and converted to produce IF.

    3. Then there is the bit of perl that ordinarily runs the bytecode.

      Not just the runloop, but all the code the runloop dispatches to.

      I think that should be compiled to IF and built into an IF library (.bc)

      It would be ""combined"" with the IF from stage 2, at runtime, and given to the JIT to convert to machine code.

    All total speculation of course. And possibly completely impractical or impossible. But we won't know ...

    With the rise and rise of 'Social' network sites: 'Computers are making people easier to use everyday'
    Examine what is said, not who speaks -- Silence betokens consent -- Love the truth but pardon error.
    "Science is about questioning the status quo. Questioning authority".
    In the absence of evidence, opinion is indistinguishable from prejudice.

    RIP Neil Armstrong

Log In?

What's my password?
Create A New User
Node Status?
node history
Node Type: note [id://990298]
and all is quiet...

How do I use this? | Other CB clients
Other Users?
Others chanting in the Monastery: (5)
As of 2018-03-22 04:56 GMT
Find Nodes?
    Voting Booth?
    When I think of a mole I think of:

    Results (272 votes). Check out past polls.