mirror of
https://github.com/c64scene-ar/llvm-6502.git
synced 2025-11-03 14:21:30 +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
119 lines
2.9 KiB
LLVM
119 lines
2.9 KiB
LLVM
; RUN: opt < %s -instcombine -S | FileCheck %s
|
|
|
|
target datalayout = "e-m:e-i64:64-f80:128-n8:16:32:64-S128"
|
|
|
|
; CHECK-LABEL: @oppositesign
|
|
; CHECK: add nsw i16 %a, %b
|
|
define i16 @oppositesign(i16 %x, i16 %y) {
|
|
; %a is negative, %b is positive
|
|
%a = or i16 %x, 32768
|
|
%b = and i16 %y, 32767
|
|
%c = add i16 %a, %b
|
|
ret i16 %c
|
|
}
|
|
|
|
define i16 @zero_sign_bit(i16 %a) {
|
|
; CHECK-LABEL: @zero_sign_bit(
|
|
; CHECK-NEXT: and
|
|
; CHECK-NEXT: add nuw
|
|
; CHECK-NEXT: ret
|
|
%1 = and i16 %a, 32767
|
|
%2 = add i16 %1, 512
|
|
ret i16 %2
|
|
}
|
|
|
|
define i16 @zero_sign_bit2(i16 %a, i16 %b) {
|
|
; CHECK-LABEL: @zero_sign_bit2(
|
|
; CHECK-NEXT: and
|
|
; CHECK-NEXT: and
|
|
; CHECK-NEXT: add nuw
|
|
; CHECK-NEXT: ret
|
|
%1 = and i16 %a, 32767
|
|
%2 = and i16 %b, 32767
|
|
%3 = add i16 %1, %2
|
|
ret i16 %3
|
|
}
|
|
|
|
declare i16 @bounded(i16 %input);
|
|
declare i32 @__gxx_personality_v0(...);
|
|
!0 = !{i16 0, i16 32768} ; [0, 32767]
|
|
!1 = !{i16 0, i16 32769} ; [0, 32768]
|
|
|
|
define i16 @add_bounded_values(i16 %a, i16 %b) {
|
|
; CHECK-LABEL: @add_bounded_values(
|
|
entry:
|
|
%c = call i16 @bounded(i16 %a), !range !0
|
|
%d = invoke i16 @bounded(i16 %b) to label %cont unwind label %lpad, !range !0
|
|
cont:
|
|
; %c and %d are in [0, 32767]. Therefore, %c + %d doesn't unsigned overflow.
|
|
%e = add i16 %c, %d
|
|
; CHECK: add nuw i16 %c, %d
|
|
ret i16 %e
|
|
lpad:
|
|
%0 = landingpad { i8*, i32 } personality i8* bitcast (i32 (...)* @__gxx_personality_v0 to i8*)
|
|
filter [0 x i8*] zeroinitializer
|
|
ret i16 42
|
|
}
|
|
|
|
define i16 @add_bounded_values_2(i16 %a, i16 %b) {
|
|
; CHECK-LABEL: @add_bounded_values_2(
|
|
entry:
|
|
%c = call i16 @bounded(i16 %a), !range !1
|
|
%d = invoke i16 @bounded(i16 %b) to label %cont unwind label %lpad, !range !1
|
|
cont:
|
|
; Similar to add_bounded_values, but %c and %d are in [0, 32768]. Therefore,
|
|
; %c + %d may unsigned overflow and we cannot add NUW.
|
|
%e = add i16 %c, %d
|
|
; CHECK: add i16 %c, %d
|
|
ret i16 %e
|
|
lpad:
|
|
%0 = landingpad { i8*, i32 } personality i8* bitcast (i32 (...)* @__gxx_personality_v0 to i8*)
|
|
filter [0 x i8*] zeroinitializer
|
|
ret i16 42
|
|
}
|
|
|
|
; CHECK-LABEL: @ripple_nsw1
|
|
; CHECK: add nsw i16 %a, %b
|
|
define i16 @ripple_nsw1(i16 %x, i16 %y) {
|
|
; %a has at most one bit set
|
|
%a = and i16 %y, 1
|
|
|
|
; %b has a 0 bit other than the sign bit
|
|
%b = and i16 %x, 49151
|
|
|
|
%c = add i16 %a, %b
|
|
ret i16 %c
|
|
}
|
|
|
|
; Like the previous test, but flip %a and %b
|
|
; CHECK-LABEL: @ripple_nsw2
|
|
; CHECK: add nsw i16 %b, %a
|
|
define i16 @ripple_nsw2(i16 %x, i16 %y) {
|
|
%a = and i16 %y, 1
|
|
%b = and i16 %x, 49151
|
|
%c = add i16 %b, %a
|
|
ret i16 %c
|
|
}
|
|
|
|
; CHECK-LABEL: @ripple_no_nsw1
|
|
; CHECK: add i32 %a, %x
|
|
define i32 @ripple_no_nsw1(i32 %x, i32 %y) {
|
|
; We know nothing about %x
|
|
%a = and i32 %y, 1
|
|
%b = add i32 %a, %x
|
|
ret i32 %b
|
|
}
|
|
|
|
; CHECK-LABEL: @ripple_no_nsw2
|
|
; CHECK: add nuw i16 %a, %b
|
|
define i16 @ripple_no_nsw2(i16 %x, i16 %y) {
|
|
; %a has at most one bit set
|
|
%a = and i16 %y, 1
|
|
|
|
; %b has a 0 bit, but it is the sign bit
|
|
%b = and i16 %x, 32767
|
|
|
|
%c = add i16 %a, %b
|
|
ret i16 %c
|
|
}
|