From Free Pascal wiki
Jump to: navigation, search

The current status of Low Level Virtual Machine (LLVM) is in progress.


Note: The information in this section has been updated as of September 2016 and might be outdated by the time you read it


LLVM support has not yet fully landed in trunk, so it is not yet possible to use it.

The main missing features before the result is usable for real world code are:

  1. LLVM has support for explicit setjmp/longjmp (which FPC uses on most platforms for exception handling), but we need to make use of some LLVM exception handling intrinsics to ensure the correctness of its control flow analysis
    A future, better, way may be to solely use LLVM's built-in primitives for exception handling.
  2. possibly support for debug information generation
    There are also a few LLVM limitations:
    • LLVM has no support for arbitrary instructions throwing exceptions. I.e., segmentation faults, alignment exceptions, bus errors, floating point exceptions etc are not supported in any way by LLVM. If it can prove at compile time that a non-floating point exception will happen (e.g., you store nil in a pointer and immediately dereference it), it will simply interpret the exception-causing instruction as having "undefined behaviour", which generally results in pretty much all code depending on the result of that instruction getting "optimised" away. In case of floating point exceptions, LLVM will replace the result of the instruction with Inf/Nan at compile time. They are aware of this limitation (http://llvm.org/devmtg/2015-10/slides/KlecknerMajnemer-ExceptionHandling.pdf), but there is no one actively working on it right now (https://groups.google.com/forum/#!topic/llvm-dev/7yLycHmeydo )
    • LLVM has no support for the i386 "register" calling convention, so the support for the i386 target using LLVM will probably never be added.

As alluded to above, LLVM support needs to be added/tested/maintained separately for each supported architecture and to a lesser extent for each supported OS.

Frequently Asked Questions

Will the FPC team, somewhere in the future, adopt the LLVM as the backend on all platforms?
No, for various reasons:
  • LLVM will almost certainly never support all targets that we support (Gameboy Advance, OS/2, WinCE, ...), or at some point drop support for targets that we still support (as already happened with Mac OS X for PowerPC/PowerPC64).
  • the native FPC code generators require very little maintenance once written, as they are quite well insulated via abstractions from the rest of the compiler
  • you still need some of the hardest parts of the FPC native code generators anyway for LLVM (entry/exit code handling, parameter manager), to be able to deal with assembler routines and because LLVM does not fully abstract parameter passing
  • a hardware architecture seldom changes in backward-compatibility breaking ways once released, while LLVM makes no such promises. They do seem to have finally settled more or less on the binary bitcode format (even there are no guarantees, but maybe I'll add support for that after all)
  • LLVM changes a lot, all the time. That means a high chance of introducing regressions. I don't know how likely it would be that FPC-with-LLVM would one day be admissible to be run as part of LLVM's buildbots and automatic regression tests, but if not then it's possible that maintaining the LLVM backend may become more work than the regular code generators and optimizers combined (at least if we want to keep up with the latest LLVM versions, and not stick with a particular version for long times like most out-of-tree "consumers" of LLVM do)
  • most OS-specific support is in the run time library, not in the compiler. As a result, LLVM will not save much time there
  • our native code generators are much faster than LLVM's (even if you would neglect the overhead of FPC generating bitcode and the LLVM tool chain reading it back in), so especially while developing it may be more interesting to use our code generators
Is it at all likely that an LLVM compiler would produce significantly better/faster optimizations than FPC as it stand currently?
It depends on the kind of code. The more pure maths (floating point or integer, especially in tight loops), the more likely it will be faster.
Artificial benchmarks will also be much faster.
For a typical database program, don't expect much change.
actual performance comparison tests to be done

See Also