| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.10/Modules/zlib/ |
| trees.c | 503 int overflow = 0; /* number of elements with bit length too large */
local
508 * overflow in the case of the bit length tree).
515 if (bits > max_length) bits = max_length, overflow++;
528 if (overflow == 0) return;
530 Trace((stderr,"\nbit length overflow\n"));
538 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
540 /* The brother of the overflow item also moves one step up,
543 overflow -= 2;
544 } while (overflow > 0);
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/ |
| mathmodule.c | 12 large to approximate by a machine float, overflow is signaled and the
50 the standard recommends raising 'overflow', Python should raise an
208 x, the obvious algorithm risks overflow, so we instead
407 fraction evaluation algorithm used below also risks overflow for large x;
454 overflow if x and nterms are not too large. On an IEEE 754 machine, with x
626 * on overflow, but also generally *allows* them to set
632 * overflow, so testing the result for zero suffices to
669 The last rule is used to catch overflow on platforms which follow
676 'overflow' floating-point exception mapping to OverflowError.
678 the possibility of overflow; fortunately, that covers everything we
1188 int overflow; local
[all...] |
| /device/linaro/bootloader/edk2/AppPkg/Applications/Python/Python-2.7.2/Modules/zlib/ |
| trees.c | 505 int overflow = 0; /* number of elements with bit length too large */
local
510 * overflow in the case of the bit length tree).
517 if (bits > max_length) bits = max_length, overflow++;
530 if (overflow == 0) return;
532 Trace((stderr,"\nbit length overflow\n"));
540 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
542 /* The brother of the overflow item also moves one step up,
545 overflow -= 2;
546 } while (overflow > 0);
[all...] |
| /external/apache-commons-math/src/main/java/org/apache/commons/math/fraction/ |
| BigFraction.java | 30 * Representation of a rational number without any overflow. This class is
271 long overflow = Integer.MAX_VALUE; local
274 if (a0 > overflow) {
302 if ((p2 > overflow) || (q2 > overflow)) {
[all...] |
| /external/deqp/framework/common/ |
| tcuCommandLine.cpp | 215 int overflow (int ch = -1);
246 int DebugOutStreambuf::overflow (int ch) function in class:tcu::DebugOutStreambuf
|
| /external/freetype/src/bdf/ |
| bdf.h | 208 bdf_glyphlist_t overflow; /* Storage used for glyph insertion. */ member in struct:bdf_font_t_
|
| /external/libaom/libaom/aom_dsp/x86/ |
| fwd_txfm_impl_sse2.h | 49 int overflow; local
88 overflow =
90 if (overflow) {
104 overflow = check_epi16_overflow_x4(&r0, &r1, &r2, &r3);
105 if (overflow) {
147 overflow = check_epi16_overflow_x4(&res0, &res4, &res2, &res6);
148 if (overflow) {
177 overflow = check_epi16_overflow_x2(&r0, &r1);
178 if (overflow) {
190 overflow = check_epi16_overflow_x4(&x0, &x1, &x2, &x3)
[all...] |
| /external/lzma/C/ |
| Lzma2DecMt.c | 280 BoolInt overflow;
local
305 overflow = False;
322 overflow = True;
345 overflow = True;
363 overflow = False;
370 if (overflow)
|
| MtDec.c | 274 BoolInt wasInterrupted, isAllocError, overflow, finish;
local
316 overflow = False;
437 // Overflow or Parse error - switch from MT decoding to ST decoding
439 overflow = True;
442 PRF(printf("\n Overflow"));
724 if (overflow)
727 p->overflow = True;
1041 p->overflow = False;
1121 || p->overflow)
|
| /external/python/cpython2/Modules/ |
| mathmodule.c | 12 large to approximate by a machine float, overflow is signaled and the
50 the standard recommends raising 'overflow', Python should raise an
208 x, the obvious algorithm risks overflow, so we instead
406 fraction evaluation algorithm used below also risks overflow for large x;
453 overflow if x and nterms are not too large. On an IEEE 754 machine, with x
625 * on overflow, but also generally *allows* them to set
631 * overflow, so testing the result for zero suffices to
668 The last rule is used to catch overflow on platforms which follow
675 'overflow' floating-point exception mapping to OverflowError.
677 the possibility of overflow; fortunately, that covers everything w
1187 int overflow; local
[all...] |
| /external/python/cpython2/Modules/zlib/ |
| trees.c | 501 int overflow = 0; /* number of elements with bit length too large */ local
506 * overflow in the case of the bit length tree).
513 if (bits > max_length) bits = max_length, overflow++;
526 if (overflow == 0) return;
528 Tracev((stderr,"\nbit length overflow\n"));
536 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
538 /* The brother of the overflow item also moves one step up,
541 overflow -= 2;
542 } while (overflow > 0);
[all...] |
| /external/python/cpython3/Objects/ |
| frameobject.c | 71 int overflow; local
134 l_new_lineno = PyLong_AsLongAndOverflow(p_new_lineno, &overflow);
135 if (overflow
800 Py_FatalError("XXX block stack overflow");
[all...] |
| /external/python/cpython3/Python/ |
| traceback.c | 600 int overflow; local
601 limit = PyLong_AsLongAndOverflow(limitv, &overflow);
602 if (overflow > 0) {
|
| /external/swiftshader/src/Pipeline/ |
| SetupRoutine.cpp | 596 Int D = FDY12; // Error-overflow
606 Int overflow = -d >> 31; local
608 d -= D & overflow;
609 x -= overflow;
|
| /external/swiftshader/src/Shader/ |
| SetupRoutine.cpp | 603 Int D = FDY12; // Error-overflow
613 Int overflow = -d >> 31; local
615 d -= D & overflow;
616 x -= overflow;
|
| /external/u-boot/lib/zlib/ |
| trees.c | 509 int overflow = 0; /* number of elements with bit length too large */ local
514 * overflow in the case of the bit length tree).
521 if (bits > max_length) bits = max_length, overflow++;
534 if (overflow == 0) return;
536 Trace((stderr,"\nbit length overflow\n"));
544 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
546 /* The brother of the overflow item also moves one step up,
549 overflow -= 2;
550 } while (overflow > 0);
[all...] |
| /external/wayland/src/ |
| connection.c | 245 int overflow = 0; local
255 if (size > max || overflow) {
256 overflow = 1;
265 if (overflow) {
1035 goto overflow;
1049 goto overflow;
1077 goto overflow;
1092 goto overflow;
1109 overflow:
|
| /external/zlib/src/ |
| trees.c | 501 int overflow = 0; /* number of elements with bit length too large */ local
506 * overflow in the case of the bit length tree).
513 if (bits > max_length) bits = max_length, overflow++;
526 if (overflow == 0) return;
528 Tracev((stderr,"\nbit length overflow\n"));
536 s->bl_count[bits+1] += 2; /* move one overflow item as its brother */
538 /* The brother of the overflow item also moves one step up,
541 overflow -= 2;
542 } while (overflow > 0);
[all...] |
| /frameworks/av/media/libmediaplayer2/nuplayer2/ |
| RTSPSource2.cpp | 35 // Default Buffer Underflow/Prepare/StartServer/Overflow Marks
328 bool *prepared, bool *underflow, bool *overflow, bool *startServer, bool *finished) {
380 *overflow = (overflowCount == numTracks);
386 bool prepared, underflow, overflow, startServer, finished; local
387 checkBuffering(&prepared, &underflow, &overflow, &startServer, &finished);
402 if (overflow && mHandler != NULL) {
|
| /frameworks/av/media/libmediaplayerservice/nuplayer/ |
| RTSPSource.cpp | 35 // Default Buffer Underflow/Prepare/StartServer/Overflow Marks
329 bool *prepared, bool *underflow, bool *overflow, bool *startServer, bool *finished) {
381 *overflow = (overflowCount == numTracks);
387 bool prepared, underflow, overflow, startServer, finished; local
388 checkBuffering(&prepared, &underflow, &overflow, &startServer, &finished);
403 if (overflow && mHandler != NULL) {
|
| /art/compiler/optimizing/ |
| induction_var_range.cc | 48 /** Computes a * b for a,b > 0 (at least until first overflow happens). */
49 static int64_t SafeMul(int64_t a, int64_t b, /*out*/ bool* overflow) {
51 *overflow = true;
56 /** Returns b^e for b,e > 0. Sets overflow if arithmetic wrap-around occurred. */
57 static int64_t IntPow(int64_t b, int64_t e, /*out*/ bool* overflow) {
63 pow = SafeMul(pow, b, overflow);
67 b = SafeMul(b, b, overflow);
1089 bool overflow = false; local
[all...] |
| /device/generic/goldfish/gps/ |
| gps_qemu.c | 229 int overflow; member in struct:__anon1721
249 r->overflow = 0;
643 if (r->overflow) {
644 r->overflow = (c != '\n');
649 r->overflow = 1;
[all...] |
| /external/icu/icu4c/source/common/ |
| ucnv.cpp | 1122 char *overflow, *t; local
1568 UChar *overflow, *t; local
1879 UChar *overflow; local
[all...] |
| /external/icu/icu4c/source/i18n/ |
| number_decimalquantity.cpp | 37 /** Helper function for safe subtraction (no overflow). */
231 bool overflow = uprv_add32_overflow(scale, delta, &scale); local
232 overflow = uprv_add32_overflow(origDelta, delta, &origDelta) || overflow;
233 // Make sure that precision + scale won't overflow, either
235 overflow = overflow || uprv_add32_overflow(scale, precision, &dummy);
236 return overflow;
527 // Remove trailing zeros; this can happen during integer overflow cases.
612 // TODO: Andy: There was a test failure because of integer overflow here. Should I d
[all...] |
| /external/libpng/contrib/libtests/ |
| tarith.c | 45 fprintf(stderr, "overflow in: %s\n", msg);
123 /* Check for overflow in the buffer by setting a marker. */
133 fprintf(stderr, "%g[%d] -> '%s'[%lu] buffer overflow\n", test,
609 int overflow = 0; local
684 if (!ok) ++overflow;
687 ok = 0, ++overflow, fpround = fp/*misleading*/;
691 fp, ok ? "ok" : "overflow");
698 fprintf(stderr, "%d * %d / %d -> overflow (expected %lld)\n", a,
701 fprintf(stderr, "%d * %d / %d -> %d (expected overflow %lld)\n", a,
725 "errors)\n", tested, overflow, passed, error, error64)
[all...] |
