1 //===- LowerSetJmp.cpp - Code pertaining to lowering set/long jumps -------===//
3 // The LLVM Compiler Infrastructure
5 // This file was developed by the LLVM research group and is distributed under
6 // the University of Illinois Open Source License. See LICENSE.TXT for details.
8 //===----------------------------------------------------------------------===//
10 // This file implements the lowering of setjmp and longjmp to use the
11 // LLVM invoke and unwind instructions as necessary.
13 // Lowering of longjmp is fairly trivial. We replace the call with a
14 // call to the LLVM library function "__llvm_sjljeh_throw_longjmp()".
15 // This unwinds the stack for us calling all of the destructors for
16 // objects allocated on the stack.
18 // At a setjmp call, the basic block is split and the setjmp removed.
19 // The calls in a function that have a setjmp are converted to invoke
20 // where the except part checks to see if it's a longjmp exception and,
21 // if so, if it's handled in the function. If it is, then it gets the
22 // value returned by the longjmp and goes to where the basic block was
23 // split. Invoke instructions are handled in a similar fashion with the
24 // original except block being executed if it isn't a longjmp except
25 // that is handled by that function.
27 //===----------------------------------------------------------------------===//
29 //===----------------------------------------------------------------------===//
30 // FIXME: This pass doesn't deal with PHI statements just yet. That is,
31 // we expect this to occur before SSAification is done. This would seem
32 // to make sense, but in general, it might be a good idea to make this
33 // pass invokable via the "opt" command at will.
34 //===----------------------------------------------------------------------===//
36 #define DEBUG_TYPE "lowersetjmp"
37 #include "llvm/Transforms/IPO.h"
38 #include "llvm/Constants.h"
39 #include "llvm/DerivedTypes.h"
40 #include "llvm/Instructions.h"
41 #include "llvm/Intrinsics.h"
42 #include "llvm/Module.h"
43 #include "llvm/Pass.h"
44 #include "llvm/Support/CFG.h"
45 #include "llvm/Support/Compiler.h"
46 #include "llvm/Support/InstVisitor.h"
47 #include "llvm/Transforms/Utils/Local.h"
48 #include "llvm/ADT/DepthFirstIterator.h"
49 #include "llvm/ADT/Statistic.h"
50 #include "llvm/ADT/StringExtras.h"
51 #include "llvm/ADT/VectorExtras.h"
54 STATISTIC(LongJmpsTransformed, "Number of longjmps transformed");
55 STATISTIC(SetJmpsTransformed , "Number of setjmps transformed");
56 STATISTIC(CallsTransformed , "Number of calls invokified");
57 STATISTIC(InvokesTransformed , "Number of invokes modified");
60 //===--------------------------------------------------------------------===//
61 // LowerSetJmp pass implementation.
62 class VISIBILITY_HIDDEN LowerSetJmp : public ModulePass,
63 public InstVisitor<LowerSetJmp> {
64 // LLVM library functions...
65 Constant *InitSJMap; // __llvm_sjljeh_init_setjmpmap
66 Constant *DestroySJMap; // __llvm_sjljeh_destroy_setjmpmap
67 Constant *AddSJToMap; // __llvm_sjljeh_add_setjmp_to_map
68 Constant *ThrowLongJmp; // __llvm_sjljeh_throw_longjmp
69 Constant *TryCatchLJ; // __llvm_sjljeh_try_catching_longjmp_exception
70 Constant *IsLJException; // __llvm_sjljeh_is_longjmp_exception
71 Constant *GetLJValue; // __llvm_sjljeh_get_longjmp_value
73 typedef std::pair<SwitchInst*, CallInst*> SwitchValuePair;
75 // Keep track of those basic blocks reachable via a depth-first search of
76 // the CFG from a setjmp call. We only need to transform those "call" and
77 // "invoke" instructions that are reachable from the setjmp call site.
78 std::set<BasicBlock*> DFSBlocks;
80 // The setjmp map is going to hold information about which setjmps
81 // were called (each setjmp gets its own number) and with which
82 // buffer it was called.
83 std::map<Function*, AllocaInst*> SJMap;
85 // The rethrow basic block map holds the basic block to branch to if
86 // the exception isn't handled in the current function and needs to
88 std::map<const Function*, BasicBlock*> RethrowBBMap;
90 // The preliminary basic block map holds a basic block that grabs the
91 // exception and determines if it's handled by the current function.
92 std::map<const Function*, BasicBlock*> PrelimBBMap;
94 // The switch/value map holds a switch inst/call inst pair. The
95 // switch inst controls which handler (if any) gets called and the
96 // value is the value returned to that handler by the call to
97 // __llvm_sjljeh_get_longjmp_value.
98 std::map<const Function*, SwitchValuePair> SwitchValMap;
100 // A map of which setjmps we've seen so far in a function.
101 std::map<const Function*, unsigned> SetJmpIDMap;
103 AllocaInst* GetSetJmpMap(Function* Func);
104 BasicBlock* GetRethrowBB(Function* Func);
105 SwitchValuePair GetSJSwitch(Function* Func, BasicBlock* Rethrow);
107 void TransformLongJmpCall(CallInst* Inst);
108 void TransformSetJmpCall(CallInst* Inst);
110 bool IsTransformableFunction(const std::string& Name);
112 void visitCallInst(CallInst& CI);
113 void visitInvokeInst(InvokeInst& II);
114 void visitReturnInst(ReturnInst& RI);
115 void visitUnwindInst(UnwindInst& UI);
117 bool runOnModule(Module& M);
118 bool doInitialization(Module& M);
121 RegisterPass<LowerSetJmp> X("lowersetjmp", "Lower Set Jump");
122 } // end anonymous namespace
124 // run - Run the transformation on the program. We grab the function
125 // prototypes for longjmp and setjmp. If they are used in the program,
126 // then we can go directly to the places they're at and transform them.
127 bool LowerSetJmp::runOnModule(Module& M) {
128 bool Changed = false;
130 // These are what the functions are called.
131 Function* SetJmp = M.getFunction("llvm.setjmp");
132 Function* LongJmp = M.getFunction("llvm.longjmp");
134 // This program doesn't have longjmp and setjmp calls.
135 if ((!LongJmp || LongJmp->use_empty()) &&
136 (!SetJmp || SetJmp->use_empty())) return false;
138 // Initialize some values and functions we'll need to transform the
139 // setjmp/longjmp functions.
143 for (Value::use_iterator B = SetJmp->use_begin(), E = SetJmp->use_end();
145 BasicBlock* BB = cast<Instruction>(*B)->getParent();
146 for (df_ext_iterator<BasicBlock*> I = df_ext_begin(BB, DFSBlocks),
147 E = df_ext_end(BB, DFSBlocks); I != E; ++I)
151 while (!SetJmp->use_empty()) {
152 assert(isa<CallInst>(SetJmp->use_back()) &&
153 "User of setjmp intrinsic not a call?");
154 TransformSetJmpCall(cast<CallInst>(SetJmp->use_back()));
160 while (!LongJmp->use_empty()) {
161 assert(isa<CallInst>(LongJmp->use_back()) &&
162 "User of longjmp intrinsic not a call?");
163 TransformLongJmpCall(cast<CallInst>(LongJmp->use_back()));
167 // Now go through the affected functions and convert calls and invokes
169 for (std::map<Function*, AllocaInst*>::iterator
170 B = SJMap.begin(), E = SJMap.end(); B != E; ++B) {
171 Function* F = B->first;
172 for (Function::iterator BB = F->begin(), BE = F->end(); BB != BE; ++BB)
173 for (BasicBlock::iterator IB = BB->begin(), IE = BB->end(); IB != IE; ) {
175 if (IB != BB->end() && IB->getParent() != BB)
176 break; // The next instruction got moved to a different block!
182 RethrowBBMap.clear();
184 SwitchValMap.clear();
190 // doInitialization - For the lower long/setjmp pass, this ensures that a
191 // module contains a declaration for the intrisic functions we are going
192 // to call to convert longjmp and setjmp calls.
194 // This function is always successful, unless it isn't.
195 bool LowerSetJmp::doInitialization(Module& M)
197 const Type *SBPTy = PointerType::get(Type::Int8Ty);
198 const Type *SBPPTy = PointerType::get(SBPTy);
200 // N.B. See llvm/runtime/GCCLibraries/libexception/SJLJ-Exception.h for
201 // a description of the following library functions.
203 // void __llvm_sjljeh_init_setjmpmap(void**)
204 InitSJMap = M.getOrInsertFunction("__llvm_sjljeh_init_setjmpmap",
205 Type::VoidTy, SBPPTy, (Type *)0);
206 // void __llvm_sjljeh_destroy_setjmpmap(void**)
207 DestroySJMap = M.getOrInsertFunction("__llvm_sjljeh_destroy_setjmpmap",
208 Type::VoidTy, SBPPTy, (Type *)0);
210 // void __llvm_sjljeh_add_setjmp_to_map(void**, void*, unsigned)
211 AddSJToMap = M.getOrInsertFunction("__llvm_sjljeh_add_setjmp_to_map",
212 Type::VoidTy, SBPPTy, SBPTy,
213 Type::Int32Ty, (Type *)0);
215 // void __llvm_sjljeh_throw_longjmp(int*, int)
216 ThrowLongJmp = M.getOrInsertFunction("__llvm_sjljeh_throw_longjmp",
217 Type::VoidTy, SBPTy, Type::Int32Ty,
220 // unsigned __llvm_sjljeh_try_catching_longjmp_exception(void **)
222 M.getOrInsertFunction("__llvm_sjljeh_try_catching_longjmp_exception",
223 Type::Int32Ty, SBPPTy, (Type *)0);
225 // bool __llvm_sjljeh_is_longjmp_exception()
226 IsLJException = M.getOrInsertFunction("__llvm_sjljeh_is_longjmp_exception",
227 Type::Int1Ty, (Type *)0);
229 // int __llvm_sjljeh_get_longjmp_value()
230 GetLJValue = M.getOrInsertFunction("__llvm_sjljeh_get_longjmp_value",
231 Type::Int32Ty, (Type *)0);
235 // IsTransformableFunction - Return true if the function name isn't one
236 // of the ones we don't want transformed. Currently, don't transform any
237 // "llvm.{setjmp,longjmp}" functions and none of the setjmp/longjmp error
238 // handling functions (beginning with __llvm_sjljeh_...they don't throw
240 bool LowerSetJmp::IsTransformableFunction(const std::string& Name) {
241 std::string SJLJEh("__llvm_sjljeh");
243 if (Name.size() > SJLJEh.size())
244 return std::string(Name.begin(), Name.begin() + SJLJEh.size()) != SJLJEh;
249 // TransformLongJmpCall - Transform a longjmp call into a call to the
250 // internal __llvm_sjljeh_throw_longjmp function. It then takes care of
251 // throwing the exception for us.
252 void LowerSetJmp::TransformLongJmpCall(CallInst* Inst)
254 const Type* SBPTy = PointerType::get(Type::Int8Ty);
256 // Create the call to "__llvm_sjljeh_throw_longjmp". This takes the
257 // same parameters as "longjmp", except that the buffer is cast to a
258 // char*. It returns "void", so it doesn't need to replace any of
259 // Inst's uses and doesn't get a name.
261 new BitCastInst(Inst->getOperand(1), SBPTy, "LJBuf", Inst);
262 new CallInst(ThrowLongJmp, CI, Inst->getOperand(2), "", Inst);
264 SwitchValuePair& SVP = SwitchValMap[Inst->getParent()->getParent()];
266 // If the function has a setjmp call in it (they are transformed first)
267 // we should branch to the basic block that determines if this longjmp
268 // is applicable here. Otherwise, issue an unwind.
270 new BranchInst(SVP.first->getParent(), Inst);
272 new UnwindInst(Inst);
274 // Remove all insts after the branch/unwind inst. Go from back to front to
275 // avoid replaceAllUsesWith if possible.
276 BasicBlock *BB = Inst->getParent();
277 Instruction *Removed;
279 Removed = &BB->back();
280 // If the removed instructions have any users, replace them now.
281 if (!Removed->use_empty())
282 Removed->replaceAllUsesWith(UndefValue::get(Removed->getType()));
283 Removed->eraseFromParent();
284 } while (Removed != Inst);
286 ++LongJmpsTransformed;
289 // GetSetJmpMap - Retrieve (create and initialize, if necessary) the
290 // setjmp map. This map is going to hold information about which setjmps
291 // were called (each setjmp gets its own number) and with which buffer it
292 // was called. There can be only one!
293 AllocaInst* LowerSetJmp::GetSetJmpMap(Function* Func)
295 if (SJMap[Func]) return SJMap[Func];
297 // Insert the setjmp map initialization before the first instruction in
299 Instruction* Inst = Func->getEntryBlock().begin();
300 assert(Inst && "Couldn't find even ONE instruction in entry block!");
302 // Fill in the alloca and call to initialize the SJ map.
303 const Type *SBPTy = PointerType::get(Type::Int8Ty);
304 AllocaInst* Map = new AllocaInst(SBPTy, 0, "SJMap", Inst);
305 new CallInst(InitSJMap, Map, "", Inst);
306 return SJMap[Func] = Map;
309 // GetRethrowBB - Only one rethrow basic block is needed per function.
310 // If this is a longjmp exception but not handled in this block, this BB
311 // performs the rethrow.
312 BasicBlock* LowerSetJmp::GetRethrowBB(Function* Func)
314 if (RethrowBBMap[Func]) return RethrowBBMap[Func];
316 // The basic block we're going to jump to if we need to rethrow the
318 BasicBlock* Rethrow = new BasicBlock("RethrowExcept", Func);
320 // Fill in the "Rethrow" BB with a call to rethrow the exception. This
321 // is the last instruction in the BB since at this point the runtime
322 // should exit this function and go to the next function.
323 new UnwindInst(Rethrow);
324 return RethrowBBMap[Func] = Rethrow;
327 // GetSJSwitch - Return the switch statement that controls which handler
328 // (if any) gets called and the value returned to that handler.
329 LowerSetJmp::SwitchValuePair LowerSetJmp::GetSJSwitch(Function* Func,
332 if (SwitchValMap[Func].first) return SwitchValMap[Func];
334 BasicBlock* LongJmpPre = new BasicBlock("LongJmpBlkPre", Func);
335 BasicBlock::InstListType& LongJmpPreIL = LongJmpPre->getInstList();
337 // Keep track of the preliminary basic block for some of the other
339 PrelimBBMap[Func] = LongJmpPre;
341 // Grab the exception.
342 CallInst* Cond = new CallInst(IsLJException, "IsLJExcept");
343 LongJmpPreIL.push_back(Cond);
345 // The "decision basic block" gets the number associated with the
346 // setjmp call returning to switch on and the value returned by
348 BasicBlock* DecisionBB = new BasicBlock("LJDecisionBB", Func);
349 BasicBlock::InstListType& DecisionBBIL = DecisionBB->getInstList();
351 new BranchInst(DecisionBB, Rethrow, Cond, LongJmpPre);
353 // Fill in the "decision" basic block.
354 CallInst* LJVal = new CallInst(GetLJValue, "LJVal");
355 DecisionBBIL.push_back(LJVal);
356 CallInst* SJNum = new CallInst(TryCatchLJ, GetSetJmpMap(Func), "SJNum");
357 DecisionBBIL.push_back(SJNum);
359 SwitchInst* SI = new SwitchInst(SJNum, Rethrow, 0, DecisionBB);
360 return SwitchValMap[Func] = SwitchValuePair(SI, LJVal);
363 // TransformSetJmpCall - The setjmp call is a bit trickier to transform.
364 // We're going to convert all setjmp calls to nops. Then all "call" and
365 // "invoke" instructions in the function are converted to "invoke" where
366 // the "except" branch is used when returning from a longjmp call.
367 void LowerSetJmp::TransformSetJmpCall(CallInst* Inst)
369 BasicBlock* ABlock = Inst->getParent();
370 Function* Func = ABlock->getParent();
372 // Add this setjmp to the setjmp map.
373 const Type* SBPTy = PointerType::get(Type::Int8Ty);
375 new BitCastInst(Inst->getOperand(1), SBPTy, "SBJmpBuf", Inst);
376 std::vector<Value*> Args =
377 make_vector<Value*>(GetSetJmpMap(Func), BufPtr,
378 ConstantInt::get(Type::Int32Ty,
379 SetJmpIDMap[Func]++), 0);
380 new CallInst(AddSJToMap, &Args[0], Args.size(), "", Inst);
382 // We are guaranteed that there are no values live across basic blocks
383 // (because we are "not in SSA form" yet), but there can still be values live
384 // in basic blocks. Because of this, splitting the setjmp block can cause
385 // values above the setjmp to not dominate uses which are after the setjmp
386 // call. For all of these occasions, we must spill the value to the stack.
388 std::set<Instruction*> InstrsAfterCall;
390 // The call is probably very close to the end of the basic block, for the
391 // common usage pattern of: 'if (setjmp(...))', so keep track of the
392 // instructions after the call.
393 for (BasicBlock::iterator I = ++BasicBlock::iterator(Inst), E = ABlock->end();
395 InstrsAfterCall.insert(I);
397 for (BasicBlock::iterator II = ABlock->begin();
398 II != BasicBlock::iterator(Inst); ++II)
399 // Loop over all of the uses of instruction. If any of them are after the
400 // call, "spill" the value to the stack.
401 for (Value::use_iterator UI = II->use_begin(), E = II->use_end();
403 if (cast<Instruction>(*UI)->getParent() != ABlock ||
404 InstrsAfterCall.count(cast<Instruction>(*UI))) {
405 DemoteRegToStack(*II);
408 InstrsAfterCall.clear();
410 // Change the setjmp call into a branch statement. We'll remove the
411 // setjmp call in a little bit. No worries.
412 BasicBlock* SetJmpContBlock = ABlock->splitBasicBlock(Inst);
413 assert(SetJmpContBlock && "Couldn't split setjmp BB!!");
415 SetJmpContBlock->setName(ABlock->getName()+"SetJmpCont");
417 // Add the SetJmpContBlock to the set of blocks reachable from a setjmp.
418 DFSBlocks.insert(SetJmpContBlock);
420 // This PHI node will be in the new block created from the
421 // splitBasicBlock call.
422 PHINode* PHI = new PHINode(Type::Int32Ty, "SetJmpReturn", Inst);
424 // Coming from a call to setjmp, the return is 0.
425 PHI->addIncoming(ConstantInt::getNullValue(Type::Int32Ty), ABlock);
427 // Add the case for this setjmp's number...
428 SwitchValuePair SVP = GetSJSwitch(Func, GetRethrowBB(Func));
429 SVP.first->addCase(ConstantInt::get(Type::Int32Ty, SetJmpIDMap[Func] - 1),
432 // Value coming from the handling of the exception.
433 PHI->addIncoming(SVP.second, SVP.second->getParent());
435 // Replace all uses of this instruction with the PHI node created by
436 // the eradication of setjmp.
437 Inst->replaceAllUsesWith(PHI);
438 Inst->getParent()->getInstList().erase(Inst);
440 ++SetJmpsTransformed;
443 // visitCallInst - This converts all LLVM call instructions into invoke
444 // instructions. The except part of the invoke goes to the "LongJmpBlkPre"
445 // that grabs the exception and proceeds to determine if it's a longjmp
447 void LowerSetJmp::visitCallInst(CallInst& CI)
449 if (CI.getCalledFunction())
450 if (!IsTransformableFunction(CI.getCalledFunction()->getName()) ||
451 CI.getCalledFunction()->isIntrinsic()) return;
453 BasicBlock* OldBB = CI.getParent();
455 // If not reachable from a setjmp call, don't transform.
456 if (!DFSBlocks.count(OldBB)) return;
458 BasicBlock* NewBB = OldBB->splitBasicBlock(CI);
459 assert(NewBB && "Couldn't split BB of \"call\" instruction!!");
460 DFSBlocks.insert(NewBB);
461 NewBB->setName("Call2Invoke");
463 Function* Func = OldBB->getParent();
465 // Construct the new "invoke" instruction.
466 TerminatorInst* Term = OldBB->getTerminator();
467 std::vector<Value*> Params(CI.op_begin() + 1, CI.op_end());
469 InvokeInst(CI.getCalledValue(), NewBB, PrelimBBMap[Func],
470 &Params[0], Params.size(), CI.getName(), Term);
472 // Replace the old call inst with the invoke inst and remove the call.
473 CI.replaceAllUsesWith(II);
474 CI.getParent()->getInstList().erase(&CI);
476 // The old terminator is useless now that we have the invoke inst.
477 Term->getParent()->getInstList().erase(Term);
481 // visitInvokeInst - Converting the "invoke" instruction is fairly
482 // straight-forward. The old exception part is replaced by a query asking
483 // if this is a longjmp exception. If it is, then it goes to the longjmp
484 // exception blocks. Otherwise, control is passed the old exception.
485 void LowerSetJmp::visitInvokeInst(InvokeInst& II)
487 if (II.getCalledFunction())
488 if (!IsTransformableFunction(II.getCalledFunction()->getName()) ||
489 II.getCalledFunction()->isIntrinsic()) return;
491 BasicBlock* BB = II.getParent();
493 // If not reachable from a setjmp call, don't transform.
494 if (!DFSBlocks.count(BB)) return;
496 BasicBlock* ExceptBB = II.getUnwindDest();
498 Function* Func = BB->getParent();
499 BasicBlock* NewExceptBB = new BasicBlock("InvokeExcept", Func);
500 BasicBlock::InstListType& InstList = NewExceptBB->getInstList();
502 // If this is a longjmp exception, then branch to the preliminary BB of
503 // the longjmp exception handling. Otherwise, go to the old exception.
504 CallInst* IsLJExcept = new CallInst(IsLJException, "IsLJExcept");
505 InstList.push_back(IsLJExcept);
507 new BranchInst(PrelimBBMap[Func], ExceptBB, IsLJExcept, NewExceptBB);
509 II.setUnwindDest(NewExceptBB);
510 ++InvokesTransformed;
513 // visitReturnInst - We want to destroy the setjmp map upon exit from the
515 void LowerSetJmp::visitReturnInst(ReturnInst &RI) {
516 Function* Func = RI.getParent()->getParent();
517 new CallInst(DestroySJMap, GetSetJmpMap(Func), "", &RI);
520 // visitUnwindInst - We want to destroy the setjmp map upon exit from the
522 void LowerSetJmp::visitUnwindInst(UnwindInst &UI) {
523 Function* Func = UI.getParent()->getParent();
524 new CallInst(DestroySJMap, GetSetJmpMap(Func), "", &UI);
527 ModulePass *llvm::createLowerSetJmpPass() {
528 return new LowerSetJmp();