HomeSort by relevance Sort by last modified time
    Searched defs:rand (Results 1 - 25 of 145) sorted by null

1 2 3 4 5 6

  /bionic/libc/bionic/
rand.cpp 19 // The BSD rand/srand is very weak. glibc just uses random/srandom instead.
23 int rand() { function
  /external/chromium_org/v8/test/mjsunit/regress/
regress-2612.js 44 function rand() { function
61 source += [varname(i), "=", rand(), ","].join("");
  /external/chromium_org/net/quic/crypto/
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));
  /external/chromium_org/third_party/libsrtp/srtp/crypto/include/
kernel_compat.h 68 /* rand() implementation. */
71 static INLINE int rand(void) function
prng.h 62 rand_source_func_t rand; /* random source for re-initialization */ member in struct:__anon17450
79 rand_source_func_t rand; /* random source for re-initialization */ member in struct:__anon17451
  /external/chromium_org/third_party/skia/bench/
LineBench.cpp 34 SkRandom rand; local
36 fPts[i].set(rand.nextUScalar1() * 640, rand.nextUScalar1() * 480);
MemcpyBench.cpp 33 SkRandom rand; variable
35 fSrc[i] = rand.nextU();
PathIterBench.cpp 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) {
18 int n = rand.nextU() & 3;
22 pts[i].fX = rand.nextSScalar1();
23 pts[i].fY = rand.nextSScalar1();
38 SkRandom rand; local
41 int n = rand_pts(rand, pts);
ColorPrivBench.cpp 23 SkRandom rand; variable
25 fSrcs[i] = SkPreMultiplyColor(rand.nextU());
26 fDsts[i] = SkPreMultiplyColor(rand.nextU());
FSRectBench.cpp 27 SkRandom rand; variable
32 fRects[i].fLeft = -kMinOffset - SkScalarMul(rand.nextUScalar1(), kOffsetRange);
33 fRects[i].fTop = -kMinOffset - SkScalarMul(rand.nextUScalar1(), kOffsetRange);
34 fRects[i].fRight = W + kMinOffset + SkScalarMul(rand.nextUScalar1(), kOffsetRange);
35 fRects[i].fBottom = H + kMinOffset + SkScalarMul(rand.nextUScalar1(), kOffsetRange);
36 fColors[i] = rand.nextU() | 0xFF000000;
MatrixConvolutionBench.cpp 42 SkRandom rand; local
44 SkRect r = SkRect::MakeWH(rand.nextUScalar1() * 400,
45 rand.nextUScalar1() * 400);
  /external/chromium_org/third_party/skia/gm/
arcofzorro.cpp 36 SkRandom rand; variable
48 SkColor color = rand.nextU();
discard.cpp 57 SkRandom rand; variable
62 SkColor color = rand.nextU() | 0xFF404040;
63 switch (rand.nextULessThan(3)) {
getpostextpath.cpp 59 SkLCGRandom rand; local
63 pos[i].set(x, y + rand.nextSScalar1() * 24);
  /external/chromium_org/third_party/skia/tests/
MipMapTest.cpp 13 static void make_bitmap(SkBitmap* bm, SkRandom& rand) {
16 int w = 2 + rand.nextU() % 1000;
17 int h = 2 + rand.nextU() % 1000;
24 SkRandom rand; local
27 make_bitmap(&bm, rand);
SortTest.cpp 18 static void rand_array(SkRandom& rand, int array[], int n) {
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);
  /external/chromium_org/third_party/tcmalloc/chromium/src/base/
spinlock_internal.cc 83 static base::subtle::Atomic64 rand; local
84 uint64 r = base::subtle::NoBarrier_Load(&rand);
86 base::subtle::NoBarrier_Store(&rand, r);
  /external/chromium_org/third_party/tcmalloc/vendor/src/base/
spinlock_internal.cc 83 static base::subtle::Atomic64 rand; local
84 uint64 r = base::subtle::NoBarrier_Load(&rand);
86 base::subtle::NoBarrier_Store(&rand, r);
  /external/fio/lib/
zipf.h 5 #include "rand.h"
13 struct frand_state rand; member in struct:zipf_state
  /external/libcxx/test/numerics/rand/rand.eng/rand.eng.lcong/
discard.pass.cpp 32 rand() function
66 rand<unsigned int>();
67 rand<unsigned long>();
68 rand<unsigned long long>();
  /development/ndk/platforms/android-L/include/
stdlib.h 111 #if (defined(__i386__) || defined(__x86_64__)) && defined(rand)
112 #undef rand macro
116 int rand(void);
  /external/chromium_org/crypto/
p224_spake_unittest.cc 84 const uint32 rand = i * 16777619; local
91 if ((rand & 1) == round) {
92 const bool server_or_client = rand & 2;
94 if (rand & 4) {
100 const size_t bit_to_corrupt = (rand >> 3) % bits;
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9/
string-fasta.js 8 function rand(max) { function
66 var r = rand(1);
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-0.9.1/
string-fasta.js 8 function rand(max) { function
66 var r = rand(1);
  /external/chromium_org/third_party/WebKit/PerformanceTests/SunSpider/tests/sunspider-1.0/
string-fasta.js 8 function rand(max) { function
66 var r = rand(1);

Completed in 637 milliseconds

1 2 3 4 5 6