diff options
author | Peter Collingbourne <peter@pcc.me.uk> | 2015-02-20 20:30:47 +0000 |
---|---|---|
committer | Peter Collingbourne <peter@pcc.me.uk> | 2015-02-20 20:30:47 +0000 |
commit | e6909c8e8ba07acb5e6366186fe186c91054e93c (patch) | |
tree | 0e1f875c39059aa76d8ae64ba80136585d610aa0 /llvm/test/Transforms/LowerBitSets/single-offset.ll | |
parent | 0365675522ae4c7b754989d86c177875a52baa72 (diff) | |
download | bcm5719-llvm-e6909c8e8ba07acb5e6366186fe186c91054e93c.tar.gz bcm5719-llvm-e6909c8e8ba07acb5e6366186fe186c91054e93c.zip |
Introduce bitset metadata format and bitset lowering pass.
This patch introduces a new mechanism that allows IR modules to co-operatively
build pointer sets corresponding to addresses within a given set of
globals. One particular use case for this is to allow a C++ program to
efficiently verify (at each call site) that a vtable pointer is in the set
of valid vtable pointers for the class or its derived classes. One way of
doing this is for a toolchain component to build, for each class, a bit set
that maps to the memory region allocated for the vtables, such that each 1
bit in the bit set maps to a valid vtable for that class, and lay out the
vtables next to each other, to minimize the total size of the bit sets.
The patch introduces a metadata format for representing pointer sets, an
'@llvm.bitset.test' intrinsic and an LTO lowering pass that lays out the globals
and builds the bitsets, and documents the new feature.
Differential Revision: http://reviews.llvm.org/D7288
llvm-svn: 230054
Diffstat (limited to 'llvm/test/Transforms/LowerBitSets/single-offset.ll')
-rw-r--r-- | llvm/test/Transforms/LowerBitSets/single-offset.ll | 40 |
1 files changed, 40 insertions, 0 deletions
diff --git a/llvm/test/Transforms/LowerBitSets/single-offset.ll b/llvm/test/Transforms/LowerBitSets/single-offset.ll new file mode 100644 index 00000000000..ebe57bf4d14 --- /dev/null +++ b/llvm/test/Transforms/LowerBitSets/single-offset.ll @@ -0,0 +1,40 @@ +; RUN: opt -S -lowerbitsets < %s | FileCheck %s + +target datalayout = "e-p:32:32" + +; CHECK: [[G:@[^ ]*]] = private constant { i32, i32 } +@a = constant i32 1 +@b = constant i32 2 + +!0 = !{!"bitset1", i32* @a, i32 0} +!1 = !{!"bitset1", i32* @b, i32 0} +!2 = !{!"bitset2", i32* @a, i32 0} +!3 = !{!"bitset3", i32* @b, i32 0} + +!llvm.bitsets = !{ !0, !1, !2, !3 } + +declare i1 @llvm.bitset.test(i8* %ptr, metadata %bitset) nounwind readnone + +; CHECK: @foo(i8* [[A0:%[^ ]*]]) +define i1 @foo(i8* %p) { + ; CHECK: [[R0:%[^ ]*]] = ptrtoint i8* [[A0]] to i32 + ; CHECK: [[R1:%[^ ]*]] = icmp eq i32 [[R0]], ptrtoint ({ i32, i32 }* [[G]] to i32) + %x = call i1 @llvm.bitset.test(i8* %p, metadata !"bitset2") + ; CHECK: ret i1 [[R1]] + ret i1 %x +} + +; CHECK: @bar(i8* [[B0:%[^ ]*]]) +define i1 @bar(i8* %p) { + ; CHECK: [[S0:%[^ ]*]] = ptrtoint i8* [[B0]] to i32 + ; CHECK: [[S1:%[^ ]*]] = icmp eq i32 [[S0]], add (i32 ptrtoint ({ i32, i32 }* [[G]] to i32), i32 4) + %x = call i1 @llvm.bitset.test(i8* %p, metadata !"bitset3") + ; CHECK: ret i1 [[S1]] + ret i1 %x +} + +; CHECK: @x( +define i1 @x(i8* %p) { + %x = call i1 @llvm.bitset.test(i8* %p, metadata !"bitset1") + ret i1 %x +} |