mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2024-07-24 08:29:39 +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
114 lines
2.4 KiB
LLVM
114 lines
2.4 KiB
LLVM
;; RUN: opt -S < %s -indvars | FileCheck %s
|
|
|
|
;; Check if llvm can narrow !range metadata based on loop entry
|
|
;; predicates.
|
|
|
|
declare void @abort()
|
|
|
|
define i1 @bounded_below_slt(i32* nocapture readonly %buffer) {
|
|
; CHECK-LABEL: bounded_below_slt
|
|
entry:
|
|
%length = load i32, i32* %buffer, !range !0
|
|
%entry.pred = icmp eq i32 %length, 0
|
|
br i1 %entry.pred, label %abort, label %loop.preheader
|
|
|
|
loop.preheader:
|
|
br label %loop
|
|
|
|
loop:
|
|
; CHECK: loop
|
|
%idx = phi i32 [ %idx.inc, %loop.next ], [ 0, %loop.preheader ]
|
|
%oob.pred = icmp slt i32 %idx, %length
|
|
br i1 %oob.pred, label %loop.next, label %oob
|
|
; CHECK: br i1 true, label %loop.next, label %oob
|
|
|
|
loop.next:
|
|
; CHECK: loop.next
|
|
%idx.inc = add i32 %idx, 1
|
|
%exit.pred = icmp slt i32 %idx.inc, %length
|
|
br i1 %exit.pred, label %loop, label %abort.loopexit
|
|
|
|
abort.loopexit:
|
|
br label %abort
|
|
|
|
abort:
|
|
ret i1 false
|
|
|
|
oob:
|
|
tail call void @abort()
|
|
ret i1 false
|
|
}
|
|
|
|
define i1 @bounded_below_sle(i32* nocapture readonly %buffer) {
|
|
; CHECK-LABEL: bounded_below_sle
|
|
entry:
|
|
%length = load i32, i32* %buffer, !range !0
|
|
%entry.pred = icmp eq i32 %length, 0
|
|
br i1 %entry.pred, label %abort, label %loop.preheader
|
|
|
|
loop.preheader:
|
|
br label %loop
|
|
|
|
loop:
|
|
; CHECK: loop
|
|
%idx = phi i32 [ %idx.inc, %loop.next ], [ 0, %loop.preheader ]
|
|
%oob.pred = icmp sle i32 %idx, %length
|
|
br i1 %oob.pred, label %loop.next, label %oob
|
|
; CHECK: br i1 true, label %loop.next, label %oob
|
|
|
|
loop.next:
|
|
; CHECK: loop.next
|
|
%idx.inc = add i32 %idx, 1
|
|
%exit.pred = icmp sle i32 %idx.inc, %length
|
|
br i1 %exit.pred, label %loop, label %abort.loopexit
|
|
|
|
abort.loopexit:
|
|
br label %abort
|
|
|
|
abort:
|
|
ret i1 false
|
|
|
|
oob:
|
|
tail call void @abort()
|
|
ret i1 false
|
|
}
|
|
|
|
;; Assert that we're not making an incorrect transform.
|
|
|
|
declare i32 @check(i8*)
|
|
|
|
define void @NoChange() {
|
|
; CHECK-LABEL: NoChange
|
|
entry:
|
|
br label %loop.begin
|
|
|
|
loop.begin:
|
|
; CHECK: loop.begin:
|
|
%i.01 = phi i64 [ 2, %entry ], [ %add, %loop.end ]
|
|
%cmp = icmp ugt i64 %i.01, 1
|
|
; CHECK: %cmp = icmp ugt i64 %i.01, 1
|
|
br i1 %cmp, label %loop, label %loop.end
|
|
|
|
loop:
|
|
; CHECK: loop
|
|
%.sum = add i64 %i.01, -2
|
|
%v = getelementptr inbounds i8, i8* null, i64 %.sum
|
|
%r = tail call i32 @check(i8* %v)
|
|
%c = icmp eq i32 %r, 0
|
|
br i1 %c, label %loop.end, label %abort.now
|
|
|
|
abort.now:
|
|
tail call void @abort()
|
|
unreachable
|
|
|
|
loop.end:
|
|
%add = add i64 %i.01, -1
|
|
%eq = icmp eq i64 %add, 0
|
|
br i1 %eq, label %exit, label %loop.begin
|
|
|
|
exit:
|
|
ret void
|
|
}
|
|
|
|
!0 = !{i32 0, i32 100}
|