/external/valgrind/none/tests/amd64/ |
D | bug156404-amd64.stdout.exp | 1 depth 0: r = 1 2 depth 1: r = 1 3 depth 2: r = 1 4 depth 3: r = 1 5 depth 4: r = 1 6 depth 5: r = 1 7 depth 6: r = 1 8 depth 7: r = 1 9 depth 8: r = 1 10 depth 9: r = 1 [all …]
|
/external/curl/tests/data/ |
D | test1005 | 17 …r\n250-AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n250-AAAAAAAAAAAAAA…
|
D | test1062 | 18 …r\n250-AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n250-AAAAAAAAAAAAAA…
|
D | test1006 | 18 …r\n250-AAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAAA\r\n250-AAAAAAAAAAAAAA…
|
/external/skia/tests/ |
D | SkSLErrorTest.cpp | 14 static void test_failure(skiatest::Reporter* r, const char* src, const char* error) { in test_failure() argument 25 REPORTER_ASSERT(r, compiler.errorText() == skError); in test_failure() 28 static void test_success(skiatest::Reporter* r, const char* src) { in test_success() argument 35 REPORTER_ASSERT(r, program); in test_success() 38 DEF_TEST(SkSLUndefinedSymbol, r) { in DEF_TEST() argument 39 test_failure(r, in DEF_TEST() 44 DEF_TEST(SkSLUndefinedFunction, r) { in DEF_TEST() argument 45 test_failure(r, in DEF_TEST() 50 DEF_TEST(SkSLGenericArgumentMismatch, r) { in DEF_TEST() argument 51 test_failure(r, in DEF_TEST() [all …]
|
/external/v8/testing/gmock/scripts/ |
D | gmock_doctor.py | 131 _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/googletest/googlemock/scripts/ |
D | gmock_doctor.py | 131 _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/libcxx/test/std/containers/associative/map/map.ops/ |
D | lower_bound.pass.cpp | 44 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 …]
|
D | upper_bound.pass.cpp | 43 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 …]
|
D | equal_range.pass.cpp | 44 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 …]
|
D | count.pass.cpp | 43 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 …]
|
D | find.pass.cpp | 44 R r = m.find(5); in main() local 45 assert(r == m.begin()); in main() 46 r = m.find(6); in main() 47 assert(r == next(m.begin())); in main() 48 r = m.find(7); in main() 49 assert(r == next(m.begin(), 2)); in main() 50 r = m.find(8); in main() 51 assert(r == next(m.begin(), 3)); in main() 52 r = m.find(9); in main() 53 assert(r == next(m.begin(), 4)); in main() [all …]
|
/external/google-breakpad/src/testing/scripts/ |
D | gmock_doctor.py | 131 _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/ |
D | raster.c | 148 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/libcxx/test/std/containers/associative/set/ |
D | lower_bound.pass.cpp | 43 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 …]
|
D | upper_bound.pass.cpp | 43 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 …]
|
D | equal_range.pass.cpp | 43 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 …]
|
D | find.pass.cpp | 43 R r = m.find(5); in main() local 44 assert(r == m.begin()); in main() 45 r = m.find(6); in main() 46 assert(r == next(m.begin())); in main() 47 r = m.find(7); in main() 48 assert(r == next(m.begin(), 2)); in main() 49 r = m.find(8); in main() 50 assert(r == next(m.begin(), 3)); in main() 51 r = m.find(9); in main() 52 assert(r == next(m.begin(), 4)); in main() [all …]
|
/external/llvm/test/CodeGen/X86/ |
D | handle-move.ll | 12 ; %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/svox/pico/lib/ |
D | picosig2.c | 2086 picoos_int32 *r = sig_inObj->int_vec35; in init_rand() local 2091 r[0] = 3455; in init_rand() 2093 r[1] = -2522; in init_rand() 2095 r[2] = 4007; in init_rand() 2097 r[3] = 3907; in init_rand() 2099 r[4] = 2158; in init_rand() 2101 r[5] = -3875; in init_rand() 2103 r[6] = -3522; in init_rand() 2105 r[7] = 4069; in init_rand() 2107 r[8] = -4033; in init_rand() [all …]
|
/external/ply/ply/ply/ |
D | ctokens.py | 44 t_PLUS = r'\+' 45 t_MINUS = r'-' 46 t_TIMES = r'\*' 47 t_DIVIDE = r'/' 48 t_MODULO = r'%' 49 t_OR = r'\|' 50 t_AND = r'&' 51 t_NOT = r'~' 52 t_XOR = r'\^' 53 t_LSHIFT = r'<<' [all …]
|
/external/ply/ply/example/ansic/ |
D | clex.py | 61 r'\n+' 65 t_PLUS = r'\+' 66 t_MINUS = r'-' 67 t_TIMES = r'\*' 68 t_DIVIDE = r'/' 69 t_MOD = r'%' 70 t_OR = r'\|' 71 t_AND = r'&' 72 t_NOT = r'~' 73 t_XOR = r'\^' [all …]
|
/external/antlr/antlr-3.4/runtime/Python/tests/ |
D | t042ast.py | 40 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/ |
D | chpmv.c | 166 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 …]
|
D | zhpmv.c | 166 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 …]
|