| /external/valgrind/main/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/chromium_org/v8/test/mjsunit/regress/ |
| D | regress-2437.js | 37 r = /a/;
38 r.lastIndex = 1;
39 r.exec("zzzz");
40 assertEquals(0, r.lastIndex);
43 r = /a/;
44 r.lastIndex = 1;
45 r.test("zzzz");
46 assertEquals(0, r.lastIndex);
49 r = /a/;
50 r.lastIndex = 1;
[all …]
|
| /external/chromium_org/cc/base/ |
| D | simple_enclosed_region_unittest.cc | 75 SimpleEnclosedRegion r; in TEST() local
76 EXPECT_TRUE(r.IsEmpty()); in TEST()
78 r = gfx::Rect(2, 3, 4, 5); in TEST()
79 EXPECT_TRUE(ExpectRegionEq(gfx::Rect(2, 3, 4, 5), r)); in TEST()
81 r = SimpleEnclosedRegion(3, 4, 5, 6); in TEST()
82 EXPECT_TRUE(ExpectRegionEq(gfx::Rect(3, 4, 5, 6), r)); in TEST()
86 SimpleEnclosedRegion r(1, 2, 3, 4); in TEST() local
87 EXPECT_FALSE(r.IsEmpty()); in TEST()
88 r.Clear(); in TEST()
89 EXPECT_TRUE(r.IsEmpty()); in TEST()
[all …]
|
| /external/libcxx/test/containers/associative/set/ |
| D | lower_bound.pass.cpp | 42 R r = m.lower_bound(5); in main() local
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.lower_bound(13); in main()
51 assert(r == next(m.begin(), 4)); in main()
[all …]
|
| D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() local
43 assert(r == next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
49 assert(r == next(m.begin(), 4)); in main()
50 r = m.upper_bound(13); in main()
51 assert(r == next(m.begin(), 5)); in main()
[all …]
|
| D | equal_range.pass.cpp | 42 R r = m.equal_range(5); in main() local
43 assert(r.first == next(m.begin(), 0)); in main()
44 assert(r.second == next(m.begin(), 1)); in main()
45 r = m.equal_range(7); in main()
46 assert(r.first == next(m.begin(), 1)); in main()
47 assert(r.second == next(m.begin(), 2)); in main()
48 r = m.equal_range(9); in main()
49 assert(r.first == next(m.begin(), 2)); in main()
50 assert(r.second == next(m.begin(), 3)); in main()
51 r = m.equal_range(11); in main()
[all …]
|
| D | find.pass.cpp | 42 R r = m.find(5); in main() local
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.find(9); in main()
51 assert(r == next(m.begin(), 4)); in main()
[all …]
|
| /external/libcxx/test/containers/associative/map/map.ops/ |
| D | lower_bound.pass.cpp | 42 R r = m.lower_bound(5); in main() local
43 assert(r == m.begin()); in main()
44 r = m.lower_bound(7); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.lower_bound(9); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.lower_bound(11); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.lower_bound(13); in main()
51 assert(r == next(m.begin(), 4)); in main()
[all …]
|
| D | upper_bound.pass.cpp | 42 R r = m.upper_bound(5); in main() local
43 assert(r == next(m.begin(), 1)); in main()
44 r = m.upper_bound(7); in main()
45 assert(r == next(m.begin(), 2)); in main()
46 r = m.upper_bound(9); in main()
47 assert(r == next(m.begin(), 3)); in main()
48 r = m.upper_bound(11); in main()
49 assert(r == next(m.begin(), 4)); in main()
50 r = m.upper_bound(13); in main()
51 assert(r == next(m.begin(), 5)); in main()
[all …]
|
| D | equal_range.pass.cpp | 42 R r = m.equal_range(5); in main() local
43 assert(r.first == next(m.begin(), 0)); in main()
44 assert(r.second == next(m.begin(), 1)); in main()
45 r = m.equal_range(7); in main()
46 assert(r.first == next(m.begin(), 1)); in main()
47 assert(r.second == next(m.begin(), 2)); in main()
48 r = m.equal_range(9); in main()
49 assert(r.first == next(m.begin(), 2)); in main()
50 assert(r.second == next(m.begin(), 3)); in main()
51 r = m.equal_range(11); in main()
[all …]
|
| D | find.pass.cpp | 42 R r = m.find(5); in main() local
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.find(9); in main()
51 assert(r == next(m.begin(), 4)); in main()
[all …]
|
| /external/skia/src/core/ |
| D | SkRecordDraw.cpp | 18 bool Draw::skip(const PairedPushCull& r) { in skip() argument
19 if (fCanvas->quickReject(r.base->rect)) { in skip()
20 fIndex += r.skip; in skip()
26 bool Draw::skip(const BoundedDrawPosTextH& r) { in skip() argument
27 return fCanvas->quickRejectY(r.minY, r.maxY); in skip()
33 #define DRAW(T, call) template <> void Draw::draw(const T& r) { fCanvas->call; }
35 DRAW(Save, save(r.flags));
36 DRAW(SaveLayer, saveLayer(r.bounds, r.paint, r.flags));
38 DRAW(PushCull, pushCull(r.rect));
39 DRAW(Clear, clear(r.color));
[all …]
|
| /external/chromium_org/media/base/ |
| D | ranges_unittest.cc | 16 std::ostream& operator<<(std::ostream& os, const Ranges<T>& r) { in operator <<() argument
18 for(size_t i = 0; i < r.size(); ++i) in operator <<()
19 os << "[" << r.start(i) << "," << r.end(i) << ") "; in operator <<()
26 static void ExpectRanges(const Ranges<T>& r, in ExpectRanges() argument
29 ss << r; in ExpectRanges()
37 Ranges<int> r; in TEST() local
38 ASSERT_EQ(r.size(), 0u) << r; in TEST()
39 ASSERT_EQ(r.Add(0, 1), 1u) << r; in TEST()
40 ASSERT_EQ(r.size(), 1u) << r; in TEST()
41 ASSERT_RANGES(r, "{ [0,1) }"); in TEST()
[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/chromium_org/third_party/libaddressinput/src/cpp/test/util/ |
| D | string_split_unittest.cc | 20 std::vector<std::string> r; in TEST() local
22 SplitString(std::string(), ',', &r); in TEST()
23 EXPECT_EQ(0U, r.size()); in TEST()
25 SplitString("a,b,c", ',', &r); in TEST()
26 ASSERT_EQ(3U, r.size()); in TEST()
27 EXPECT_EQ(r[0], "a"); in TEST()
28 EXPECT_EQ(r[1], "b"); in TEST()
29 EXPECT_EQ(r[2], "c"); in TEST()
31 SplitString("a, b, c", ',', &r); in TEST()
32 ASSERT_EQ(3U, r.size()); in TEST()
[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/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/valgrind/main/drd/tests/ |
| D | trylock.c | 21 int r; in main() local
30 r = pthread_rwlock_init(&rwlock, NULL); assert(r == 0); in main()
32 r = pthread_rwlock_wrlock(&rwlock); assert(r == 0); in main()
33 r = pthread_rwlock_unlock(&rwlock); assert(r == 0); in main()
35 r = pthread_rwlock_trywrlock(&rwlock); assert(r == 0); in main()
36 r = pthread_rwlock_unlock(&rwlock); assert(r == 0); in main()
39 r = pthread_rwlock_timedwrlock(&rwlock, &abs_timeout); assert(r == 0); in main()
40 r = pthread_rwlock_unlock(&rwlock); assert(r == 0); in main()
43 r = pthread_rwlock_rdlock(&rwlock); assert(r == 0); in main()
44 r = pthread_rwlock_rdlock(&rwlock); assert(r == 0); in main()
[all …]
|
| /external/libcxx/test/containers/associative/multiset/ |
| D | find.pass.cpp | 42 R r = m.find(5); in main() local
43 assert(r == m.begin()); in main()
44 r = m.find(6); in main()
45 assert(r == next(m.begin())); in main()
46 r = m.find(7); in main()
47 assert(r == next(m.begin(), 2)); in main()
48 r = m.find(8); in main()
49 assert(r == next(m.begin(), 3)); in main()
50 r = m.find(9); in main()
51 assert(r == next(m.begin(), 4)); in main()
[all …]
|
| D | equal_range.pass.cpp | 43 R r = m.equal_range(4); in main() local
44 assert(r.first == next(m.begin(), 0)); in main()
45 assert(r.second == next(m.begin(), 0)); in main()
46 r = m.equal_range(5); in main()
47 assert(r.first == next(m.begin(), 0)); in main()
48 assert(r.second == next(m.begin(), 3)); in main()
49 r = m.equal_range(6); in main()
50 assert(r.first == next(m.begin(), 3)); in main()
51 assert(r.second == next(m.begin(), 3)); in main()
52 r = m.equal_range(7); in main()
[all …]
|
| /external/valgrind/main/helgrind/tests/ |
| D | tc20_verifywrap.c | 40 int r; in main() local
76 r= pthread_create( &child, NULL, racy_child, NULL ); assert(!r); in main()
79 r= pthread_join( child, NULL ); assert(!r); in main()
83 r= pthread_join( pthread_self(), NULL ); assert(r); in main()
92 r= pthread_mutex_init( &mx, &mxa ); in main()
94 assert(r); /* glibc >= 2.4: the call should fail */ in main()
96 assert(!r); /* glibc < 2.4: oh well, glibc didn't bounce this */ in main()
100 r= pthread_mutex_init( &mx2, NULL ); assert(!r); in main()
101 r= pthread_mutex_lock( &mx2 ); assert(!r); in main()
102 r= pthread_mutex_destroy( &mx2 ); assert(r); in main()
[all …]
|
| /external/chromium_org/third_party/WebKit/Source/platform/geometry/ |
| D | RegionTest.cpp | 35 #define TEST_INSIDE_RECT(r, x, y, w, h) \ argument
36 EXPECT_TRUE(r.contains(IntPoint(x, y))); \
37 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y))); \
38 EXPECT_TRUE(r.contains(IntPoint(x, y + h - 1))); \
39 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y + h - 1))); \
40 EXPECT_TRUE(r.contains(IntPoint(x, y + h / 2))); \
41 EXPECT_TRUE(r.contains(IntPoint(x + w - 1, y + h / 2))); \
42 EXPECT_TRUE(r.contains(IntPoint(x + w / 2, y))); \
43 EXPECT_TRUE(r.contains(IntPoint(x + w / 2, y + h - 1))); \
44 EXPECT_TRUE(r.contains(IntPoint(x + w / 2, y + h / 2))); \
[all …]
|
| /external/libusb/examples/ |
| D | dpfp.c | 77 int r; in print_f0_data() local
80 r = libusb_control_transfer(devh, CTRL_IN, USB_RQ, 0xf0, 0, data, in print_f0_data()
82 if (r < 0) { in print_f0_data()
83 fprintf(stderr, "F0 error %d\n", r); in print_f0_data()
84 return r; in print_f0_data()
86 if ((unsigned int) r < sizeof(data)) { in print_f0_data()
87 fprintf(stderr, "short read (%d)\n", r); in print_f0_data()
100 int r; in get_hwstat() local
102 r = libusb_control_transfer(devh, CTRL_IN, USB_RQ, 0x07, 0, status, 1, 0); in get_hwstat()
103 if (r < 0) { in get_hwstat()
[all …]
|
| D | dpfp_threaded.c | 81 int r = 0; in poll_thread_main() local
86 r = libusb_handle_events_timeout(NULL, &tv); in poll_thread_main()
87 if (r < 0) { in poll_thread_main()
106 int r; in print_f0_data() local
109 r = libusb_control_transfer(devh, CTRL_IN, USB_RQ, 0xf0, 0, data, in print_f0_data()
111 if (r < 0) { in print_f0_data()
112 fprintf(stderr, "F0 error %d\n", r); in print_f0_data()
113 return r; in print_f0_data()
115 if ((unsigned int) r < sizeof(data)) { in print_f0_data()
116 fprintf(stderr, "short read (%d)\n", r); in print_f0_data()
[all …]
|
| /external/libcxx/test/localization/locale.stdcvt/ |
| D | codecvt_utf16_length.pass.cpp | 33 int r = c.length(m, n, n+4, 2); in main() local
34 assert(r == 4); in main()
38 r = c.length(m, n, n+2, 2); in main()
39 assert(r == 2); in main()
43 r = c.length(m, n, n+2, 2); in main()
44 assert(r == 2); in main()
48 r = c.length(m, n, n+2, 2); in main()
49 assert(r == 2); in main()
56 int r = c.length(m, n, n+4, 2); in main() local
57 assert(r == 0); in main()
[all …]
|