/external/compiler-rt/test/timing/ |
H A D | udivdi3.c | 27 input1[i] = (((uint64_t)rand() << 36) | (uint64_t)rand()) >> (rand() & 63); 28 input2[i] = ((((uint64_t)rand() << 36) | (uint64_t)rand()) >> (rand() & 63)) + 1LL;
|
H A D | umoddi3.c | 27 input1[i] = (((uint64_t)rand() << 36) | (uint64_t)rand()) >> (rand() & 63); 28 input2[i] = ((((uint64_t)rand() << 36) | (uint64_t)rand()) >> (rand() & 63)) + 1LL;
|
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/skia/bench/ |
H A D | 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;
|
H A D | PathIterBench.cpp | 17 static int rand_pts(SkRandom& rand, SkPoint pts[4]) { argument 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);
|
H A D | RTreeBench.cpp | 51 SkRandom rand; variable 54 fTree->insert(reinterpret_cast<void*>(j), fProc(rand, j, NUM_BUILD_RECTS), 105 SkRandom rand; variable 108 fProc(rand, j, NUM_QUERY_RECTS), 115 SkRandom rand; variable 121 query.fLeft = rand.nextU() % GENERATE_EXTENTS; 122 query.fTop = rand.nextU() % GENERATE_EXTENTS; 127 query.fLeft = rand.nextU() % GENERATE_EXTENTS; 128 query.fTop = rand.nextU() % GENERATE_EXTENTS; 140 query.fLeft = rand 163 make_XYordered_rects(SkRandom& rand, int index, int numRects) argument 171 make_YXordered_rects(SkRandom& rand, int index, int numRects) argument 180 make_random_rects(SkRandom& rand, int index, int numRects) argument [all...] |
/external/skia/tests/ |
H A D | RTreeTest.cpp | 26 static SkIRect random_rect(SkRandom& rand) { argument 29 rect.fLeft = rand.nextS() % 1000; 30 rect.fRight = rand.nextS() % 1000; 31 rect.fTop = rand.nextS() % 1000; 32 rect.fBottom = rand.nextS() % 1000; 38 static void random_data_rects(SkRandom& rand, DataRect out[], int n) { argument 40 out[i].rect = random_rect(rand); 71 static void run_queries(skiatest::Reporter* reporter, SkRandom& rand, DataRect rects[], argument 75 SkIRect query = random_rect(rand); 83 SkRandom rand; local [all...] |
H A D | MipMapTest.cpp | 14 static void make_bitmap(SkBitmap* bm, SkRandom& rand) { argument 17 int w = 2 + rand.nextU() % 1000; 18 int h = 2 + rand.nextU() % 1000; 26 SkRandom rand; local 29 make_bitmap(&bm, rand);
|
H A D | SortTest.cpp | 19 static void rand_array(SkRandom& rand, int array[], int n) { argument 21 array[j] = rand.nextS() & 0xFF; 44 SkRandom rand; local 47 int count = rand.nextRangeU(1, SK_ARRAY_COUNT(randomArray)); 48 rand_array(rand, randomArray, count);
|
/external/chromium_org/tools/oopif/ |
H A D | iframe_server.py | 106 def generate_host(rand, params): 116 host = rand.randint(1, apply_jitter(rand, params.jitter, params.nsites)) 120 def apply_jitter(rand, jitter, n): 124 v = n - int(n * rand.uniform(0, jitter)) 162 rand = random.Random() 163 rand.seed(params.seed) 166 netloc_paths[0] = generate_host(rand, params) 168 width = apply_jitter(rand, params.size_jitter, params.width) 169 height = apply_jitter(rand, param [all...] |
/external/skia/gm/ |
H A D | imagemagnifier.cpp | 48 SkRandom rand; variable 50 int x = rand.nextULessThan(WIDTH); 51 int y = rand.nextULessThan(HEIGHT); 52 paint.setColor(rand.nextBits(24) | 0xFF000000); 53 paint.setTextSize(rand.nextRangeScalar(0, 300));
|
H A D | points.cpp | 26 static void fill_pts(SkPoint pts[], size_t n, SkLCGRandom* rand) { argument 31 SkScalar y = rand->nextUScalar1() * 480; 32 SkScalar x = rand->nextUScalar1() * 640; 40 SkLCGRandom rand; local 54 fill_pts(pts, n, &rand);
|
/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;
|
/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/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/lib/tsan/lit_tests/ |
H A D | static_init2.cc | 14 static Cache *c = my ? my : new Cache(rand()); 20 foo(new Cache(rand()));
|