| /libcore/luni/src/test/java/libcore/java/io/ |
| OldStringReaderTest.java | 27 StringReader sr; field in class:OldStringReaderTest
30 sr = new StringReader(testString);
32 sr.mark(-1);
40 sr = new StringReader(testString);
42 sr.read(buf, 0, -1);
48 sr.read(buf, -1, 1);
54 sr.read(buf, 1, testString.length());
64 sr.close();
|
| /external/compiler-rt/lib/ |
| udivsi3.c | 30 unsigned sr; local
36 sr = __builtin_clz(d) - __builtin_clz(n);
37 /* 0 <= sr <= n_uword_bits - 1 or sr large */
38 if (sr > n_uword_bits - 1) /* d > r */
40 if (sr == n_uword_bits - 1) /* d == 1 */
42 ++sr;
43 /* 1 <= sr <= n_uword_bits - 1 */
45 q = n << (n_uword_bits - sr);
46 r = n >> sr;
[all...] |
| udivmoddi4.c | 34 unsigned sr; local
102 sr = __builtin_clz(d.s.high) - __builtin_clz(n.s.high);
103 /* 0 <= sr <= n_uword_bits - 2 or sr large */
104 if (sr > n_uword_bits - 2)
110 ++sr;
111 /* 1 <= sr <= n_uword_bits - 1 */
112 /* q.all = n.all << (n_udword_bits - sr); */
114 q.s.high = n.s.low << (n_uword_bits - sr);
115 /* r.all = n.all >> sr; */
[all...] |
| udivmodti4.c | 36 unsigned sr; local
104 sr = __builtin_clzll(d.s.high) - __builtin_clzll(n.s.high);
105 /* 0 <= sr <= n_udword_bits - 2 or sr large */
106 if (sr > n_udword_bits - 2)
112 ++sr;
113 /* 1 <= sr <= n_udword_bits - 1 */
114 /* q.all = n.all << (n_utword_bits - sr); */
116 q.s.high = n.s.low << (n_udword_bits - sr);
117 /* r.all = n.all >> sr; */
[all...] |
| /external/apache-harmony/luni/src/test/api/common/org/apache/harmony/luni/tests/java/io/ |
| StringReaderTest.java | 27 StringReader sr; field in class:StringReaderTest
43 sr = new StringReader(testString);
44 sr.close();
46 sr.read(buf, 0, 2);
58 sr = new StringReader(testString);
59 sr.skip(5);
60 sr.mark(0);
61 sr.skip(5);
62 sr.reset();
64 sr.read(buf, 0, 2)
155 final StringReader sr = new StringReader(anything); local
[all...] |
| /external/libgsm/src/ |
| gsm_decode.c | 21 uword sr = 0; local
26 sr = *c++;
27 LARc[0] = sr & 0x3f; sr >>= 6;
28 sr |= (uword)*c++ << 2;
29 LARc[1] = sr & 0x3f; sr >>= 6;
30 sr |= (uword)*c++ << 4;
31 LARc[2] = sr & 0x1f; sr >>= 5
[all...] |
| gsm_encode.c | 112 uword sr; local
114 sr = 0;
115 sr = sr >> 6 | LARc[0] << 10;
116 sr = sr >> 6 | LARc[1] << 10;
117 *c++ = sr >> 4;
118 sr = sr >> 5 | LARc[2] << 11;
119 *c++ = sr >> 7
228 uword sr; local
[all...] |
| gsm_explode.c | 25 uword sr = 0; local
29 sr = *c++;
30 LARc[0] = sr & 0x3f; sr >>= 6;
31 sr |= (uword)*c++ << 2;
32 LARc[1] = sr & 0x3f; sr >>= 6;
33 sr |= (uword)*c++ << 4;
34 LARc[2] = sr & 0x1f; sr >>= 5
[all...] |
| gsm_implode.c | 118 uword sr = 0; local
120 sr = sr >> 6 | LARc[0] << 10;
121 sr = sr >> 6 | LARc[1] << 10;
122 *c++ = sr >> 4;
123 sr = sr >> 5 | LARc[2] << 11;
124 *c++ = sr >> 7;
125 sr = sr >> 5 | LARc[3] << 11
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.intersection/ |
| set_intersection.pass.cpp | 36 const int sr = sizeof(ir)/sizeof(ir[0]); local
39 assert(base(ce) - ic == sr); local
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 assert(base(ce) - ic == sr); local
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_intersection_comp.pass.cpp | 38 const int sr = sizeof(ir)/sizeof(ir[0]); local
41 assert(base(ce) - ic == sr); local
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 assert(base(ce) - ic == sr); local
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.symmetric.difference/ |
| set_symmetric_difference.pass.cpp | 37 const int sr = sizeof(ir)/sizeof(ir[0]); local
40 assert(base(ce) - ic == sr); local
41 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
44 assert(base(ce) - ic == sr); local
45 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_symmetric_difference_comp.pass.cpp | 39 const int sr = sizeof(ir)/sizeof(ir[0]); local
43 assert(base(ce) - ic == sr); local
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
48 assert(base(ce) - ic == sr); local
49 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.union/ |
| set_union.pass.cpp | 36 const int sr = sizeof(ir)/sizeof(ir[0]); local
39 assert(base(ce) - ic == sr); local
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
43 assert(base(ce) - ic == sr); local
44 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| set_union_comp.pass.cpp | 38 const int sr = sizeof(ir)/sizeof(ir[0]); local
41 assert(base(ce) - ic == sr); local
42 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
45 assert(base(ce) - ic == sr); local
46 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
| /ndk/sources/cxx-stl/llvm-libc++/test/re/re.alg/re.alg.match/ |
| awk.pass.cpp | 673 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
676 std::regex regex(FI(r), FI(r+sr), std::regex_constants::awk);
1354 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| basic.pass.cpp | 674 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
677 std::regex regex(FI(r), FI(r+sr), std::regex_constants::basic);
1342 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| ecma.pass.cpp | 632 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
635 std::regex regex(FI(r), FI(r+sr));
1285 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| extended.pass.cpp | 672 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
675 std::regex regex(FI(r), FI(r+sr), std::regex_constants::extended);
1338 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| /ndk/sources/cxx-stl/llvm-libc++/test/re/re.alg/re.alg.search/ |
| awk.pass.cpp | 762 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
765 std::regex regex(FI(r), FI(r+sr), std::regex_constants::awk);
1533 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| basic.pass.cpp | 764 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
767 std::regex regex(FI(r), FI(r+sr), std::regex_constants::basic);
1522 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| ecma.pass.cpp | 740 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
743 std::regex regex(FI(r), FI(r+sr));
1519 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| extended.pass.cpp | 762 std::ptrdiff_t sr = std::char_traits<char>::length(r); local
765 std::regex regex(FI(r), FI(r+sr), std::regex_constants::extended);
1518 std::ptrdiff_t sr = std::char_traits<wchar_t>::length(r); local
[all...] |
| /external/eigen/test/ |
| corners.cpp | 33 Index sr = internal::random<Index>(1,rows) - 1; local
34 Index nr = internal::random<Index>(1,rows-sr);
39 COMPARE_CORNER(middleRows(sr,nr), block(sr,0,nr,cols));
56 sr = SRows, enumerator in enum:__anon7765
66 VERIFY_IS_EQUAL((matrix.template middleRows<r>(sr)), (matrix.template block<r,cols>(sr,0)));
78 VERIFY_IS_EQUAL((const_matrix.template middleRows<r>(sr)), (const_matrix.template block<r,cols>(sr,0)));
|
| /ndk/sources/cxx-stl/llvm-libc++/test/algorithms/alg.sorting/alg.set.operations/set.difference/ |
| set_difference.pass.cpp | 36 const int sr = sizeof(ir)/sizeof(ir[0]); local
39 assert(base(ce) - ic == sr); local
40 assert(std::lexicographical_compare(ic, base(ce), ir, ir+sr) == 0);
|
