Searched defs:r1 (Results 1 - 25 of 359) sorted by relevance

1234567891011>>

/external/chromium_org/v8/test/mjsunit/regress/
H A Dregress-1472.js30 var r1 = /(?:a(?:b(?:c(?:d(?:e(?:f(?:g(?:h(?:i(?:j(?:k(?:l(?:m(?:n(?:o(?:p(?:q(?:r(?:s(?:t(?:u(?:v(?:w(?:x(?:y(?:z(?:FooBar)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)+)/; variable
31 "xxx".match(r1);
H A Dregress-crbug-178790.js31 var r1 = ""; variable
33 r1 += "a?";
35 "test".match(RegExp(r1));
/external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/
H A Dp3.cpp2 int& r1; // expected-error{{declaration of reference variable 'r1' requires an initializer}} variable
/external/libcxx/test/containers/sequences/vector.bool/
H A Dswap.pass.cpp57 std::vector<bool>::reference r1 = v[0]; local
59 r1 = true;
61 swap(r1, r2);
89 std::vector<bool, min_allocator<bool>>::reference r1 = v[0]; local
91 r1 = true;
93 swap(r1, r2);
/external/libcxx/test/utilities/function.objects/refwrap/refwrap.helpers/
H A Dcref_2.pass.cpp22 std::reference_wrapper<const int> r1 = std::cref(i); local
23 std::reference_wrapper<const int> r2 = std::cref(r1);
H A Dref_2.pass.cpp22 std::reference_wrapper<int> r1 = std::ref(i); local
23 std::reference_wrapper<int> r2 = std::ref(r1);
/external/llvm/unittests/Support/
H A DProcessTest.cpp43 const unsigned r1 = Process::GetRandomNumber(); local
45 // It should be extremely unlikely that both r1 and r2 are 0.
46 EXPECT_NE((r1 | r2), 0u);
/external/chromium_org/components/omnibox/
H A Dautocomplete_match_unittest.cc12 int r1; member in struct:RelevantCases
30 m1.relevance = cases[i].r1;
/external/chromium_org/ui/gfx/range/
H A Drange_unittest.cc66 gfx::Range r1(10, 4);
69 EXPECT_EQ(r1, r2);
70 EXPECT_NE(r1, r3);
74 EXPECT_NE(r1, r4);
79 EXPECT_NE(r1, r5);
85 gfx::Range r1(10, 5);
87 EXPECT_TRUE(r1.EqualsIgnoringDirection(r2));
153 void TestContainsAndIntersects(const gfx::Range& r1, argument
156 EXPECT_TRUE(r1.Intersects(r1));
[all...]
/external/clang/test/Misc/
H A Dverify.c10 struct s r1; // expected-error {{tentative definition has type 'struct s' that is never completed}} variable in typeref:struct:s
/external/libcxx/test/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.const/
H A Dconvert.fail.cpp27 std::move_iterator<It> r1 = r2; local
H A Dconvert.pass.cpp28 std::move_iterator<It> r1 = r2; local
29 assert(r1.base() == u);
/external/libcxx/test/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op=/
H A Dmove_iterator.fail.cpp28 std::move_iterator<It> r1; local
29 r1 = r2;
H A Dmove_iterator.pass.cpp29 std::move_iterator<It> r1; local
30 std::move_iterator<It>& rr = r1 = r2;
31 assert(r1.base() == u);
32 assert(&rr == &r1);
/external/libcxx/test/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.cons/
H A Dreverse_iterator.fail.cpp27 std::reverse_iterator<It> r1 = r2; local
H A Dreverse_iterator.pass.cpp28 std::reverse_iterator<It> r1 = r2; local
29 assert(r1.base() == u);
/external/libcxx/test/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op=/
H A Dreverse_iterator.fail.cpp28 std::reverse_iterator<It> r1; local
29 r1 = r2;
H A Dreverse_iterator.pass.cpp29 std::reverse_iterator<It> r1; local
30 std::reverse_iterator<It>& rr = r1 = r2;
31 assert(r1.base() == u);
32 assert(&rr == &r1);
/external/pixman/test/
H A Dregion-translate-test.c14 pixman_region32_t r1, r2; local
16 pixman_region32_init_rects (&r1, &rect, 1);
19 assert (pixman_region32_equal (&r1, &r2));
21 pixman_region32_translate (&r1, -LARGE, LARGE);
22 pixman_region32_translate (&r1, LARGE, -LARGE);
24 assert (pixman_region32_equal (&r1, &r2));
26 pixman_region32_fini (&r1);
/external/libcxx/test/algorithms/alg.modifying.operations/alg.partitions/
H A Dpartition_copy.pass.cpp33 int r1[10] = {0}; local
38 output_iterator<int*>(r1), r2, is_odd());
39 assert(p.first.base() == r1 + 4);
40 assert(r1[0] == 1);
41 assert(r1[1] == 3);
42 assert(r1[2] == 5);
43 assert(r1[3] == 7);
/external/libcxx/test/containers/sequences/array/
H A Dat.pass.cpp26 C::reference r1 = c.at(0); local
27 assert(r1 == 1);
28 r1 = 5.5;
43 C::const_reference r1 = c.at(0); local
44 assert(r1 == 1);
H A Dfront_back.pass.cpp27 C::reference r1 = c.front(); local
28 assert(r1 == 1);
29 r1 = 5.5;
41 C::const_reference r1 = c.front(); local
42 assert(r1 == 1);
H A Dindexing.pass.cpp26 C::reference r1 = c[0]; local
27 assert(r1 == 1);
28 r1 = 5.5;
40 C::const_reference r1 = c[0]; local
41 assert(r1 == 1);
/external/stlport/test/unit/
H A Dreference_wrapper_test.cpp37 rr_type r1 = std::tr1::ref(i); local
39 CPPUNIT_CHECK( r1.get() == 1 );
41 r1 = std::tr1::ref(j);
43 CPPUNIT_CHECK( r1.get() == 2 );
47 CPPUNIT_CHECK( r1.get() == 2 );
51 CPPUNIT_CHECK( r1.get() == 4 );
53 r1.get() = 5;
68 crr_type r1 = std::tr1::cref(i); local
70 CPPUNIT_CHECK( r1.get() == 1 );
72 r1
[all...]
/external/valgrind/main/none/tests/s390x/
H A Dbfp-3.c8 float r1 = v1; local
10 __asm__ volatile("maebr %[r1],%[r3],%[r2]"
11 : [r1]"+f"(r1) : [r2]"f"(v2), [r3]"f"(v3));
12 printf("maebr %f * %f + %f -> %f\n", v2, v3, v1, r1);
17 double r1 = v1; local
19 __asm__ volatile("madbr %[r1],%[r3],%[r2]"
20 : [r1]"+f"(r1) : [r2]"f"(v2), [r3]"f"(v3));
21 printf("madbr %f * %f + %f -> %f\n", v2, v3, v1, r1);
26 float r1 = v1; local
35 double r1 = v1; local
[all...]

Completed in 429 milliseconds

1234567891011>>