| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 204 @i203_s = external global i203 ; <i203*> [#uses=1]
1269 define void @i203_ls(i203 %x) nounwind {
1270 store i203 %x, i203* @i203_s
[all...] |
| APIntSextParam.ll | 204 @i203_s = external global i203 ; <i203*> [#uses=1]
1269 define void @i203_ls(i203 signext %x) nounwind {
1270 store i203 %x, i203* @i203_s
[all...] |
| APIntZextParam.ll | 204 @i203_s = external global i203 ; <i203*> [#uses=1]
1269 define void @i203_ls(i203 zeroext %x) nounwind {
1270 store i203 %x, i203* @i203_s
[all...] |
| APIntLoadStore.ll | 406 @i203_l = external global i203 ; <i203*> [#uses=1]
407 @i203_s = external global i203 ; <i203*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 345 int i203[] = {1, 0, 1, 0, 0, 1, 1}; local
472 assert(std::is_heap(i203, i203+7) == (std::is_heap_until(i203, i203+7) == i203+7));
|
| is_heap_until.pass.cpp | 345 int i203[] = {1, 0, 1, 0, 0, 1, 1}; local
472 assert(std::is_heap_until(i203, i203+7) == i203+7);
|
| is_heap_until_comp.pass.cpp | 346 int i203[] = {1, 0, 1, 0, 0, 1, 1}; local
473 assert(std::is_heap_until(i203, i203+7, std::greater<int>()) == i203+1);
|
| is_heap_comp.pass.cpp | 346 int i203[] = {1, 0, 1, 0, 0, 1, 1}; local
[all...] |
| /external/llvm/test/CodeGen/ARM/ |
| vmul.ll | 571 %sub.i203 = sub <8 x i16> <i16 80, i16 80, i16 80, i16 80, i16 80, i16 80, i16 80, i16 80>, %vshr_n134
573 %add.i198 = add <8 x i16> %add.i200, %sub.i203
|
