| /external/deqp/framework/referencerenderer/ |
| H A D | rrDefs.cpp | 26 namespace rr namespace
28 } // rr
|
| H A D | rrFragmentPacket.hpp | 29 namespace rr namespace
57 } // rr
|
| H A D | rrMultisamplePixelBufferAccess.hpp | 29 namespace rr namespace
72 MultisampleConstPixelBufferAccess (const rr::MultisamplePixelBufferAccess& msAccess);
103 } // rr
|
| H A D | rrShaders.cpp | 27 namespace rr namespace
40 } // rr
|
| H A D | rrShadingContext.cpp | 26 namespace rr namespace
41 } // rr
|
| H A D | rrDefs.hpp | 31 namespace rr namespace
60 } // rr
|
| H A D | rrPrimitivePacket.cpp | 28 namespace rr namespace
72 } // rr
|
| H A D | rrPrimitivePacket.hpp | 31 namespace rr namespace
74 } // rr
|
| H A D | rrVertexPacket.hpp | 32 namespace rr namespace
114 } // rr
|
| /external/clang/test/CXX/dcl.decl/dcl.init/dcl.init.ref/ |
| H A D | p1.cpp | 9 int &rr=r; local
|
| /external/clang/test/CodeGen/ |
| H A D | 2002-09-18-UnionProblem.c | 14 DWunion rr; local
18 rr.s.high = n1;
22 rr.s.high = bm;
25 return rr.ll;
|
| /external/clang/test/PCH/ |
| H A D | cxx-reference.h | 9 char &&rr = 'c'; variable
|
| /external/libconstrainedcrypto/include/constrainedcrypto/ |
| H A D | rsa.h | 44 uint32_t rr[RSANUMWORDS]; /* R^2 as little endian array */ member in struct:RSAPublicKey
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.-=/ |
| H A D | difference_type.pass.cpp | 30 std::move_iterator<It>& rr = r -= n; local
32 assert(&rr == &r);
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op+=/ |
| H A D | difference_type.pass.cpp | 30 std::reverse_iterator<It>& rr = r += n; local
32 assert(&rr == &r);
|
| /external/libcxx/test/std/iterators/predef.iterators/reverse.iterators/reverse.iter.ops/reverse.iter.op-=/ |
| H A D | difference_type.pass.cpp | 30 std::reverse_iterator<It>& rr = r -= n; local
32 assert(&rr == &r);
|
| /external/skia/bench/ |
| H A D | BlurOccludedRRectBench.cpp | 37 const SkRRect rr = SkRRect::MakeRectXY(r, 8, 8); variable
38 SkRect occRect = sk_tool_utils::compute_central_occluder(rr);
57 canvas->drawRRect(rr, firstBlur);
69 canvas->drawRRect(rr, secondBlur);
73 canvas->drawRRect(rr, opaque);
|
| /external/toybox/toys/posix/ |
| H A D | ulimit.c | 61 struct rlimit rr; local
80 if (get && prlimit(TT.pid, map[i], 0, &rr)) perror_exit("-%c", flags[i]);
95 rlim_t rl = (toys.optflags&FLAG_H) ? rr.rlim_max : rr.rlim_cur;
113 if (toys.optflags&FLAG_H) rr.rlim_max = val;
114 else rr.rlim_cur = val;
115 if (prlimit(TT.pid, map[i], &rr, 0)) perror_exit(0);
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.nonmember/ |
| H A D | plus.pass.cpp | 31 std::move_iterator<It> rr = n + r; local
32 assert(rr.base() == x);
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.+/ |
| H A D | difference_type.pass.cpp | 30 std::move_iterator<It> rr = r + n; local
31 assert(rr.base() == x);
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.+=/ |
| H A D | difference_type.pass.cpp | 30 std::move_iterator<It>& rr = r += n; local
32 assert(&rr == &r);
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.-/ |
| H A D | difference_type.pass.cpp | 30 std::move_iterator<It> rr = r - n; local
31 assert(rr.base() == x);
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.decr/ |
| H A D | post.pass.cpp | 29 std::move_iterator<It> rr = r--; local
31 assert(rr.base() == i);
|
| H A D | pre.pass.cpp | 29 std::move_iterator<It>& rr = --r; local
31 assert(&rr == &r);
|
| /external/libcxx/test/std/iterators/predef.iterators/move.iterators/move.iter.ops/move.iter.op.incr/ |
| H A D | post.pass.cpp | 29 std::move_iterator<It> rr = r++; local
31 assert(rr.base() == i);
|