view test/CodeGen/X86/2010-03-05-ConstantFoldCFG.ll @ 33:e4204d083e25

LLVM 3.5
author Kaito Tokumori <e105711@ie.u-ryukyu.ac.jp>
date Thu, 12 Dec 2013 14:32:10 +0900
parents 95c75e76d11b
children afa8332a0e37
line wrap: on
line source

; RUN: llc < %s -verify-machineinstrs
;
; When BRCOND is constant-folded to BR, make sure that PHI nodes don't get
; spurious operands when the CFG is trimmed.
;
target datalayout = "e-p:64:64:64-i1:8:8-i8:8:8-i16:16:16-i32:32:32-i64:64:64-f32:32:32-f64:64:64-v64:64:64-v128:128:128-a0:0:64-s0:64:64-f80:128:128-n8:16:32:64"
target triple = "x86_64-apple-darwin10.2"

define fastcc void @_ZSt16__introsort_loopIPdl17less_than_functorEvT_S2_T0_T1_(double* %__first, double* %__last, i64 %__depth_limit) nounwind ssp {
entry:
  br i1 undef, label %bb1, label %bb2

bb1:                                              ; preds = %entry
  ret void

bb2:                                              ; preds = %entry
  br label %bb2.outer.i

bb2.outer.i:                                      ; preds = %bb9.i, %bb2
  br i1 undef, label %bb1.i, label %bb5.preheader.i

bb1.i:                                            ; preds = %bb1.i, %bb2.outer.i
  %indvar5.i = phi i64 [ %tmp, %bb1.i ], [ 0, %bb2.outer.i ] ; <i64> [#uses=1]
  %tmp = add i64 %indvar5.i, 1                    ; <i64> [#uses=2]
  %scevgep.i = getelementptr double* undef, i64 %tmp ; <double*> [#uses=0]
  br i1 undef, label %bb1.i, label %bb5.preheader.i

bb5.preheader.i:                                  ; preds = %bb1.i, %bb2.outer.i
  br label %bb5.i

bb5.i:                                            ; preds = %bb5.i, %bb5.preheader.i
  br i1 undef, label %bb5.i, label %bb7.i6

bb7.i6:                                           ; preds = %bb5.i
  br i1 undef, label %bb9.i, label %_ZSt21__unguarded_partitionIPdd17less_than_functorET_S2_S2_T0_T1_.exit

bb9.i:                                            ; preds = %bb7.i6
  br label %bb2.outer.i

_ZSt21__unguarded_partitionIPdd17less_than_functorET_S2_S2_T0_T1_.exit: ; preds = %bb7.i6
  unreachable
}