Home
last modified time | relevance | path

Searched refs:r (Results 1 – 25 of 10130) sorted by relevance

12345678910>>...406

/external/curl/tests/data/
Dtest100517 …r\n250-AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n250-AAAAAAAAAAAAAA…
Dtest106218 …r\n250-AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n250-AAAAAAAAAAAAAA…
Dtest100618 …r\n250-AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n250-AAAAAAAAAAAAAA…
/external/skia/tests/
DSkSLErrorTest.cpp12 static void test_failure(skiatest::Reporter* r, const char* src, const char* error) { in test_failure() argument
27 REPORTER_ASSERT(r, compiler.errorText() == skError); in test_failure()
30 static void test_success(skiatest::Reporter* r, const char* src) { in test_success() argument
37 REPORTER_ASSERT(r, program); in test_success()
40 DEF_TEST(SkSLUndefinedSymbol, r) { in DEF_TEST() argument
41 test_failure(r, in DEF_TEST()
46 DEF_TEST(SkSLUndefinedFunction, r) { in DEF_TEST() argument
47 test_failure(r, in DEF_TEST()
52 DEF_TEST(SkSLGenericArgumentMismatch, r) { in DEF_TEST() argument
53 test_failure(r, in DEF_TEST()
[all …]
DSkSLGLSLTest.cpp19 static void test(skiatest::Reporter* r, const char* src, const SkSL::Program::Settings& settings, in test() argument
29 REPORTER_ASSERT(r, program); in test()
31 REPORTER_ASSERT(r, compiler.toGLSL(*program, &output)); in test()
38 REPORTER_ASSERT(r, output == skExpected); in test()
42 static void test(skiatest::Reporter* r, const char* src, const GrShaderCaps& caps, in test() argument
47 test(r, src, settings, expected, &inputs, kind); in test()
50 DEF_TEST(SkSLHelloWorld, r) { in DEF_TEST() argument
51 test(r, in DEF_TEST()
61 DEF_TEST(SkSLControl, r) { in DEF_TEST() argument
62 test(r, in DEF_TEST()
[all …]
DSkNxTest.cpp14 static void test_Nf(skiatest::Reporter* r) { in test_Nf() argument
23 REPORTER_ASSERT(r, ok); in test_Nf()
27 REPORTER_ASSERT(r, ok); in test_Nf()
64 REPORTER_ASSERT(r, (a == b).allTrue()); in test_Nf()
65 REPORTER_ASSERT(r, (a+b == a*b-b).anyTrue()); in test_Nf()
66 REPORTER_ASSERT(r, !(a+b == a*b-b).allTrue()); in test_Nf()
67 REPORTER_ASSERT(r, !(a+b == a*b).anyTrue()); in test_Nf()
68 REPORTER_ASSERT(r, !(a != b).anyTrue()); in test_Nf()
69 REPORTER_ASSERT(r, (a < fours).anyTrue()); in test_Nf()
70 REPORTER_ASSERT(r, (a <= fours).anyTrue()); in test_Nf()
[all …]
/external/skqp/tests/
DSkSLErrorTest.cpp12 static void test_failure(skiatest::Reporter* r, const char* src, const char* error) { in test_failure() argument
27 REPORTER_ASSERT(r, compiler.errorText() == skError); in test_failure()
30 static void test_success(skiatest::Reporter* r, const char* src) { in test_success() argument
37 REPORTER_ASSERT(r, program); in test_success()
40 DEF_TEST(SkSLUndefinedSymbol, r) { in DEF_TEST() argument
41 test_failure(r, in DEF_TEST()
46 DEF_TEST(SkSLUndefinedFunction, r) { in DEF_TEST() argument
47 test_failure(r, in DEF_TEST()
52 DEF_TEST(SkSLGenericArgumentMismatch, r) { in DEF_TEST() argument
53 test_failure(r, in DEF_TEST()
[all …]
DSkNxTest.cpp14 static void test_Nf(skiatest::Reporter* r) { in test_Nf() argument
23 REPORTER_ASSERT(r, ok); in test_Nf()
27 REPORTER_ASSERT(r, ok); in test_Nf()
64 REPORTER_ASSERT(r, (a == b).allTrue()); in test_Nf()
65 REPORTER_ASSERT(r, (a+b == a*b-b).anyTrue()); in test_Nf()
66 REPORTER_ASSERT(r, !(a+b == a*b-b).allTrue()); in test_Nf()
67 REPORTER_ASSERT(r, !(a+b == a*b).anyTrue()); in test_Nf()
68 REPORTER_ASSERT(r, !(a != b).anyTrue()); in test_Nf()
69 REPORTER_ASSERT(r, (a < fours).anyTrue()); in test_Nf()
70 REPORTER_ASSERT(r, (a <= fours).anyTrue()); in test_Nf()
[all …]
/external/libcxx/test/std/containers/associative/map/map.ops/
Dlower_bound.pass.cpp44 R r = m.lower_bound(5); in main() local
45 assert(r == m.begin()); in main()
46 r = m.lower_bound(7); in main()
47 assert(r == next(m.begin())); in main()
48 r = m.lower_bound(9); in main()
49 assert(r == next(m.begin(), 2)); in main()
50 r = m.lower_bound(11); in main()
51 assert(r == next(m.begin(), 3)); in main()
52 r = m.lower_bound(13); in main()
53 assert(r == next(m.begin(), 4)); in main()
[all …]
Dupper_bound.pass.cpp43 R r = m.upper_bound(5); in main() local
44 assert(r == next(m.begin(), 1)); in main()
45 r = m.upper_bound(7); in main()
46 assert(r == next(m.begin(), 2)); in main()
47 r = m.upper_bound(9); in main()
48 assert(r == next(m.begin(), 3)); in main()
49 r = m.upper_bound(11); in main()
50 assert(r == next(m.begin(), 4)); in main()
51 r = m.upper_bound(13); in main()
52 assert(r == next(m.begin(), 5)); in main()
[all …]
Dequal_range.pass.cpp44 R r = m.equal_range(5); in main() local
45 assert(r.first == next(m.begin(), 0)); in main()
46 assert(r.second == next(m.begin(), 1)); in main()
47 r = m.equal_range(7); in main()
48 assert(r.first == next(m.begin(), 1)); in main()
49 assert(r.second == next(m.begin(), 2)); in main()
50 r = m.equal_range(9); in main()
51 assert(r.first == next(m.begin(), 2)); in main()
52 assert(r.second == next(m.begin(), 3)); in main()
53 r = m.equal_range(11); in main()
[all …]
Dcount.pass.cpp43 R r = m.count(5); in main() local
44 assert(r == 1); in main()
45 r = m.count(6); in main()
46 assert(r == 1); in main()
47 r = m.count(7); in main()
48 assert(r == 1); in main()
49 r = m.count(8); in main()
50 assert(r == 1); in main()
51 r = m.count(9); in main()
52 assert(r == 1); in main()
[all …]
/external/googletest/googlemock/scripts/
Dgmock_doctor.py131 _GCC_FILE_LINE_RE = r'(?P<file>.*):(?P<line>\d+):(\d+:)?\s+'
132 _CLANG_FILE_LINE_RE = r'(?P<file>.*):(?P<line>\d+):(?P<column>\d+):\s+'
134 r'(?P<file>.*[/\\^](?!gmock-)[^/\\]+):(?P<line>\d+):(?P<column>\d+):\s+')
140 r = re.compile(regex)
141 return r.finditer(s)
169 gcc_regex = (r'In member function \'testing::internal::ReturnAction<R>.*\n'
170 + _GCC_FILE_LINE_RE + r'instantiated from here\n'
171 r'.*gmock-actions\.h.*error: creating array with negative size')
172 clang_regex = (r'error:.*array.*negative.*\r?\n'
173 r'(.*\n)*?' +
[all …]
/external/libcups/filter/
Draster.c148 static ssize_t cups_raster_io(cups_raster_t *r, unsigned char *buf, size_t bytes);
149 static unsigned cups_raster_read_header(cups_raster_t *r);
150 static ssize_t cups_raster_read(cups_raster_t *r, unsigned char *buf, size_t bytes);
151 static int cups_raster_update(cups_raster_t *r);
152 static ssize_t cups_raster_write(cups_raster_t *r, const unsigned char *pixels);
167 cupsRasterClose(cups_raster_t *r) /* I - Stream to close */ in cupsRasterClose() argument
169 if (r != NULL) in cupsRasterClose()
171 if (r->buffer) in cupsRasterClose()
172 free(r->buffer); in cupsRasterClose()
174 if (r->pixels) in cupsRasterClose()
[all …]
/external/google-breakpad/src/testing/scripts/
Dgmock_doctor.py131 _GCC_FILE_LINE_RE = r'(?P<file>.*):(?P<line>\d+):(\d+:)?\s+'
132 _CLANG_FILE_LINE_RE = r'(?P<file>.*):(?P<line>\d+):(?P<column>\d+):\s+'
134 r'(?P<file>.*[/\\^](?!gmock-)[^/\\]+):(?P<line>\d+):(?P<column>\d+):\s+')
140 r = re.compile(regex)
141 return r.finditer(s)
169 gcc_regex = (r'In member function \'testing::internal::ReturnAction<R>.*\n'
170 + _GCC_FILE_LINE_RE + r'instantiated from here\n'
171 r'.*gmock-actions\.h.*error: creating array with negative size')
172 clang_regex = (r'error:.*array.*negative.*\r?\n'
173 r'(.*\n)*?' +
[all …]
/external/chromium-trace/catapult/common/py_vulcanize/third_party/rjsmin/
Drjsmin.py3 r"""
67 __author__ = r"Andr\xe9 Malo".encode('ascii').decode('unicode_escape')
106 space_chars = r'[\000-\011\013\014\016-\040]'
108 line_comment = r'(?://[^\r\n]*)'
109 space_comment = r'(?:/\*[^*]*\*+(?:[^/*][^*]*\*+)*/)'
110 space_comment_nobang = r'(?:/\*(?!!)[^*]*\*+(?:[^/*][^*]*\*+)*/)'
111 bang_comment = r'(?:/\*![^*]*\*+(?:[^/*][^*]*\*+)*/)'
114 r'(?:\047[^\047\\\r\n]*(?:\\(?:[^\r\n]|\r?\n|\r)[^\047\\\r\n]*)*\047)'
115 string2 = r'(?:"[^"\\\r\n]*(?:\\(?:[^\r\n]|\r?\n|\r)[^"\\\r\n]*)*")'
116 string3 = r'(?:`(?:[^`\\]|\\.)*`)'
[all …]
/external/libcxx/test/std/containers/associative/set/
Dlower_bound.pass.cpp43 R r = m.lower_bound(5); in main() local
44 assert(r == m.begin()); in main()
45 r = m.lower_bound(7); in main()
46 assert(r == next(m.begin())); in main()
47 r = m.lower_bound(9); in main()
48 assert(r == next(m.begin(), 2)); in main()
49 r = m.lower_bound(11); in main()
50 assert(r == next(m.begin(), 3)); in main()
51 r = m.lower_bound(13); in main()
52 assert(r == next(m.begin(), 4)); in main()
[all …]
Dupper_bound.pass.cpp43 R r = m.upper_bound(5); in main() local
44 assert(r == next(m.begin(), 1)); in main()
45 r = m.upper_bound(7); in main()
46 assert(r == next(m.begin(), 2)); in main()
47 r = m.upper_bound(9); in main()
48 assert(r == next(m.begin(), 3)); in main()
49 r = m.upper_bound(11); in main()
50 assert(r == next(m.begin(), 4)); in main()
51 r = m.upper_bound(13); in main()
52 assert(r == next(m.begin(), 5)); in main()
[all …]
Dequal_range.pass.cpp43 R r = m.equal_range(5); in main() local
44 assert(r.first == next(m.begin(), 0)); in main()
45 assert(r.second == next(m.begin(), 1)); in main()
46 r = m.equal_range(7); in main()
47 assert(r.first == next(m.begin(), 1)); in main()
48 assert(r.second == next(m.begin(), 2)); in main()
49 r = m.equal_range(9); in main()
50 assert(r.first == next(m.begin(), 2)); in main()
51 assert(r.second == next(m.begin(), 3)); in main()
52 r = m.equal_range(11); in main()
[all …]
/external/llvm/test/CodeGen/X86/
Dhandle-move.ll12 ; %vreg4: [48r,144r:0) 0@48r
13 ; --> [48r,180r:0) 0@48r
14 ; DH: [0B,16r:0)[128r,144r:2)[144r,144d:1) 0@0B-phi 1@144r 2@128r
15 ; --> [0B,16r:0)[128r,180r:2)[180r,180d:1) 0@0B-phi 1@180r 2@128r
16 ; DL: [0B,16r:0)[128r,144r:2)[144r,144d:1) 0@0B-phi 1@144r 2@128r
17 ; --> [0B,16r:0)[128r,180r:2)[180r,180d:1) 0@0B-phi 1@180r 2@128r
29 ; %vreg4: [48r,144r:0) 0@48r
30 ; --> [48r,180r:0) 0@48r
31 ; DH: [0B,16r:0)[128r,144r:2)[144r,184r:1) 0@0B-phi 1@144r 2@128r
32 ; --> [0B,16r:0)[128r,180r:2)[180r,184r:1) 0@0B-phi 1@180r 2@128r
[all …]
/external/swiftshader/third_party/llvm-7.0/llvm/test/CodeGen/X86/
Dhandle-move.ll12 ; %4: [48r,144r:0) 0@48r
13 ; --> [48r,180r:0) 0@48r
14 ; DH: [0B,16r:0)[128r,144r:2)[144r,144d:1) 0@0B-phi 1@144r 2@128r
15 ; --> [0B,16r:0)[128r,180r:2)[180r,180d:1) 0@0B-phi 1@180r 2@128r
16 ; DL: [0B,16r:0)[128r,144r:2)[144r,144d:1) 0@0B-phi 1@144r 2@128r
17 ; --> [0B,16r:0)[128r,180r:2)[180r,180d:1) 0@0B-phi 1@180r 2@128r
29 ; %4: [48r,144r:0) 0@48r
30 ; --> [48r,180r:0) 0@48r
31 ; DH: [0B,16r:0)[128r,144r:2)[144r,184r:1) 0@0B-phi 1@144r 2@128r
32 ; --> [0B,16r:0)[128r,180r:2)[180r,184r:1) 0@0B-phi 1@180r 2@128r
[all …]
/external/antlr/runtime/Python3/tests/
Dt042ast.py40 r = self.parse("1 + 2", 'r1')
42 r.tree.toStringTree(),
48 r = self.parse("assert 2+3;", 'r2')
50 r.tree.toStringTree(),
56 r = self.parse("assert 2+3 : 5;", 'r2')
58 r.tree.toStringTree(),
64 r = self.parse("if 1 fooze", 'r3')
66 r.tree.toStringTree(),
72 r = self.parse("if 1 fooze else fooze", 'r3')
74 r.tree.toStringTree(),
[all …]
/external/antlr/runtime/Python/tests/
Dt042ast.py40 r = self.parse("1 + 2", 'r1')
42 r.tree.toStringTree(),
48 r = self.parse("assert 2+3;", 'r2')
50 r.tree.toStringTree(),
56 r = self.parse("assert 2+3 : 5;", 'r2')
58 r.tree.toStringTree(),
64 r = self.parse("if 1 fooze", 'r3')
66 r.tree.toStringTree(),
72 r = self.parse("if 1 fooze else fooze", 'r3')
74 r.tree.toStringTree(),
[all …]
/external/eigen/blas/f2c/
Dchpmv.c166 if (*n == 0 || (alpha->r == 0.f && alpha->i == 0.f && (beta->r == 1.f && in chpmv_()
189 if (beta->r != 1.f || beta->i != 0.f) { in chpmv_()
191 if (beta->r == 0.f && beta->i == 0.f) { in chpmv_()
195 y[i__2].r = 0.f, y[i__2].i = 0.f; in chpmv_()
203 q__1.r = beta->r * y[i__3].r - beta->i * y[i__3].i, in chpmv_()
204 q__1.i = beta->r * y[i__3].i + beta->i * y[i__3] in chpmv_()
205 .r; in chpmv_()
206 y[i__2].r = q__1.r, y[i__2].i = q__1.i; in chpmv_()
212 if (beta->r == 0.f && beta->i == 0.f) { in chpmv_()
216 y[i__2].r = 0.f, y[i__2].i = 0.f; in chpmv_()
[all …]
Dzhpmv.c166 if (*n == 0 || (alpha->r == 0. && alpha->i == 0. && (beta->r == 1. && in zhpmv_()
189 if (beta->r != 1. || beta->i != 0.) { in zhpmv_()
191 if (beta->r == 0. && beta->i == 0.) { in zhpmv_()
195 y[i__2].r = 0., y[i__2].i = 0.; in zhpmv_()
203 z__1.r = beta->r * y[i__3].r - beta->i * y[i__3].i, in zhpmv_()
204 z__1.i = beta->r * y[i__3].i + beta->i * y[i__3] in zhpmv_()
205 .r; in zhpmv_()
206 y[i__2].r = z__1.r, y[i__2].i = z__1.i; in zhpmv_()
212 if (beta->r == 0. && beta->i == 0.) { in zhpmv_()
216 y[i__2].r = 0., y[i__2].i = 0.; in zhpmv_()
[all …]

12345678910>>...406