| /external/v8/test/mjsunit/ |
| 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);
|
| 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);
|
| 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/ |
| 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);
|
| 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/ |
| 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));
|
| 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));
|
| 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));
|
| 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));
|
| /external/bouncycastle/bcprov/src/main/java/org/bouncycastle/math/raw/ |
| 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);
|
| 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);
|
| /art/test/411-optimizing-arith/src/ |
| Main.java | 76 mul(); method
79 public static void mul() { method in class:Main
87 expectEquals(15, $opt$Mul(5, 3));
88 expectEquals(0, $opt$Mul(0, 0));
89 expectEquals(0, $opt$Mul(0, 3));
90 expectEquals(0, $opt$Mul(3, 0));
91 expectEquals(-3, $opt$Mul(1, -3));
92 expectEquals(36, $opt$Mul(-12, -3));
93 expectEquals(33, $opt$Mul(1, 3) * 11);
94 expectEquals(671088645, $opt$Mul(134217729, 5)); // (2^27 + 1) *
[all...] |
| /external/llvm/test/MC/ARM/ |
| mul-v4.s | 1 @ PR17647: MUL/MLA/SMLAL/UMLAL should be avalaibe to IAS for ARMv4 and higher
5 @ ARMV4: mul r0, r1, r2 @ encoding: [0x91,0x02,0x00,0xe0]
9 mul r0, r1, r2 label
|
| /external/v8/src/base/ |
| division-by-constant.cc | 54 T mul = q2 + 1; member in namespace:v8::base
55 return {neg ? (0 - mul) : mul, p - bits, false};
|
| /external/v8/test/cctest/compiler/ |
| test-schedule.cc | 141 Node* mul = graph.NewNode(machine.Int32Mul(), param0, param1); local
142 Node* ret = graph.NewNode(common.Return(), mul, start);
|
| /external/valgrind/perf/ |
| bigcode.c | 54 const int mul = atoi(argv[1]); local
55 if (mul == 0)
58 n_fns = N_LOOPS * mul;
|
| /prebuilts/python/darwin-x86/2.7.5/lib/python2.7/test/ |
| profilee.py | 43 return mul(n, factorial(n-1))
48 def mul(a, b): function
|
| test_list.py | 57 def mul(a, b): return a * b function in function:ListTest.test_overflow
59 self.assertRaises((MemoryError, OverflowError), mul, lst, n)
|
| /prebuilts/python/linux-x86/2.7.5/lib/python2.7/test/ |
| profilee.py | 43 return mul(n, factorial(n-1))
48 def mul(a, b): function
|
| test_list.py | 57 def mul(a, b): return a * b function in function:ListTest.test_overflow
59 self.assertRaises((MemoryError, OverflowError), mul, lst, n)
|
| /system/core/liblog/ |
| log_time.cpp | 104 unsigned long mul = NS_PER_SEC; local
109 while (isdigit(*ret) && num && (mul > 1)) {
111 mul /= 10;
112 tv_nsec = tv_nsec + (*ret - '0') * mul;
|
| /system/core/toolbox/upstream-netbsd/lib/libc/gen/ |
| getbsize.c | 57 long n, max, mul, blocksize; local
77 mul = GB;
82 mul = KB;
87 mul = MB;
91 mul = 1;
96 mul = 1;
104 if ((blocksize = n * mul) < 512) {
|
| /external/tcpdump/ |
| 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/ |
| 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/ |
| ir_builder.cpp | 186 ir_expression *mul(operand a, operand b) function in namespace:ir_builder
|
