/external/clang/test/CodeGen/ |
D | unsigned-promotion.c | 9 unsigned short si, sj, sk; variable 33 si = sj + sk; in testshortadd() 55 si = sj - sk; in testshortsub() 76 si = sj * sk; in testshortmul()
|
/external/llvm-project/clang/test/CodeGen/ |
D | unsigned-promotion.c | 9 unsigned short si, sj, sk; variable 29 si = sj * sk; in testshortmul()
|
/external/llvm/test/CodeGen/X86/ |
D | late-address-taken.ll | 52 br i1 %b, label %early_out, label %sj 55 sj: 64 ; CHECK: # %sj 68 ; CHECK-NEXT: # %sj
|
/external/llvm-project/llvm/test/CodeGen/X86/ |
D | late-address-taken.ll | 58 br i1 %b, label %early_out, label %sj 61 sj: 70 ; CHECK: # %sj 74 ; CHECK-NEXT: # %sj
|
/external/icu/icu4c/source/data/rbnf/ |
D | is.txt | 27 "7: sj\u00F3;", 45 "70: sj\u00F6t\u00EDu[ og >>];", 73 "70: sj\u00F6t\u00EDu[ og >>];", 101 "70: sj\u00F6t\u00EDu[ og >>];",
|
/external/llvm-project/llvm/test/CodeGen/Mips/Fast-ISel/ |
D | div1.ll | 6 @sj = global i32 200000, align 4 21 ; CHECK-DAG: lw $[[J_ADDR:[0-9]+]], %got(sj)($[[GOT]]) 28 %1 = load i32, i32* @sj, align 4
|
D | rem1.ll | 6 @sj = global i32 200, align 4 21 ; CHECK-DAG: lw $[[J_ADDR:[0-9]+]], %got(sj)($[[GOT]]) 28 %1 = load i32, i32* @sj, align 4
|
/external/llvm/test/CodeGen/Mips/Fast-ISel/ |
D | div1.ll | 6 @sj = global i32 200000, align 4 21 ; CHECK-DAG: lw $[[J_ADDR:[0-9]+]], %got(sj)($[[GOT]]) 28 %1 = load i32, i32* @sj, align 4
|
D | rem1.ll | 6 @sj = global i32 200, align 4 21 ; CHECK-DAG: lw $[[J_ADDR:[0-9]+]], %got(sj)($[[GOT]]) 28 %1 = load i32, i32* @sj, align 4
|
/external/libvpx/libvpx/ |
D | tools_common.c | 613 const int sj = mmin(j + bsize, img1->d_w) - j; in find_mismatch_high() local 615 for (l = 0; match && l < sj; ++l) { in find_mismatch_high() 639 const int sj = mmin(j + bsizex, c_w - j); in find_mismatch_high() local 641 for (l = 0; match && l < sj; ++l) { in find_mismatch_high() 665 const int sj = mmin(j + bsizex, c_w - j); in find_mismatch_high() local 667 for (l = 0; match && l < sj; ++l) { in find_mismatch_high() 700 const int sj = mmin(j + bsize, img1->d_w) - j; in find_mismatch() local 702 for (l = 0; match && l < sj; ++l) { in find_mismatch() 726 const int sj = mmin(j + bsizex, c_w - j); in find_mismatch() local 728 for (l = 0; match && l < sj; ++l) { in find_mismatch() [all …]
|
/external/libevent/ |
D | arc4random.c | 418 unsigned char si, sj; in arc4_getbyte() local 423 sj = rs.s[rs.j]; in arc4_getbyte() 424 rs.s[rs.i] = sj; in arc4_getbyte() 426 return (rs.s[(si + sj) & 0xff]); in arc4_getbyte()
|
/external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.bmh/ |
D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/libcxx/test/std/utilities/function.objects/func.search/func.search.bm/ |
D | default.pass.cpp | 81 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 84 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 120 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 123 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test() 119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test2() local 122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test2()
|
/external/javaparser/javaparser-symbol-solver-core/src/main/java/com/github/javaparser/symbolsolver/resolution/typeinference/ |
D | BoundSet.java | 80 SameAsBound sj = (SameAsBound)bj; in findPairSameAs() local 81 … Pair<SameAsBound, SameAsBound> pair = new Pair<SameAsBound, SameAsBound>(si, sj); in findPairSameAs() 109 SameAsBound sj = (SameAsBound)bj; in forEachPairSameAs() local 110 currentValue = processor.process(si, sj, currentValue); in forEachPairSameAs() 127 SubtypeOfBound sj = (SubtypeOfBound)bj; in forEachPairSameAndSubtype() local 128 currentValue = processor.process(si, sj, currentValue); in forEachPairSameAndSubtype() 145 SubtypeOfBound sj = (SubtypeOfBound)bj; in forEachPairSubtypeAndSubtype() local 146 currentValue = processor.process(si, sj, currentValue); in forEachPairSubtypeAndSubtype()
|
/external/llvm-project/libcxx/test/std/utilities/function.objects/func.search/func.search.default/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
D | make_default_searcher.pass.cpp | 65 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
/external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
D | make_default_searcher.pass.cpp | 65 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
/external/llvm-project/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); in test() local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); in test()
|