/linux/arch/arm/lib/ |
H A D | div64.S | 29 * __do_div64: perform a division with 64-bit dividend and 32-bit divisor. 84 @ The division loop for needed upper bit positions. 100 @ The division loop for lower bit positions. 140 @ If possible, branch for another shift in the division loop. 147 8: @ Division by a power of 2: determine what that divisor order is 187 @ eq -> division by 1: obvious enough... 198 @ Division by 0:
|
H A D | lib1funcs.S | 2 * linux/arch/arm/lib/lib1funcs.S: Optimized ARM division routines 56 @ at the left end of each 4 bit nibbles in the division loop 65 @ division loop. Continue shifting until the divisor is 85 @ Division loop 152 @ division loop. Continue shifting until the divisor is 272 subs r2, r1, #1 @ division by 1 or -1 ?
|
/linux/arch/alpha/include/uapi/asm/ |
H A D | gentrap.h | 11 #define GEN_INTDIV -2 /* integer division by zero */ 13 #define GEN_FLTDIV -4 /* fp division by zero */ 18 #define GEN_DECDIV -9 /* decimal division by zero */
|
H A D | fpu.h | 12 #define FPCR_DZED (1UL<<50) /* division by zero disable (opt.) */ 15 #define FPCR_DZE (1UL<<53) /* division by zero */ 45 #define IEEE_TRAP_ENABLE_DZE (1UL<<2) /* division by zero */
|
/linux/Documentation/devicetree/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.
|
/linux/tools/testing/selftests/ftrace/test.d/trigger/ |
H A D | trigger-hist-expressions.tc | 43 test_hist_expr "Division not associative" "64/8/4/2" "1" 51 test_hist_expr "Division evaluated before addition/subtraction" "4+6/2-2" "5" 61 check_error "Division by zero" 'hist:keys=common_pid:x=3/^0'
|
/linux/lib/crypto/mpi/ |
H A D | mpih-div.c | 40 /* If multiplication is much faster than division, and the in mpihelp_mod_1() 77 * ...one division less... in mpihelp_mod_1() 136 * ...one division less... in mpihelp_mod_1() 258 * treatment of this rare case as normal division would in mpihelp_divrem() 390 /* If multiplication is much faster than division, and the in mpihelp_divmod_1() 426 * ...one division less... in mpihelp_divmod_1() 484 * ...one division less... in mpihelp_divmod_1()
|
/linux/Documentation/staging/ |
H A D | crc32.rst | 5 A CRC is a long-division remainder. You add the CRC to the message, 13 It's actually the same long division you learned in school, except that: 20 Like all division, the remainder is always smaller than the divisor. 34 Just like with ordinary division, you proceed one digit (bit) at a time. 35 Each step of the division you take one more digit (bit) of the dividend
|
/linux/scripts/coccinelle/misc/ |
H A D | do_div.cocci | 2 /// do_div() does a 64-by-32 division. 5 /// non-zero and be truncated to 0 for division on 64bit platforms. 62 msg="WARNING: do_div() does a 64-by-32 division, please consider using %s instead."
|
H A D | array_size.cocci | 5 //# where there is a division of sizeof the array by the sizeof its first 7 //# division of the two sizeofs by ARRAY_SIZE.
|
/linux/tools/perf/pmu-events/arch/riscv/sifive/u74/ |
H A D | instructions.json | 55 "BriefDescription": "Integer division instruction retired" 85 "BriefDescription": "Floating-point division or square-root retired"
|
/linux/arch/nios2/kernel/ |
H A D | insnemu.S | 94 * is used to differentiate between the division opcodes and the 180 * Prepare for either multiplication or division loop. 215 /* DIVISION 254 * Prepare for division by assuming the result 260 /* Which division opcode? */ 279 /* Initialize the unsigned-division loop. */ 299 * Division:
|
/linux/lib/math/ |
H A D | gcd.c | 10 * This is faster than the division-based algorithm even on x86, which 11 * has decent hardware division.
|
H A D | test_div64.c | 225 pr_info("Starting 64bit/32bit division and modulo test\n"); in test_div64_init() 234 pr_info("Completed 64bit/32bit division and modulo test, " in test_div64_init() 249 MODULE_DESCRIPTION("64bit/32bit division and modulo test module");
|
/linux/tools/perf/pmu-events/arch/riscv/andes/ax45/ |
H A D | instructions.json | 80 "BriefDescription": "Integer division/remainder instruction count" 110 "BriefDescription": "Floating-point division or square-root instruction count"
|
/linux/arch/alpha/lib/ |
H A D | divide.S | 7 * Alpha division.. 11 * The alpha chip doesn't provide hardware division, so we have to do it 159 * Uhh.. Ugly signed division. I'd rather not have it at all, but
|
/linux/drivers/scsi/ |
H A D | scsi_logging.h | 10 * bitfields, each of which describes a loglevel. The division of things is 11 * somewhat arbitrary, and the division of the word could be changed if it
|
/linux/arch/x86/math-emu/ |
H A D | reg_u_div.S | 120 /* We should be able to zip through the division here */ 136 /* Work on the remainder of the first division */ 141 /* Work on the remainder of the 64 bit division */ 224 i.e., no division at all.. */ 356 /* The division is essentially finished here, we just need to perform
|
/linux/include/linux/ |
H A D | reciprocal_div.h | 8 * This algorithm is based on the paper "Division by Invariant 20 * to calculate the division A/B.
|
/linux/drivers/crypto/intel/qat/qat_common/ |
H A D | adf_clock.c | 92 * Enclose the division to allow the preprocessor to precalculate it, in measure_clock() 93 * and avoid promoting r-value to 64-bit before division. in measure_clock()
|
/linux/Documentation/admin-guide/device-mapper/ |
H A D | dm-service-time.rst | 60 the division and just compare the 'in-flight-size'. 62 2. If the paths have the same 'in-flight-size', skip the division
|
/linux/drivers/watchdog/ |
H A D | rzv2h_wdt.c | 74 /* Configure the timeout, clock division ratio, and window start and end positions. */ in rzv2h_wdt_setup() 104 * - CKS[7:4] - Clock Division Ratio Select - 0101b: oscclk/256 in rzv2h_wdt_start() 182 * - CKS[7:4] - Clock Division Ratio Select - 0000b: oscclk/1 in rzv2h_wdt_restart()
|
/linux/drivers/block/drbd/ |
H A D | drbd_proc.c | 58 * +1 to prevent division by zero */ in drbd_get_syncer_progress() 66 /* Make sure the division happens in long context. in drbd_get_syncer_progress() 71 * so we don't need a 64bit division on 32bit arch. in drbd_get_syncer_progress() 131 * safe against division by zero. We only estimate anyway. in drbd_syncer_progress()
|
/linux/drivers/pwm/ |
H A D | pwm-tegra.c | 11 * 1. 13-bit: Frequency division (SCALE) 12 * 2. 8-bit : Pulse division (DUTY) 16 * on the programmable frequency division value to generate the required 106 * nearest integer during division. in tegra_pwm_config()
|