| /src/contrib/bc/tests/bc/ |
| H A D | divmod.txt | 2 v = divmod(0, 1, v[]); v[0]; v 3 v = divmod(0, 321566, v[]); v[0]; v 4 v = divmod(0, 0.3984567238456, v[]); v[0]; v 5 v = divmod(1, 1, v[]); v[0]; v 6 v = divmod(1, 1287469297356, v[]); v[0]; v 7 v = divmod(1, 0.2395672438567234, v[]); v[0]; v 8 v = divmod(1, 237586239856.0293596728392360, v[]); v[0]; v 9 v = divmod(1249687284356, 3027949207835207, v[]); v[0]; v 10 v = divmod(378617298617396719, 35748521, v[]); v[0]; v 11 v = divmod(9348576237845624358, 0.9857829375461, v[]); v[0]; v [all …]
|
| H A D | errors.txt | 255 divmod 24 257 divmod(if 259 divmod(24) 261 divmod(24 24) 263 divmod(24,) 265 divmod(24, 267 divmod(24,5 269 divmod(24,5) 271 divmod(24,5,) 273 divmod(24,5, [all …]
|
| H A D | all.txt | 177 divmod
|
| /src/contrib/bc/scripts/ |
| H A D | sqrt_random.bc | 38 bits = divmod(bits, 2, negpow[]) 41 bits = divmod(bits, 2, square[]) 48 bits = divmod(bits, 2, small[]) 54 bits = divmod(bits, 2, small[]) 63 bits = divmod(bits, 2, extra_digits[]) 115 bits = divmod(bits, 2, zero_scale[])
|
| /src/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/ |
| H A D | generate.sh | 3 m4 divmod.m4 | sed -e 's/[[:space:]]*$//' | grep -v '^$' > modsi3.S 4 m4 -DANSWER=quotient divmod.m4 | sed -e 's/[[:space:]]*$//' | grep -v '^$' > divsi3.S
|
| /src/contrib/bc/gen/ |
| H A D | lib2.bc | 456 a=divmod(a,2,m[]) 458 b=divmod(b,2,m[]) 475 a=divmod(a,2,m[]) 476 if(!m[0])b=divmod(b,2,m[]) 493 a=divmod(a,2,m[]) 494 b=divmod(b,2,n[]) 512 x=divmod(x,2,m[]) 532 x=divmod(x,2,m[]) 553 x=divmod(x,2^(n-p),m[]) 572 x=divmod(x,2^p,m[])
|
| H A D | dc_help.txt | 51 2) This dc implements the GNU extensions for divmod ("~") and modular
|
| /src/contrib/bc/tests/dc/ |
| H A D | all.txt | 10 divmod
|
| /src/contrib/bc/vs/tests/ |
| H A D | tests_dc.bat | 18 divmod
|
| H A D | tests_bc.bat | 24 divmod
|
| /src/usr.bin/dtc/ |
| H A D | input_buffer.cc | 740 struct divmod : public binary_operator<5, T> struct 776 expr = new divmod<std::modulus<valty>>(l, "/"); in parse_binary_expression() 782 expr = new divmod<std::divides<valty>>(l, "/"); in parse_binary_expression()
|
| /src/sys/contrib/openzfs/tests/test-runner/bin/ |
| H A D | test-runner.py.in | 93 m, s = divmod(monotonic_time() - self.starttime, 60) 1019 m, s = divmod(time() - self.starttime, 60) 1020 h, m = divmod(m, 60)
|
| /src/crypto/libecc/src/arithmetic_tests/ |
| H A D | arithmetic_tests_generator.py | 1089 quotient, remainder = divmod(d, 2)
|
| /src/contrib/bc/ |
| H A D | README.md | 380 * For `bc` only, the `divmod()` built-in function for computing a quotient and
|
| H A D | NEWS.md | 500 * Added `dc`'s modular exponentiation and divmod to `bc`. 1519 9. Performance was further enhanced by using a "divmod" function to reduce
|
| /src/crypto/libecc/scripts/ |
| H A D | expand_libecc.py | 97 quotient, remainder = divmod(d, 2)
|