2011-12-24 02:41:31 +08:00
|
|
|
; RUN: opt < %s -functionattrs -S | FileCheck %s
|
2018-03-24 05:46:16 +08:00
|
|
|
; RUN: opt < %s -passes=function-attrs -S | FileCheck %s
|
|
|
|
|
2009-01-01 00:14:43 +08:00
|
|
|
@g = global i32* null ; <i32**> [#uses=1]
|
|
|
|
|
2016-07-20 02:50:26 +08:00
|
|
|
; CHECK: define i32* @c1(i32* readnone returned %q)
|
2009-01-01 04:21:34 +08:00
|
|
|
define i32* @c1(i32* %q) {
|
|
|
|
ret i32* %q
|
2009-01-01 00:14:43 +08:00
|
|
|
}
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define void @c2(i32* %q)
|
2013-07-06 08:29:58 +08:00
|
|
|
; It would also be acceptable to mark %q as readnone. Update @c3 too.
|
2009-01-01 04:21:34 +08:00
|
|
|
define void @c2(i32* %q) {
|
|
|
|
store i32* %q, i32** @g
|
2009-01-01 00:14:43 +08:00
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define void @c3(i32* %q)
|
2009-01-01 04:21:34 +08:00
|
|
|
define void @c3(i32* %q) {
|
|
|
|
call void @c2(i32* %q)
|
2009-01-01 00:14:43 +08:00
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define i1 @c4(i32* %q, i32 %bitno)
|
2009-01-02 08:55:51 +08:00
|
|
|
define i1 @c4(i32* %q, i32 %bitno) {
|
|
|
|
%tmp = ptrtoint i32* %q to i32
|
|
|
|
%tmp2 = lshr i32 %tmp, %bitno
|
|
|
|
%bit = trunc i32 %tmp2 to i1
|
|
|
|
br i1 %bit, label %l1, label %l0
|
|
|
|
l0:
|
|
|
|
ret i1 0 ; escaping value not caught by def-use chaining.
|
|
|
|
l1:
|
|
|
|
ret i1 1 ; escaping value not caught by def-use chaining.
|
|
|
|
}
|
|
|
|
|
|
|
|
@lookup_table = global [2 x i1] [ i1 0, i1 1 ]
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define i1 @c5(i32* %q, i32 %bitno)
|
2009-01-02 08:55:51 +08:00
|
|
|
define i1 @c5(i32* %q, i32 %bitno) {
|
|
|
|
%tmp = ptrtoint i32* %q to i32
|
|
|
|
%tmp2 = lshr i32 %tmp, %bitno
|
|
|
|
%bit = and i32 %tmp2, 1
|
|
|
|
; subtle escape mechanism follows
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%lookup = getelementptr [2 x i1], [2 x i1]* @lookup_table, i32 0, i32 %bit
|
2015-02-28 05:17:42 +08:00
|
|
|
%val = load i1, i1* %lookup
|
2009-01-02 08:55:51 +08:00
|
|
|
ret i1 %val
|
|
|
|
}
|
|
|
|
|
2009-05-05 00:50:29 +08:00
|
|
|
declare void @throw_if_bit_set(i8*, i8) readonly
|
2011-12-24 02:41:31 +08:00
|
|
|
|
2013-07-06 08:29:58 +08:00
|
|
|
; CHECK: define i1 @c6(i8* readonly %q, i8 %bit)
|
2015-06-18 04:52:32 +08:00
|
|
|
define i1 @c6(i8* %q, i8 %bit) personality i32 (...)* @__gxx_personality_v0 {
|
2009-05-05 00:50:29 +08:00
|
|
|
invoke void @throw_if_bit_set(i8* %q, i8 %bit)
|
|
|
|
to label %ret0 unwind label %ret1
|
|
|
|
ret0:
|
|
|
|
ret i1 0
|
|
|
|
ret1:
|
2015-06-18 04:52:32 +08:00
|
|
|
%exn = landingpad {i8*, i32}
|
2011-09-01 08:58:03 +08:00
|
|
|
cleanup
|
2009-05-05 00:50:29 +08:00
|
|
|
ret i1 1
|
|
|
|
}
|
|
|
|
|
2011-09-01 08:58:03 +08:00
|
|
|
declare i32 @__gxx_personality_v0(...)
|
|
|
|
|
2009-05-08 02:08:34 +08:00
|
|
|
define i1* @lookup_bit(i32* %q, i32 %bitno) readnone nounwind {
|
|
|
|
%tmp = ptrtoint i32* %q to i32
|
|
|
|
%tmp2 = lshr i32 %tmp, %bitno
|
|
|
|
%bit = and i32 %tmp2, 1
|
[opaque pointer type] Add textual IR support for explicit type parameter to getelementptr instruction
One of several parallel first steps to remove the target type of pointers,
replacing them with a single opaque pointer type.
This adds an explicit type parameter to the gep instruction so that when the
first parameter becomes an opaque pointer type, the type to gep through is
still available to the instructions.
* This doesn't modify gep operators, only instructions (operators will be
handled separately)
* Textual IR changes only. Bitcode (including upgrade) and changing the
in-memory representation will be in separate changes.
* geps of vectors are transformed as:
getelementptr <4 x float*> %x, ...
->getelementptr float, <4 x float*> %x, ...
Then, once the opaque pointer type is introduced, this will ultimately look
like:
getelementptr float, <4 x ptr> %x
with the unambiguous interpretation that it is a vector of pointers to float.
* address spaces remain on the pointer, not the type:
getelementptr float addrspace(1)* %x
->getelementptr float, float addrspace(1)* %x
Then, eventually:
getelementptr float, ptr addrspace(1) %x
Importantly, the massive amount of test case churn has been automated by
same crappy python code. I had to manually update a few test cases that
wouldn't fit the script's model (r228970,r229196,r229197,r229198). The
python script just massages stdin and writes the result to stdout, I
then wrapped that in a shell script to handle replacing files, then
using the usual find+xargs to migrate all the files.
update.py:
import fileinput
import sys
import re
ibrep = re.compile(r"(^.*?[^%\w]getelementptr inbounds )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
normrep = re.compile( r"(^.*?[^%\w]getelementptr )(((?:<\d* x )?)(.*?)(| addrspace\(\d\)) *\*(|>)(?:$| *(?:%|@|null|undef|blockaddress|getelementptr|addrspacecast|bitcast|inttoptr|\[\[[a-zA-Z]|\{\{).*$))")
def conv(match, line):
if not match:
return line
line = match.groups()[0]
if len(match.groups()[5]) == 0:
line += match.groups()[2]
line += match.groups()[3]
line += ", "
line += match.groups()[1]
line += "\n"
return line
for line in sys.stdin:
if line.find("getelementptr ") == line.find("getelementptr inbounds"):
if line.find("getelementptr inbounds") != line.find("getelementptr inbounds ("):
line = conv(re.match(ibrep, line), line)
elif line.find("getelementptr ") != line.find("getelementptr ("):
line = conv(re.match(normrep, line), line)
sys.stdout.write(line)
apply.sh:
for name in "$@"
do
python3 `dirname "$0"`/update.py < "$name" > "$name.tmp" && mv "$name.tmp" "$name"
rm -f "$name.tmp"
done
The actual commands:
From llvm/src:
find test/ -name *.ll | xargs ./apply.sh
From llvm/src/tools/clang:
find test/ -name *.mm -o -name *.m -o -name *.cpp -o -name *.c | xargs -I '{}' ../../apply.sh "{}"
From llvm/src/tools/polly:
find test/ -name *.ll | xargs ./apply.sh
After that, check-all (with llvm, clang, clang-tools-extra, lld,
compiler-rt, and polly all checked out).
The extra 'rm' in the apply.sh script is due to a few files in clang's test
suite using interesting unicode stuff that my python script was throwing
exceptions on. None of those files needed to be migrated, so it seemed
sufficient to ignore those cases.
Reviewers: rafael, dexonsmith, grosser
Differential Revision: http://reviews.llvm.org/D7636
llvm-svn: 230786
2015-02-28 03:29:02 +08:00
|
|
|
%lookup = getelementptr [2 x i1], [2 x i1]* @lookup_table, i32 0, i32 %bit
|
2009-05-08 02:08:34 +08:00
|
|
|
ret i1* %lookup
|
|
|
|
}
|
|
|
|
|
2014-05-30 10:31:27 +08:00
|
|
|
; CHECK: define i1 @c7(i32* readonly %q, i32 %bitno)
|
2009-05-08 02:08:34 +08:00
|
|
|
define i1 @c7(i32* %q, i32 %bitno) {
|
|
|
|
%ptr = call i1* @lookup_bit(i32* %q, i32 %bitno)
|
2015-02-28 05:17:42 +08:00
|
|
|
%val = load i1, i1* %ptr
|
2009-05-08 02:08:34 +08:00
|
|
|
ret i1 %val
|
|
|
|
}
|
|
|
|
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define i32 @nc1(i32* %q, i32* nocapture %p, i1 %b)
|
2009-01-01 04:21:34 +08:00
|
|
|
define i32 @nc1(i32* %q, i32* %p, i1 %b) {
|
|
|
|
e:
|
|
|
|
br label %l
|
|
|
|
l:
|
|
|
|
%x = phi i32* [ %p, %e ]
|
|
|
|
%y = phi i32* [ %q, %e ]
|
|
|
|
%tmp = bitcast i32* %x to i32* ; <i32*> [#uses=2]
|
|
|
|
%tmp2 = select i1 %b, i32* %tmp, i32* %y
|
2015-02-28 05:17:42 +08:00
|
|
|
%val = load i32, i32* %tmp2 ; <i32> [#uses=1]
|
2009-01-01 00:14:43 +08:00
|
|
|
store i32 0, i32* %tmp
|
2009-01-01 04:21:34 +08:00
|
|
|
store i32* %y, i32** @g
|
2009-01-01 00:14:43 +08:00
|
|
|
ret i32 %val
|
|
|
|
}
|
|
|
|
|
2014-01-15 03:11:52 +08:00
|
|
|
; CHECK: define i32 @nc1_addrspace(i32* %q, i32 addrspace(1)* nocapture %p, i1 %b)
|
|
|
|
define i32 @nc1_addrspace(i32* %q, i32 addrspace(1)* %p, i1 %b) {
|
|
|
|
e:
|
|
|
|
br label %l
|
|
|
|
l:
|
|
|
|
%x = phi i32 addrspace(1)* [ %p, %e ]
|
|
|
|
%y = phi i32* [ %q, %e ]
|
|
|
|
%tmp = addrspacecast i32 addrspace(1)* %x to i32* ; <i32*> [#uses=2]
|
|
|
|
%tmp2 = select i1 %b, i32* %tmp, i32* %y
|
2015-02-28 05:17:42 +08:00
|
|
|
%val = load i32, i32* %tmp2 ; <i32> [#uses=1]
|
2014-01-15 03:11:52 +08:00
|
|
|
store i32 0, i32* %tmp
|
|
|
|
store i32* %y, i32** @g
|
|
|
|
ret i32 %val
|
|
|
|
}
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define void @nc2(i32* nocapture %p, i32* %q)
|
2009-01-01 04:21:34 +08:00
|
|
|
define void @nc2(i32* %p, i32* %q) {
|
|
|
|
%1 = call i32 @nc1(i32* %q, i32* %p, i1 0) ; <i32> [#uses=0]
|
2009-01-01 00:14:43 +08:00
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define void @nc3(void ()* nocapture %p)
|
2009-01-01 04:21:34 +08:00
|
|
|
define void @nc3(void ()* %p) {
|
|
|
|
call void %p()
|
2009-01-01 00:14:43 +08:00
|
|
|
ret void
|
|
|
|
}
|
2009-01-02 11:46:56 +08:00
|
|
|
|
2009-05-05 00:50:29 +08:00
|
|
|
declare void @external(i8*) readonly nounwind
|
2013-07-06 08:29:58 +08:00
|
|
|
; CHECK: define void @nc4(i8* nocapture readonly %p)
|
2009-01-02 11:46:56 +08:00
|
|
|
define void @nc4(i8* %p) {
|
|
|
|
call void @external(i8* %p)
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2011-12-24 02:41:31 +08:00
|
|
|
; CHECK: define void @nc5(void (i8*)* nocapture %f, i8* nocapture %p)
|
2009-05-08 02:08:34 +08:00
|
|
|
define void @nc5(void (i8*)* %f, i8* %p) {
|
|
|
|
call void %f(i8* %p) readonly nounwind
|
|
|
|
call void %f(i8* nocapture %p)
|
2009-01-02 11:46:56 +08:00
|
|
|
ret void
|
|
|
|
}
|
2011-12-29 07:24:21 +08:00
|
|
|
|
2013-07-06 08:29:58 +08:00
|
|
|
; CHECK: define void @test1_1(i8* nocapture readnone %x1_1, i8* %y1_1)
|
|
|
|
; It would be acceptable to add readnone to %y1_1 and %y1_2.
|
2011-12-29 07:24:21 +08:00
|
|
|
define void @test1_1(i8* %x1_1, i8* %y1_1) {
|
|
|
|
call i8* @test1_2(i8* %x1_1, i8* %y1_1)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2016-07-20 02:50:26 +08:00
|
|
|
; CHECK: define i8* @test1_2(i8* nocapture readnone %x1_2, i8* returned %y1_2)
|
2011-12-29 07:24:21 +08:00
|
|
|
define i8* @test1_2(i8* %x1_2, i8* %y1_2) {
|
|
|
|
call void @test1_1(i8* %x1_2, i8* %y1_2)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret i8* %y1_2
|
|
|
|
}
|
|
|
|
|
2013-07-06 08:29:58 +08:00
|
|
|
; CHECK: define void @test2(i8* nocapture readnone %x2)
|
2011-12-29 07:24:21 +08:00
|
|
|
define void @test2(i8* %x2) {
|
|
|
|
call void @test2(i8* %x2)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2013-07-06 08:29:58 +08:00
|
|
|
; CHECK: define void @test3(i8* nocapture readnone %x3, i8* nocapture readnone %y3, i8* nocapture readnone %z3)
|
2011-12-29 07:24:21 +08:00
|
|
|
define void @test3(i8* %x3, i8* %y3, i8* %z3) {
|
|
|
|
call void @test3(i8* %z3, i8* %y3, i8* %x3)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
; CHECK: define void @test4_1(i8* %x4_1)
|
|
|
|
define void @test4_1(i8* %x4_1) {
|
|
|
|
call i8* @test4_2(i8* %x4_1, i8* %x4_1, i8* %x4_1)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2016-07-20 02:50:26 +08:00
|
|
|
; CHECK: define i8* @test4_2(i8* nocapture readnone %x4_2, i8* readnone returned %y4_2, i8* nocapture readnone %z4_2)
|
2011-12-29 07:24:21 +08:00
|
|
|
define i8* @test4_2(i8* %x4_2, i8* %y4_2, i8* %z4_2) {
|
|
|
|
call void @test4_1(i8* null)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret i8* %y4_2
|
|
|
|
}
|
|
|
|
|
|
|
|
declare i8* @test5_1(i8* %x5_1)
|
|
|
|
|
|
|
|
; CHECK: define void @test5_2(i8* %x5_2)
|
|
|
|
define void @test5_2(i8* %x5_2) {
|
|
|
|
call i8* @test5_1(i8* %x5_2)
|
|
|
|
store i32* null, i32** @g
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
declare void @test6_1(i8* %x6_1, i8* nocapture %y6_1, ...)
|
|
|
|
|
|
|
|
; CHECK: define void @test6_2(i8* %x6_2, i8* nocapture %y6_2, i8* %z6_2)
|
|
|
|
define void @test6_2(i8* %x6_2, i8* %y6_2, i8* %z6_2) {
|
[opaque pointer type] Add textual IR support for explicit type parameter to the call instruction
See r230786 and r230794 for similar changes to gep and load
respectively.
Call is a bit different because it often doesn't have a single explicit
type - usually the type is deduced from the arguments, and just the
return type is explicit. In those cases there's no need to change the
IR.
When that's not the case, the IR usually contains the pointer type of
the first operand - but since typed pointers are going away, that
representation is insufficient so I'm just stripping the "pointerness"
of the explicit type away.
This does make the IR a bit weird - it /sort of/ reads like the type of
the first operand: "call void () %x(" but %x is actually of type "void
()*" and will eventually be just of type "ptr". But this seems not too
bad and I don't think it would benefit from repeating the type
("void (), void () * %x(" and then eventually "void (), ptr %x(") as has
been done with gep and load.
This also has a side benefit: since the explicit type is no longer a
pointer, there's no ambiguity between an explicit type and a function
that returns a function pointer. Previously this case needed an explicit
type (eg: a function returning a void() function was written as
"call void () () * @x(" rather than "call void () * @x(" because of the
ambiguity between a function returning a pointer to a void() function
and a function returning void).
No ambiguity means even function pointer return types can just be
written alone, without writing the whole function's type.
This leaves /only/ the varargs case where the explicit type is required.
Given the special type syntax in call instructions, the regex-fu used
for migration was a bit more involved in its own unique way (as every
one of these is) so here it is. Use it in conjunction with the apply.sh
script and associated find/xargs commands I've provided in rr230786 to
migrate your out of tree tests. Do let me know if any of this doesn't
cover your cases & we can iterate on a more general script/regexes to
help others with out of tree tests.
About 9 test cases couldn't be automatically migrated - half of those
were functions returning function pointers, where I just had to manually
delete the function argument types now that we didn't need an explicit
function type there. The other half were typedefs of function types used
in calls - just had to manually drop the * from those.
import fileinput
import sys
import re
pat = re.compile(r'((?:=|:|^|\s)call\s(?:[^@]*?))(\s*$|\s*(?:(?:\[\[[a-zA-Z0-9_]+\]\]|[@%](?:(")?[\\\?@a-zA-Z0-9_.]*?(?(3)"|)|{{.*}}))(?:\(|$)|undef|inttoptr|bitcast|null|asm).*$)')
addrspace_end = re.compile(r"addrspace\(\d+\)\s*\*$")
func_end = re.compile("(?:void.*|\)\s*)\*$")
def conv(match, line):
if not match or re.search(addrspace_end, match.group(1)) or not re.search(func_end, match.group(1)):
return line
return line[:match.start()] + match.group(1)[:match.group(1).rfind('*')].rstrip() + match.group(2) + line[match.end():]
for line in sys.stdin:
sys.stdout.write(conv(re.search(pat, line), line))
llvm-svn: 235145
2015-04-17 07:24:18 +08:00
|
|
|
call void (i8*, i8*, ...) @test6_1(i8* %x6_2, i8* %y6_2, i8* %z6_2)
|
2011-12-29 07:24:21 +08:00
|
|
|
store i32* null, i32** @g
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2016-02-19 03:23:27 +08:00
|
|
|
; CHECK: define void @test_cmpxchg(i32* nocapture %p)
|
|
|
|
define void @test_cmpxchg(i32* %p) {
|
|
|
|
cmpxchg i32* %p, i32 0, i32 1 acquire monotonic
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2016-02-19 08:13:09 +08:00
|
|
|
; CHECK: define void @test_cmpxchg_ptr(i32** nocapture %p, i32* %q)
|
|
|
|
define void @test_cmpxchg_ptr(i32** %p, i32* %q) {
|
|
|
|
cmpxchg i32** %p, i32* null, i32* %q acquire monotonic
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
2016-02-19 03:23:27 +08:00
|
|
|
; CHECK: define void @test_atomicrmw(i32* nocapture %p)
|
|
|
|
define void @test_atomicrmw(i32* %p) {
|
|
|
|
atomicrmw add i32* %p, i32 1 seq_cst
|
|
|
|
ret void
|
|
|
|
}
|
2016-05-27 01:36:22 +08:00
|
|
|
|
|
|
|
; CHECK: define void @test_volatile(i32* %x)
|
|
|
|
define void @test_volatile(i32* %x) {
|
|
|
|
entry:
|
|
|
|
%gep = getelementptr i32, i32* %x, i64 1
|
|
|
|
store volatile i32 0, i32* %gep, align 4
|
|
|
|
ret void
|
|
|
|
}
|
2018-05-05 18:23:27 +08:00
|
|
|
|
|
|
|
; CHECK: nocaptureLaunder(i8* nocapture %p)
|
|
|
|
define void @nocaptureLaunder(i8* %p) {
|
|
|
|
entry:
|
|
|
|
%b = call i8* @llvm.launder.invariant.group.p0i8(i8* %p)
|
|
|
|
store i8 42, i8* %b
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
@g2 = global i8* null
|
|
|
|
; CHECK: define void @captureLaunder(i8* %p)
|
|
|
|
define void @captureLaunder(i8* %p) {
|
|
|
|
%b = call i8* @llvm.launder.invariant.group.p0i8(i8* %p)
|
|
|
|
store i8* %b, i8** @g2
|
|
|
|
ret void
|
|
|
|
}
|
|
|
|
|
|
|
|
declare i8* @llvm.launder.invariant.group.p0i8(i8*)
|