| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 202 @i201_s = external global i201 ; <i201*> [#uses=1]
1259 define void @i201_ls(i201 %x) nounwind {
1260 store i201 %x, i201* @i201_s
[all...] |
| APIntSextParam.ll | 202 @i201_s = external global i201 ; <i201*> [#uses=1]
1259 define void @i201_ls(i201 signext %x) nounwind {
1260 store i201 %x, i201* @i201_s
[all...] |
| APIntZextParam.ll | 202 @i201_s = external global i201 ; <i201*> [#uses=1]
1259 define void @i201_ls(i201 zeroext %x) nounwind {
1260 store i201 %x, i201* @i201_s
[all...] |
| APIntLoadStore.ll | 402 @i201_l = external global i201 ; <i201*> [#uses=1]
403 @i201_s = external global i201 ; <i201*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 343 int i201[] = {1, 0, 1, 0, 0, 0, 1}; local
470 assert(std::is_heap(i201, i201+7) == (std::is_heap_until(i201, i201+7) == i201+7));
|
| is_heap_until.pass.cpp | 343 int i201[] = {1, 0, 1, 0, 0, 0, 1}; local
470 assert(std::is_heap_until(i201, i201+7) == i201+7);
|
| is_heap_until_comp.pass.cpp | 344 int i201[] = {1, 0, 1, 0, 0, 0, 1}; local
471 assert(std::is_heap_until(i201, i201+7, std::greater<int>()) == i201+1);
|
| is_heap_comp.pass.cpp | 344 int i201[] = {1, 0, 1, 0, 0, 0, 1}; local
[all...] |
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | 547 br i1 false, label %bb41.i201, label %bb42.i202
549 bb41.i201: ; preds = %bb40.i200
552 bb42.i202: ; preds = %bb41.i201, %bb40.i200
[all...] |
