94 lines · plain
1; NOTE: Assertions have been autogenerated by utils/update_llc_test_checks.py2; RUN: llc %s -o - -verify-machineinstrs | FileCheck %s3 4target datalayout = "e-m:o-p:32:32-f64:32:64-v64:32:64-v128:32:128-a:0:32-n32-S32"5target triple = "thumbv7s-apple-unknown"6 7; The subtract instruction %3 will be optimized (combined and predicated) with the select8; inside the loop. In this case, the kill flag on the subtract should be removed or else9; it will fail verification.10 11%struct.PROOFSEARCH_HELP = type { ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, ptr, i32, i32, i32, i32, i32, i32, i32, i32 }12%struct.SORTTHEORY_HELP = type { ptr, [4000 x ptr], ptr, ptr, i32 }13%struct.st = type { ptr, ptr, ptr, i16, i16 }14%struct.subst = type { ptr, i32, ptr }15%struct.term = type { i32, %union.anon, ptr, i32, i32 }16%union.anon = type { ptr }17%struct.NODE_HELP = type { ptr, i32, i32, i32, ptr, i32 }18%struct.SHARED_INDEX_NODE = type { ptr, [3001 x ptr], [4000 x ptr], i32 }19%struct.LIST_HELP = type { ptr, ptr }20%struct.CLAUSE_HELP = type { i32, i32, i32, i32, ptr, i32, ptr, ptr, i32, i32, ptr, i32, i32, i32, i32 }21%struct.LITERAL_HELP = type { i32, i32, i32, ptr, ptr }22 23declare void @foo(ptr, ptr)24 25define hidden fastcc ptr @test(ptr %Search, ptr %ClauseList, i32 %Level, ptr nocapture %New) {26; CHECK-LABEL: test:27; CHECK: @ %bb.0: @ %entry28; CHECK-NEXT: push.w {r4, r5, r6, r7, r8, r9, lr}29; CHECK-NEXT: sub sp, #430; CHECK-NEXT: sub.w r8, r2, #3231; CHECK-NEXT: mov r6, r032; CHECK-NEXT: movs r0, #133; CHECK-NEXT: mov r4, r234; CHECK-NEXT: add.w r7, r0, r8, lsr #535; CHECK-NEXT: mov r5, r136; CHECK-NEXT: mov.w r9, #037; CHECK-NEXT: b .LBB0_238; CHECK-NEXT: .LBB0_1: @ %for.inc39; CHECK-NEXT: @ in Loop: Header=BB0_2 Depth=140; CHECK-NEXT: ldr r5, [r5]41; CHECK-NEXT: .LBB0_2: @ %for.body42; CHECK-NEXT: @ =>This Inner Loop Header: Depth=143; CHECK-NEXT: ldr r1, [r5, #4]44; CHECK-NEXT: mov r2, r445; CHECK-NEXT: cmp r4, #3146; CHECK-NEXT: ldr r0, [r1, #16]47; CHECK-NEXT: add.w r0, r0, r7, lsl #248; CHECK-NEXT: ldr r0, [r0, #40]49; CHECK-NEXT: it hi50; CHECK-NEXT: andhi r2, r8, #3151; CHECK-NEXT: lsrs r0, r252; CHECK-NEXT: lsls r0, r0, #3153; CHECK-NEXT: beq .LBB0_154; CHECK-NEXT: @ %bb.3: @ %if.then55; CHECK-NEXT: @ in Loop: Header=BB0_2 Depth=156; CHECK-NEXT: mov r0, r657; CHECK-NEXT: bl foo58; CHECK-NEXT: str.w r9, [r5, #4]59; CHECK-NEXT: b .LBB0_160entry:61 %cmp4.i.i = icmp ugt i32 %Level, 3162 %i = add i32 %Level, -3263 %i1 = lshr i32 %i, 564 %i2 = shl nuw i32 %i1, 565 %i3 = sub i32 %i, %i266 %i4 = add nuw nsw i32 %i1, 167 br label %for.body68 69for.body: ; preds = %for.inc, %entry70 %Scan.038 = phi ptr [ %ClauseList, %entry ], [ %i9, %for.inc ]71 %car.i33 = getelementptr inbounds %struct.LIST_HELP, ptr %Scan.038, i32 0, i32 172 %i6 = load ptr, ptr %car.i33, align 473 %. = add i32 %i4, 1074 %.Level = select i1 %cmp4.i.i, i32 %i3, i32 %Level75 %splitfield.i = getelementptr inbounds %struct.CLAUSE_HELP, ptr %i6, i32 0, i32 476 %i7 = load ptr, ptr %splitfield.i, align 477 %arrayidx.i = getelementptr inbounds i32, ptr %i7, i32 %.78 %i8 = load i32, ptr %arrayidx.i, align 479 %shl.i = shl i32 1, %.Level80 %and.i = and i32 %i8, %shl.i81 %cmp4.i = icmp eq i32 %and.i, 082 br i1 %cmp4.i, label %for.inc, label %if.then83 84if.then: ; preds = %for.body85 tail call void @foo(ptr %Search, ptr %i6)86 store ptr null, ptr %car.i33, align 487 br label %for.inc88 89for.inc: ; preds = %if.then, %for.body90 %cdr.i = getelementptr inbounds %struct.LIST_HELP, ptr %Scan.038, i32 0, i32 091 %i9 = load ptr, ptr %cdr.i, align 492 br label %for.body93}94