xref: /llvm-project/llvm/test/Transforms/CodeExtractor/SingleCondition.ll (revision bbbbbfbdcb1ab1ba9857138dfa0f2355da8e4499)
10ca8ddd8SRoman Lebedev; RUN: opt < %s -skip-partial-inlining-cost-analysis -passes=partial-inliner -S  | FileCheck %s
2cee313d2SEric Christopher
3*bbbbbfbdSNikita Popovdefine internal i32 @inlinedFunc(i1 %cond, ptr align 4 %align.val) {
4cee313d2SEric Christopherentry:
5cee313d2SEric Christopher  br i1 %cond, label %if.then, label %return
6cee313d2SEric Christopherif.then:
7cee313d2SEric Christopher  ; Dummy store to have more than 0 uses
8*bbbbbfbdSNikita Popov  store i32 10, ptr %align.val, align 4
9cee313d2SEric Christopher  br label %return
10cee313d2SEric Christopherreturn:             ; preds = %entry
11cee313d2SEric Christopher  ret i32 0
12cee313d2SEric Christopher}
13cee313d2SEric Christopher
14*bbbbbfbdSNikita Popovdefine internal i32 @dummyCaller(i1 %cond, ptr align 2 %align.val) {
15cee313d2SEric Christopherentry:
16cee313d2SEric Christopher; CHECK-LABEL: @dummyCaller
17cee313d2SEric Christopher; CHECK: br
18cee313d2SEric Christopher; CHECK: call void @inlinedFunc.1.
19*bbbbbfbdSNikita Popov  %val = call i32 @inlinedFunc(i1 %cond, ptr %align.val)
20cee313d2SEric Christopher  ret i32 %val
21cee313d2SEric Christopher}
22cee313d2SEric Christopher
23