| /bionic/libc/arch-arm/bionic/ |
| bpabi.c | 33 long long quotient = __divdi3(a, b); local
34 *remainder = a - b * quotient;
35 return quotient;
40 unsigned long long quotient = __udivdi3(a, b); local
41 *remainder = a - b * quotient;
42 return quotient;
|
| /external/jemalloc_new/test/unit/ |
| div.c | 15 size_t quotient = div_compute( local
17 assert_zu_eq(dividend, quotient * divisor,
19 "got quotient %zu", divisor, dividend, quotient);
|
| /external/u-boot/drivers/ddr/marvell/a38x/ |
| mv_ddr_common.c | 32 int round_div(unsigned int dividend, unsigned int divisor, unsigned int *quotient)
34 if (quotient == NULL) {
35 printf("%s: error: NULL quotient pointer found\n", __func__);
43 *quotient = (dividend + divisor / 2) / divisor;
|
| mv_ddr_common.h | 18 int round_div(unsigned int dividend, unsigned int divisor, unsigned int *quotient);
|
| /device/linaro/bootloader/edk2/EdkCompatibilityPkg/Foundation/Library/EdkIIGlueLib/Library/BaseLib/Ia32/ |
| DivU64x32.c | 2 Calculate the quotient of a 64-bit integer by a 32-bit integer
29 push eax ; save quotient on stack
32 pop edx ; restore high-order dword of the quotient
|
| DivU64x64Remainder.asm | 18 ; Calculate the quotient of a 64-bit integer by a 64-bit integer and returns
19 ; both the quotient and the remainder
63 mov ebx, eax ; ebx <- quotient
65 mul dword ptr [esp + 24] ; edx:eax <- quotient * divisor[0..31]
66 imul ecx, ebx ; ecx <- quotient * divisor[32..63]
67 add edx, ecx ; edx <- (quotient * divisor)[32..63]
76 dec ebx ; adjust quotient by -1
79 sbb edx, dword ptr [esp + 28] ; edx:eax <- (quotient - 1) * divisor
87 mov eax, ebx ; eax <- quotient
88 xor edx, edx ; quotient is 32 bits long
[all...] |
| DivU64x32.asm | 18 ; Calculate the quotient of a 64-bit integer by a 32-bit integer
39 push eax ; save quotient on stack
42 pop edx ; restore high-order dword of the quotient
|
| DivU64x32Remainder.asm | 39 div ecx ; eax <- quotient[32..63], edx <- remainder
42 div ecx ; eax <- quotient[0..31]
47 pop edx ; edx <- quotient[32..63]
|
| /device/linaro/bootloader/edk2/MdePkg/Library/BaseLib/Ia32/ |
| DivU64x32.c | 2 Calculate the quotient of a 64-bit integer by a 32-bit integer
23 unsigned value Divisor and generates a 64-bit unsigned quotient. This
24 function returns the 64-bit unsigned quotient.
44 push eax ; save quotient on stack
47 pop edx ; restore high-order dword of the quotient
|
| DivU64x64Remainder.S | 18 # Calculate the quotient of a 64-bit integer by a 64-bit integer and returns
19 # both the quotient and the remainder
60 movl %eax, %ebx # ebx <- quotient
62 mull 24(%esp) # edx:eax <- quotient * divisor[0..31]
63 imull %ebx, %ecx # ecx <- quotient * divisor[32..63]
64 addl %ecx, %edx # edx <- (quotient * divisor)[32..63]
73 decl %ebx # adjust quotient by -1
76 sbb 28(%esp), %edx # edx:eax <- (quotient - 1) * divisor
84 movl %ebx, %eax # eax <- quotient
85 xorl %edx, %edx # quotient is 32 bits long
[all...] |
| DivU64x64Remainder.asm | 18 ; Calculate the quotient of a 64-bit integer by a 64-bit integer and returns
19 ; both the quotient and the remainder
63 mov ebx, eax ; ebx <- quotient
65 mul dword ptr [esp + 24] ; edx:eax <- quotient * divisor[0..31]
66 imul ecx, ebx ; ecx <- quotient * divisor[32..63]
67 add edx, ecx ; edx <- (quotient * divisor)[32..63]
76 dec ebx ; adjust quotient by -1
79 sbb edx, dword ptr [esp + 28] ; edx:eax <- (quotient - 1) * divisor
87 mov eax, ebx ; eax <- quotient
88 xor edx, edx ; quotient is 32 bits long
[all...] |
| DivU64x32.S | 18 # Calculate the quotient of a 64-bit integer by a 32-bit integer
37 push %eax # save quotient on stack
40 pop %edx # restore high-order dword of the quotient
|
| DivU64x32.asm | 18 ; Calculate the quotient of a 64-bit integer by a 32-bit integer
39 push eax ; save quotient on stack
42 pop edx ; restore high-order dword of the quotient
|
| DivU64x32Remainder.asm | 39 div ecx ; eax <- quotient[32..63], edx <- remainder
42 div ecx ; eax <- quotient[0..31]
47 pop edx ; edx <- quotient[32..63]
|
| DivU64x32Remainder.S | 37 divl %ecx # eax <- quotient[32..63], edx <- remainder
40 divl %ecx # eax <- quotient[0..31]
45 pop %edx # edx <- quotient[32..63]
|
| /external/u-boot/lib/ |
| div64.c | 66 u64 quotient; local
69 quotient = div_u64_rem(-dividend, abs(divisor), (u32 *)remainder);
72 quotient = -quotient;
74 quotient = div_u64_rem(dividend, abs(divisor), (u32 *)remainder);
76 quotient = -quotient;
78 return quotient;
|
| /external/icu/icu4c/source/i18n/ |
| gregoimp.cpp | 37 double quotient; local
38 quotient = uprv_floor(numerator / denominator);
39 remainder = (int32_t) (numerator - (quotient * denominator));
40 return (int32_t) quotient;
47 double quotient = floorDivide(dividend, divisor); local
48 remainder = dividend - (quotient * divisor);
50 // is a bug such that the quotient is off by one. If you doubt
56 double q = quotient;
57 quotient += (remainder < 0) ? -1 : +1;
58 if (q == quotient) {
[all...] |
| /external/compiler-rt/lib/builtins/ |
| divdf3.c | 135 rep_t quotient, quotientLo; local
136 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo);
138 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
149 // We also take this time to right shift quotient if it falls in the [1,2)
152 if (quotient < (implicitBit << 1)) {
153 residual = (aSignificand << 53) - quotient * bSignificand;
156 quotient >>= 1;
157 residual = (aSignificand << 52) - quotient * bSignificand;
176 rep_t absResult = quotient & significandMask
[all...] |
| divsf3.c | 121 rep_t quotient = (uint64_t)reciprocal*(aSignificand << 1) >> 32; local
123 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
134 // We also take this time to right shift quotient if it falls in the [1,2)
137 if (quotient < (implicitBit << 1)) {
138 residual = (aSignificand << 24) - quotient * bSignificand;
141 quotient >>= 1;
142 residual = (aSignificand << 23) - quotient * bSignificand;
161 rep_t absResult = quotient & significandMask;
|
| divtf3.c | 149 rep_t quotient, quotientLo; local
150 wideMultiply(aSignificand << 2, reciprocal, "ient, "ientLo);
152 // Two cases: quotient is in [0.5, 1.0) or quotient is in [1.0, 2.0).
163 // We also take this time to right shift quotient if it falls in the [1,2)
168 if (quotient < (implicitBit << 1)) {
169 wideMultiply(quotient, bSignificand, &dummy, &qb);
173 quotient >>= 1;
174 wideMultiply(quotient, bSignificand, &dummy, &qb);
192 rep_t absResult = quotient & significandMask
[all...] |
| /external/libxaac/decoder/ |
| ixheaacd_basic_ops.h | 74 WORD32 quotient; local
81 quotient = MAX_32;
83 quotient = 0;
86 quotient = quotient << 1;
90 quotient += 1;
97 return quotient;
|
| ixheaacd_basic_funcs.c | 126 WORD32 quotient = 0; local
137 quotient = (quotient << 1);
141 quotient++;
145 if (sign < 0) quotient = -(quotient);
147 return quotient;
|
| /external/protobuf/src/google/protobuf/stubs/ |
| int128.cc | 103 uint128 quotient = 0; local
115 quotient |= position;
121 *quotient_ret = quotient;
126 uint128 quotient = 0; local
128 DivModImpl(*this, divisor, "ient, &remainder);
129 *this = quotient;
133 uint128 quotient = 0; local
135 DivModImpl(*this, divisor, "ient, &remainder);
|
| /device/linaro/bootloader/edk2/StdLib/LibC/CRT/Ia32/ |
| lldvrm.c | 54 ; EDX:EAX contains the quotient (dividend/divisor)
87 ; EDX:EAX contains the quotient (dividend/divisor)
|
| ulldvrm.c | 54 ; EDX:EAX contains the quotient (dividend/divisor)
87 ; EDX:EAX contains the quotient (dividend/divisor)
|
