File: 2011-11-23-MaskedBitsCrash.ll

package info (click to toggle)
llvm-toolchain-9 1%3A9.0.1-16.1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 882,388 kB
  • sloc: cpp: 4,167,636; ansic: 714,256; asm: 457,610; python: 155,927; objc: 65,094; sh: 42,856; lisp: 26,908; perl: 7,786; pascal: 7,722; makefile: 6,881; ml: 5,581; awk: 3,648; cs: 2,027; xml: 888; javascript: 381; ruby: 156
file content (17 lines) | stat: -rw-r--r-- 605 bytes parent folder | download | duplicates (25)
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
; RUN: opt < %s -instsimplify

; The mul can be proved to always overflow (turning a negative value
; into a positive one) and thus results in undefined behaviour.  At
; the same time we were deducing from the nsw flag that that mul could
; be assumed to have a negative value (since if not it has an undefined
; value, which can be taken to be negative).  We were reporting the mul
; as being both positive and negative, firing an assertion!
define i1 @test1(i32 %a) {
entry:
  %0 = or i32 %a, 1
  %1 = shl i32 %0, 31
  %2 = mul nsw i32 %1, 4
  %3 = and i32 %2, -4
  %4 = icmp ne i32 %3, 0
  ret i1 %4
}