Searched refs:rand (Results 1 – 25 of 66) sorted by relevance
123
30 i1 = rand(); in main()31 i2 = rand(); in main()33 j1 = rand(); in main()34 j2 = rand(); in main()
20 #undef rand25 rand (void) in rand() function
58 rand; rand_r; random; random_r; realpath; rpmatch;
107 rand \
454 extern int rand (void) __THROW;
157 test_arr[i].dst = (rand () & (max_size - 1)); in do_test()158 test_arr[i].dst &= ~dst_align_arr[rand () & ALIGN_MASK]; in do_test()159 test_arr[i].src = (rand () & (max_size - 1)); in do_test()160 test_arr[i].src &= ~src_align_arr[rand () & ALIGN_MASK]; in do_test()161 test_arr[i].len = size_arr[rand () & SIZE_MASK]; in do_test()
82 random_block_sizes[i] = get_block_size (rand ()); in init_random_values()85 random_offsets[i] = rand () % WORKING_SET_SIZE; in init_random_values()
296 hs[i] = (rand () & 255) > 155 ? 'a' : 'b'; in test_hard_needle()325 hs[i] = (rand () & 255) >= 128 ? 'a' : 'b'; in test_hard_needle()
259 int x = rand () & 255; in test_main()
169 if (rand () > perc_zero_int) in do_rand_test()
47 int njobs = rand () % (count + 1); in tf()49 if ((rand () % 30) == 0) in tf()
129 bitset(bitoffset, rand() & 1); in pattern_fill()136 bitset(bitoffset, op ^= (rand() & 1)); in pattern_fill()146 int r = rand() & 1; in pattern_fill()150 bitset(bitoffset, rand() & (op ^ 1)); in pattern_fill()
42 contents[i] = 'a' + (rand () % 26); in do_test()
174 result[i] = 'a' + (rand () % 26); in random_string()
113 unsigned int rand; member
124 values[i].num[j] = rand (); in do_test()
41 rand_mask = rand () & 0xFF; in check()
238 *p = rand () >> 24; in do_test()
135 function int rand (void)
1439 @w{ISO C} interface, @code{rand} and @code{srand}. The SVID functions1447 * ISO Random:: @code{rand} and friends.1466 value the @code{rand} function can return. In @theglibc{}, it is1471 @deftypefun int rand (void)1475 The @code{rand} function returns the next pseudo-random number in the1484 pseudo-random numbers. If you call @code{rand} before a seed has been1500 just as @code{rand} does. However, all its state is stored in the2008 @code{2^32−1} (inclusive), which is twice the range of @code{rand} and
524 @code{rand} and @code{srand} functions, were written by Earl T. Cohen
454 if (fp (rand (), &uc) != 0)
71 uint32_t ch = 1 + (rand () % 521); in make_random_string()
79 AkH-14-c1 írandó
1580 GLIBC_2.35 rand F