File: recursively-delete-dead-instructions.ll

package info (click to toggle)
llvm-toolchain-17 1%3A17.0.6-22
  • links: PTS, VCS
  • area: main
  • in suites: forky, sid, trixie
  • size: 1,799,624 kB
  • sloc: cpp: 6,428,607; ansic: 1,383,196; asm: 793,408; python: 223,504; objc: 75,364; f90: 60,502; lisp: 33,869; pascal: 15,282; sh: 9,684; perl: 7,453; ml: 4,937; awk: 3,523; makefile: 2,889; javascript: 2,149; xml: 888; fortran: 619; cs: 573
file content (27 lines) | stat: -rw-r--r-- 868 bytes parent folder | download | duplicates (11) 
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
 
; RUN: opt -codegenprepare -S -mtriple=x86_64-linux < %s | FileCheck %s

declare void @llvm.assume(i1 noundef) nounwind willreturn

; Recursively deleting dead operands of assume() may result in its next
; instruction deleted and the iterator pointing to the next instruction
; invalidated. This prevents the following simple loop in
; CodeGenPrepare::optimizeBlock() unless CurInstIterator is fixed:
;
;   CurInstIterator = BB.begin();
;   while (CurInstIterator != BB.end())
;     optimizeInst(&*CurInstIterator++, ModifiedDT);
;
define i32 @test_assume_in_loop(i1 %cond1, i1 %cond2) {
; CHECK-LABEL: @test_assume_in_loop(
; CHECK-NEXT:  entry:
entry:
  br label %loop

; CHECK: loop:
; CHECK-NEXT:  br label %loop
loop:
  %cond3 = phi i1 [%cond1, %entry], [%cond4, %loop]
  call void @llvm.assume(i1 %cond3)
  %cond4 = icmp ult i1 %cond1, %cond2
  br label %loop
}