| /external/llvm/test/Transforms/InstCombine/ |
| apint-and-or-and.ll | 39 define i231 @or_test1(i231 %X, i231 %Y) {
40 %A = and i231 %X, 1
41 %B = or i231 %A, 1 ;; This cannot include any bits from X!
42 ret i231 %B
|
| /external/llvm/test/CodeGen/Generic/ |
| APIntParam.ll | 232 @i231_s = external global i231 ; <i231*> [#uses=1]
1409 define void @i231_ls(i231 %x) nounwind {
1410 store i231 %x, i231* @i231_s
[all...] |
| APIntSextParam.ll | 232 @i231_s = external global i231 ; <i231*> [#uses=1]
[all...] |
| APIntZextParam.ll | 232 @i231_s = external global i231 ; <i231*> [#uses=1]
[all...] |
| APIntLoadStore.ll | 462 @i231_l = external global i231 ; <i231*> [#uses=1]
463 @i231_s = external global i231 ; <i231*> [#uses=1]
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/libcxx/test/algorithms/alg.sorting/alg.heap.operations/is.heap/ |
| is_heap.pass.cpp | 373 int i231[] = {1, 1, 0, 1, 1, 1, 1}; local
500 assert(std::is_heap(i231, i231+7) == (std::is_heap_until(i231, i231+7) == i231+7));
|
| is_heap_until.pass.cpp | 373 int i231[] = {1, 1, 0, 1, 1, 1, 1}; local
500 assert(std::is_heap_until(i231, i231+7) == i231+5);
|
| is_heap_until_comp.pass.cpp | 374 int i231[] = {1, 1, 0, 1, 1, 1, 1}; local
501 assert(std::is_heap_until(i231, i231+7, std::greater<int>()) == i231+2);
|
| is_heap_comp.pass.cpp | 374 int i231[] = {1, 1, 0, 1, 1, 1, 1}; local
[all...] |
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 186 ... i226, i227, i228, i229, i230, i231, i232, i233, i234,
221 ... i226, i227, i228, i229, i230, i231, i232, i233, i234,
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| test_syntax.py | 186 ... i226, i227, i228, i229, i230, i231, i232, i233, i234,
221 ... i226, i227, i228, i229, i230, i231, i232, i233, i234,
|
| /art/test/083-compiler-regressions/src/ |
| Main.java | 712 int i231 = 231; local
[all...] |
