addcda483e
Now that the call graph supports efficient replacement of a function and spurious reference edges, we can port ArgumentPromotion to the new pass manager very easily. The old PM-specific bits are sunk into callbacks that the new PM simply doesn't use. Unlike the old PM, the new PM simply does argument promotion and afterward does the update to LCG reflecting the promoted function. Differential Revision: https://reviews.llvm.org/D29580 llvm-svn: 294667
28 lines
598 B
LLVM
28 lines
598 B
LLVM
; RUN: opt < %s -argpromotion -S | FileCheck %s
|
|
; RUN: opt < %s -passes=argpromotion -S | FileCheck %s
|
|
|
|
@G1 = constant i32 0
|
|
@G2 = constant i32* @G1
|
|
|
|
define internal i32 @test(i32** %x) {
|
|
; CHECK-LABEL: define internal i32 @test(
|
|
; CHECK: i32 %{{.*}})
|
|
entry:
|
|
%y = load i32*, i32** %x
|
|
%z = load i32, i32* %y
|
|
; CHECK-NOT: load
|
|
ret i32 %z
|
|
; CHECK: ret i32
|
|
}
|
|
|
|
define i32 @caller() {
|
|
; CHECK-LABEL: define i32 @caller()
|
|
entry:
|
|
%x = call i32 @test(i32** @G2)
|
|
; CHECK: %[[Y:.*]] = load i32*, i32** @G2
|
|
; CHECK: %[[Z:.*]] = load i32, i32* %[[Y]]
|
|
; CHECK: call i32 @test(i32 %[[Z]])
|
|
ret i32 %x
|
|
}
|
|
|