/external/opencv3/3rdparty/libjasper/jasper/ |
jas_fix.h | 128 * One macro always performs overflow/underflow checking, one never performs 129 * overflow/underflow checking, and one is generic with its behavior 141 /* Calculate the sum of two fixed-point numbers without overflow checking. */ 144 /* Calculate the sum of two fixed-point numbers with overflow checking. */ 159 /* Calculate the product of two fixed-point numbers without overflow 165 /* Calculate the product of two fixed-point numbers with overflow 181 /* Calculate the product of a fixed-point number and an int without overflow 186 /* Calculate the product of a fixed-point number and an int with overflow 215 /* Negate a fixed-point number without overflow checking. */ 219 /* Negate a fixed-point number with overflow checking. * [all...] |
/external/libvpx/libvpx/vp9/encoder/x86/ |
vp9_highbd_error_avx.asm | 66 ; Accumulate horizontally in 64 bits, there is no chance of overflow here 101 pxor xm5, xm5 ; overflow detection register for xm4 103 pxor xm7, xm7 ; overflow detection register for xm6 142 ; We accumulate using 32 bit arithmetic, but detect potential overflow 148 por xm5, xm4 ; OR in the accumulator for overflow detection 149 por xm7, xm6 ; OR in the accumulator for overflow detection 155 por xm5, xm4 ; OR in the accumulator for overflow detection 157 por xm7, xm6 ; OR in the accumulator for overflow detection 159 ; Check for possibility of overflow by testing if bit 32 of each dword lane 160 ; have ever been set. If they were not, then there was no overflow and th [all...] |
/external/llvm/test/Transforms/InstSimplify/ |
call.ll | 3 declare {i8, i1} @llvm.uadd.with.overflow.i8(i8 %a, i8 %b) 4 declare {i8, i1} @llvm.usub.with.overflow.i8(i8 %a, i8 %b) 5 declare {i8, i1} @llvm.ssub.with.overflow.i8(i8 %a, i8 %b) 6 declare {i8, i1} @llvm.umul.with.overflow.i8(i8 %a, i8 %b) 10 %x = call {i8, i1} @llvm.uadd.with.overflow.i8(i8 254, i8 3) 11 %overflow = extractvalue {i8, i1} %x, 1 12 ret i1 %overflow 18 %x = call {i8, i1} @llvm.uadd.with.overflow.i8(i8 254, i8 44) 26 %x = call {i8, i1} @llvm.usub.with.overflow.i8(i8 %V, i8 %V) 33 %x = call {i8, i1} @llvm.ssub.with.overflow.i8(i8 %V, i8 %V [all...] |
/bionic/libc/tzcode/ |
difftime.c | 30 ** The difference of two unsigned values can't overflow 44 ** (meaning that their difference cannot overflow).
|
/dalvik/dx/tests/127-merge-stress/com/android/dx/merge/ |
MergeTest.java | 24 // but not more to avoid dex index overflow. 37 // ignore index overflow
|
/external/clang/test/Analysis/ |
rdar-6541136-region.c | 18 kernel_tea_cheese_t r = *q; // expected-warning{{Access out-of-bound array element (buffer overflow)}} 26 *p = 1; // expected-warning{{Access out-of-bound array element (buffer overflow)}}
|
outofbound.c | 10 return s[5] + c; // expected-warning{{Access out-of-bound array element (buffer overflow)}} 15 p[3] = 4; // expected-warning{{Access out-of-bound array element (buffer overflow)}} 30 p[1] = a; // expected-warning{{Access out-of-bound array element (buffer overflow)}} 38 p[2] = a; // expected-warning{{Access out-of-bound array element (buffer overflow)}} 119 if (in < ins[eee]) { // expected-warning {{Access out-of-bound array element (buffer overflow)}}
|
/external/clang/test/CodeGenCXX/ |
operator-new.cpp | 20 // rdar://5739832 - operator new should check for overflow in multiply. 24 // SANE: [[UWO:%.*]] = call {{.*}} @llvm.umul.with.overflow
|
/external/compiler-rt/test/asan/TestCases/Darwin/ |
suppressions-sandbox.cc | 23 // CHECK-CRASH: AddressSanitizer: heap-buffer-overflow 25 // CHECK-IGNORE-NOT: AddressSanitizer: heap-buffer-overflow
|
/external/compiler-rt/test/asan/TestCases/ |
stack-buffer-overflow.cc | 12 // CHECK: {{ #0 0x.* in main .*stack-buffer-overflow.cc:}}[[@LINE-2]] 14 // CHECK-NEXT: in{{.*}}main{{.*}}stack-buffer-overflow.cc
|
/external/kernel-headers/original/uapi/asm-mips/asm/ |
break.h | 20 #define BRK_OVERFLOW 6 /* Overflow check */ 29 #define BRK_MULOVF 1023 /* Multiply overflow */
|
/external/llvm/test/CodeGen/AArch64/ |
setcc-takes-i32.ll | 12 declare {i64, i1} @llvm.umul.with.overflow.i64(i64, i64) 17 %res = call {i64, i1} @llvm.umul.with.overflow.i64(i64 %lhs, i64 %rhs)
|
/external/llvm/test/CodeGen/X86/ |
2009-04-12-FastIselOverflowCrash.ll | 7 declare %0 @llvm.sadd.with.overflow.i32(i32, i32) nounwind 11 %tmp1 = call %0 @llvm.sadd.with.overflow.i32(i32 1, i32 0)
|
cse-add-with-overflow.ll | 29 %tmp16 = tail call { i32, i1 } @llvm.sadd.with.overflow.i32(i32 %tmp14, i32 %tmp15) 43 declare { i32, i1 } @llvm.sadd.with.overflow.i32(i32, i32)
|
muloti.ll | 16 %0 = tail call %1 @llvm.smul.with.overflow.i128(i128 %ins14, i128 %ins) 20 br i1 %2, label %overflow, label %nooverflow 22 overflow: ; preds = %entry 59 %6 = call %1 @llvm.umul.with.overflow.i128(i128 %tmp, i128 %tmp2) 64 br i1 %8, label %overflow, label %nooverflow 66 overflow: ; preds = %entry 77 declare %1 @llvm.umul.with.overflow.i128(i128, i128) nounwind readnone 79 declare %1 @llvm.smul.with.overflow.i128(i128, i128) nounwind readnone
|
/external/skia/src/animator/ |
SkDisplayNumber.cpp | 36 // we are intentionally causing an overflow here 37 // (warning C4756: overflow in constant arithmetic)
|
/external/v8/test/mjsunit/regress/ |
regress-crbug-614727.js | 11 // not cause a stack overflow, but big enough to move the allocated arguments 19 // turn trigger a stack overflow on 64-bit machines, which we need to catch.
|
/external/dng_sdk/source/ |
dng_safe_arithmetic.cpp | 11 // https://www.securecoding.cert.org/confluence/display/c/INT32-C.+Ensure+that+operations+on+signed+integers+do+not+result+in+overflow 36 ThrowProgramError("Arithmetic overflow"); 49 ThrowProgramError("Arithmetic overflow"); 105 ThrowProgramError("Arithmetic overflow"); 115 ThrowProgramError("Arithmetic overflow"); 171 ThrowProgramError("Arithmetic overflow"); 183 bool overflow = true; local 187 overflow = (arg1 > std::numeric_limits<std::int64_t>::max() / arg2); 189 overflow = (arg2 < std::numeric_limits<std::int64_t>::min() / arg1); 193 overflow = (arg1 < std::numeric_limits<std::int64_t>::min() / arg2) [all...] |
/external/libchrome/base/time/ |
time.cc | 31 // Preserve max to prevent overflow. 39 // Preserve max to prevent overflow. 47 // Preserve max to prevent overflow. 55 // Preserve max to prevent overflow. 63 // Preserve max to prevent overflow. 71 // Preserve max to prevent overflow. 79 // Preserve max to prevent overflow. 87 // Preserve max to prevent overflow. 96 // Preserve max to prevent overflow. 156 // Preserve max without offset to prevent overflow [all...] |
/external/libweave/third_party/chromium/base/time/ |
time.cc | 28 // Preserve max to prevent overflow. 36 // Preserve max to prevent overflow. 44 // Preserve max to prevent overflow. 52 // Preserve max to prevent overflow. 60 // Preserve max to prevent overflow. 68 // Preserve max to prevent overflow. 76 // Preserve max to prevent overflow. 84 // Preserve max to prevent overflow. 93 // Preserve max to prevent overflow. 153 // Preserve max without offset to prevent overflow [all...] |
/external/bison/lib/ |
xmalloc.c | 96 /* Test for overflow, since some calloc implementations don't have 97 proper overflow checks. But omit overflow and size-zero tests if 98 HAVE_GNU_CALLOC, since GNU calloc catches overflow and never 108 need for an arithmetic overflow check. */
|
/external/chromium-trace/catapult/netlog_viewer/netlog_viewer/ |
events_view.css | 9 overflow: hidden; 21 overflow: hidden; 26 overflow-x: hidden; 27 overflow-y: auto 44 text-overflow: ellipsis;
|
/external/clang/test/CodeGen/ |
builtins-multiprecision.c | 8 // CHECK: %{{.+}} = {{.*}} call { i8, i1 } @llvm.uadd.with.overflow.i8(i8 %x, i8 %y) 11 // CHECK: %{{.+}} = {{.*}} call { i8, i1 } @llvm.uadd.with.overflow.i8(i8 %{{.+}}, i8 %carryin) 27 // CHECK: %{{.+}} = {{.*}} call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %x, i16 %y) 30 // CHECK: %{{.+}} = {{.*}} call { i16, i1 } @llvm.uadd.with.overflow.i16(i16 %{{.+}}, i16 %carryin) 45 // CHECK: %{{.+}} = {{.*}} call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 %x, i32 %y) 48 // CHECK: %{{.+}} = {{.*}} call { i32, i1 } @llvm.uadd.with.overflow.i32(i32 %{{.+}}, i32 %carryin) 64 // CHECK: %{{.+}} = {{.*}} call { [[UL]], i1 } @llvm.uadd.with.overflow.[[UL]]([[UL]] %x, [[UL]] %y) 67 // CHECK: %{{.+}} = {{.*}} call { [[UL]], i1 } @llvm.uadd.with.overflow.[[UL]]([[UL]] %{{.+}}, [[UL]] %carryin) 83 // CHECK: %{{.+}} = {{.*}} call { i64, i1 } @llvm.uadd.with.overflow.i64(i64 %x, i64 %y) 86 // CHECK: %{{.+}} = {{.*}} call { i64, i1 } @llvm.uadd.with.overflow.i64(i64 %{{.+}}, i64 %carryin [all...] |
/external/llvm/test/Transforms/CodeGenPrepare/ |
overflow-intrinsics.ll | 7 ; CHECK: llvm.uadd.with.overflow 18 ; CHECK: llvm.uadd.with.overflow 29 ; CHECK: llvm.uadd.with.overflow 40 ; CHECK: llvm.uadd.with.overflow 59 ; CHECK-NOT: llvm.uadd.with.overflow
|
/external/llvm/test/Transforms/IndVarSimplify/ |
overflowcheck.ll | 9 ; CHECK: @llvm.sadd.with.overflow 13 ; CHECK: @llvm.sadd.with.overflow 33 %adds = call { i32, i1 } @llvm.sadd.with.overflow.i32(i32 %s, i32 %truncv) 39 %i1 = call { i32, i1 } @llvm.sadd.with.overflow.i32(i32 %i, i32 1) 56 declare { i32, i1 } @llvm.sadd.with.overflow.i32(i32, i32)
|