/external/deqp/modules/gles31/functional/ |
H A D | es31fCopyImageTests.cpp | 412 void genTexel (de::Random& rng, deUint32 glFormat, int texelBlockSize, const int texelCount, deUint8* buffer) argument 422 const float red = rng.getFloat(info.valueMin.x(), info.valueMax.x()); 423 const float green = rng.getFloat(info.valueMin.y(), info.valueMax.y()); 424 const float blue = rng.getFloat(info.valueMin.z(), info.valueMax.z()); 425 const float alpha = rng.getFloat(info.valueMin.w(), info.valueMax.w()); 456 const int blockNdx = rng.getInt(0, DE_LENGTH_OF_ARRAY(blocks)-1); 465 const deUint8 val = rng.getUint8(); 475 const deUint8 val = rng.getUint8(); 571 de::Random& rng, 603 genTexel(rng, moreRestrictiveForma 570 genTextureImage(const glw::Functions& gl, de::Random& rng, deUint32 name, vector<ArrayBuffer<deUint8> >& levels, const ImageInfo& info, deUint32 moreRestrictiveFormat) argument 623 genRenderbufferImage(const glw::Functions& gl, de::Random& rng, deUint32 name, vector<ArrayBuffer<deUint8> >& levels, const ImageInfo& info, deUint32 moreRestrictiveFormat) argument 709 genImage(const glw::Functions& gl, de::Random& rng, deUint32 name, vector<ArrayBuffer<deUint8> >& levels, const ImageInfo& info, deUint32 moreRestrictiveFormat) argument 864 verifyTexture2DView(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& renderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const ImageInfo& info, const tcu::Texture2DView& refTexture) argument 987 verifyTexture2D(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& textureRenderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const vector<ArrayBuffer<deUint8> >& data, const ImageInfo& info) argument 1018 verifyTexture3DView(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& renderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const ImageInfo& info, const tcu::Texture3DView& refTexture) argument 1097 verifyTexture3D(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& textureRenderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const vector<ArrayBuffer<deUint8> >& data, const ImageInfo& info) argument 1128 verifyTextureCubemapView(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& renderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const ImageInfo& info, const tcu::TextureCubeView& refTexture) argument 1210 verifyTextureCubemap(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& textureRenderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const vector<ArrayBuffer<deUint8> >& data, const ImageInfo& info) argument 1301 verifyTexture2DArrayView(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& renderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const ImageInfo& info, const tcu::Texture2DArrayView& refTexture) argument 1378 verifyTexture2DArray(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& textureRenderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const vector<ArrayBuffer<deUint8> >& data, const ImageInfo& info) argument 1514 verify(tcu::TestContext& testContext, glu::RenderContext& renderContext, TextureRenderer& textureRenderer, tcu::ResultCollector& results, de::Random& rng, deUint32 name, const vector<ArrayBuffer<deUint8> >& data, const ImageInfo& info) argument 1621 de::Random rng; member in struct:deqp::gles31::Functional::__anon3562::CopyImageTest::State 1721 de::Random& rng = m_state->rng; local 1766 de::Random& rng = m_state->rng; local 1781 de::Random& rng = m_state->rng; local [all...] |
H A D | es31fDrawBuffersIndexedTests.cpp | 1182 BlendEq getRandomBlendEq (de::Random& rng) argument 1193 return de::getSizedArrayElement<DE_LENGTH_OF_ARRAY(eqs)>(eqs, rng.getUint32() % DE_LENGTH_OF_ARRAY(eqs)); 1196 BlendFunc getRandomBlendFunc (de::Random& rng) argument 1217 const deUint32 src = de::getSizedArrayElement<DE_LENGTH_OF_ARRAY(funcs)>(funcs, rng.getUint32() % DE_LENGTH_OF_ARRAY(funcs)); 1218 const deUint32 dst = de::getSizedArrayElement<DE_LENGTH_OF_ARRAY(funcs)>(funcs, rng.getUint32() % DE_LENGTH_OF_ARRAY(funcs)); 1223 void genRandomBlendState (de::Random& rng, BlendState& blendState) argument 1225 if (rng.getBool()) 1226 blendState.enableBlend = rng.getBool(); 1228 if (rng.getBool()) 1230 if (rng 1265 getRandomFormat(de::Random& rng) argument 1301 genRandomTest(de::Random& rng, BlendState& preCommon, BlendState& postCommon, vector<DrawBufferInfo>& drawBuffers, int maxDrawBufferCount) argument [all...] |
/external/deqp/modules/glshared/ |
H A D | glsTextureBufferCase.cpp | 97 void genRandomCoords (de::Random rng, vector<deUint8>& coords, size_t offset, size_t size) argument 106 const deUint8 xBits = deUint8(rng.getUint32() & bitMask); 429 de::Random& rng, 434 genRandomCoords(rng, data, 0, texture.getBufferSize()); 443 de::Random& rng, 448 const size_t size = de::max<size_t>(minSize, size_t((texture.getSize() != 0 ? texture.getSize() : texture.getBufferSize()) * (0.7 + 0.3 * rng.getFloat()))); 450 const size_t offset = minOffset + (rng.getUint32() % (texture.getBufferSize() - (size + minOffset))); 453 genRandomCoords(rng, data, offset, size); 466 de::Random& rng, 471 const size_t size = de::max<size_t>(minSize, size_t((texture.getSize() != 0 ? texture.getSize() : texture.getBufferSize()) * (0.7 + 0.3 * rng 428 modifyBufferData(TestLog& log, de::Random& rng, glu::TextureBuffer& texture) argument 442 modifyBufferSubData(TestLog& log, de::Random& rng, const glw::Functions& gl, glu::TextureBuffer& texture) argument 465 modifyMapWrite(TestLog& log, de::Random& rng, const glw::Functions& gl, glu::TextureBuffer& texture) argument 498 modifyMapReadWrite(TestLog& log, tcu::ResultCollector& resultCollector, de::Random& rng, const glw::Functions& gl, glu::TextureBuffer& texture) argument 551 modify(TestLog& log, tcu::ResultCollector& resultCollector, glu::RenderContext& renderContext, ModifyBits modifyBits, de::Random& rng, glu::TextureBuffer& texture) argument 754 render(TestLog& log, glu::RenderContext& renderContext, RenderBits renderBits, de::Random& rng, glu::ShaderProgram& program, glu::TextureBuffer& texture, const tcu::PixelBufferAccess& target) argument 843 runTests(tcu::TestContext& testCtx, glu::RenderContext& renderContext, de::Random& rng, deUint32 format, size_t bufferSize, size_t offset, size_t size, RenderBits preRender, glu::ShaderProgram* preRenderProgram, ModifyBits modifyType, RenderBits postRender, glu::ShaderProgram* postRenderProgram) argument [all...] |
/external/guava/guava-tests/benchmark/com/google/common/collect/ |
H A D | BinaryTreeTraverserBenchmark.java | 48 Optional<BinaryNode> createTree(int size, Random rng) { 55 rng.nextInt(), createTree(leftChildSize, rng), createTree(rightChildSize, rng))); 61 Optional<BinaryNode> createTree(int size, Random rng) { 64 root = Optional.of(new BinaryNode(rng.nextInt(), root, Optional.<BinaryNode>absent())); 71 Optional<BinaryNode> createTree(int size, Random rng) { 74 root = Optional.of(new BinaryNode(rng.nextInt(), Optional.<BinaryNode>absent(), root)); 85 Optional<BinaryNode> createTree(int size, Random rng) { 88 keys[i] = rng 110 createTree(int size, Random rng) argument 172 SpecialRandom rng; field in class:BinaryTreeTraverserBenchmark [all...] |
/external/guava/guava/src/com/google/common/cache/ |
H A D | Striped64.java | 116 static final Random rng = new Random(); field in class:Striped64.HashCode 119 int h = rng.nextInt(); // Avoid zero to allow xorShift rehash
|
/external/jmonkeyengine/engine/src/android/jme3tools/android/ |
H A D | Fixed.java | 156 private static Random rng = null; field in class:Fixed 419 if (rng == null) { 420 rng = new Random(); 422 return rng.nextInt() >>> (32 - FIXED_POINT);
|
/external/kernel-headers/original/uapi/linux/ |
H A D | serial.h | 97 int cts, dsr, rng, dcd; member in struct:serial_icounter_struct
|
H A D | synclink.h | 213 __u32 cts, dsr, rng, dcd, tx, rx; member in struct:mgsl_icount
|
/external/libcxx/test/std/containers/sequences/deque/deque.capacity/ |
H A D | resize_size.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 70 const int N = sizeof(rng)/sizeof(rng[0]); 74 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 79 const int N = sizeof(rng)/sizeof(rng[0]); 83 testN<std::deque<int, min_allocator<int>>>(rng[ [all...] |
H A D | resize_size_value.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 70 const int N = sizeof(rng)/sizeof(rng[0]); 74 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 78 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 79 const int N = sizeof(rng)/sizeof(rng[0]); 83 testN<std::deque<int, min_allocator<int>>>(rng[ [all...] |
H A D | shrink_to_fit.pass.cpp | 62 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 63 const int N = sizeof(rng)/sizeof(rng[0]); 66 testN<std::deque<int> >(rng[i], rng[j]); 70 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 71 const int N = sizeof(rng)/sizeof(rng[0]); 74 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.cons/ |
H A D | assign_iter_iter.pass.cpp | 90 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 91 const int N = sizeof(rng)/sizeof(rng[0]); 95 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 100 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 101 const int N = sizeof(rng)/sizeof(rng[0]); 105 testN<std::deque<int, min_allocator<int>> >(rng[ [all...] |
H A D | assign_size_value.pass.cpp | 68 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 69 const int N = sizeof(rng)/sizeof(rng[0]); 73 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 78 const int N = sizeof(rng)/sizeof(rng[0]); 82 testN<std::deque<int, min_allocator<int>> >(rng[ [all...] |
/external/libcxx/test/std/containers/sequences/deque/deque.modifiers/ |
H A D | emplace.pass.cpp | 96 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 97 const int N = sizeof(rng)/sizeof(rng[0]); 100 testN<std::deque<Emplaceable> >(rng[i], rng[j]); 104 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 105 const int N = sizeof(rng)/sizeof(rng[0]); 108 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[ [all...] |
H A D | emplace_back.pass.cpp | 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 72 const int N = sizeof(rng)/sizeof(rng[0]); 75 testN<std::deque<Emplaceable> >(rng[i], rng[j]); 79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 80 const int N = sizeof(rng)/sizeof(rng[0]); 83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[ [all...] |
H A D | emplace_front.pass.cpp | 71 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 72 const int N = sizeof(rng)/sizeof(rng[0]); 75 testN<std::deque<Emplaceable> >(rng[i], rng[j]); 79 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 80 const int N = sizeof(rng)/sizeof(rng[0]); 83 testN<std::deque<Emplaceable, min_allocator<Emplaceable>> >(rng[i], rng[ [all...] |
H A D | erase_iter_iter.pass.cpp | 81 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 82 const int N = sizeof(rng)/sizeof(rng[0]); 85 testN<std::deque<int> >(rng[i], rng[j]); 89 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 90 const int N = sizeof(rng)/sizeof(rng[0]); 93 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | insert_iter_iter.pass.cpp | 272 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 273 const int N = sizeof(rng)/sizeof(rng[0]); 277 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 285 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 286 const int N = sizeof(rng)/sizeof(rng[0]); 290 testN<std::deque<int, min_allocator<int>> >(rng[ [all...] |
H A D | insert_rvalue.pass.cpp | 102 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 103 const int N = sizeof(rng)/sizeof(rng[0]); 106 testN<std::deque<MoveOnly> >(rng[i], rng[j]); 110 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 111 const int N = sizeof(rng)/sizeof(rng[0]); 114 testN<std::deque<MoveOnly, min_allocator<MoveOnly>> >(rng[i], rng[ [all...] |
H A D | insert_size_value.pass.cpp | 140 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 141 const int N = sizeof(rng)/sizeof(rng[0]); 145 testN<std::deque<int> >(rng[i], rng[j], rng[k]); 150 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 151 const int N = sizeof(rng)/sizeof(rng[0]); 155 testN<std::deque<int, min_allocator<int>> >(rng[ [all...] |
H A D | insert_value.pass.cpp | 122 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 123 const int N = sizeof(rng)/sizeof(rng[0]); 126 testN<std::deque<int> >(rng[i], rng[j]); 131 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 132 const int N = sizeof(rng)/sizeof(rng[0]); 135 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | pop_back.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 70 const int N = sizeof(rng)/sizeof(rng[0]); 73 testN<std::deque<int> >(rng[i], rng[j]); 77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 78 const int N = sizeof(rng)/sizeof(rng[0]); 81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | pop_front.pass.cpp | 69 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 70 const int N = sizeof(rng)/sizeof(rng[0]); 73 testN<std::deque<int> >(rng[i], rng[j]); 77 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2047, 2048, 2049}; local 78 const int N = sizeof(rng)/sizeof(rng[0]); 81 testN<std::deque<int, min_allocator<int>> >(rng[i], rng[ [all...] |
H A D | push_back.pass.cpp | 46 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local 47 const int N = sizeof(rng)/sizeof(rng[0]); 50 C c = make<C>(size, rng[j]); 60 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local 61 const int N = sizeof(rng)/sizeof(rng[0]); 63 test<std::deque<int> >(rng[j]); 67 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local 68 const int N = sizeof(rng)/sizeo [all...] |
H A D | push_back_rvalue.pass.cpp | 49 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049}; local 50 const int N = sizeof(rng)/sizeof(rng[0]); 53 C c = make<C>(size, rng[j]); 66 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local 67 const int N = sizeof(rng)/sizeof(rng[0]); 69 test<std::deque<MoveOnly> >(rng[j]); 73 int rng[] = {0, 1, 2, 3, 1023, 1024, 1025, 2046, 2047, 2048, 2049, 4094, 4095, 4096}; local 74 const int N = sizeof(rng)/sizeo [all...] |