mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-12-16 11:30:51 +00:00
7c9c6ed761
Essentially the same as the GEP change in r230786.
A similar migration script can be used to update test cases, though a few more
test case improvements/changes were required this time around: (r229269-r229278)
import fileinput
import sys
import re
pat = re.compile(r"((?:=|:|^)\s*load (?:atomic )?(?:volatile )?(.*?))(| addrspace\(\d+\) *)\*($| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$)")
for line in sys.stdin:
sys.stdout.write(re.sub(pat, r"\1, \2\3*\4", line))
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7649
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@230794 91177308-0d34-0410-b5e6-96231b3b80d8
67 lines
2.4 KiB
LLVM
67 lines
2.4 KiB
LLVM
; RUN: opt -irce -S < %s | FileCheck %s
|
|
|
|
define void @multiple_access_no_preloop(
|
|
i32* %arr_a, i32* %a_len_ptr, i32* %arr_b, i32* %b_len_ptr, i32 %n) {
|
|
|
|
entry:
|
|
%len.a = load i32, i32* %a_len_ptr, !range !0
|
|
%len.b = load i32, i32* %b_len_ptr, !range !0
|
|
%first.itr.check = icmp sgt i32 %n, 0
|
|
br i1 %first.itr.check, label %loop, label %exit
|
|
|
|
loop:
|
|
%idx = phi i32 [ 0, %entry ] , [ %idx.next, %in.bounds.b ]
|
|
%idx.next = add i32 %idx, 1
|
|
%abc.a = icmp slt i32 %idx, %len.a
|
|
br i1 %abc.a, label %in.bounds.a, label %out.of.bounds, !prof !1
|
|
|
|
in.bounds.a:
|
|
%addr.a = getelementptr i32, i32* %arr_a, i32 %idx
|
|
store i32 0, i32* %addr.a
|
|
%abc.b = icmp slt i32 %idx, %len.b
|
|
br i1 %abc.b, label %in.bounds.b, label %out.of.bounds, !prof !1
|
|
|
|
in.bounds.b:
|
|
%addr.b = getelementptr i32, i32* %arr_b, i32 %idx
|
|
store i32 -1, i32* %addr.b
|
|
%next = icmp slt i32 %idx.next, %n
|
|
br i1 %next, label %loop, label %exit
|
|
|
|
out.of.bounds:
|
|
ret void
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
; CHECK-LABEL: multiple_access_no_preloop
|
|
|
|
; CHECK-LABEL: loop.preheader:
|
|
; CHECK: [[not_len_b:[^ ]+]] = sub i32 -1, %len.b
|
|
; CHECK: [[not_len_a:[^ ]+]] = sub i32 -1, %len.a
|
|
; CHECK: [[smax_not_len_cond:[^ ]+]] = icmp sgt i32 [[not_len_b]], [[not_len_a]]
|
|
; CHECK: [[smax_not_len:[^ ]+]] = select i1 [[smax_not_len_cond]], i32 [[not_len_b]], i32 [[not_len_a]]
|
|
; CHECK: [[not_n:[^ ]+]] = sub i32 -1, %n
|
|
; CHECK: [[not_upper_limit_cond_loclamp:[^ ]+]] = icmp sgt i32 [[smax_not_len]], [[not_n]]
|
|
; CHECK: [[not_upper_limit_loclamp:[^ ]+]] = select i1 [[not_upper_limit_cond_loclamp]], i32 [[smax_not_len]], i32 [[not_n]]
|
|
; CHECK: [[upper_limit_loclamp:[^ ]+]] = sub i32 -1, [[not_upper_limit_loclamp]]
|
|
; CHECK: [[upper_limit_cmp:[^ ]+]] = icmp sgt i32 [[upper_limit_loclamp]], 0
|
|
; CHECK: [[upper_limit:[^ ]+]] = select i1 [[upper_limit_cmp]], i32 [[upper_limit_loclamp]], i32 0
|
|
|
|
; CHECK-LABEL: loop:
|
|
; CHECK: br i1 true, label %in.bounds.a, label %out.of.bounds
|
|
|
|
; CHECK-LABEL: in.bounds.a:
|
|
; CHECK: br i1 true, label %in.bounds.b, label %out.of.bounds
|
|
|
|
; CHECK-LABEL: in.bounds.b:
|
|
; CHECK: [[main_loop_cond:[^ ]+]] = icmp slt i32 %idx.next, [[upper_limit]]
|
|
; CHECK: br i1 [[main_loop_cond]], label %loop, label %main.exit.selector
|
|
|
|
; CHECK-LABEL: in.bounds.b.postloop:
|
|
; CHECK: %next.postloop = icmp slt i32 %idx.next.postloop, %n
|
|
; CHECK: br i1 %next.postloop, label %loop.postloop, label %exit.loopexit
|
|
|
|
!0 = !{i32 0, i32 2147483647}
|
|
!1 = !{!"branch_weights", i32 64, i32 4}
|