File: 2011-11-23-MaskedBitsCrash.ll

package info (click to toggle)
llvm-toolchain-13 1%3A13.0.1-6~deb11u1
  • links: PTS, VCS
  • area: main
  • in suites: bullseye
  • size: 1,418,812 kB
  • sloc: cpp: 5,290,827; ansic: 996,570; asm: 544,593; python: 188,212; objc: 72,027; lisp: 30,291; f90: 25,395; sh: 24,900; javascript: 9,780; pascal: 9,398; perl: 7,484; ml: 5,432; awk: 3,523; makefile: 2,892; xml: 953; cs: 573; fortran: 539
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
}