- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 40 for udivisible (0.41 sec)
-
src/cmd/compile/internal/ssa/magic_test.go
} } } func testDivisibleExhaustiveU(t *testing.T, n uint) { maxU := uint64(1) << n for c := uint64(1); c < maxU; c++ { if !udivisibleOK(n, int64(c)) { continue } k := udivisible(n, int64(c)).k m := udivisible(n, int64(c)).m max := udivisible(n, int64(c)).max mask := ^uint64(0) >> (64 - n) for i := uint64(0); i < maxU; i++ { want := i%c == 0 mul := (i * m) & mask
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Apr 30 22:02:07 UTC 2019 - 9.1K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/magic.go
k: int64(k), m: m, max: max, } } func udivisible8(c int8) udivisibleData { return udivisible(8, int64(c)) } func udivisible16(c int16) udivisibleData { return udivisible(16, int64(c)) } func udivisible32(c int32) udivisibleData { return udivisible(32, int64(c)) } func udivisible64(c int64) udivisibleData { return udivisible(64, c) } // For signed integers, a similar method follows. //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Mar 26 19:58:25 UTC 2024 - 15.8K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/generic.rules
=> (Leq8U (RotateLeft8 <typ.UInt8> (Add8 <typ.UInt8> (Mul8 <typ.UInt8> (Const8 <typ.UInt8> [int8(sdivisible8(c).m)]) x) (Const8 <typ.UInt8> [int8(sdivisible8(c).a)]) ) (Const8 <typ.UInt8> [int8(8-sdivisible8(c).k)]) ) (Const8 <typ.UInt8> [int8(sdivisible8(c).max)]) ) (Eq16 x (Mul16 (Const16 [c]) (Sub16 (Rsh32x64 mul:(Mul32
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 22:21:05 UTC 2024 - 135.3K bytes - Viewed (0) -
pkg/registry/apps/deployment/strategy_test.go
errTests := []struct { name string newDeployment *apps.Deployment oldDeployment *apps.Deployment }{ { name: "validation on an existing deployment with divisible hugepages values to a new deployment with indivisible hugepages values", newDeployment: newDeploymentWithHugePageValue(api.ResourceHugePagesPrefix+"2Mi", resource.MustParse("2.1Mi")),
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Mon May 01 07:17:45 UTC 2023 - 9.1K bytes - Viewed (0) -
test/codegen/arithmetic.go
// ppc64x:"ANDCC",-"RLDICL",-"SRAD",-"CMP" a := n1%64 == 0 // signed divisible // 386:"TESTL\t[$]63",-"DIVL",-"SHRL" // amd64:"TESTQ\t[$]63",-"DIVQ",-"SHRQ" // arm:"AND\t[$]63",-".*udiv",-"SRA" // arm64:"TST\t[$]63",-"UDIV",-"ASR",-"AND" // ppc64x:"ANDCC",-"RLDICL",-"SRAD",-"CMP" b := n2%64 != 0 // signed indivisible return a, b } // Check that constant modulo divs get turned into MULs
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 17 15:28:00 UTC 2024 - 15.2K bytes - Viewed (0) -
test/sieve.go
func Generate(ch chan<- int) { for i := 2; ; i++ { ch <- i // Send 'i' to channel 'ch'. } } // Copy the values from channel 'in' to channel 'out', // removing those divisible by 'prime'. func Filter(in <-chan int, out chan<- int, prime int) { for { i := <-in // Receive value of new variable 'i' from 'in'. if i%prime != 0 { out <- i // Send 'i' to channel 'out'. } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Feb 24 00:48:19 UTC 2012 - 1K bytes - Viewed (0) -
cmd/metacache-bucket_test.go
"testing" ) func Benchmark_bucketMetacache_findCache(b *testing.B) { bm := newBucketMetacache("", false) const elements = 50000 const paths = 100 if elements%paths != 0 { b.Fatal("elements must be divisible by the number of paths") } var pathNames [paths]string for i := range pathNames[:] { pathNames[i] = fmt.Sprintf("prefix/%d", i) } for i := 0; i < elements; i++ { bm.findCache(listPathOptions{
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri Mar 25 23:29:45 UTC 2022 - 1.8K bytes - Viewed (0) -
test/chan/sieve1.go
func Generate(ch chan<- int) { for i := 2; ; i++ { ch <- i // Send 'i' to channel 'ch'. } } // Copy the values from channel 'in' to channel 'out', // removing those divisible by 'prime'. func Filter(in <-chan int, out chan<- int, prime int) { for i := range in { // Loop over values received from 'in'. if i%prime != 0 { out <- i // Send 'i' to channel 'out'. } } }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun Feb 19 06:44:02 UTC 2012 - 1.5K bytes - Viewed (0) -
pkg/apis/core/v1/helper/helpers.go
pageSize := strings.TrimPrefix(string(name), v1.ResourceHugePagesPrefix) return resource.ParseQuantity(pageSize) } // HugePageUnitSizeFromByteSize returns hugepage size has the format. // `size` must be guaranteed to divisible into the largest units that can be expressed. // <size><unit-prefix>B (1024 = "1KB", 1048576 = "1MB", etc). func HugePageUnitSizeFromByteSize(size int64) (string, error) {
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu May 30 23:03:54 UTC 2024 - 11.4K bytes - Viewed (0) -
tensorflow/compiler/mlir/tensorflow/tests/tf_device_ops_invalid.mlir
} // ----- // Check number of replicated inputs is evenly divisible by 'n'. func.func @verifier_replicate_bad_operandSegmentSizes(%arg0: tensor<*xi32>) { "tf_device.replicate" (%arg0, %arg0, %arg0, %arg0) ({ // expected-error@-1 {{'tf_device.replicate' op expects number of replicated inputs (4) to be evenly divisible by 'n' (3)}} ^entry(%input0: tensor<*xi32>, %input1: tensor<*xi32>): tf_device.return
Registered: Sun Jun 16 05:45:23 UTC 2024 - Last Modified: Mon Aug 14 15:35:49 UTC 2023 - 9.8K bytes - Viewed (0)