/external/skia/samplecode/ |
H A D | SamplePoints.cpp | 42 static void fill_pts(SkPoint pts[], size_t n, SkRandom* rand) { argument 44 pts[i].set(rand->nextUScalar1() * 640, rand->nextUScalar1() * 480); 50 SkRandom rand; local 64 fill_pts(pts, n, &rand);
|
/external/skia/tests/ |
H A D | MipMapTest.cpp | 13 static void make_bitmap(SkBitmap* bm, SkRandom& rand) { argument 16 int w = 2 + rand.nextU() % 1000; 17 int h = 2 + rand.nextU() % 1000; 24 SkRandom rand; local 27 make_bitmap(&bm, rand);
|
H A D | SortTest.cpp | 18 static void rand_array(SkRandom& rand, int array[], int n) { argument 20 array[j] = rand.nextS() & 0xFF; 42 SkRandom rand; local 45 int count = rand.nextRangeU(1, SK_ARRAY_COUNT(randomArray)); 46 rand_array(rand, randomArray, count);
|
H A D | RandomTest.cpp | 63 SkRandom rand; local 65 bins[(rand.nextU() >> shift) & 0xff]++; 75 SkRandom rand; local 77 float f = rand.nextF(); 85 float f = rand.nextF(); 110 SkRandom rand; local 116 unsigned int rnd = rand.nextU(); 123 unsigned int rnd = rand.nextU(); 163 SkRandom rand; local 166 (void) rand [all...] |
/external/chromium_org/net/quic/crypto/ |
H A D | curve25519_key_exchange_test.cc | 21 QuicRandom* const rand = QuicRandom::GetInstance(); local 24 const string alice_key(Curve25519KeyExchange::NewPrivateKey(rand)); 25 const string bob_key(Curve25519KeyExchange::NewPrivateKey(rand));
|
H A D | curve25519_key_exchange.h | 29 // NewPrivateKey returns a private key, generated from |rand|, suitable for 31 static std::string NewPrivateKey(QuicRandom* rand); 34 virtual KeyExchange* NewKeyPair(QuicRandom* rand) const OVERRIDE;
|
H A D | curve25519_key_exchange.cc | 46 string Curve25519KeyExchange::NewPrivateKey(QuicRandom* rand) { argument 48 rand->RandBytes(private_key, sizeof(private_key)); 58 KeyExchange* Curve25519KeyExchange::NewKeyPair(QuicRandom* rand) const { 59 const string private_value = NewPrivateKey(rand);
|
H A D | ephemeral_key_source.h | 34 QuicRandom* rand,
|
/external/chromium_org/v8/test/mjsunit/ |
H A D | unicodelctest-no-optimization.js | 59 function rand() { function 75 var c = rand(); 78 if (rand() & 1) { 82 if (rand() & 31 == 0) c = 0xfff8 + (rand() & 7) 83 if (rand() & 31 == 0) c = (rand() & 7) 86 if (rand() & 1) c = last + (rand() & 15) - 8; 96 var len = rand() [all...] |
H A D | unicodelctest.js | 58 function rand() { function 74 var c = rand(); 77 if (rand() & 1) { 81 if (rand() & 31 == 0) c = 0xfff8 + (rand() & 7) 82 if (rand() & 31 == 0) c = (rand() & 7) 85 if (rand() & 1) c = last + (rand() & 15) - 8; 94 var len = rand() [all...] |
/external/compiler-rt/test/builtins/timing/ |
H A D | floatdidf.c | 26 input[i] = (((uint64_t)rand() << 32) | (uint64_t)rand()) >> (rand() & 63);
|
H A D | floatdisf.c | 26 input[i] = (((uint64_t)rand() << 32) | (uint64_t)rand()) >> (rand() & 63);
|
H A D | floatdixf.c | 26 input[i] = (((uint64_t)rand() << 32) | (uint64_t)rand()) >> (rand() & 63);
|
H A D | floatundidf.c | 23 input[i] = (((uint64_t)rand() << 32) | (uint64_t)rand()) >> (rand() & 63);
|
H A D | floatundisf.c | 26 input[i] = (((uint64_t)rand() << 32) | (uint64_t)rand()) >> (rand() & 63);
|
H A D | floatundixf.c | 26 input[i] = (((uint64_t)rand() << 32) | (uint64_t)rand()) >> (rand() & 63);
|
H A D | negdi2.c | 26 input[i] = (((int64_t)rand() << 36) | (uint64_t)rand()) >> (rand() & 63);
|
/external/ceres-solver/internal/ceres/ |
H A D | random.h | 46 return rand() % n; 50 double r = static_cast<double>(rand());
|
/external/chromium_org/v8/test/mjsunit/regress/ |
H A D | regress-2612.js | 44 function rand() { function 61 source += [varname(i), "=", rand(), ","].join("");
|
/external/compiler-rt/test/builtins/Unit/ |
H A D | paritydi2_test.c | 47 if (test__paritydi2(((di_int)rand() << 32) + rand()))
|
/external/compiler-rt/test/tsan/ |
H A D | static_init2.cc | 14 static Cache *c = my ? my : new Cache(rand()); 20 foo(new Cache(rand()));
|
H A D | static_init4.cc | 17 g_other = rand(); 18 return new Cache(rand());
|
/external/chromium_org/third_party/skia/tests/ |
H A D | RandomTest.cpp | 63 SkRandom rand; local 65 bins[(rand.nextU() >> shift) & 0xff]++; 75 SkRandom rand; local 77 float f = rand.nextF(); 85 float f = rand.nextF(); 110 SkRandom rand; local 116 unsigned int rnd = rand.nextU(); 123 unsigned int rnd = rand.nextU(); 163 SkRandom rand; local 166 (void) rand [all...] |
/external/chromium_org/third_party/skia/bench/ |
H A D | HairlinePathBench.cpp | 92 SkRandom rand; variable 101 int base1 = 2 * rand.nextULessThan(hSize); 102 int base2 = 2 * rand.nextULessThan(hSize); 103 int base3 = 2 * rand.nextULessThan(hSize); 124 SkRandom rand; variable 133 int base1 = 2 * rand.nextULessThan(hSize); 134 int base2 = 2 * rand.nextULessThan(hSize); 135 int base3 = 2 * rand.nextULessThan(hSize); 156 SkRandom rand; variable 166 int base1 = 2 * rand 207 SkRandom rand; variable [all...] |
/external/skia/bench/ |
H A D | HairlinePathBench.cpp | 92 SkRandom rand; variable 101 int base1 = 2 * rand.nextULessThan(hSize); 102 int base2 = 2 * rand.nextULessThan(hSize); 103 int base3 = 2 * rand.nextULessThan(hSize); 124 SkRandom rand; variable 133 int base1 = 2 * rand.nextULessThan(hSize); 134 int base2 = 2 * rand.nextULessThan(hSize); 135 int base3 = 2 * rand.nextULessThan(hSize); 156 SkRandom rand; variable 166 int base1 = 2 * rand 207 SkRandom rand; variable [all...] |