| /external/v8/test/mjsunit/ |
| H A D | deopt-minus-zero.js | 30 function mul (a, b) { function
34 mul(-1, -1);
35 mul(0x80000001|0, -1);
36 mul(0x80000001|0, -1);
37 %OptimizeFunctionOnNextCall(mul);
38 mul(0, -1);
39 %OptimizeFunctionOnNextCall(mul);
40 mul(0, -1);
42 assertOptimized(mul);
|
| H A D | div-mul-minus-one.js | 41 function mul(g) { function
45 expected_MinInt = mul(kMinInt);
46 expected_minus_zero = mul(0);
47 %OptimizeFunctionOnNextCall(mul);
48 assertEquals(expected_MinInt, mul(kMinInt));
49 assertOptimized(mul);
50 assertEquals(expected_minus_zero , mul(0));
51 assertOptimized(mul);
|
| H A D | smi-mul.js | 30 function mul(a, b) { function
35 mul(-1, 2);
36 mul(-1, 2);
37 %OptimizeFunctionOnNextCall(mul);
38 assertEquals(-2, mul(-1, 2));
39 assertOptimized(mul);
42 assertEquals(-0, mul(-1, 0));
43 assertUnoptimized(mul);
|
| /external/v8/test/mjsunit/regress/ |
| H A D | regress-2132.js | 30 function mul(x, y) { function
34 mul(0, 0);
35 mul(0, 0);
36 %OptimizeFunctionOnNextCall(mul);
37 assertEquals(0, mul(0, -1));
38 assertOptimized(mul);
|
| H A D | regress-1278.js | 41 function mul(x, y) { function
60 assertEquals(0, mul(0, 0));
61 assertEquals(-0, mul(0, -0));
62 assertEquals(-0, mul(-0, 0));
63 assertEquals(0, mul(-0, -0));
|
| /external/valgrind/memcheck/tests/ |
| H A D | wrap2.c | 9 int mul ( int x, int y ) { return x * y; } function
13 if (n == 0) return 1; else return mul(n, fact(n-1));
|
| H A D | wrap3.c | 13 int mul ( int x, int y ) { return x * y; } function
17 if (n == 0) return 1; else return mul(n, fact2(n-1));
21 if (n == 0) return 1; else return mul(n, fact1(n-1));
|
| H A D | wrap4.c | 17 int mul ( int x, int y ) { return x * y; } function
21 if (n == 0) return 1; else return mul(n, fact2(n-1));
25 if (n == 0) return 1; else return mul(n, fact1(n-1));
|
| H A D | wrap5.c | 37 int mul ( int x, int y ) { return x * y; } function
42 if (n == 0) return 1; else return mul(n, fact2(n-1));
47 if (n == 0) return 1; else return mul(n, fact1(n-1));
|
| H A D | wrap8.c | 44 int mul ( int x, int y ) { return x * y; } function
49 if (n == 0) return 1; else return mul(n, fact2(n-1));
54 if (n == 0) return 1; else return mul(n, fact1(n-1));
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/raw/ |
| H A D | Nat384.java | 6 public static void mul(int[] x, int[] y, int[] zz) method in class:Nat384
8 Nat192.mul(x, y, zz);
9 Nat192.mul(x, 6, y, 6, zz, 12);
19 Nat192.mul(dx, dy, tt);
|
| H A D | Nat512.java | 6 public static void mul(int[] x, int[] y, int[] zz) method in class:Nat512
8 Nat256.mul(x, y, zz);
9 Nat256.mul(x, 8, y, 8, zz, 16);
19 Nat256.mul(dx, dy, tt);
|
| H A D | Nat192.java | 271 public static void mul(int[] x, int[] y, int[] zz) method in class:Nat192
328 public static void mul(int[] x, int xOff, int[] y, int yOff, int[] zz, int zzOff) method in class:Nat192
|
| H A D | Nat224.java | 342 public static void mul(int[] x, int[] y, int[] zz) method in class:Nat224
406 public static void mul(int[] x, int xOff, int[] y, int yOff, int[] zz, int zzOff) method in class:Nat224
|
| H A D | Nat256.java | 365 public static void mul(int[] x, int[] y, int[] zz) method in class:Nat256
436 public static void mul(int[] x, int xOff, int[] y, int yOff, int[] zz, int zzOff) method in class:Nat256
|
| /external/llvm/test/MC/ARM/ |
| H A D | mul-v4.s | 5 @ ARMV4: mul r0, r1, r2 @ encoding: [0x91,0x02,0x00,0xe0]
9 mul r0, r1, r2 label
|
| /external/v8/test/cctest/compiler/ |
| H A D | test-schedule.cc | 141 Node* mul = graph.NewNode(machine.Int32Mul(), param0, param1); local
142 Node* ret = graph.NewNode(common.Return(), mul, start);
|
| /external/skia/gm/ |
| H A D | colorfilters.cpp | 33 static void install_lighting(SkPaint* paint, uint32_t mul, uint32_t add) { argument
34 paint->setColorFilter(SkColorFilter::CreateLightingFilter(mul, add))->unref();
|
| /external/v8/src/base/ |
| H A D | division-by-constant.cc | 54 T mul = q2 + 1; member in namespace:v8::base
55 return {neg ? (0 - mul) : mul, p - bits, false};
|
| /external/valgrind/perf/ |
| H A D | bigcode.c | 54 const int mul = atoi(argv[1]); local
55 if (mul == 0)
58 n_fns = N_LOOPS * mul;
|
| /external/tcpdump/ |
| H A D | checksum.c | 149 u_int32_t mul; local
175 mul = (length - checksum_offset)*(c0);
177 x = mul - c0 - c1;
178 y = c1 - mul - 1;
|
| /external/boringssl/src/crypto/bn/asm/ |
| H A D | x86_64-gcc.c | 61 #undef mul macro
86 #define mul(r, a, word, carry) \ macro
140 mul(rp[0], ap[0], w, c1);
141 mul(rp[1], ap[1], w, c1);
142 mul(rp[2], ap[2], w, c1);
143 mul(rp[3], ap[3], w, c1);
149 mul(rp[0], ap[0], w, c1);
153 mul(rp[1], ap[1], w, c1);
157 mul(rp[2], ap[2], w, c1);
|
| /external/mesa3d/src/glsl/ |
| H A D | ir_builder.cpp | 186 ir_expression *mul(operand a, operand b) function in namespace:ir_builder
|
| H A D | loop_controls.cpp | 130 ir_expression *const mul = local
135 new(mem_ctx) ir_expression(ir_binop_add, mul->type, mul, from);
|
| /external/skia/src/effects/ |
| H A D | SkEmbossMask.cpp | 113 int mul = ambient; local
128 mul = SkFastMin32(mul + dot, 255);
150 multiply[x] = SkToU8(mul);
|