Home
last modified time | relevance | path

Searched refs:i221 (Results 1 – 16 of 16) sorted by relevance

/minix/external/bsd/llvm/dist/llvm/test/CodeGen/X86/
H A Dinsert-positions.ll7 br label %while.body.i.i221.i
9 while.body.i.i221.i: ; preds = %while.cond.backedge.i.i.i, %if.end90.i…
12 while.cond.backedge.i.i.i: ; preds = %for.end.i.i.i, %while.body.i.i221.i
13 br label %while.body.i.i221.i
15 if.then.i.i224.i: ; preds = %while.body.i.i221.i
H A Dragreedy-bug.ll89 %tobool1.sink.i.i221 = icmp eq i32 %tobool1.sink.i.in.i220, 0
90 br i1 %tobool1.sink.i.i221, label %while.end, label %while.body, !prof !990
H A Dscev-interchange.ll191 br i1 undef, label %invcont84.i, label %bb.i.i.i221.i
193 bb.i.i.i221.i: ; preds = %bb83.i
/minix/external/bsd/libc++/dist/libcxx/test/std/algorithms/alg.sorting/alg.heap.operations/is.heap/
H A Dis_heap.pass.cpp363 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
490 assert(std::is_heap(i221, i221+7) == (std::is_heap_until(i221, i221+7) == i221+7)); in test()
H A Dis_heap_until.pass.cpp363 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
490 assert(std::is_heap_until(i221, i221+7) == i221+6); in test()
H A Dis_heap_until_comp.pass.cpp364 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
491 assert(std::is_heap_until(i221, i221+7, std::greater<int>()) == i221+2); in test()
H A Dis_heap_comp.pass.cpp364 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
491 …assert(std::is_heap(i221, i221+7, std::greater<int>()) == (std::is_heap_until(i221, i221+7, std::g… in test()
/minix/external/bsd/libc++/dist/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/
H A Dis_heap.pass.cpp363 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
490 assert(std::is_heap(i221, i221+7) == (std::is_heap_until(i221, i221+7) == i221+7)); in test()
H A Dis_heap_until.pass.cpp363 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
490 assert(std::is_heap_until(i221, i221+7) == i221+6); in test()
H A Dis_heap_until_comp.pass.cpp364 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
491 assert(std::is_heap_until(i221, i221+7, std::greater<int>()) == i221+2); in test()
H A Dis_heap_comp.pass.cpp364 int i221[] = {1, 1, 0, 0, 1, 0, 1}; in test() local
491 …assert(std::is_heap(i221, i221+7, std::greater<int>()) == (std::is_heap_until(i221, i221+7, std::g… in test()
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/Generic/
H A DAPIntLoadStore.ll442 @i221_l = external global i221 ; <i221*> [#uses=1]
443 @i221_s = external global i221 ; <i221*> [#uses=1]
1836 %tmp = load i221* @i221_l ; <i221> [#uses=1]
1837 store i221 %tmp, i221* @i221_s
H A DAPIntParam.ll222 @i221_s = external global i221 ; <i221*> [#uses=1]
1359 define void @i221_ls(i221 %x) nounwind {
1360 store i221 %x, i221* @i221_s
H A DAPIntSextParam.ll222 @i221_s = external global i221 ; <i221*> [#uses=1]
1359 define void @i221_ls(i221 signext %x) nounwind {
1360 store i221 %x, i221* @i221_s
H A DAPIntZextParam.ll222 @i221_s = external global i221 ; <i221*> [#uses=1]
1359 define void @i221_ls(i221 zeroext %x) nounwind {
1360 store i221 %x, i221* @i221_s
/minix/external/bsd/llvm/dist/llvm/test/CodeGen/AArch64/
H A Dragreedy-csr.ll94 %tobool1.sink.i.i221 = icmp eq i32 %tobool1.sink.i.in.i220, 0
95 br i1 %tobool1.sink.i.i221, label %while.end, label %while.body, !prof !990