- Sort Score
- Result 10 results
- Languages All
Results 171 - 180 of 225 for MULTIPLY (0.12 sec)
-
src/math/big/ratconv.go
case 2: exp2 += exp default: panic("unexpected exponent base") } // exp consumed - not needed anymore // apply exp5 contributions // (start with exp5 so the numbers to multiply are smaller) if exp5 != 0 { n := exp5 if n < 0 { n = -n if n < 0 { // This can occur if -n overflows. -(-1 << 63) would become // -1 << 63, which is still negative.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Nov 15 22:16:34 UTC 2023 - 12.3K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/experimental/remat/rematerializer_test.cc
if (forward_tensor >= 0) AddUse(op, forward_tensor); forward_tensor = AddTensor(size); AddUse(op, forward_tensor); } // Backward pass: Right-multiply the jacobian from the outside in. // dLoss/df[n] * df[n]/df[n-1] * ... // The i-th term g[i] depends on g[i-1] and f[n-i] and has size |f[n-i]|. for (; forward_tensor >= 0; --forward_tensor) {
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue Mar 14 20:57:44 UTC 2023 - 19.1K bytes - Viewed (0) -
src/crypto/internal/bigmod/nat.go
out.montgomeryMul(out, out, m) // Select x^k in constant time from the table. k := uint((b >> j) & 0b1111) for i := range table { tmp.assign(ctEq(k, uint(i+1)), table[i]) } // Multiply by x^k, discarding the result if k = 0. tmp.montgomeryMul(out, tmp, m) out.assign(not(ctEq(k, 0)), tmp) } } return out.montgomeryReduction(m) }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 24K bytes - Viewed (0) -
src/cmd/go/internal/generate/generate.go
// Create command shorthand. if len(words) == 1 { g.errorf("no command specified for -command") } command := words[1] if g.commands[command] != nil { g.errorf("command %q multiply defined", command) } g.commands[command] = slices.Clip(words[2:]) } // exec runs the command specified by the argument. The first word is // the command name itself.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Jan 29 19:39:24 UTC 2024 - 14.5K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/tests/legalize_hlo.mlir
%0 = "mhlo.broadcast_in_dim"(%arg0) <{broadcast_dimensions = dense<[0, 1]> : tensor<2xi64>}> : (tensor<1x1xf32>) -> tensor<1x1000xf32> %1 = mhlo.multiply %0, %arg1 : tensor<1x1000xf32> %2 = mhlo.multiply %arg1, %0 : tensor<1x1000xf32> func.return %1, %2 : tensor<1x1000xf32>, tensor<1x1000xf32> } // CHECK-LABEL: func @broadcast_mul_chlo(
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Wed May 29 07:26:59 UTC 2024 - 340.2K bytes - Viewed (0) -
tensorflow/compiler/mlir/tf2xla/tests/legalize-tf-binary-elementwise.mlir
func.return %0 : tensor<4xf32> } // CHECK-LABEL: func @mul func.func @mul(%arg0: tensor<2xi32>) -> tensor<2xi32> { // CHECK-NEXT: %0 = mhlo.multiply %arg0, %arg0 : tensor<2xi32> // CHECK-NEXT: return %0 : tensor<2xi32> %0 = "tf.Mul"(%arg0, %arg0) : (tensor<2xi32>, tensor<2xi32>) -> tensor<2xi32> func.return %0: tensor<2xi32> }
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Sat Apr 06 15:32:52 UTC 2024 - 18.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/quantization/stablehlo/passes/replace_stablehlo_ops_in_main_function_with_xla_call_module_ops.cc
// // Consider a sequence of op: // // ``` // node 1: %0 = stablehlo.constant // node 2: %1 = stablehlo.constant // node 3: %2 = stablehlo.add %0, %1 // node 4: %3 = stablehlo.multiply %2, %1 // node 5: return %3 // ``` // // In Backward Liveliness analysis, the liveliness for each node above becomes: // live_in[5] = use[5] U (live_out[5] - def[5])
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 21K bytes - Viewed (0) -
src/strconv/ftoaryu.go
ml, mc, mu, e2 := computeBounds(mant, exp, flt) if e2 == 0 { ryuDigits(d, ml, mc, mu, true, false) return } // Find 10^q *larger* than 2^-e2 q := mulByLog2Log10(-e2) + 1 // We are going to multiply by 10^q using 128-bit arithmetic. // The exponent is the same for all 3 numbers. var dl, dc, du uint64 var dl0, dc0, du0 bool if flt == &float32info { var dl32, dc32, du32 uint32
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Sep 09 00:28:56 UTC 2022 - 15.7K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/RISCV64.rules
(FSUB(S|D) a (FMUL(S|D) x y)) && a.Block.Func.useFMA(v) => (FNMSUB(S|D) x y a) (FSUB(S|D) (FMUL(S|D) x y) a) && a.Block.Func.useFMA(v) => (FMSUB(S|D) x y a) // Merge negation into fused multiply-add and multiply-subtract. // // Key: // // [+ -](x * y [+ -] z). // _ N A S // D U // D B // // Note: multiplication commutativity handled by rule generator.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Mar 07 14:57:07 UTC 2024 - 40.3K bytes - Viewed (0) -
android/guava-tests/test/com/google/common/net/InetAddressesTest.java
checkBigIntegerConversion("127.255.255.255", BigInteger.valueOf(Integer.MAX_VALUE)); checkBigIntegerConversion( "255.255.255.254", BigInteger.valueOf(Integer.MAX_VALUE).multiply(BigInteger.valueOf(2))); checkBigIntegerConversion( "255.255.255.255", BigInteger.ONE.shiftLeft(32).subtract(BigInteger.ONE)); } public void testFromIpv6BigIntegerValid() {
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri May 24 16:44:05 UTC 2024 - 35.3K bytes - Viewed (0)