I realize that LLVM has a long way to go, but theoretically, can the optimizations that are in GCC/ICC/etc. for individual languages be applied to LLVM byte code? If so, does this mean that any language that compiles to LLVM byte code has the potential to be equally as fast? Or are language specific optimizations (before the LLVM bytecode stage) going to always play a large part in optimizing any specific program.
I don’t know much about compilers or optimizations (only enough to be dangerous), so I apologize if this question isn’t well defined.
In general, no.
For example, in Haskell a common optimization is strictness analysis, which allows the compiler to determine which variables are always in head-normal form and therefore can be forced + inlined without changing program semantics. This is not possible with LLVM.
Explanation: In Haskell, a function
(Int, Int) -> Intis more or less equivalent to the type in C:The compiler can analyze
functionand determine that it always evaluates its argument and always extracts the contents, transforming the function into this:This is well beyond the capability of LLVM. Maybe, in the future, with some really heavy interprocedural optimization… but realistically speaking, this will not happen in the foreseeable future.
Example 2: There are Java VMs which can transform virtual function calls into direct function calls. However, this isn’t something that LLVM can do — because this transformation must be undone dynamically if another class is loaded which implements the same interface.
In general, when you compile a program to LLVM you lose much of the semantic information about the original program. LLVM bytecode is capable of representing any code, but its type system is fairly limited — and your choice of type system affects what optimizations you can do.