| /external/llvm/test/Transforms/GVN/ |
| 2011-04-27-phioperands.ll | 83 br i1 undef, label %"<bb 3>.i157.i", label %"<bb 5>"
85 "<bb 3>.i157.i":
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 158 @i157_s = external global i157 ; <i157*> [#uses=1]
1039 define void @i157_ls(i157 %x) nounwind {
1040 store i157 %x, i157* @i157_s
[all...] |
| APIntSextParam.ll | 158 @i157_s = external global i157 ; <i157*> [#uses=1]
1039 define void @i157_ls(i157 signext %x) nounwind {
1040 store i157 %x, i157* @i157_s
[all...] |
| APIntZextParam.ll | 158 @i157_s = external global i157 ; <i157*> [#uses=1]
1039 define void @i157_ls(i157 zeroext %x) nounwind {
1040 store i157 %x, i157* @i157_s
[all...] |
| APIntLoadStore.ll | 314 @i157_l = external global i157 ; <i157*> [#uses=1]
315 @i157_s = external global i157 ; <i157*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 299 int i157[] = {0, 1, 0, 0, 1, 0, 1}; local
426 assert(std::is_heap(i157, i157+7) == (std::is_heap_until(i157, i157+7) == i157+7));
|
| is_heap_until.pass.cpp | 299 int i157[] = {0, 1, 0, 0, 1, 0, 1}; local
426 assert(std::is_heap_until(i157, i157+7) == i157+1);
|
| is_heap_until_comp.pass.cpp | 300 int i157[] = {0, 1, 0, 0, 1, 0, 1}; local
427 assert(std::is_heap_until(i157, i157+7, std::greater<int>()) == i157+3);
|
| is_heap_comp.pass.cpp | 300 int i157[] = {0, 1, 0, 0, 1, 0, 1}; local
427 assert(std::is_heap(i157, i157+7, std::greater<int>()) == (std::is_heap_until(i157, i157+7, std::greater<int>()) == i157+7));
[all...] |
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 421 br i1 false, label %bb8.i157, label %bb129
423 bb8.i157: ; preds = %bb7.i156
426 bb9.i158: ; preds = %bb8.i157
771 bb129: ; preds = %parse.exit, %bb22.i173, %bb18.i168, %bb16.i166, %bb12.i161, %bb10.i159, %bb9.i158, %bb8.i157, %bb7.i156, %bb5.i154, %bb4.i153
[all...] |
