Searched refs:divl (Results 1 - 25 of 39) sorted by relevance
12
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/xc16x/ |
H A D | div.s | 6 divl r0
|
/netbsd-current/lib/libc/arch/i386/gen/ |
H A D | udivsi3.S | 45 divl 8(%esp)
|
/netbsd-current/external/gpl3/gdb.old/dist/ld/testsuite/ld-i386/ |
H A D | discarded1.s | 5 divl x@GOT(%ecx), %eax
|
/netbsd-current/sys/external/bsd/compiler_rt/dist/lib/builtins/i386/ |
H A D | udivdi3.S | 46 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r 72 divl %ebx // overflow, and find q and r such that 106 divl %ecx // 109 divl %ecx //
|
H A D | umoddi3.S | 47 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r 77 divl %ebx // overflow, and find q and r such that 116 divl %ecx // 119 divl %ecx //
|
H A D | divdi3.S | 75 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r 107 divl %ebx // overflow, and find q and r such that 147 divl %ecx // 150 divl %ecx //
|
H A D | moddi3.S | 74 divl %ebx // eax <-- qs, edx <-- r such that ahi:alo = bs*qs + r 108 divl %ebx // overflow, and find q and r such that 150 divl %ecx // 153 divl %ecx //
|
/netbsd-current/usr.sbin/cpuctl/arch/ |
H A D | i386-asm.S | 85 divl %ecx 133 divl %ecx 153 divl %ebx # do a long division
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/pentium4/sse2/ |
H A D | dive_1.asm | 44 C Using divl for size==1 seems a touch quicker than mul-by-inverse. The mul 46 C that might be hidden by out-of-order execution, whereas divl is around 60. 47 C At size==2 an extra 19 for the mul versus 60 for the divl will see the mul 72 divl %ecx
|
H A D | divrem_1.asm | 94 dnl inverse method is used, rather than plain "divl"s. Minimum value 1. 268 divl %ebp 301 divl %ebp 347 divl %ebp C floor (b*(b-d)-1 / d)
|
/netbsd-current/sys/arch/arm/rockchip/ |
H A D | rk_i2c.c | 132 int div, divl, divh; local 145 divl = div / 2; 147 divh = divl; 151 divl = divh = 0; 156 __SHIFTIN(divl, RKI2C_CLKDIV_CLKDIVL));
|
/netbsd-current/external/gpl3/gdb.old/dist/gas/testsuite/gas/i386/ |
H A D | x86-64-lfence-load.s | 57 divl (%rcx)
|
H A D | lfence-load.s | 57 divl (%ecx)
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/ |
H A D | udiv.asm | 48 divl PARAM_DIVISOR
|
H A D | divrem_1.asm | 60 C mpn/generic/divrem_1.c, but has the advantage that we get the desired divl 177 divl %esi 202 divl %esi
|
H A D | divrem_2.asm | 107 divl 24(%esp)
|
/netbsd-current/lib/libm/src/ |
H A D | s_tanhl.c | 92 divl(long double a, long double b, long double c, long double d, function 170 z = divl(hi, lo, -0.5, hi, lo, 0.5);
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/k6/ |
H A D | divrem_1.asm | 149 divl %esi 173 divl %esi
|
H A D | mode1o.asm | 45 C A special case for size==1 using a divl rather than the inverse measured
|
H A D | pre_mod_1.asm | 40 C This code is only 2 c/l faster than a simple divl, but that's 10% so it's
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/pentium/ |
H A D | dive_1.asm | 43 C Plain divl is used for small sizes, since the inverse takes a while to 46 C size==3 for even are about the same speed for both divl or mul, but the 88 divl PARAM_DIVISOR
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/k6/mmx/ |
H A D | dive_1.asm | 43 C A simple divl is used for size==1. This is about 10 cycles faster for an 74 divl PARAM_DIVISOR
|
/netbsd-current/sys/arch/i386/stand/mbr/ |
H A D | gptmbr.S | 284 divl -6(%bp) /* secpercyl */
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/k7/mmx/ |
H A D | divrem_1.asm | 96 dnl inverse method is used, rather than plain "divl"s. Minimum value 1. 286 divl PARAM_DIVISOR 321 divl %ebp 369 divl %ebp C floor (b*(b-d)-1) / d
|
/netbsd-current/external/lgpl3/gmp/dist/mpn/x86/p6/mmx/ |
H A D | divrem_1.asm | 53 dnl inverse method is used, rather than plain "divl"s. Minimum value 1. 243 divl %ebp 280 divl %ebp 324 divl %ebp C floor (b*(b-d)-1) / d
|
Completed in 303 milliseconds
12