| /src/external/lgpl3/mpfr/dist/tests/ |
| random2.c | 46 mp_limb_t elimb, ran, acc; local
75 ran = elimb;
79 ran >>= MPFR_LOG2_GMP_NUMB_BITS; /* Ideally log2(GMP_NUMB_BITS) */
82 /* Bit 0 of ran chooses string of ones/string of zeroes.
83 Make most significant limb be non-zero by setting bit 0 of RAN. */
84 ran |= 1;
93 ran = elimb;
97 nb = (ran >> 1) % (1 << LOGBITS_PER_BLOCK) + 1;
98 if ((ran & 1) != 0)
127 ran >>= LOGBITS_PER_BLOCK + 1
[all...] |
| /src/external/gpl3/gdb.old/dist/gdbsupport/ |
| selftest.cc | 74 int ran = 0; local
99 ++ran;
121 debug_printf (_("Ran %d unit tests, %zu failed\n"),
122 ran, failed.size ());
|
| /src/external/lgpl3/gmp/dist/mpn/generic/ |
| random2.c | 51 mp_limb_t ran, ranm; /* buffer for random bits */ local
57 ran = ranm;
60 bit_pos = ran % GMP_NUMB_BITS;
|
| /src/external/gpl3/gdb/dist/gdbsupport/ |
| selftest.cc | 74 int ran = 0; local
99 ++ran;
121 debug_printf (_("Ran %d unit tests, %zu failed\n"),
122 ran, failed.size ());
|
| /src/external/mit/isl/dist/ |
| isl_morph.c | 32 __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran,
37 if (!dom || !ran || !map || !inv)
46 morph->ran = ran;
53 isl_basic_set_free(ran);
74 isl_basic_set_copy(morph->ran),
98 isl_basic_set_free(morph->ran);
138 isl_space *dom, *ran, *space; local
157 ran = isl_morph_get_ran_space(morph);
158 space = isl_space_map_from_domain_and_range(dom, ran);
487 isl_basic_set *dom, *ran; local
577 isl_basic_set *dom, *ran; local
688 isl_basic_set *ran; local
719 isl_basic_set *dom, *ran; local
[all...] |
| isl_morph.h | 25 * "map" is an affine mapping from "dom" to "ran"
32 isl_basic_set *ran; member in struct:isl_morph
42 __isl_take isl_basic_set *dom, __isl_take isl_basic_set *ran,
|
| isl_pw_morph_templ.c | 29 isl_space_copy(morph->ran->dim), space);
|
| isl_transitive_closure.c | 853 * element from ran R \times Z, such that the first n coordinates of the
865 * x in dom R and x + d in ran R and
971 * with domain and/or range outside of dom and ran.
974 __isl_keep isl_set *dom, __isl_keep isl_set *ran)
981 if (d < 0 || !dom || !ran)
1000 subset = isl_set_is_subset(s, ran);
1022 * ran map_i \cap dom map_j = \emptyset
1029 * ran map_j \subseteq C
1033 * dom map_i \cap ran map_j = \emptyset
1042 isl_set **dom, isl_set **ran, int *left, int *right
1312 isl_set **ran = NULL; local
[all...] |
| isl_factorization.c | 103 isl_basic_set *ran; local
121 ran = isl_basic_set_universe(space);
122 morph = isl_morph_alloc(dom, ran, Q, U);
|
| isl_space.c | 1609 isl_space *ran, *dom1, *dom2, *nest; local
1618 ran = isl_space_range(isl_space_copy(left));
1624 return isl_space_join(isl_space_reverse(nest), ran);
3168 isl_space *dom, *ran; local
3178 ran = isl_space_unwrap(isl_space_range(space));
3181 ran_dom = isl_space_domain(isl_space_copy(ran));
3182 ran_ran = isl_space_range(ran);
3185 ran = isl_space_join(isl_space_from_domain(dom_ran),
3188 isl_space_from_range(isl_space_wrap(ran)));
3207 isl_space *dom, *ran; local
3281 isl_space *dom, *ran; local
[all...] |
| /src/external/bsd/jemalloc.old/dist/test/unit/ |
| background_thread.c | 87 bool ran = false; local
91 ran = true;
94 if (ran) {
|
| background_thread_init.c | 147 bool ran = false; local
148 while (!ran) {
151 ran = true;
155 if (ran) {
|
| /src/external/bsd/jemalloc/dist/test/unit/ |
| background_thread_init.c | 147 bool ran = false; local
148 while (!ran) {
151 ran = true;
155 if (ran) {
|
| background_thread.c | 87 bool ran = false; local
91 ran = true;
94 if (ran) {
|
| /src/external/lgpl3/gmp/dist/tests/mpn/ |
| t-div.c | 137 mp_limb_t ran; local
255 ran = urandom ();
296 scratch[itch] = ran;
301 ASSERT_ALWAYS (ran == scratch[itch]);
311 scratch[itch] = ran;
314 ASSERT_ALWAYS (ran == scratch[itch]);
321 scratch[itch] = ran;
327 ASSERT_ALWAYS (ran == scratch[itch]);
332 scratch[itch] = ran;
335 ASSERT_ALWAYS (ran == scratch[itch])
[all...] |
| t-minvert.c | 66 mp_limb_t ran; local
133 scratch[itch] = ran = urandom ();
141 if (rres != tres || (rres == 1 && !mpz_eq_mpn (tp, n, r)) || ran != scratch[itch])
152 if (ran != scratch[itch])
|
| t-bdiv.c | 141 mp_limb_t ran; local
235 ran = random_word (rands);
297 scratch[itch] = ran;
302 ASSERT_ALWAYS (ran == scratch[itch]);
319 scratch[itch] = ran;
324 ASSERT_ALWAYS (ran == scratch[itch]);
336 scratch[itch] = ran;
339 ASSERT_ALWAYS (ran == scratch[itch]);
|
| /src/games/sail/ |
| dr_2.c | 180 int row, col, dir, total, ran; local
192 ran = range(ship, to);
193 total = -50 * ran;
194 if (ran < 4 && gunsbear(ship, to))
196 if ((ran = portside(ship, to, 1) - fp->dir) == 4 || ran == -4)
|
| /src/common/dist/zlib/contrib/minizip/ |
| skipset.h | 118 ui64_t ran; /* a precious trove of random bits */ member in struct:set_s
242 set->ran = 1;
331 if (set->ran == 1)
332 /* Ran out. Get another 32 random bits. */
333 set->ran = set_rand(&set->gen) | (1ULL << 32);
334 int bit = set->ran & 1;
335 set->ran >>= 1;
|
| /src/games/adventure/ |
| extern.h | 112 int ran(int);
|
| wizard.c | 156 ran(int range) function
|
| subr.c | 145 if (ran(100) < n)
179 j = 1 + ran(5);
210 j = 1 + ran(j);
264 if (ran(1000) < 95 * (dflag - 2))
884 if (ran(3) == 0 || saved != -1)
|
| /src/usr.bin/make/unit-tests/ |
| recursive.mk | 21 # 2020-08-06, when make ran in -dL mode, it reported: "Variable am__v_lt_ is
|
| /src/external/mit/lua/dist/src/ |
| lmathlib.c | 525 ** Project the random integer 'ran' into the interval [0, n].
526 ** Because 'ran' has 2^B possible values, the projection can only be
530 ** 'n'. We then project 'ran' into the interval [0, lim]. If the result
531 ** is inside [0, n], we are done. Otherwise, we try with another 'ran',
534 static lua_Unsigned project (lua_Unsigned ran, lua_Unsigned n,
537 return ran & n; /* no bias */
552 while ((ran &= lim) > n) /* project 'ran' into [0..lim] */
553 ran = I2UInt(nextrand(state->s)); /* not inside [0..n]? try again */
554 return ran;
[all...] |
| /src/external/mit/isl/dist/doc/ |
| manual.tex | 66 \def\range{\mathop{\rm ran}\nolimits}
|
