/minix/external/bsd/llvm/dist/llvm/test/Transforms/InstCombine/ |
H A D | apint-cast.ll | 7 %tmp = zext i17 %a to i37 ; <i37> [#uses=2] 8 %tmp21 = lshr i37 %tmp, 8 ; <i37> [#uses=1] 10 %tmp5 = shl i37 %tmp, 8 ; <i37> [#uses=1] 12 %tmp.upgrd.32 = or i37 %tmp21, %tmp5 ; <i37> [#uses=1] 14 %tmp.upgrd.3 = trunc i37 %tmp.upgrd.32 to i17 ; <i17> [#uses=1]
|
H A D | apint-xor1.ll | 25 define i37 @test4(i37 %x) { 27 %NotX = xor i37 -1, %x 28 %B = xor i37 %x, %NotX 29 ret i37 %B
|
H A D | apint-shift.ll | 187 define i1 @test19(i37 %A) { 188 %B = ashr i37 %A, 2 ; <i37> [#uses=1] 189 %C = icmp eq i37 %B, 0 ; <i1> [#uses=1] 236 define i37 @test25(i37 %tmp.2, i37 %AA) { 237 %x = lshr i37 %AA, 17 ; <i37> [#uses=1] 238 %tmp.3 = lshr i37 %tmp.2, 17 ; <i37> [#uses=1] 239 %tmp.5 = add i37 %tmp.3, %x ; <i37> [#uses=1] 240 %tmp.6 = shl i37 %tmp.5, 17 ; <i37> [#uses=1] 241 ret i37 %tmp.6
|
H A D | apint-and1.ll | 31 define i1 @test4(i37 %x) { 32 %A = and i37 %x, -2147483648 33 %B = icmp ne i37 %A, 0
|
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/PowerPC/ |
H A D | subsumes-pred-regs.ll | 25 br i1 %lnot.i.i16.i23, label %if.end7.i37, label %test.exit27.i34 28 br i1 undef, label %return, label %if.end7.i37 30 if.end7.i37: ; preds = %test.exit27.i34, %if.end.i24 34 if.then9.i39: ; preds = %if.end7.i37 59 …%if.then9.i, %if.end.i, %land.rhs, %lor.rhs.i.i49, %if.then9.i39, %if.end7.i37, %test.exit27.i34, … 60 …%retval.0 = phi i1 [ false, %if.then ], [ false, %test.exit27.i34 ], [ true, %if.end7.i37 ], [ tru…
|
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/X86/ |
H A D | loop-strength-reduce7.ll | 17 br i1 true, label %bb28.i37, label %bb.i4 22 bb28.i37: ; preds = %bb33.i47, %bb5 27 bb29.i38: ; preds = %bb33.i47, %bb28.i37 28 %indvar32.i = phi i32 [ %indvar.next33.i, %bb33.i47 ], [ 0, %bb28.i37 ] ; <i32> [#uses=2] 43 br i1 %phitmp.i46, label %bb28.i37, label %bb29.i38
|
H A D | 2009-09-22-CoalescerBug.ll | 51 br label %bb.i37 56 bb.i37: ; preds = %bb.i37, %bb11.thread 60 br i1 undef, label %bb.i37, label %quantum_addscratch.exit 62 quantum_addscratch.exit: ; preds = %bb.i37
|
H A D | unwindraise.ll | 188 br i1 %tobool6.i.i.i35, label %if.end.i.i.i39, label %if.then.i.i.i37 190 if.then.i.i.i37: ; preds = %land.lhs.true.i.i.i36 207 uw_update_context.exit44: ; preds = %if.then10.i.i.i40, %if.then.i.i.i37 208 %retval.0.i.i.i42 = phi i64 [ %28, %if.then.i.i.i37 ], [ %30, %if.then10.i.i.i40 ]
|
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/Generic/ |
H A D | 2006-02-12-InsertLibcall.ll | 20 br i1 %tmp.324.i, label %else.4.i, label %then.11.i37 22 then.11.i37: ; preds = %endif.0
|
/minix/external/bsd/llvm/dist/llvm/test/Transforms/JumpThreading/ |
H A D | 2010-08-26-and.ll | 41 i32 6, label %land.lhs.true5.i37 52 land.lhs.true5.i37: ; preds = %land.lhs.true.i 57 if.then.i40: ; preds = %land.lhs.true5.i37 60 …4CaseILj7EEERS1_RAT__KcRKS0_.exit: ; preds = %if.then.i40, %land.lhs.true5.i37, %_ZN12StringSwitch… 61 …4CaseILj4EEERS1_RAT__KcRKS0_.exit ], [ %retval.0.i.pre161, %land.lhs.true5.i37 ], [ 2, %if.then.i4… 62 …ingSwitchI5ColorE4CaseILj4EEERS1_RAT__KcRKS0_.exit ], [ 0, %land.lhs.true5.i37 ], [ 1, %if.then.i4…
|
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/ARM/ |
H A D | 2012-05-29-TailDupBug.ll | 88 br i1 undef, label %if.then50, label %if.end.i37 90 if.end.i37: ; preds = %if.end45 93 if.then50: ; preds = %if.end.i37, %if.end45
|
H A D | 2012-01-24-RegSequenceLiveRange.ll | 48 …%shuffle.i37.i.i1037 = shufflevector <1 x i64> %shuffle.i39.i.i1035, <1 x i64> %shuffle.i38.i.i103… 49 %0 = bitcast <2 x i64> %shuffle.i37.i.i1037 to <4 x float>
|
H A D | 2007-04-03-UndefinedSymbol.ll | 61 %tmp121314.i37 = bitcast i8* %ctg23.i36 to i32 (...)*** ; <i32 (...)***> [#uses=1] 62 %tmp15.i38 = load i32 (...)*** %tmp121314.i37 ; <i32 (...)**> [#uses=1]
|
H A D | 2009-06-15-RegScavengerAssert.ll | 307 br i1 undef, label %bb14.i.i.i2163, label %bb10.i.i37.i 309 bb10.i.i37.i: ; preds = %bb9.i.i36.i
|
/minix/external/bsd/llvm/dist/llvm/test/Transforms/SimplifyCFG/ |
H A D | 2006-06-12-InfLoop.ll | 273 br i1 false, label %no_exit.1.i36.preheader, label %loopentry.3.i37 381 br i1 false, label %no_exit.1.i36.preheader, label %loopentry.3.i37 385 br i1 false, label %no_exit.1.i36, label %loopentry.3.i37.loopexit 386 loopentry.3.i37.loopexit: ; preds = %no_exit.1.i36 387 br label %loopentry.3.i37 388 loopentry.3.i37: ; preds = %loopentry.3.i37.loopexit, %runcont.exit, %run.exit 390 loopentry.4.i38.preheader: ; preds = %loopentry.3.i37 410 loopexit.3.i: ; preds = %loopexit.3.i.loopexit, %loopentry.3.i37
|
/minix/external/bsd/llvm/dist/llvm/test/Transforms/CodeGenPrepare/ |
H A D | 2008-11-24-RAUW-Self.ll | 372 br i1 false, label %bb1.i21.mulflt.exit47_crit_edge, label %bb3.i37 377 bb3.i37: ; preds = %bb1.i21 378 br i1 false, label %bb3.i37.mulflt.exit47_crit_edge, label %bb5.i38 380 bb3.i37.mulflt.exit47_crit_edge: ; preds = %bb8.i40, %bb3.i37 383 bb5.i38: ; preds = %bb3.i37 393 br i1 false, label %bb3.i37.mulflt.exit47_crit_edge, label %bb10.i41 401 mulflt.exit47: ; preds = %bb12.i44, %bb3.i37.mulflt.exit47_crit_edge, %bb1.i21.mulflt.exit47_crit_…
|
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
H A D | is_heap.pass.cpp | 85 int i37[] = {0, 1, 0, 1, 1}; in test() local 116 assert(std::is_heap(i37, i37+5) == (std::is_heap_until(i37, i37+5) == i37+5)); in test()
|
H A D | is_heap_until.pass.cpp | 85 int i37[] = {0, 1, 0, 1, 1}; in test() local 116 assert(std::is_heap_until(i37, i37+5) == i37+1); in test()
|
H A D | is_heap_until_comp.pass.cpp | 86 int i37[] = {0, 1, 0, 1, 1}; in test() local 117 assert(std::is_heap_until(i37, i37+5, std::greater<int>()) == i37+5); in test()
|
H A D | is_heap_comp.pass.cpp | 86 int i37[] = {0, 1, 0, 1, 1}; in test() local 117 …assert(std::is_heap(i37, i37+5, std::greater<int>()) == (std::is_heap_until(i37, i37+5, std::great… in test()
|
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
H A D | is_heap.pass.cpp | 85 int i37[] = {0, 1, 0, 1, 1}; in test() local 116 assert(std::is_heap(i37, i37+5) == (std::is_heap_until(i37, i37+5) == i37+5)); in test()
|
H A D | is_heap_until.pass.cpp | 85 int i37[] = {0, 1, 0, 1, 1}; in test() local 116 assert(std::is_heap_until(i37, i37+5) == i37+1); in test()
|
H A D | is_heap_until_comp.pass.cpp | 86 int i37[] = {0, 1, 0, 1, 1}; in test() local 117 assert(std::is_heap_until(i37, i37+5, std::greater<int>()) == i37+5); in test()
|
H A D | is_heap_comp.pass.cpp | 86 int i37[] = {0, 1, 0, 1, 1}; in test() local 117 …assert(std::is_heap(i37, i37+5, std::greater<int>()) == (std::is_heap_until(i37, i37+5, std::great… in test()
|
/minix/external/bsd/llvm/dist/llvm/test/Transforms/LoopVectorize/ |
H A D | if-conversion-edgemasks.ll | 193 br i1 %tobool2.i.i, label %if.end7.i.i39, label %if.then3.i.i37 195 if.then3.i.i37: 202 %p1.addr.1.i.i38 = phi i32 [ %or.i22.i36, %if.then3.i.i37 ], [ %p1.addr.0.i21.i30, %if.end.i.i33 ]
|