| /freebsd/crypto/libecc/src/examples/basic/ |
| H A D | nn_pollard_rho.c | 129 /* Maximum number of divisors we support */
131 /* Function to find prime divisors of the NN input */
136 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()
187 * to find new divisors. If n / d is prime, we are done! in find_divisors()
189 ret = nn_divrem(&q, &r, &n, &(divisors[n_divisors_found])); EG(ret, err); in find_divisors()
[all …]
|
| /freebsd/sys/dev/qcom_clk/ |
| H A D | qcom_clk_fepll.c | 51 * It's a fixed PLL clock that feeds a bunch of divisors into
56 * instance of the FEPLL, and then normal divisors will feed into
|
| /freebsd/sys/contrib/device-tree/Bindings/arm/apm/ |
| H A D | scu.txt | 4 clock enable/disables, clock divisors and other deepsleep registers.
|
| /freebsd/share/man/man4/ |
| H A D | atrtc.4 | 54 divisors.
|
| H A D | eventtimers.4 | 103 timer supports only power-of-2 divisors.
|
| /freebsd/sys/contrib/device-tree/Bindings/serial/ |
| H A D | mvebu-uart.txt | 19 of UART. TBG clock (with UART TBG divisors d1=d2=1) or xtal clock
|
| /freebsd/sys/contrib/device-tree/Bindings/clock/ti/ |
| H A D | divider.txt | 61 - ti,dividers : array of integers defining divisors
|
| H A D | ti,divider-clock.yaml | 84 array of integers defining divisors
|
| /freebsd/sys/sys/ |
| H A D | pidctrl.h | 78 * Reasonable default divisors.
|
| /freebsd/share/man/man9/ |
| H A D | eventtimers.9 | 125 Timer supports only 2^n divisors.
|
| /freebsd/sys/arm/ti/am335x/ |
| H A D | am335x_ehrpwm.c | 272 /* Handle requested period too long for available clock divisors. */ in am335x_ehrpwm_cfg_period()
278 * clock divisors and period register. in am335x_ehrpwm_cfg_period()
|
| H A D | am335x_lcd.c | 248 /* Raster mode case: divisors are in range from 2 to 255 */ in am335x_lcd_calc_divisor()
|
| /freebsd/contrib/googletest/docs/reference/ |
| H A D | assertions.md | 364 // 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/sys/arm/freescale/imx/ |
| H A D | imx_i2c.c | 107 * A table of available divisors and the associated coded values to put in the
109 * can see between divisors and the codes that go into the register. The table
|
| /freebsd/secure/lib/libcrypto/man/man3/ |
| H A D | BN_generate_prime.3 | 207 If the trial division is done, and no divisors are found and \fBcb\fR
|
| /freebsd/crypto/openssl/doc/man3/ |
| H A D | BN_generate_prime.pod | 156 If the trial division is done, and no divisors are found and B<cb>
|
| /freebsd/contrib/llvm-project/llvm/lib/Support/ |
| H A D | SlowDynamicAPInt.cpp | 213 assert(RHS >= 1 && "mod is only supported for positive divisors!"); in mod()
|
| /freebsd/sys/dev/sound/macio/ |
| H A D | i2s.c | 458 * and the I2S bit block (SCLK) and set the divisors as in i2s_setup()
|
| /freebsd/sys/dev/qcom_gcc/ |
| H A D | qcom_gcc_ipq4018_clock.c | 388 * Divisor table for the 2g/5g wifi clock divisors.
|
| /freebsd/sys/kern/ |
| H A D | kern_clock.c | 420 * Set divisors to 1 (normal case) and let the machine-specific in initclocks()
|
| /freebsd/contrib/llvm-project/llvm/lib/CodeGen/SelectionDAG/ |
| H A D | TargetLowering.cpp | 6737 // If all lanes are tautological (either all divisors are ones, or divisor in prepareUREMEqFold()
6758 // If all divisors are power-of-two, we will prefer to avoid the fold. in prepareUREMEqFold()
6854 // divisors as a performance improvement, since rotating by 0 is a no-op. in prepareUREMEqFold()
6990 // WARNING: this fold is only valid for positive divisors! in prepareSREMEqFold()
6997 // If all divisors are ones, we will prefer to avoid the fold. in prepareSREMEqFold()
7013 // If all divisors are power-of-two, we will prefer to avoid the fold. in prepareSREMEqFold()
7136 // divisors as a performance improvement, since rotating by 0 is a no-op. in prepareSREMEqFold()
7155 // That fold is only valid for positive divisors. Which effectively means, in prepareSREMEqFold()
7156 // it is invalid for INT_MIN divisors. So if we have such a lane, in prepareSREMEqFold()
7178 // Which lanes had INT_MIN divisors? Divisor is constant, so const-folded. in prepareSREMEqFold()
[all …]
|
| /freebsd/sys/dev/ffec/ |
| H A D | if_ffec.c | 1723 * various divisors showed that the root speed was 66 MHz (clk_ipg_root in ffec_attach()
|
| /freebsd/sys/dev/sym/ |
| H A D | sym_hipd.c | 1606 u_char clock_divn; /* Number of clock divisors */
2364 * Divisors are multiplied by 10,000,000 in order to make
2511 * The C1010 uses hardwired divisors for async. in sym_prepare_setting()
3325 int div = np->clock_divn; /* Number of divisors supported */ in sym_getsync()
3350 * using higher clock divisors. in sym_getsync()
|
| /freebsd/contrib/bc/project/ |
| H A D | github_prs.json | 4542 …nt for small integer divisors,\nit makes sense to extend the divisor if it i ssmall. In fact, it s…
4796 …nt for small integer divisors,\nit makes sense to extend the divisor if it i ssmall. In fact, it s…
|
| /freebsd/sys/dev/usb/serial/ |
| H A D | uftdi.c | 1521 * chips that support all 8 fractional divisors, just round 16ths to in uftdi_encode_baudrate()
|