Home
last modified time | relevance | path

Searched refs:divisors (Results 1 – 7 of 7) sorted by relevance

/freebsd/crypto/libecc/src/examples/basic/
H A Dnn_pollard_rho.c136 nn divisors[MAX_DIVISORS]; in find_divisors() local
141 divisors[i].magic = WORD(0); in find_divisors()
161 ret = nn_init(&(divisors[i]), 0); EG(ret, err); in find_divisors()
168 ret = pollard_rho(&(divisors[n_divisors_found]), &n, c); in find_divisors()
174 ret = nn_cmp(&(divisors[n_divisors_found]), &(divisors[i]), &cmp); EG(ret, err); in find_divisors()
184 nn_print("d:", &(divisors[n_divisors_found])); in find_divisors()
189 ret = nn_divrem(&q, &r, &n, &(divisors[n_divisors_found])); EG(ret, err); in find_divisors()
220 nn_uninit(&(divisors[i])); in find_divisors()
/freebsd/sys/contrib/device-tree/Bindings/arm/apm/
H A Dscu.txt4 clock enable/disables, clock divisors and other deepsleep registers.
/freebsd/sys/contrib/device-tree/Bindings/serial/
H A Dmvebu-uart.txt19 of UART. TBG clock (with UART TBG divisors d1=d2=1) or xtal clock
/freebsd/sys/contrib/device-tree/Bindings/clock/ti/
H A Ddivider.txt61 - ti,dividers : array of integers defining divisors
/freebsd/contrib/googletest/docs/reference/
H A Dassertions.md364 // Returns true if m and n have no common divisors except 1.
463 // Returns true if m and n have no common divisors except 1.
/freebsd/crypto/openssl/doc/man3/
H A DBN_generate_prime.pod156 If the trial division is done, and no divisors are found and B<cb>
/freebsd/contrib/one-true-awk/testdir/
H A Dfunstack.in4691 …keywords = "algebra; algebraic expressions; equivalence; greatest common divisors; polynomial;…
15331 …abstract = "The elementary divisors of a tensor product of linear transformations have been kn…
15337 …keywords = "combinatorial; combinatorial mathematics; consequence; elementary divisors; linear…
17898 …abstract = "A fast algorithm for division by constant divisors is presented. The method has pr…
17904 …keywords = "bit addressable memory; computer programming; constant divisors; digital arithmeti…