- Sort Score
- Result 10 results
- Languages All
Results 261 - 270 of 584 for MASK (0.08 sec)
-
src/cmd/go/testdata/script/build_trimpath_goroot.txt
# If a correct GOROOT is baked in to the 'go' command itself, 'go run' and # 'go test' should not implicitly set GOROOT in the process environment # (because that could mask an unexpected production dependency on the GOROOT # environment variable), but 'go generate' should (because the generator may # reasonably expect to be able to locate the GOROOT for which it is generating # code).
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed Feb 21 22:16:54 UTC 2024 - 2.8K bytes - Viewed (0) -
cni/pkg/iptables/iptables_linux.go
inpodMarkRule := netlink.NewRule() inpodMarkRule.Family = family inpodMarkRule.Table = RouteTableInbound inpodMarkRule.Mark = InpodTProxyMark inpodMarkRule.Mask = InpodTProxyMask inpodMarkRule.Priority = 32764 rules = append(rules, inpodMarkRule) } for _, rule := range rules { log.Debugf("Iterating netlink rule : %+v", rule) if err := f(rule); err != nil {
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Tue Apr 30 22:24:38 UTC 2024 - 3.3K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/BloomFilterStrategies.java
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Mon Oct 10 19:45:10 UTC 2022 - 10.7K bytes - Viewed (0) -
src/math/cmplx/tan.go
return ((x - t*PI1) - t*PI2) - t*PI3 } // Must apply Payne-Hanek range reduction const ( mask = 0x7FF shift = 64 - 11 - 1 bias = 1023 fracMask = 1<<shift - 1 ) // Extract out the integer and exponent such that, // x = ix * 2 ** exp. ix := math.Float64bits(x) exp := int(ix>>shift&mask) - bias - shift ix &= fracMask ix |= 1 << shift
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 01 03:16:37 UTC 2020 - 8.5K bytes - Viewed (0) -
src/reflect/type.go
} // Element is small with pointer mask; use as literal bits. ptrs := typ.PtrBytes / goarch.PtrSize mask := typ.GcSlice(0, (ptrs+7)/8) // Emit 120-bit chunks of full bytes (max is 127 but we avoid using partial bytes). for ; ptrs > 120; ptrs -= 120 { dst = append(dst, 120) dst = append(dst, mask[:15]...) mask = mask[15:] } dst = append(dst, byte(ptrs))
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 29 17:58:53 UTC 2024 - 85.5K bytes - Viewed (0) -
cmd/peer-rest-server.go
} pattern := event.NewPattern(prefix, suffix) var eventNames []event.Name var mask pubsub.Mask for _, ev := range values[peerRESTListenEvents] { eventName, err := event.ParseName(ev) if err != nil { return grid.NewRemoteErr(err) } mask.MergeMaskable(eventName) eventNames = append(eventNames, eventName) }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 52.1K bytes - Viewed (0) -
src/vendor/golang.org/x/net/idna/trieval.go
// table size significantly. // // The per-rune values have the following format: // // if mapped { // if inlinedXOR { // 15..13 inline XOR marker // 12..11 unused // 10..3 inline XOR mask // } else { // 15..3 index into xor or mapping table // } // } else { // 15..14 unused // 13 mayNeedNorm // 12..11 attributes // 10..8 joining type // 7..3 category type
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 02 04:45:15 UTC 2022 - 3K bytes - Viewed (0) -
src/cmd/vendor/golang.org/x/sys/unix/ztypes_linux_s390x.go
Acrs [16]uint32 Orig_gpr2 uint64 Fp_regs PtraceFpregs Per_info PtracePer Ieee_instruction_pointer uint64 } type PtracePsw struct { Mask uint64 Addr uint64 } type PtraceFpregs struct { Fpc uint32 Fprs [16]float64 } type PtracePer struct { Control_regs [3]uint64 _ [8]byte Starting_addr uint64
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 08 16:12:58 UTC 2024 - 12.6K bytes - Viewed (0) -
src/internal/runtime/atomic/atomic_s390x.s
TEXT ·Or8(SB), NOSPLIT, $0-9 MOVD ptr+0(FP), R3 MOVBZ val+8(FP), R4 // We don't have atomic operations that work on individual bytes so we // need to align addr down to a word boundary and create a mask // containing v to OR with the entire word atomically. MOVD $(3<<3), R5 RXSBG $59, $60, $3, R3, R5 // R5 = 24 - ((addr % 4) * 8) = ((addr & 3) << 3) ^ (3 << 3) ANDW $~3, R3 // R3 = floor(addr, 4) = addr &^ 3
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Mar 25 19:53:03 UTC 2024 - 7.1K bytes - Viewed (0) -
src/internal/bisect/bisect.go
} if n <= 0 { return nil, &parseError{"invalid pattern syntax: " + pattern} } if p[start] == 'y' { n = 0 } mask := uint64(1)<<n - 1 m.list = append(m.list, cond{mask, bits, result}) } else if c == '-' { // leading - subtracts from complete set m.list = append(m.list, cond{0, 0, true}) } bits = 0 result = c == '+'
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri May 03 17:28:43 UTC 2024 - 22.9K bytes - Viewed (0)