mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-10-31 08:16:47 +00:00
1ef70ff39b
Now that `Metadata` is typeless, reflect that in the assembly. These
are the matching assembly changes for the metadata/value split in
r223802.
- Only use the `metadata` type when referencing metadata from a call
intrinsic -- i.e., only when it's used as a `Value`.
- Stop pretending that `ValueAsMetadata` is wrapped in an `MDNode`
when referencing it from call intrinsics.
So, assembly like this:
define @foo(i32 %v) {
call void @llvm.foo(metadata !{i32 %v}, metadata !0)
call void @llvm.foo(metadata !{i32 7}, metadata !0)
call void @llvm.foo(metadata !1, metadata !0)
call void @llvm.foo(metadata !3, metadata !0)
call void @llvm.foo(metadata !{metadata !3}, metadata !0)
ret void, !bar !2
}
!0 = metadata !{metadata !2}
!1 = metadata !{i32* @global}
!2 = metadata !{metadata !3}
!3 = metadata !{}
turns into this:
define @foo(i32 %v) {
call void @llvm.foo(metadata i32 %v, metadata !0)
call void @llvm.foo(metadata i32 7, metadata !0)
call void @llvm.foo(metadata i32* @global, metadata !0)
call void @llvm.foo(metadata !3, metadata !0)
call void @llvm.foo(metadata !{!3}, metadata !0)
ret void, !bar !2
}
!0 = !{!2}
!1 = !{i32* @global}
!2 = !{!3}
!3 = !{}
I wrote an upgrade script that handled almost all of the tests in llvm
and many of the tests in cfe (even handling many `CHECK` lines). I've
attached it (or will attach it in a moment if you're speedy) to PR21532
to help everyone update their out-of-tree testcases.
This is part of PR21532.
git-svn-id: https://llvm.org/svn/llvm-project/llvm/trunk@224257 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* %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* %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* 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}
|