From: Chris Lattner Date: Mon, 16 Feb 2004 06:35:19 +0000 (+0000) Subject: New testcase, details in the comments X-Git-Url: http://demsky.eecs.uci.edu/git/?a=commitdiff_plain;h=5ea27d820a7873400d0c5e8e18253489e1d99c85;p=oota-llvm.git New testcase, details in the comments git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@11495 91177308-0d34-0410-b5e6-96231b3b80d8 --- diff --git a/test/Transforms/SimplifyCFG/UncondBranchToReturn.ll b/test/Transforms/SimplifyCFG/UncondBranchToReturn.ll new file mode 100644 index 00000000000..6e943f35fb1 --- /dev/null +++ b/test/Transforms/SimplifyCFG/UncondBranchToReturn.ll @@ -0,0 +1,32 @@ +; The unify-function-exit-nodes pass often makes basic blocks that just contain +; a PHI node and a return. Make sure the simplify cfg can straighten out this +; important case. This is basically the most trivial form of tail-duplication. + +; RUN: llvm-as < %s | opt -simplifycfg | llvm-dis | not grep 'br label' + +int %test(bool %B, int %A, int %B) { + br bool %B, label %T, label %F +T: + br label %ret +F: + br label %ret +ret: + %X = phi int [%A, %F], [%B, %T] + ret int %X +} + +; Make sure it's willing to move unconditional branches to return instructions +; as well, even if the return block is shared and the source blocks are +; non-empty. +int %test2(bool %B, int %A, int %B) { + br bool %B, label %T, label %F +T: + call int %test(bool true, int 5, int 8) + br label %ret +F: + call int %test(bool true, int 5, int 8) + br label %ret +ret: + ret int %A +} +