search for: guaranteedefficienttailcalls

...#39;t captured by the > > `call' instruction? > > > > Tail calls, closures, continuations, lazy allocation... Basically I'm > trying to see how am I going to implement high-level functions on LLVM. As for tail calls, my plans are here: http://nondot.org/sabre/LLVMNotes/GuaranteedEfficientTailCalls.txt Note that LLVM already has a pretty aggressive tail-call elimination pass, so this is really more for completeness than anything else. Closures and continuations should not be a problem. Closures are represented as a pair, where the first element is a pointer to a struct (containing any envir...

Misha Brukman wrote: > >>1. Opcodes and intrinsics >> > That's not really correct. The intrinsics such as llvm.frameaddress and > llvm.returnaddress have no equivalents in LLVM opcodes -- the meaning of > the intrinsics is specifically machine-dependent, and LLVM (and its > opcodes) are machine-independent, so there is no valid interchange of > these intrinsics

Hi, I was looking at LLVM as a target for EHC (http://catamaran.labs.cs.uu.nl/twiki/st/bin/view/Ehc) which is a Haskell compiler. I got some questions on the status of LLVM. I read some discussions on tail calls, and was wondering if they are implemented. Furthermore many comments in lib/Target/.. state: '// FIXME: Implement the invoke/unwind instructions!' I understood this is an old

...certain criteria it is turned into a tail call? Or is it guaranteed to perform a tail call if 'tail' is specified? The last statement of that paragraph implies that some analysis is involved, but [1] states that there is no analysis performed. Sandro [1] http://nondot.org/sabre/LLVMNotes/GuaranteedEfficientTailCalls.txt