/art/runtime/entrypoints/quick/ |
quick_throw_entrypoints.cc | 68 // Called by generated call to throw an arithmetic divide by zero exception.
|
/bionic/libc/upstream-netbsd/lib/libc/stdlib/ |
bsearch.c | 49 * divide the work in half by moving either left or right. If lim
|
/bionic/libc/upstream-openbsd/lib/libc/stdio/ |
fwrite.c | 78 * skip the divide if this happens, since divides are
|
/cts/tests/tests/view/src/android/view/cts/ |
View_LayoutPositionTest.java | 30 * For the view test is too big, we divide the test cases into several parts.
|
/external/aac/libFDK/include/ |
fixpoint_math.h | 241 * \brief Divide two FIXP_DBL values with given precision. 283 * \brief Divide 2 FIXP_DBL values with normalization of input values. 291 * \brief Divide 2 FIXP_DBL values with normalization of input values. 300 * \brief Divide 2 FIXP_DBL values with normalization of input values.
|
/external/antlr/antlr-3.4/runtime/CSharp3/Sources/Antlr3.Runtime.Test/BuildOptions/ |
DebugTreeGrammar.g3 | 67 | ^('/' a=expr b=expr) { $value = $a.value.divide($b.value); }
|
ProfileTreeGrammar.g3 | 67 | ^('/' a=expr b=expr) { $value = $a.value.divide($b.value); }
|
/external/bluetooth/bluedroid/embdrv/sbc/decoder/srce/ |
bitalloc-sbc.c | 151 return DIVIDE(bits, nrof_blocks);
|
/external/ceres-solver/internal/ceres/ |
corrector.h | 57 // in a divide by zero error. Thus we constrain alpha to be upper
|
/external/chromium_org/cc/output/ |
geometry_binding.cc | 19 // Index of the vertex, divide by 4 to have the matrix for this quad.
|
/external/chromium_org/components/web_cache/browser/ |
web_cache_manager.cc | 246 // The plan for the extra space is to divide it evenly amoung the active 280 // Divide the extra memory evenly among the renderers. 371 // first try to evict dead data only. If that fails, we'll just divide the 397 // We're basically out of memory. The best we can do is just divide up
|
/external/chromium_org/third_party/WebKit/Source/core/rendering/svg/ |
SVGTextMetrics.cpp | 55 // Calculate width/height using the scaled font, divide this result by the scalingFactor afterwards.
|
/external/chromium_org/third_party/WebKit/Source/platform/audio/ |
UpSampler.cpp | 128 // Divide by two since this is a linear phase kernel and the delay is at the center of the kernel.
|
/external/chromium_org/third_party/freetype/include/freetype/internal/ |
ftcalc.h | 78 /* divide by zero; it simply returns `MaxInt' or `MinInt' depending */
|
/external/chromium_org/third_party/mesa/src/src/gallium/drivers/llvmpipe/ |
lp_bld_interp.h | 35 * perspective divide if necessary.
|
/external/chromium_org/third_party/opus/src/silk/fixed/ |
schur64_FIX.c | 70 /* Get reflection coefficient: divide two Q30 values and get result in Q31 */
|
/external/chromium_org/third_party/skia/experimental/Intersection/ |
LineParameters.h | 20 // divide the result of xxxDistance() by sqrt(normalSquared())
|
/external/chromium_org/third_party/skia/src/effects/gradients/ |
SkClampRange.cpp | 55 // and avoids us ever calling divide or 64bit multiply
|
/external/chromium_org/third_party/webrtc/modules/audio_coding/neteq/ |
expand.h | 30 // TODO(hlundin): Refactor this class to divide the long methods into shorter
|
/external/chromium_org/third_party/webrtc/modules/rtp_rtcp/source/ |
vp8_partition_aggregator.h | 114 // Calculate the number of fragments to divide a large partition into.
|
/external/dexmaker/src/test/java/com/google/dexmaker/ |
DexMakerTest.java | 742 Method divide = binaryOpMethod(int.class, int.class, BinaryOp.DIVIDE); local 743 assertEquals(18, divide.invoke(null, 75, 4)); 745 divide.invoke(null, 75, 0); 790 Method divide = binaryOpMethod(long.class, long.class, BinaryOp.DIVIDE); local 841 Method divide = binaryOpMethod(float.class, float.class, BinaryOp.DIVIDE); local 860 Method divide = binaryOpMethod(double.class, double.class, BinaryOp.DIVIDE); local [all...] |
/external/e2fsprogs/intl/ |
plural-exp.h | 46 divide, /* Division. */ enumerator in enum:expression::operator
|
/external/eigen/Eigen/src/LU/arch/ |
Inverse_SSE.h | 53 // The inverse is calculated using "Divide and Conquer" technique. The 54 // original matrix is divide into four 2x2 sub-matrices. Since each 175 // The inverse is calculated using "Divide and Conquer" technique. The 176 // original matrix is divide into four 2x2 sub-matrices. Since each
|
/external/fonttools/Lib/fontTools/ttLib/ |
standardGlyphOrder.py | 197 "divide", # 184
|
/external/freetype/include/internal/ |
ftcalc.h | 82 /* divide by zero; it simply returns `MaxInt' or `MinInt' depending */
|