- Sort Score
- Result 10 results
- Languages All
Results 1 - 8 of 8 for MULTIPLY (0.12 sec)
-
tensorflow/compiler/mlir/quantization/stablehlo/python/integration_test/quantize_model_test.py
module_str = self._extract_first_xla_call_module_op( self._output_saved_model_path ) # Tests that the output graph contains multiply for symmetric # dequantization. self.assertTrue(re.search('stablehlo.multiply', module_str)) # Tests that the output graph contains float dot_general. self.assertTrue( re.search('stablehlo.dot_general.*xf32>.*xf32>.*xf32>', module_str)
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Tue May 14 06:31:57 UTC 2024 - 51.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/lite/stablehlo/transforms/compose_uniform_quantized_type_pass.cc
// %13 = stablehlo.subtract %7, %12 // q1 * q2 - q2 * z1 // %14 = stablehlo.constant // Merged scale s1 * s2, precalculated. // %15 = stablehlo.broadcast_in_dim %14 // %16 = stablehlo.multiply %13 %15 // r3 = s1 s2 (q1 q2 - q2 z1) // // The following quant -> dequant pattern is a no-op, but is required to // retrieve the quantization parameters for the output tensor. //
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Thu Apr 25 16:01:03 UTC 2024 - 64.6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/PPC64.rules
(Sub32F ...) => (FSUBS ...) (Sub64F ...) => (FSUB ...) (Min(32|64)F x y) && buildcfg.GOPPC64 >= 9 => (XSMINJDP x y) (Max(32|64)F x y) && buildcfg.GOPPC64 >= 9 => (XSMAXJDP x y) // Combine 64 bit integer multiply and adds (ADD l:(MULLD x y) z) && buildcfg.GOPPC64 >= 9 && l.Uses == 1 && clobber(l) => (MADDLD x y z) (Mod16 x y) => (Mod32 (SignExt16to32 x) (SignExt16to32 y)) (Mod16u x y) => (Mod32u (ZeroExt16to32 x) (ZeroExt16to32 y))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 53.2K bytes - Viewed (0) -
src/math/big/int_test.go
// and the result are assumed to be in big-endian representation (to // match the semantics of Int.Bytes and Int.SetBytes). func mulBytes(x, y []byte) []byte { z := make([]byte, len(x)+len(y)) // multiply k0 := len(z) - 1 for j := len(y) - 1; j >= 0; j-- { d := int(y[j]) if d != 0 { k := k0 carry := 0 for i := len(x) - 1; i >= 0; i-- { t := int(z[k]) + int(x[i])*d + carry
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 18:42:28 UTC 2024 - 58.5K bytes - Viewed (0) -
src/crypto/tls/conn.go
payloadBytes-- // encrypted ContentType } // Allow packet growth in arithmetic progression up to max. pkt := c.packetsSent c.packetsSent++ if pkt > 1000 { return maxPlaintext // avoid overflow in multiply below } n := payloadBytes * int(pkt+1) if n > maxPlaintext { n = maxPlaintext } return n } func (c *Conn) write(data []byte) (int, error) { if c.buffering {
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 23 03:10:12 UTC 2024 - 51.8K bytes - Viewed (0) -
src/time/time.go
// // To count the number of units in a [Duration], divide: // // second := time.Second // fmt.Print(int64(second/time.Millisecond)) // prints 1000 // // To convert an integer number of units to a Duration, multiply: // // seconds := 10 // fmt.Print(time.Duration(seconds)*time.Second) // prints 10s const ( Nanosecond Duration = 1 Microsecond = 1000 * Nanosecond Millisecond = 1000 * Microsecond
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 50.7K bytes - Viewed (0) -
src/runtime/mgcscavenge.go
// will get messy. Just assume we did at least this much work. // All this means is that we'll sleep longer than we otherwise would have. worked = minScavWorkTime } // Multiply the critical time by 1 + the ratio of the costs of using // scavenged memory vs. scavenging memory. This forces us to pay down // the cost of reusing this memory eagerly by sleeping for a longer period
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 17:48:45 UTC 2024 - 52.3K bytes - Viewed (0) -
cmd/erasure-server-pool.go
if pctUsed := int(disk.Used * 100 / disk.Total); pctUsed > maxUsedPct { maxUsedPct = pctUsed } } // Since we are comparing pools that may have a different number of sets // we multiply by the number of sets in the pool. // This will compensate for differences in set sizes // when choosing destination pool. // Different set sizes are already compensated by less disks. available *= uint64(nSets[i])
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu May 30 11:58:12 UTC 2024 - 82.5K bytes - Viewed (0)