| /external/llvm/test/CodeGen/ARM/ |
| 2009-06-15-RegScavengerAssert.ll | 238 br i1 undef, label %bb1.i207.i, label %ana_AnalyzeSortStructure.exit.i
240 bb1.i207.i: ; preds = %bb.i206.i
243 bb.i1688: ; preds = %bb1.i207.i
246 bb25.i1801.thread: ; preds = %bb1.i207.i
250 br i1 undef, label %bb7.i207, label %bb.i1806
261 bb7.i207: ; preds = %ana_AnalyzeSortStructure.exit.i
264 bb8.i: ; preds = %bb7.i207
267 bb9.i: ; preds = %bb7.i207
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 208 @i207_s = external global i207 ; <i207*> [#uses=1]
1289 define void @i207_ls(i207 %x) nounwind {
1290 store i207 %x, i207* @i207_s
[all...] |
| APIntSextParam.ll | 208 @i207_s = external global i207 ; <i207*> [#uses=1]
1289 define void @i207_ls(i207 signext %x) nounwind {
1290 store i207 %x, i207* @i207_s
[all...] |
| APIntZextParam.ll | 208 @i207_s = external global i207 ; <i207*> [#uses=1]
1289 define void @i207_ls(i207 zeroext %x) nounwind {
1290 store i207 %x, i207* @i207_s
[all...] |
| APIntLoadStore.ll | 414 @i207_l = external global i207 ; <i207*> [#uses=1]
415 @i207_s = external global i207 ; <i207*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 349 int i207[] = {1, 0, 1, 0, 1, 1, 1}; local
476 assert(std::is_heap(i207, i207+7) == (std::is_heap_until(i207, i207+7) == i207+7));
|
| is_heap_until.pass.cpp | 349 int i207[] = {1, 0, 1, 0, 1, 1, 1}; local
476 assert(std::is_heap_until(i207, i207+7) == i207+4);
|
| is_heap_until_comp.pass.cpp | 350 int i207[] = {1, 0, 1, 0, 1, 1, 1}; local
477 assert(std::is_heap_until(i207, i207+7, std::greater<int>()) == i207+1);
|
| is_heap_comp.pass.cpp | 350 int i207[] = {1, 0, 1, 0, 1, 1, 1}; local
[all...] |
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 592 br i1 false, label %bb7.i.i208, label %bb6.i.i207
594 bb6.i.i207: ; preds = %bb3.i11.i
762 READ_LITERAL.i.outer.backedge: ; preds = %bb5.i.i.i218, %bb70.i.i.i.i, %bb6.i.i207
[all...] |
