brintos

brintos / llvm-project-archived public Read only

0
0
Text · 914 B · 76dc610 Raw
40 lines · plain
1; RUN: opt -S -passes=jump-threading < %s | FileCheck %s2 3declare ptr @escape()4declare void @llvm.assume(i1)5 6define i1 @test1(i1 %cond) {7entry:8    br i1 %cond, label %taken, label %not_taken9 10; CHECK-LABEL: @test111; CHECK: br i1 %cond, label %no, label %yes12; CHECK: ret i1 true13 14taken:15    %res1 = call ptr @escape()16    %a = icmp eq ptr %res1, null17    tail call void @llvm.assume(i1 %a)18    br label %done19not_taken:20    %res2 = call ptr @escape()21    %b = icmp ne ptr %res2, null22    tail call void @llvm.assume(i1 %b)23    br label %done24 25; An assume that can be used to simplify this comparison dominates each26; predecessor branch (although no assume dominates the cmp itself). Make sure27; this still can be simplified.28 29done:30    %res = phi ptr [ %res1, %taken ], [ %res2, %not_taken ]31    %cnd = icmp ne ptr %res, null32    br i1 %cnd, label %yes, label %no33 34yes:35    ret i1 true36no:37    ret i1 false38}39 40