Home
last modified time | relevance | path

Searched refs:divisor (Results 1 - 25 of 321) sorted by relevance

12345678910>>...13

/third_party/FreeBSD/sys/compat/linuxkpi/common/include/linux/
H A Dkernel.h218 * @param base [IN] the divisor
240 * @param base [IN] the divisor > 0
257 * <li>the param divisor should not be 0.</li>
261 * @param divisor [IN] the divisor > 0
267 static inline UINT64 div64_u64(UINT64 dividend, UINT64 divisor) in div64_u64() argument
269 return dividend / divisor; in div64_u64()
281 * <li>the param divisor should not be 0.</li>
285 * @param divisor [IN] the divisor no
291 div64_s64(INT64 dividend, INT64 divisor) div64_s64() argument
325 div_s64_rem(INT64 dividend, INT32 divisor, INT32 *remainder) div_s64_rem() argument
352 div64_u64_rem(UINT64 dividend, UINT64 divisor, UINT64 *remainder) div64_u64_rem() argument
379 div_u64_rem(UINT64 dividend, UINT32 divisor, UINT32 *remainder) div_u64_rem() argument
404 div_s64(INT64 dividend, INT32 divisor) div_s64() argument
429 div_u64(UINT64 dividend, UINT32 divisor) div_u64() argument
[all...]
/third_party/node/deps/v8/src/bigint/
H A Ddigit-arithmetic.h118 // quotient = (high << kDigitBits + low - remainder) / divisor
119 static inline digit_t digit_div(digit_t high, digit_t low, digit_t divisor, in digit_div() argument
122 DCHECK(high < divisor); in digit_div()
123 DCHECK(divisor != 0); in digit_div()
128 __asm__("divq %[divisor]" in digit_div()
131 // Inputs: put {high} into rdx, {low} into rax, and {divisor} into in digit_div()
133 : "d"(high), "a"(low), [divisor] "rm"(divisor)); in digit_div()
139 __asm__("divl %[divisor]" in digit_div()
142 // Inputs: put {high} into edx, {low} into eax, and {divisor} int in digit_div()
[all...]
/third_party/node/deps/v8/src/base/numbers/
H A Dfast-dtoa.cc391 uint32_t divisor; local
393 BiggestPowerTen(integrals, DiyFp::kSignificandSize - (-one.e()), &divisor,
399 // with the divisor exponent + 1. And the divisor is the biggest power of ten
402 int digit = integrals / divisor;
405 integrals %= divisor;
407 // Note that kappa now equals the exponent of the divisor and that the
418 static_cast<uint64_t>(divisor) << -one.e(), unit);
420 divisor /= 10;
494 uint32_t divisor; local
[all...]
/third_party/icu/icu4j/main/classes/core/src/com/ibm/icu/text/
H A DNFSubstitution.java218 * Set's the substitution's divisor. Used by NFRule.setBaseValue().
221 * @param radix The radix of the divisor
222 * @param exponent The exponent of the divisor
475 // times the rule's divisor (or the rule's base value) plus in doParse()
656 * divisor and formats the quotient. Represented by &lt;&lt; in normal
665 * The divisor of the rule that owns this substitution.
667 long divisor; field in MultiplierSubstitution
676 * also maintains its own copy of its rule's divisor.
688 // the owning rule's divisor affects the behavior of this in MultiplierSubstitution()
690 // rule, we keep a copy of the divisor in MultiplierSubstitution()
818 long divisor; global() field in ModulusSubstitution
[all...]
/third_party/icu/ohos_icu4j/src/main/java/ohos/global/icu/text/
H A DNFSubstitution.java219 * Set's the substitution's divisor. Used by NFRule.setBaseValue().
222 * @param radix The radix of the divisor
223 * @param exponent The exponent of the divisor
476 // times the rule's divisor (or the rule's base value) plus in doParse()
657 * divisor and formats the quotient. Represented by &lt;&lt; in normal
666 * The divisor of the rule that owns this substitution.
668 long divisor; field in MultiplierSubstitution
677 * also maintains its own copy of its rule's divisor.
689 // the owning rule's divisor affects the behavior of this in MultiplierSubstitution()
691 // rule, we keep a copy of the divisor in MultiplierSubstitution()
819 long divisor; global() field in ModulusSubstitution
[all...]
/third_party/protobuf/src/google/protobuf/stubs/
H A Dint128.cc83 void uint128::DivModImpl(uint128 dividend, uint128 divisor, in DivModImpl() argument
85 if (divisor == 0) { in DivModImpl()
88 } else if (dividend < divisor) { in DivModImpl()
94 int divisor_bit_length = Fls128(divisor); in DivModImpl()
99 uint128 shifted_divisor = divisor << difference; in DivModImpl()
113 uint128& uint128::operator/=(const uint128& divisor) { in operator /=() argument
116 DivModImpl(*this, divisor, &quotient, &remainder); in operator /=()
120 uint128& uint128::operator%=(const uint128& divisor) { in operator %=() argument
123 DivModImpl(*this, divisor, &quotient, &remainder); in operator %=()
131 // Select a divisor whic in operator <<()
[all...]
/third_party/skia/third_party/externals/spirv-cross/include/spirv_cross/
H A Dbarrier.hpp35 void set_release_divisor(unsigned divisor) in set_release_divisor() argument
37 this->divisor = divisor; in set_release_divisor()
55 unsigned target_count = divisor * target_iteration; in wait()
74 unsigned divisor = 1; member in spirv_cross::Barrier
/third_party/icu/icu4c/source/i18n/
H A Dgregoimp.cpp48 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
51 U_ASSERT(divisor > 0); in floorDivide()
52 double quotient = floorDivide(dividend, divisor); in floorDivide()
53 *remainder = dividend - (quotient * divisor); in floorDivide()
57 if (*remainder < 0 || *remainder >= divisor) { in floorDivide()
75 *remainder = dividend - (quotient * divisor); in floorDivide()
78 U_ASSERT(0 <= *remainder && *remainder < divisor); in floorDivide()
H A Dnfsubs.cpp75 int64_t divisor; member in MultiplierSubstitution
83 : NFSubstitution(_pos, _ruleSet, description, status), divisor(rule->getDivisor()) in MultiplierSubstitution()
85 if (divisor == 0) { in MultiplierSubstitution()
92 divisor = util64_pow(radix, exponent);
94 if(divisor == 0) {
102 return number / divisor;
107 return uprv_floor(number / divisor);
109 return number / divisor;
114 return newRuleValue * divisor;
117 virtual double calcUpperBound(double /*oldUpperBound*/) const override { return static_cast<double>(divisor); }
129 int64_t divisor; global() member in ModulusSubstitution
[all...]
H A Ddouble-conversion-fast-dtoa.cpp352 uint32_t divisor;
355 &divisor, &divisor_exponent_plus_one);
360 // with the divisor exponent + 1. And the divisor is the biggest power of ten
363 int digit = integrals / divisor;
367 integrals %= divisor;
369 // Note that kappa now equals the exponent of the divisor and that the
380 static_cast<uint64_t>(divisor) << -one.e(), unit);
382 divisor /= 10;
462 uint32_t divisor;
[all...]
/third_party/node/deps/icu-small/source/i18n/
H A Dgregoimp.cpp50 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
53 U_ASSERT(divisor > 0); in floorDivide()
54 double quotient = floorDivide(dividend, divisor); in floorDivide()
55 double r = dividend - (quotient * divisor); in floorDivide()
59 if (r < 0 || r >= divisor) { in floorDivide()
77 r = dividend - (quotient * divisor); in floorDivide()
80 U_ASSERT(0 <= r && r < divisor); in floorDivide()
H A Dnfsubs.cpp75 int64_t divisor; member in MultiplierSubstitution
83 : NFSubstitution(_pos, _ruleSet, description, status), divisor(rule->getDivisor()) in MultiplierSubstitution()
85 if (divisor == 0) { in MultiplierSubstitution()
92 divisor = util64_pow(radix, exponent);
94 if(divisor == 0) {
102 return number / divisor;
125 return uprv_floor(number / divisor);
127 return number / divisor;
132 return newRuleValue * divisor;
135 virtual double calcUpperBound(double /*oldUpperBound*/) const override { return static_cast<double>(divisor); }
147 int64_t divisor; global() member in ModulusSubstitution
[all...]
H A Ddouble-conversion-fast-dtoa.cpp352 uint32_t divisor;
355 &divisor, &divisor_exponent_plus_one);
360 // with the divisor exponent + 1. And the divisor is the biggest power of ten
363 int digit = integrals / divisor;
367 integrals %= divisor;
369 // Note that kappa now equals the exponent of the divisor and that the
380 static_cast<uint64_t>(divisor) << -one.e(), unit);
382 divisor /= 10;
462 uint32_t divisor;
[all...]
/third_party/skia/third_party/externals/icu/source/i18n/
H A Dgregoimp.cpp43 double ClockMath::floorDivide(double dividend, double divisor, in floorDivide() argument
46 U_ASSERT(divisor > 0); in floorDivide()
47 double quotient = floorDivide(dividend, divisor); in floorDivide()
48 remainder = dividend - (quotient * divisor); in floorDivide()
52 if (remainder < 0 || remainder >= divisor) { in floorDivide()
70 remainder = dividend - (quotient * divisor); in floorDivide()
73 U_ASSERT(0 <= remainder && remainder < divisor); in floorDivide()
H A Dnfsubs.cpp75 int64_t divisor; member in MultiplierSubstitution
83 : NFSubstitution(_pos, _ruleSet, description, status), divisor(rule->getDivisor()) in MultiplierSubstitution()
85 if (divisor == 0) { in MultiplierSubstitution()
92 divisor = util64_pow(radix, exponent); in setDivisor()
94 if(divisor == 0) { in setDivisor()
102 return number / divisor; in transformNumber()
107 return uprv_floor(number / divisor); in transformNumber()
109 return number / divisor; in transformNumber()
114 return newRuleValue * divisor; in composeRuleValue()
117 virtual double calcUpperBound(double /*oldUpperBound*/) const { return static_cast<double>(divisor); } in calcUpperBound()
129 int64_t divisor; global() member in ModulusSubstitution
[all...]
H A Ddouble-conversion-fast-dtoa.cpp352 uint32_t divisor;
355 &divisor, &divisor_exponent_plus_one);
360 // with the divisor exponent + 1. And the divisor is the biggest power of ten
363 int digit = integrals / divisor;
367 integrals %= divisor;
369 // Note that kappa now equals the exponent of the divisor and that the
380 static_cast<uint64_t>(divisor) << -one.e(), unit);
382 divisor /= 10;
462 uint32_t divisor;
[all...]
/third_party/ffmpeg/libavformat/
H A Dhcom.c41 unsigned compresstype, divisor; in hcom_read_header() local
54 divisor = avio_rb32(s->pb); in hcom_read_header()
55 if (divisor == 0 || divisor > 4) in hcom_read_header()
65 st->codecpar->sample_rate = 22050 / divisor; in hcom_read_header()
/third_party/skia/third_party/externals/angle2/src/libANGLE/renderer/d3d/d3d11/
H A DInputLayoutCache.cpp63 uint32_t divisor; member
75 unsigned int divisor) in addAttributeData()
84 packedAttrib.divisor = static_cast<uint32_t>(divisor); in addAttributeData()
89 ASSERT(static_cast<unsigned int>(packedAttrib.divisor) == divisor); in addAttributeData()
218 attrib.divisor > 0 ? D3D11_INPUT_PER_INSTANCE_DATA : D3D11_INPUT_PER_VERTEX_DATA; in createInputLayout()
232 inputElement->InstanceDataStepRate = attrib.divisor; in createInputLayout()
266 if (numIndicesPerInstance > 0 && currentAttributes[elementIndex]->divisor > 0) in createInputLayout()
72 addAttributeData(GLenum glType, UINT semanticIndex, angle::FormatID vertexFormatID, unsigned int divisor) addAttributeData() argument
/third_party/skia/src/gpu/gl/
H A DGrGLVertexArray.cpp86 int divisor) { in set()
88 SkASSERT(0 == divisor || gpu->caps()->drawInstancedSupport()); in set()
137 if (gpu->caps()->drawInstancedSupport() && array->fDivisor != divisor) { in set()
138 SkASSERT(0 == divisor || 1 == divisor); // not necessarily a requirement but what we expect. in set()
139 GR_GL_CALL(gpu->glInterface(), VertexAttribDivisor(index, divisor)); in set()
140 array->fDivisor = divisor; in set()
79 set(GrGLGpu* gpu, int index, const GrBuffer* vertexBuffer, GrVertexAttribType cpuType, GrSLType gpuType, GrGLsizei stride, size_t offsetInBytes, int divisor) set() argument
/third_party/icu/vendor/double-conversion/upstream/double-conversion/
H A Dfast-dtoa.cc338 uint32_t divisor;
341 &divisor, &divisor_exponent_plus_one);
346 // with the divisor exponent + 1. And the divisor is the biggest power of ten
349 int digit = integrals / divisor;
353 integrals %= divisor;
355 // Note that kappa now equals the exponent of the divisor and that the
366 static_cast<uint64_t>(divisor) << -one.e(), unit);
368 divisor /= 10;
448 uint32_t divisor;
[all...]
/third_party/node/deps/openssl/openssl/crypto/bn/
H A Dbn_div.c111 * other words divisor has to be "bit-aligned to the left." bn_div_fixed_top
202 * BN_div computes dv := num / divisor, rounding towards
203 * zero, and sets up rm such that dv*divisor + rm = num holds.
205 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
209 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, in BN_div() argument
214 if (BN_is_zero(divisor)) { in BN_div()
224 if (divisor->d[divisor->top - 1] == 0) { in BN_div()
229 ret = bn_div_fixed_top(dv, rm, num, divisor, ctx); in BN_div()
242 * It's argued that *length* of *significant* part of divisor i
264 bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, BN_CTX *ctx) bn_div_fixed_top() argument
[all...]
/third_party/openssl/crypto/bn/
H A Dbn_div.c111 * other words divisor has to be "bit-aligned to the left." bn_div_fixed_top
202 * BN_div computes dv := num / divisor, rounding towards
203 * zero, and sets up rm such that dv*divisor + rm = num holds.
205 * dv->neg == num->neg ^ divisor->neg (unless the result is zero)
209 int BN_div(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, in BN_div() argument
214 if (BN_is_zero(divisor)) { in BN_div()
224 if (divisor->d[divisor->top - 1] == 0) { in BN_div()
229 ret = bn_div_fixed_top(dv, rm, num, divisor, ctx); in BN_div()
242 * It's argued that *length* of *significant* part of divisor i
264 bn_div_fixed_top(BIGNUM *dv, BIGNUM *rm, const BIGNUM *num, const BIGNUM *divisor, BN_CTX *ctx) bn_div_fixed_top() argument
[all...]
/third_party/mesa3d/src/glx/apple/
H A Dglx_empty.c45 glXWaitVideoSyncSGI(int divisor, int remainder, unsigned int *count) in glXWaitVideoSyncSGI() argument
69 int64_t target_msc, int64_t divisor, int64_t remainder) in glXSwapBuffersMscOML()
74 (void) divisor; in glXSwapBuffersMscOML()
82 int64_t target_msc, int64_t divisor, in glXWaitForMscOML()
89 (void) divisor; in glXWaitForMscOML()
68 glXSwapBuffersMscOML(Display * dpy, GLXDrawable drawable, int64_t target_msc, int64_t divisor, int64_t remainder) glXSwapBuffersMscOML() argument
81 glXWaitForMscOML(Display * dpy, GLXDrawable drawable, int64_t target_msc, int64_t divisor, int64_t remainder, int64_t * ust, int64_t * msc, int64_t * sbc) glXWaitForMscOML() argument
/third_party/node/deps/v8/src/wasm/
H A Dwasm-external-refs.cc289 int64_t divisor = ReadUnalignedValue<int64_t>(data + sizeof(dividend)); in int64_div_wrapper() local
290 if (divisor == 0) { in int64_div_wrapper()
293 if (divisor == -1 && dividend == std::numeric_limits<int64_t>::min()) { in int64_div_wrapper()
296 WriteUnalignedValue<int64_t>(data, dividend / divisor); in int64_div_wrapper()
302 int64_t divisor = ReadUnalignedValue<int64_t>(data + sizeof(dividend)); in int64_mod_wrapper() local
303 if (divisor == 0) { in int64_mod_wrapper()
306 if (divisor == -1 && dividend == std::numeric_limits<int64_t>::min()) { in int64_mod_wrapper()
310 WriteUnalignedValue<int64_t>(data, dividend % divisor); in int64_mod_wrapper()
316 uint64_t divisor = ReadUnalignedValue<uint64_t>(data + sizeof(dividend)); in uint64_div_wrapper() local
317 if (divisor in uint64_div_wrapper()
326 uint64_t divisor = ReadUnalignedValue<uint64_t>(data + sizeof(dividend)); uint64_mod_wrapper() local
[all...]
/third_party/skia/third_party/externals/dawn/examples/
H A DManualSwapChainTest.cpp22 // - D: cycles the divisor for the swapchain size.
76 uint32_t divisor = 1; member
105 data->targetDesc.width = std::max(1u, width / data->divisor); in SyncFromWindow()
106 data->targetDesc.height = std::max(1u, height / data->divisor); in SyncFromWindow()
195 if (data->divisor != 1) { in UpdateTitle()
196 o << "Divisor:" << data->divisor << " "; in UpdateTitle()
233 data->divisor *= 2; in OnKeyPress()
234 if (data->divisor > 32) { in OnKeyPress()
235 data->divisor = 1; in OnKeyPress()

Completed in 27 milliseconds

12345678910>>...13