| /external/opencv3/3rdparty/include/ffmpeg_/libavutil/ |
| mathematics.h | 77 * Return the greatest common divisor of a and b.
|
| /external/tpm2/include/tpm2/ |
| Platform.h | 295 // Assume that the nominal divisor is 30000
|
| /external/v8/test/cctest/compiler/ |
| test-machine-operator-reducer.cc | 545 Node* divisor = R.Constant<int32_t>(1u << n); local
547 divisor); // x / 2^n => x >> n
597 Node* divisor = R.Constant<int32_t>(1u << n); local
599 divisor); // x % 2^n => x & 2^n-1
|
| /frameworks/native/opengl/tools/glgen/specs/gles11/ |
| GLES31.spec | 68 void glVertexBindingDivisor ( GLuint bindingindex, GLuint divisor )
|
| /libcore/harmony-tests/src/test/java/org/apache/harmony/tests/java/math/ |
| BigIntegerDivideTest.java | 318 * Verifies the case when the divisor is already normalized.
339 * and divisor equal.
628 * mod when a divisor is positive
648 * mod when a divisor is negative
|
| /packages/apps/TvSettings/Settings/res/values/ |
| attrs.xml | 102 <!-- divisor (>=1) for view to chasing the scrolling target pos, set to 1.0 for
|
| /frameworks/native/cmds/dumpstate/ |
| dumpstate.cpp | 359 unsigned long long divisor = fields[__STAT_READ_TICKS] local
363 * fields[__STAT_IN_QUEUE] + (divisor >> 1))
364 / divisor;
366 * fields[__STAT_IN_QUEUE] + (divisor >> 1))
367 / divisor;
373 unsigned long long divisor = fields[__STAT_WRITE_TICKS] local
377 * fields[__STAT_IN_QUEUE] + (divisor >> 1))
378 / divisor;
380 * fields[__STAT_IN_QUEUE] + (divisor >> 1))
381 / divisor;
[all...] |
| /external/deqp/external/vulkancts/modules/vulkan/pipeline/ |
| vktPipelineImageUtil.cpp | 41 /*! Gets the next multiple of a given divisor */
42 static deUint32 getNextMultiple (deUint32 divisor, deUint32 value)
44 if (value % divisor == 0)
48 return value + divisor - (value % divisor);
[all...] |
| /external/netperf/src/ |
| netlib.c | 3592 double divisor; local
3650 double divisor; local
[all...] |
| /external/freetype/src/smooth/ |
| ftgrays.c | 336 /* Compute `dividend / divisor' and return both its quotient and */
339 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
341 (quotient) = (type)( (dividend) / (divisor) ); \
342 (remainder) = (type)( (dividend) % (divisor) ); \
346 (remainder) += (type)(divisor); \
357 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
359 (quotient) = (type)( (dividend) / (divisor) ); \
360 (remainder) = (type)( (dividend) - (quotient) * (divisor) ); \
364 (remainder) += (type)(divisor); \
[all...] |
| /external/pdfium/third_party/freetype/src/smooth/ |
| ftgrays.c | 335 /* Compute `dividend / divisor' and return both its quotient and */
338 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
340 (quotient) = (type)( (dividend) / (divisor) ); \
341 (remainder) = (type)( (dividend) % (divisor) ); \
345 (remainder) += (type)(divisor); \
356 #define FT_DIV_MOD( type, dividend, divisor, quotient, remainder ) \
358 (quotient) = (type)( (dividend) / (divisor) ); \
359 (remainder) = (type)( (dividend) - (quotient) * (divisor) ); \
363 (remainder) += (type)(divisor); \
[all...] |
| /external/chromium-trace/catapult/third_party/gsutil/gslib/ |
| util.py | 237 def DivideAndCeil(dividend, divisor):
238 """Returns ceil(dividend / divisor).
245 divisor: Divisor for the operation.
250 quotient = dividend // divisor
251 if (dividend % divisor) != 0:
[all...] |
| /frameworks/native/opengl/libs/GLES2/ |
| gl2ext_api.in | 235 void API_ENTRY(glVertexAttribDivisorANGLE)(GLuint index, GLuint divisor) {
236 CALL_GL_API(glVertexAttribDivisorANGLE, index, divisor);
397 void API_ENTRY(glVertexAttribDivisorEXT)(GLuint index, GLuint divisor) {
398 CALL_GL_API(glVertexAttribDivisorEXT, index, divisor);
[all...] |
| /libcore/ojluni/src/main/java/java/lang/ |
| Math.java | 353 * @param f2 the divisor.
[all...] |
| StrictMath.java | 296 * @param f2 the divisor.
806 * {@linkplain Integer#MIN_VALUE Integer.MIN_VALUE} and the divisor is {@code -1},
814 * @param y the divisor
817 * @throws ArithmeticException if the divisor {@code y} is zero
[all...] |
| /external/aac/libFDK/include/ |
| fixpoint_math.h | 272 * \param denum divisor
274 * \return num/divisor
|
| /external/guava/guava-gwt/src-super/com/google/common/math/super/com/google/common/math/ |
| LongMath.java | 121 * Returns the greatest common divisor of {@code a, b}. Returns {@code 0} if
274 // so denominator must be a divisor of numerator.
|
| /external/mesa3d/src/glx/ |
| drisw_glx.c | 558 int64_t target_msc, int64_t divisor, int64_t remainder)
564 (void) divisor;
|
| /external/webrtc/webrtc/system_wrappers/source/spreadsortlib/ |
| spreadsort.hpp | 48 unsigned divisor = rough_log_2_size(count);
local
49 //Making sure the divisor is positive
50 if(divisor > LOG_MEAN_BIN_SIZE)
51 divisor -= LOG_MEAN_BIN_SIZE;
53 divisor = 1;
54 unsigned relative_width = (LOG_CONST * log_range)/((divisor > MAX_SPLITS) ? MAX_SPLITS : divisor);
91 //Gets a non-negative right bit shift to operate as a logarithmic divisor
[all...] |
| /cts/apps/CtsVerifier/src/com/android/cts/verifier/nfc/hce/ |
| ProtocolParamsReaderActivity.java | 113 sb.append(" (OK) bit 8 set, indicating only same bit rate divisor.\n");
|
| /external/apache-commons-math/src/main/java/org/apache/commons/math/analysis/solvers/ |
| UnivariateRealSolver.java | 38 * value which is used as divisor is zero.</p>
|
| /external/iproute2/doc/actions/ |
| ifb-README | 87 filter protocol ip pref 10 u32 fh 800: ht divisor 1
|
| /external/iproute2/examples/diffserv/ |
| Edge31-ca-u32 | 34 divisor 1
|
| /external/llvm/docs/ |
| CompileCudaWithLLVM.rst | 168 divides in our benchmarks have a divisor and dividend which fit in 32-bits at
|
| /external/llvm/lib/Support/ |
| APFloat.cpp | 1071 integerPart *lhsSignificand, *dividend, *divisor;
1086 divisor = dividend + partsCount;
1088 /* Copy the dividend and divisor as they will be modified in-place. */
1091 divisor[i] = rhsSignificand[i];
1099 /* Normalize the divisor. */
1100 bit = precision - APInt::tcMSB(divisor, partsCount) - 1;
1103 APInt::tcShiftLeft(divisor, partsCount, bit);
1113 /* Ensure the dividend >= divisor initially for the loop below.
1116 if (APInt::tcCompare(dividend, divisor, partsCount) < 0) {
1119 assert(APInt::tcCompare(dividend, divisor, partsCount) >= 0)
[all...] |
