diff options
| author | Daniel Jasper <djasper@google.com> | 2015-04-14 15:20:37 +0000 |
|---|---|---|
| committer | Daniel Jasper <djasper@google.com> | 2015-04-14 15:20:37 +0000 |
| commit | 8229ebb9263fb1a773ea48c632bc1e04ce6e1299 (patch) | |
| tree | c71d7be567534f99f2eba546ebabc18ed2522b18 /llvm/lib/Bitcode/Writer/BitcodeWriterPass.cpp | |
| parent | 2f16bc10957acf1e29306bc764cb4886d38024a9 (diff) | |
| download | llvm-8229ebb9263fb1a773ea48c632bc1e04ce6e1299.zip llvm-8229ebb9263fb1a773ea48c632bc1e04ce6e1299.tar.gz llvm-8229ebb9263fb1a773ea48c632bc1e04ce6e1299.tar.bz2 | |
The code that originally made me discover this is:
if ((a & 0x1) == 0x1) {
..
}
In this case we don't actually have any branch probability information and
should not assume to have any. LLVM transforms this into:
%and = and i32 %a, 1
%tobool = icmp eq i32 %and, 0
So, in this case, the result of a bitwise and is compared against 0,
but nevertheless, we should not assume to have probability
information.
llvm-svn: 234898
Diffstat (limited to 'llvm/lib/Bitcode/Writer/BitcodeWriterPass.cpp')
0 files changed, 0 insertions, 0 deletions