| /external/llvm/test/Transforms/SLPVectorizer/X86/ |
| crash_smallpt.ll | 46 %add4.i246.us = fadd double %mul2.i256.us, 5.200000e+01
50 store double %add4.i246.us, double* %agg.tmp99208.sroa.1.8.idx388, align 8
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 247 @i246_s = external global i246 ; <i246*> [#uses=1]
[all...] |
| APIntSextParam.ll | 247 @i246_s = external global i246 ; <i246*> [#uses=1]
[all...] |
| APIntZextParam.ll | 247 @i246_s = external global i246 ; <i246*> [#uses=1]
[all...] |
| APIntLoadStore.ll | 492 @i246_l = external global i246 ; <i246*> [#uses=1]
493 @i246_s = external global i246 ; <i246*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 388 int i246[] = {1, 1, 1, 1, 1, 1, 0}; local
515 assert(std::is_heap(i246, i246+7) == (std::is_heap_until(i246, i246+7) == i246+7));
|
| is_heap_until.pass.cpp | 388 int i246[] = {1, 1, 1, 1, 1, 1, 0}; local
515 assert(std::is_heap_until(i246, i246+7) == i246+7);
|
| is_heap_until_comp.pass.cpp | 389 int i246[] = {1, 1, 1, 1, 1, 1, 0}; local
516 assert(std::is_heap_until(i246, i246+7, std::greater<int>()) == i246+6);
|
| is_heap_comp.pass.cpp | 389 int i246[] = {1, 1, 1, 1, 1, 1, 0}; local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 188 ... i244, i245, i246, i247, i248, i249, i250, i251, i252,
223 ... (x for x in i244), i245, i246, i247, i248, i249, i250, i251,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 188 ... i244, i245, i246, i247, i248, i249, i250, i251, i252,
223 ... (x for x in i244), i245, i246, i247, i248, i249, i250, i251,
|
| /external/llvm/test/CodeGen/ARM/ |
| vmul.ll | 556 %shuffle.i246 = shufflevector <2 x i64> undef, <2 x i64> undef, <1 x i32> zeroinitializer
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 742 int i246 = 246; local
[all...] |
