brintos

brintos / llvm-project-archived public Read only

0
0
Text · 3.9 KiB · 1166b09 Raw
155 lines · plain
1; RUN: opt -passes=inline < %s -S -o - -inline-threshold=10 | FileCheck %s2 3target datalayout = "p:32:32-p1:64:64-p2:16:16-n16:32:64"4 5define i32 @outer1() {6; CHECK-LABEL: @outer1(7; CHECK-NOT: call i328; CHECK: ret i329 10  %ptr = alloca i3211  %ptr2 = getelementptr inbounds i32, ptr %ptr, i32 4212  %result = call i32 @inner1(ptr %ptr, ptr %ptr2)13  ret i32 %result14}15 16define i32 @inner1(ptr %begin, ptr %end) {17  call void @extern()18  %begin.i = ptrtoint ptr %begin to i3219  %end.i = ptrtoint ptr %end to i3220  %distance = sub i32 %end.i, %begin.i21  %icmp = icmp sle i32 %distance, 4222  br i1 %icmp, label %then, label %else23 24then:25  ret i32 326 27else:28  %t = load i32, ptr %begin29  ret i32 %t30}31 32define i32 @outer1_as1(ptr addrspace(1) %ptr) {33; CHECK-LABEL: @outer1_as1(34; CHECK-NOT: call35; CHECK: ret i3236  %ptr2 = getelementptr inbounds i32, ptr addrspace(1) %ptr, i32 4237  %result = call i32 @inner1_as1(ptr addrspace(1) %ptr, ptr addrspace(1) %ptr2)38  ret i32 %result39}40 41; Make sure that the address space's larger size makes the ptrtoints42; not no-ops preventing inlining43define i32 @inner1_as1(ptr addrspace(1) %begin, ptr addrspace(1) %end) {44  %begin.i = ptrtoint ptr addrspace(1) %begin to i3245  %end.i = ptrtoint ptr addrspace(1) %end to i3246  %distance = sub i32 %end.i, %begin.i47  %icmp = icmp sle i32 %distance, 4248  br i1 %icmp, label %then, label %else49 50then:51  ret i32 352 53else:54  %t = load i32, ptr addrspace(1) %begin55  ret i32 %t56}57 58define i32 @outer2(ptr %ptr) {59; Test that an inbounds GEP disables this -- it isn't safe in general as60; wrapping changes the behavior of lessthan and greaterthan comparisons.61; CHECK-LABEL: @outer2(62; CHECK: call i32 @inner263; CHECK: ret i3264 65  %ptr2 = getelementptr i32, ptr %ptr, i32 4266  %result = call i32 @inner2(ptr %ptr, ptr %ptr2)67  ret i32 %result68}69 70define i32 @inner2(ptr %begin, ptr %end) {71  call void @extern()72  %begin.i = ptrtoint ptr %begin to i3273  %end.i = ptrtoint ptr %end to i3274  %distance = sub i32 %end.i, %begin.i75  %icmp = icmp sle i32 %distance, 4276  br i1 %icmp, label %then, label %else77 78then:79  ret i32 380 81else:82  %t = load i32, ptr %begin83  ret i32 %t84}85 86define i32 @outer3(ptr addrspace(1) %ptr) {87; CHECK-LABEL: @outer3(88; CHECK-NOT: call i3289; CHECK: ret i32 390; CHECK-LABEL: @inner3(91  %result = call i32 @inner3(ptr addrspace(1) %ptr)92  ret i32 %result93}94 95define i32 @inner3(ptr addrspace(1) %ptr) {96  call void @extern()97  %ptr.i = ptrtoint ptr addrspace(1) %ptr to i6498  %distance = sub i64 %ptr.i, %ptr.i99  %icmp = icmp eq i64 %distance, 0100  br i1 %icmp, label %then, label %else101 102then:103  ret i32 3104 105else:106  ret i32 5107}108 109 110; The inttoptrs are free since it is a smaller integer to a larger111; pointer size112define i32 @inttoptr_free_cost(i32 %a, i32 %b, i32 %c) {113  call void @extern()114  %p1 = inttoptr i32 %a to ptr addrspace(1)115  %p2 = inttoptr i32 %b to ptr addrspace(1)116  %p3 = inttoptr i32 %c to ptr addrspace(1)117  %t1 = load i32, ptr addrspace(1) %p1118  %t2 = load i32, ptr addrspace(1) %p2119  %t3 = load i32, ptr addrspace(1) %p3120  %s = add i32 %t1, %t2121  %s1 = add i32 %s, %t3122  ret i32 %s1123}124 125define i32 @inttoptr_free_cost_user(i32 %begin, i32 %end) {126; CHECK-LABEL: @inttoptr_free_cost_user(127; CHECK-NOT: call i32128  %x = call i32 @inttoptr_free_cost(i32 %begin, i32 %end, i32 9)129  ret i32 %x130}131 132; The inttoptrs have a cost since it is a larger integer to a smaller133; pointer size134define i32 @inttoptr_cost_smaller_ptr(i32 %a, i32 %b, i32 %c) {135  call void @extern()136  %p1 = inttoptr i32 %a to ptr addrspace(2)137  %p2 = inttoptr i32 %b to ptr addrspace(2)138  %p3 = inttoptr i32 %c to ptr addrspace(2)139  %t1 = load i32, ptr addrspace(2) %p1140  %t2 = load i32, ptr addrspace(2) %p2141  %t3 = load i32, ptr addrspace(2) %p3142  %s = add i32 %t1, %t2143  %s1 = add i32 %s, %t3144  ret i32 %s1145}146 147define i32 @inttoptr_cost_smaller_ptr_user(i32 %begin, i32 %end) {148; CHECK-LABEL: @inttoptr_cost_smaller_ptr_user(149; CHECK: call i32150  %x = call i32 @inttoptr_cost_smaller_ptr(i32 %begin, i32 %end, i32 9)151  ret i32 %x152}153 154declare void @extern()155