| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 132 @i131_s = external global i131 ; <i131*> [#uses=1]
909 define void @i131_ls(i131 %x) nounwind {
910 store i131 %x, i131* @i131_s
[all...] |
| APIntSextParam.ll | 132 @i131_s = external global i131 ; <i131*> [#uses=1]
909 define void @i131_ls(i131 signext %x) nounwind {
910 store i131 %x, i131* @i131_s
[all...] |
| APIntZextParam.ll | 132 @i131_s = external global i131 ; <i131*> [#uses=1]
909 define void @i131_ls(i131 zeroext %x) nounwind {
910 store i131 %x, i131* @i131_s
[all...] |
| APIntLoadStore.ll | 262 @i131_l = external global i131 ; <i131*> [#uses=1]
263 @i131_s = external global i131 ; <i131*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 273 int i131[] = {0, 0, 0, 1, 0, 1, 1}; local
400 assert(std::is_heap(i131, i131+7) == (std::is_heap_until(i131, i131+7) == i131+7));
|
| is_heap_until.pass.cpp | 273 int i131[] = {0, 0, 0, 1, 0, 1, 1}; local
400 assert(std::is_heap_until(i131, i131+7) == i131+3);
|
| is_heap_until_comp.pass.cpp | 274 int i131[] = {0, 0, 0, 1, 0, 1, 1}; local
401 assert(std::is_heap_until(i131, i131+7, std::greater<int>()) == i131+7);
|
| is_heap_comp.pass.cpp | 274 int i131[] = {0, 0, 0, 1, 0, 1, 1}; local
401 assert(std::is_heap(i131, i131+7, std::greater<int>()) == (std::is_heap_until(i131, i131+7, std::greater<int>()) == i131+7));
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 175 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
210 ... i127, i128, i129, i130, i131, i132, i133, i134, i135,
|
| /external/llvm/test/Transforms/ArgumentPromotion/ |
| pr3085.ll | [all...] |
| /art/test/083-compiler-regressions/src/ |
| Main.java | 512 int i131 = 131; local
[all...] |
