/external/clang/test/CodeGen/ |
H A D | unsigned-promotion.c | 9 unsigned short si, sj, sk; variable 18 // CHECKS: load i16, i16* @sj 25 // CHECKU: [[T1:%.*]] = load i16, i16* @sj 33 si = sj + sk; 40 // CHECKS: load i16, i16* @sj 47 // CHECKU: [[T1:%.*]] = load i16, i16* @sj 55 si = sj - sk; 62 // CHECKS: load i16, i16* @sj 69 // CHECKU: [[T1:%.*]] = load i16, i16* @sj 76 si = sj * s [all...] |
/external/libcxx/test/std/algorithms/alg.nonmodifying/alg.search/ |
H A D | search.pass.cpp | 55 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 58 assert(std::search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk)) == Iter1(ij+6));
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore/ |
H A D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); 119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.boyer_moore_horspool/ |
H A D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6)); 119 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 122 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/ |
H A D | default.pass.cpp | 80 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 83 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
|
/external/libcxx/test/std/experimental/func/func.searchers/func.searchers.default/func.searchers.default.creation/ |
H A D | make_default_searcher.pass.cpp | 65 const unsigned sj = sizeof(ij)/sizeof(ij[0]); local 68 do_search(Iter1(ij), Iter1(ij+sj), Iter2(ik), Iter2(ik+sk), Iter1(ij+6));
|
/external/dhcpcd-6.8.2/compat/ |
H A D | arc4random.c | 77 uint8_t si, sj; local 82 sj = as->s[as->j]; 83 as->s[as->i] = sj; 85 return (as->s[(si + sj) & 0xff]);
|
/external/libevent/ |
H A D | arc4random.c | 427 unsigned char si, sj; local 432 sj = rs.s[rs.j]; 433 rs.s[rs.i] = sj; 435 return (rs.s[(si + sj) & 0xff]);
|
/external/libvpx/libvpx/examples/ |
H A D | vp9cx_set_ref.c | 120 const int sj = mmin(j + bsize, img1->d_w) - j; local 122 for (l = 0; match && l < sj; ++l) { 146 const int sj = mmin(j + bsizex, c_w - j); local 148 for (l = 0; match && l < sj; ++l) { 171 const int sj = mmin(j + bsizex, c_w - j); local 173 for (l = 0; match && l < sj; ++l) {
|
/external/opencv/ml/src/ |
H A D | mlsvm.cpp | 1424 int sj = class_ranges[j], cj = class_ranges[j+1] - sj; local 1436 temp_samples[ci + k] = samples[sj + k]; 1474 sv_tab[sj + k] = 1; 1475 df->sv_index[k1] = sj + k;
|
/external/toybox/toys/pending/ |
H A D | fdisk.c | 1221 int i, j, oj, ojj, sj, sjj; local 1271 sj = swap_le32toh(pj->start4); 1275 if (oj+sj > ojj+sjj) { 1280 set_levalue(pjj->start4, oj+sj-ojj);
|
/external/libvpx/libvpx/ |
H A D | vpxenc.c | 611 const int sj = mmin(j + bsize, img1->d_w) - j; local 613 for (l = 0; match && l < sj; ++l) { 637 const int sj = mmin(j + bsizex, c_w - j); local 639 for (l = 0; match && l < sj; ++l) { 663 const int sj = mmin(j + bsizex, c_w - j); local 665 for (l = 0; match && l < sj; ++l) { 699 const int sj = mmin(j + bsize, img1->d_w) - j; local 701 for (l = 0; match && l < sj; ++l) { 725 const int sj = mmin(j + bsizex, c_w - j); local 727 for (l = 0; match && l < sj; 750 const int sj = mmin(j + bsizex, c_w - j); local [all...] |
/external/eclipse-basebuilder/basebuilder-3.6.2/org.eclipse.releng.basebuilder/plugins/ |
H A D | com.ibm.icu_4.2.1.v20100412.jar | META-INF/MANIFEST.MF META-INF/ECLIPSEF.SF META-INF/ECLIPSEF.RSA META ... |