1; This testcase contains a entire loop that should be removed. The only thing 2; left is the store instruction in BB0. The problem this testcase was running 3; into was that when the reg109 PHI was getting zero predecessors, it was 4; removed even though there were uses still around. Now the uses are filled 5; in with a dummy value before the PHI is deleted. 6; 7; RUN: opt < %s -S -passes=adce | grep bb1 8; RUN: opt < %s -S -passes=adce -adce-remove-loops | FileCheck %s 9 10 %node_t = type { ptr, ptr, ptr, ptr, ptr, i32, i32 } 11 12define void @localize_local(ptr %nodelist) { 13bb0: 14 %nodelist.upgrd.1 = alloca ptr ; <ptr> [#uses=2] 15 store ptr %nodelist, ptr %nodelist.upgrd.1 16 br label %bb1 17 18bb1: ; preds = %bb0 19 %reg107 = load ptr, ptr %nodelist.upgrd.1 ; <ptr> [#uses=2] 20 %cond211 = icmp eq ptr %reg107, null ; <i1> [#uses=1] 21; CHECK: br label %bb3 22 br i1 %cond211, label %bb3, label %bb2 23 24bb2: ; preds = %bb2, %bb1 25 %reg109 = phi ptr [ %reg110, %bb2 ], [ %reg107, %bb1 ] ; <ptr> [#uses=1] 26 %reg212 = getelementptr %node_t, ptr %reg109, i64 0, i32 1 ; <ptr> [#uses=1] 27 %reg110 = load ptr, ptr %reg212 ; <ptr> [#uses=2] 28 %cond213 = icmp ne ptr %reg110, null ; <i1> [#uses=1] 29; CHECK: br label %bb3 30 br i1 %cond213, label %bb2, label %bb3 31 32bb3: ; preds = %bb2, %bb1 33 ret void 34} 35 36