Now that the legacy PM is no longer tested, the huge matrix of test prefixes used by attributor tests is no longer needed and very confusing for the casual reader. Reduce the prefixes down to just CHECK, TUNIT and CGSCC.
96 lines
3.3 KiB
LLVM
96 lines
3.3 KiB
LLVM
; NOTE: Assertions have been autogenerated by utils/update_test_checks.py UTC_ARGS: --function-signature --check-attributes --check-globals
|
|
; RUN: opt -aa-pipeline=basic-aa -passes=attributor -attributor-manifest-internal -attributor-max-iterations-verify -attributor-annotate-decl-cs -attributor-max-iterations=4 -S < %s | FileCheck %s --check-prefixes=CHECK,TUNIT
|
|
; RUN: opt -aa-pipeline=basic-aa -passes=attributor-cgscc -attributor-manifest-internal -attributor-annotate-decl-cs -S < %s | FileCheck %s --check-prefixes=CHECK,CGSCC
|
|
|
|
%"a" = type { i64 }
|
|
%"b" = type { i8 }
|
|
|
|
define hidden i64 @f1() align 2 {
|
|
; TUNIT: Function Attrs: nofree norecurse nosync nounwind readnone willreturn
|
|
; TUNIT-LABEL: define {{[^@]+}}@f1
|
|
; TUNIT-SAME: () #[[ATTR0:[0-9]+]] align 2 {
|
|
; TUNIT-NEXT: entry:
|
|
; TUNIT-NEXT: ret i64 undef
|
|
;
|
|
; CGSCC: Function Attrs: nofree nosync nounwind readnone willreturn
|
|
; CGSCC-LABEL: define {{[^@]+}}@f1
|
|
; CGSCC-SAME: () #[[ATTR0:[0-9]+]] align 2 {
|
|
; CGSCC-NEXT: entry:
|
|
; CGSCC-NEXT: [[REF_TMP:%.*]] = alloca [[A:%.*]], align 8
|
|
; CGSCC-NEXT: [[CALL2:%.*]] = call i64 @f2() #[[ATTR2:[0-9]+]]
|
|
; CGSCC-NEXT: ret i64 [[CALL2]]
|
|
;
|
|
entry:
|
|
%ref.tmp = alloca %"a", align 8
|
|
%call2 = call i64 @f2(%"a"* %ref.tmp)
|
|
ret i64 %call2
|
|
}
|
|
|
|
define internal i64 @f2(%"a"* %this) align 2 {
|
|
; CGSCC: Function Attrs: nofree nosync nounwind readnone willreturn
|
|
; CGSCC-LABEL: define {{[^@]+}}@f2
|
|
; CGSCC-SAME: () #[[ATTR0]] align 2 {
|
|
; CGSCC-NEXT: entry:
|
|
; CGSCC-NEXT: ret i64 undef
|
|
;
|
|
entry:
|
|
%this.addr = alloca %"a"*, align 8
|
|
store %"a"* %this, %"a"** %this.addr, align 8
|
|
%this1 = load %"a"*, %"a"** %this.addr, align 8
|
|
%0 = bitcast %"a"* %this1 to %"b"*
|
|
call void @f3(%"b"* %0)
|
|
ret i64 undef
|
|
}
|
|
|
|
define internal void @f3(%"b"* %this) align 2 {
|
|
; CGSCC: Function Attrs: nofree nosync nounwind readnone willreturn
|
|
; CGSCC-LABEL: define {{[^@]+}}@f3
|
|
; CGSCC-SAME: () #[[ATTR0]] align 2 {
|
|
; CGSCC-NEXT: entry:
|
|
; CGSCC-NEXT: ret void
|
|
;
|
|
entry:
|
|
%this.addr = alloca %"b"*, align 8
|
|
store %"b"* %this, %"b"** %this.addr, align 8
|
|
%this1 = load %"b"*, %"b"** %this.addr, align 8
|
|
%call = call i1 @f4(%"b"* %this1)
|
|
ret void
|
|
}
|
|
|
|
define internal i1 @f4(%"b"* %this) align 2 {
|
|
; CGSCC: Function Attrs: nofree nosync nounwind readnone willreturn
|
|
; CGSCC-LABEL: define {{[^@]+}}@f4
|
|
; CGSCC-SAME: () #[[ATTR0]] align 2 {
|
|
; CGSCC-NEXT: entry:
|
|
; CGSCC-NEXT: ret i1 undef
|
|
;
|
|
entry:
|
|
%this.addr = alloca %"b"*, align 8
|
|
store %"b"* %this, %"b"** %this.addr, align 8
|
|
%this1 = load %"b"*, %"b"** %this.addr, align 8
|
|
%call = call %"a"* @f5(%"b"* %this1)
|
|
ret i1 undef
|
|
}
|
|
|
|
define internal %"a"* @f5(%"b"* %this) align 2 {
|
|
; CGSCC: Function Attrs: nofree norecurse nosync nounwind readnone willreturn
|
|
; CGSCC-LABEL: define {{[^@]+}}@f5
|
|
; CGSCC-SAME: () #[[ATTR1:[0-9]+]] align 2 {
|
|
; CGSCC-NEXT: entry:
|
|
; CGSCC-NEXT: ret %a* undef
|
|
;
|
|
entry:
|
|
%this.addr = alloca %"b"*, align 8
|
|
store %"b"* %this, %"b"** %this.addr, align 8
|
|
%this1 = load %"b"*, %"b"** %this.addr, align 8
|
|
%0 = bitcast %"b"* %this1 to %"a"*
|
|
ret %"a"* %0
|
|
}
|
|
;.
|
|
; TUNIT: attributes #[[ATTR0]] = { nofree norecurse nosync nounwind readnone willreturn }
|
|
;.
|
|
; CGSCC: attributes #[[ATTR0]] = { nofree nosync nounwind readnone willreturn }
|
|
; CGSCC: attributes #[[ATTR1]] = { nofree norecurse nosync nounwind readnone willreturn }
|
|
; CGSCC: attributes #[[ATTR2]] = { readnone willreturn }
|
|
;.
|