/freebsd/contrib/bc/manuals/ |
H A D | algorithms.md | 33 ### Division subsection in Algorithms 35 This `bc` uses Algorithm D ([long division][2]). Long division is polynomial 36 (`O(n^2)`), but unlike Karatsuba, any division "divide and conquer" algorithm 38 algorithms become less attractive with division as this operation typically 41 While the implementation of long division may appear to use the subtractive 48 1. Division and subtraction can share code (one of the less important goals of 52 Using multiplication would make division have the even worse algorithmic 67 Its complexity is `O(log(n)*n^2)` as it requires one division per iteration, and 296 It has a complexity of `O(n^3)` because of the division and factorials. 304 It has a complexity of `O(n^3)` because of the division and factorials. [all …]
|
/freebsd/contrib/unifdef/tests/ |
H A D | div.expout | 3 DIVISION 6 DIVISION 9 DIVISION
|
/freebsd/usr.bin/units/ |
H A D | units.1 | 107 Division of units is indicated by the slash 110 Division of numbers 115 Note that multiplication has a higher precedence than division, 276 .It Sy Example 3 : No Difference between Do Ic \&| Dc No and Do Ic / Dc No division 286 prints the expected result because the division operator for numbers 290 Using the division operator for units 435 to indicate division of numbers and 437 to indicate division of symbols.
|
/freebsd/crypto/openssl/external/perl/Text-Template-1.56/ |
H A D | Changes | 123 Program fragment at line 30 delivered error ``Illegal division by zero'' 127 Program fragment delivered error ``Illegal division by zero at catalog.tmpl line 37'' 136 Program fragment at line 30 delivered error ``Illegal division by zero'' 140 Program fragment delivered error ``Illegal division by zero at catalog.tmpl line 37'' 161 Illegal division by zero at template line 37. 165 Illegal division by zero at catalog.tmpl line 37. 179 Illegal division by zero at template line 37. 183 Illegal division by zero at catalog.tmpl line 37.
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Scalar/ |
H A D | DivRemPairs.h | 1 //===- DivRemPairs.h - Hoist/decompose integer division and remainder -----===// 9 // This pass hoists and/or decomposes integer division and remainder 21 /// Hoist/decompose integer division and remainder instructions to enable CFG
|
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Utils/ |
H A D | IntegerDivision.cpp | 1 //===-- IntegerDivision.cpp - Expand integer division ---------------------===// 10 // division for targets that don't have native support. It's largely derived 24 #define DEBUG_TYPE "integer-division" 410 "Trying to expand division from a non-division function"); in expandDivision() 416 // First prepare the sign if it's a signed division in expandDivision() 418 // Lower the code to unsigned division, and reset Div to point to the udiv. in expandDivision() 438 // Insert the unsigned division code in expandDivision() 473 // with 32 bit division. in expandRemainderUpTo32Bits() 519 // with 64 bit division. in expandRemainderUpTo64Bits() 555 "Trying to expand division from a non-division function"); in expandDivisionUpTo32Bits() [all …]
|
H A D | BypassSlowDivision.cpp | 1 //===- BypassSlowDivision.cpp - Bypass slow division ----------------------===// 40 #define DEBUG_TYPE "bypass-slow-division" 124 // Skip division on vector types. Only optimize integer instructions. in FastDivInsertionTask() 217 // Ignore undef values as they probably don't affect the division in isHashLikeValue() 370 // division with a short one in-place. Since we're not introducing control in insertFastDivAndRem() 371 // flow in this case, narrowing the division is always a win, even if the in insertFastDivAndRem() 404 // If the division is unsigned and Dividend is known to be short, then in insertFastDivAndRem() 407 // with a short division. in insertFastDivAndRem() 408 // 2) Divisor is greater than Dividend. In this case, no division is needed in insertFastDivAndRem()
|
/freebsd/sys/contrib/device-tree/Bindings/clock/ |
H A D | mvebu-gated-clock.txt | 23 25 tdm Time Division Mplx 48 25 tdm Time Division Mplx 77 25 tdm Time Division Multiplexing 117 25 tdm Time Division Mplx 173 20 tdm Time Division Mplx
|
H A D | apple,nco.yaml | 15 fractional division of a high frequency input clock. 32 are derived through fractional division.
|
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/ |
H A D | divsi3.c | 19 // On CPUs without unsigned hardware division support, 21 // On CPUs with unsigned hardware division support, 22 // this uses the unsigned division instruction.
|
H A D | divtf3.c | 1 //===-- lib/divtf3.c - Quad-precision division --------------------*- C -*-===// 9 // This file implements quad-precision soft-float division
|
/freebsd/crypto/openssl/external/perl/Text-Template-1.56/t/ |
H A D | broken.t | 15 is $r, q{Program fragment delivered error ``Illegal division by zero at template line 1.''}; 44 is $r, qq{1,Illegal division by zero at template line 1.\n,1/0}; 57 is $r, qq{1,Illegal division by zero at template line 1.\n,1/0};
|
/freebsd/contrib/ntp/libntp/ |
H A D | ntp_calendar.c | 10 * Calendar algorithms thrive on the division operation, which is one of 23 * Furthermore, we need floor division in many places. C either leaves 24 * the division behaviour undefined (< C99) or demands truncation to 38 * two's complement: Floor division on negative dividents can be 454 * where 'MOD' denotes the modulo operator for FLOOR DIVISION, which 455 * is not the same as the '%' operator in C: C requires division to be 456 * a truncated division, where remainder and dividend have the same 457 * sign if the remainder is not zero, whereas floor division requires 480 * to the floor division convention. 484 * division routin [all...] |
/freebsd/contrib/llvm-project/llvm/lib/Transforms/Scalar/ |
H A D | DivRemPairs.cpp | 1 //===- DivRemPairs.cpp - Hoist/[dr]ecompose division and remainder --------===// 9 // This pass hoists and/or decomposes/recomposes integer division and remainder 88 "Not a division."); in DivRemPairWorklistEntry() 149 // rare than division. in getWorklist() 151 // Find the matching division instruction from the division map. in getWorklist() 169 /// them together by hoisting or replace the common division operation that is 337 // If the remainder dominates, then hoist the division up to that block: in optimizeDivRem() 349 // If the division dominates, it's already in the right place. The mul+sub in optimizeDivRem()
|
/freebsd/contrib/one-true-awk/testdir/ |
H A D | T.errmsg | 49 division by zero 52 division by zero in /= 55 division by zero in %= 58 division by zero in mod
|
/freebsd/contrib/llvm-project/llvm/lib/Target/Mips/MCTargetDesc/ |
H A D | MipsAsmBackend.cpp | 79 // address range. Forcing a signed division because Value can be negative. in adjustFixupValue() 89 // Forcing a signed division because Value can be negative. in adjustFixupValue() 128 // Forcing a signed division because Value can be negative. in adjustFixupValue() 138 // Forcing a signed division because Value can be negative. in adjustFixupValue() 148 // Forcing a signed division because Value can be negative. in adjustFixupValue() 157 // Forcing a signed division because Value can be negative. in adjustFixupValue() 170 // Forcing a signed division because Value can be negative. in adjustFixupValue() 179 // Forcing a signed division because Value can be negative. in adjustFixupValue() 188 // Forcing a signed division because Value can be negative. in adjustFixupValue() 197 // Forcing a signed division because Value can be negative. in adjustFixupValue() [all …]
|
/freebsd/share/doc/usd/05.dc/ |
H A D | dc | 137 The result of a division is an integer truncated toward zero. 276 that are maintained during multiplication, division, and exponentiation. 467 Division 471 the scale of the result of the integer division equal to 476 Division is performed much as it would be done by hand. 498 The division routine is called and division is performed 501 Since division truncates toward zero, remainders have the same 729 The operation of division gives arbitrarily many decimal places
|
/freebsd/contrib/llvm-project/llvm/include/llvm/Transforms/Utils/ |
H A D | IntegerDivision.h | 10 // division for targets that don't have native support. It's largely derived 29 /// 32bit and 64bit scalar division. 38 /// 32bit and 64bit scalar division.
|
/freebsd/contrib/bearssl/src/int/ |
H A D | i15_muladd.c | 28 * Constant-time division. The divisor must not be larger than 16 bits, 85 * doing a 30/15 division with the high words. in br_i15_muladd_small() 103 * using a division on the top words: in br_i15_muladd_small() 128 * q-1 or q-2; moreover, the division may have returned a value in br_i15_muladd_small()
|
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/sparc64/ |
H A D | divmod.m4 | 6 * Division/Remainder 22 * ITER -- number of iterations of the main division loop which will 180 ! division loop will mess up the first time around. 218 ! Do the main division iteration
|
/freebsd/contrib/jemalloc/include/jemalloc/internal/ |
H A D | div.h | 7 * This module does the division that computes the index of a region in a slab, 10 * We do some pre-computation to do this more quickly than a CPU division
|
/freebsd/contrib/llvm-project/compiler-rt/lib/builtins/arm/ |
H A D | umodsi3.S | 21 @ Calculate and return the remainder of the (unsigned) division. 41 // Implement division using binary long division algorithm.
|
/freebsd/contrib/sendmail/cf/cf/ |
H A D | huginn.cs.mc | 17 # machine in the Computer Science Division at Berkeley, and should 21 # This file is for the backup CS Division mail server.
|
/freebsd/lib/libpmc/pmu-events/arch/x86/knightslanding/ |
H A D | floating-point.json | 21 …AVX2, AVX-512 micro-ops except for loads (memory-to-register mov-type micro ops), division, sqrt.", 25 …int, integer and store) except for loads (memory-to-register mov-type micro ops), division, sqrt.",
|
/freebsd/usr.sbin/setpmac/ |
H A D | setpmac.8 | 6 .\" Security Research Division of Network Associates, Inc. under 59 the Security Research Division of Network Associates
|