Home
last modified time | relevance | path

Searched refs:rand (Results 1 – 25 of 29) sorted by relevance

12

/oneTBB/test/tbbmalloc/
H A Dtest_malloc_shutdown_hang.cpp32 utils::Sleep(rand( ) % MAX_DELAY); in ~GlobalObject()
42 for (int i = 0; i < rand() % MAX_ITER; ++i) { in allocatorRandomThrashing()
44 for (int j = 0; j < rand() % ARRAY_SIZE; ++j) { in allocatorRandomThrashing()
45 arr[j] = scalable_malloc(rand() % MAX_ALLOC); in allocatorRandomThrashing()
H A Dtest_malloc_compliance.cpp244 return sizeof(void*)<<(rand() % POWERS_OF_2); in choose_random_alignment()
524 arr[i].size=rand()%MAX_SIZE; in AddrArifm()
565 arr[i].size=rand()%MAX_SIZE; in AddrArifm()
592 CountElement=rand()%MAX_SIZE; in Zerofilling()
679 Size=rand()%(MaxSize-MinSize)+MinSize; in NULLReturn()
697 Size=rand()%(MaxSize-MinSize)+MinSize; in NULLReturn()
735 Size=rand()%(MaxSize-MinSize)+MinSize; in NULLReturn()
829 MasCountElem[i]=rand()%MAX_SIZE; in UniquePointer()
H A Dtest_malloc_whitebox.cpp86 val(rand()), size(sz) { in AllocInfo()
157 2*minLargeObjectSize*(1.*rand()/RAND_MAX))); in operator ()()
174 (int)(minLargeObjectSize + 2*minLargeObjectSize*(1.*rand()/RAND_MAX)); in TestLargeObjectCache()
198 blocks1[i].sz = rand() % minLargeObjectSize; in operator ()()
205 blocks2[i].sz = rand() % minLargeObjectSize; in operator ()()
1111 if ( lmbArray.empty() || rand() / (RAND_MAX>>1) == 0 ) in next()
1113 size_t ind = rand()%lmbArray.size(); in next()
H A Dtest_malloc_pools.cpp605 size_t curr_algn = algn[rand() % ALGN]; in TestEntries()
606 size_t curr_sz = size[rand() % SZ]; in TestEntries()
612 size_t curr_sz1 = size[rand() % SZ]; in TestEntries()
/oneTBB/examples/parallel_for/tachyon/src/
H A Dtrace.serial.cpp108 sample.d.x += ((std::rand() % 100) - 50) / jitterscale; in render_one_pixel()
109 sample.d.y += ((std::rand() % 100) - 50) / jitterscale; in render_one_pixel()
110 sample.d.z += ((std::rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dtrace.omp.cpp110 sample.d.x += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
111 sample.d.y += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
112 sample.d.z += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dtrace.tbb1d.cpp117 sample.d.x += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
118 sample.d.y += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
119 sample.d.z += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dapigeom.cpp214 (((((rand() % 1000) - 500.0) / 500.0) * d) / 8.0); in adjust()
268 field[0 + 0] = 1.0 + (rand() % 100) / 100.0; in rt_landscape()
269 field[m - 1] = 1.0 + (rand() % 100) / 100.0; in rt_landscape()
270 field[0 + m * (n - 1)] = 1.0 + (rand() % 100) / 100.0; in rt_landscape()
271 field[m - 1 + m * (n - 1)] = 1.0 + (rand() % 100) / 100.0; in rt_landscape()
H A Dtrace.threads.cpp121 sample.d.x += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
122 sample.d.y += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
123 sample.d.z += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dtrace.taskq.cpp117 sample.d.x += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
118 sample.d.y += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
119 sample.d.z += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dtrace.threads2d.cpp124 sample.d.x += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
125 sample.d.y += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
126 sample.d.z += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dtrace.tbb.cpp146 sample.d.x += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
147 sample.d.y += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
148 sample.d.z += ((rand() % 100) - 50) / jitterscale; in render_one_pixel()
H A Dtexture.cpp153 rnum = rand() % 4096; in grit_texture()
264 NoiseMatrix[x][y][z] = rand() % 12000; in InitNoise()
/oneTBB/examples/parallel_for_each/parallel_preorder/
H A DGraph.cpp34 int op = int((rand() >> 8) % 5u); in create_random_dag()
48 Cell& input = my_vertex_set[rand() % k]; in create_random_dag()
/oneTBB/examples/concurrent_hash_map/count_strings/
H A Dcount_strings.cpp207 sounds = Vowels, rate = rand() % VowelsRatesSum[part]; in GetLetters()
209 sounds = Consonants, rate = rand() % ConsonantsRatesSum[part]; in GetLetters()
222 int type = rand(); in CreateData()
/oneTBB/test/tbb/
H A Dtest_concurrent_vector.cpp446 utils::FastRandom<> rand(thread_id); in TestConcurrentOperationsWithUnSafeOperations() local
449 std::size_t j = rand.get() % i; in TestConcurrentOperationsWithUnSafeOperations()
466 std::size_t random_operation = rand.get() % 3; in TestConcurrentOperationsWithUnSafeOperations()
475 std::size_t grow_size = rand.get() % 100; in TestConcurrentOperationsWithUnSafeOperations()
481 std::size_t grow_at_least_size = vector.size() + rand.get() % 100; in TestConcurrentOperationsWithUnSafeOperations()
H A Dtest_parallel_sort.cpp360 test_array[i] = rand() % array_size; in sort_array_test()
419 test_array[i] = rand() % array_size;
H A Dtest_task_arena.cpp61 tbb::task_arena arena( std::rand() % maxthread + 1 ); in InitializeAndTerminate()
72 arena.initialize( std::rand() % maxthread + 1 ); // change the parameters in InitializeAndTerminate()
86 arena.initialize( std::rand() % maxthread + 1 ); in InitializeAndTerminate()
/oneTBB/test/conformance/
H A Dconformance_parallel_sort.cpp33 result[i] = rand() % vector_size; in get_random_vector()
H A Dconformance_concurrent_queue.cpp1689 generate(vec_1.begin(), vec_1.end(), rand); in test_queue_helper()
1690 generate(vec_2.begin(), vec_2.end(), rand); in test_queue_helper()
1691 generate(vec_3.begin(), vec_3.end(), rand); in test_queue_helper()
1692 generate(vec_4.begin(), vec_4.end(), rand); in test_queue_helper()
/oneTBB/examples/parallel_for/game_of_life/
H A DGame_of_life.cpp59 int x = rand() / (int)(((unsigned)RAND_MAX + 1) / 100); in seed()
/oneTBB/examples/parallel_for/polygon_overlay/
H A Dpolymain.cpp695 int rrand = rand() << 15 | rand(); in NextRan()
/oneTBB/examples/graph/som/
H A Dsom.cpp74 return double(rand()) / double(RAND_MAX) * (highlimit - lowlimit) + lowlimit; in randval()
/oneTBB/examples/graph/binpack/
H A Dbinpack.cpp293 item = rand() % desired_bin_capacity + 1; // generate items that fit in a bin in main()
/oneTBB/test/common/
H A Dconcurrent_ordered_common.h76 r = std::rand() % random_threshold; in test_ordered_methods()

12