- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 10 for mask1 (0.1 sec)
-
src/crypto/sha1/sha1.go
if i >= 56 { // we might have to write the length here if all fit in one block d.x[i] |= mask1b & length[i-56] } } // compress, and only keep the digest if all fit in one block block(d, d.x[:]) var digest [Size]byte for i, s := range d.h { digest[i*4] = mask1b & byte(s>>24) digest[i*4+1] = mask1b & byte(s>>16) digest[i*4+2] = mask1b & byte(s>>8)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu May 16 16:50:58 UTC 2024 - 5.7K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/tasks/DeferredTaskFailureIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Fri May 17 13:27:33 UTC 2024 - 9.2K bytes - Viewed (0) -
subprojects/core/src/integTest/groovy/org/gradle/api/tasks/options/MultipleTaskOptionsIntegrationTest.groovy
Registered: Wed Jun 12 18:38:38 UTC 2024 - Last Modified: Mon May 20 11:16:24 UTC 2024 - 3.9K bytes - Viewed (0) -
pkg/controller/nodeipam/node_ipam_controller.go
} for idx, cidr := range clusterCIDRs { mask := cidr.Mask if maskSize, _ := mask.Size(); maskSize > nodeCIDRMaskSizes[idx] { return nil, fmt.Errorf("Controller: Invalid --cluster-cidr, mask size of cluster CIDR must be less than or equal to --node-cidr-mask-size configured for CIDR family") } } } ic := &Controller{ cloud: cloud,
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jun 06 16:18:38 UTC 2024 - 5.4K bytes - Viewed (0) -
cmd/listen-notification-handlers.go
} pattern := event.NewPattern(prefix, suffix) var eventNames []event.Name var mask pubsub.Mask for _, s := range values[peerRESTListenEvents] { eventName, err := event.ParseName(s) if err != nil { writeErrorResponse(ctx, w, toAPIError(ctx, err), r.URL) return } mask.MergeMaskable(eventName) eventNames = append(eventNames, eventName) } if bucketName != "" {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 6K bytes - Viewed (0) -
src/cmd/compile/internal/ssa/_gen/PPC64latelower.rules
// The upper bits of the smaller than register values is undefined. Take advantage of that. (AND <t> x:(MOVDconst [m]) n) && t.Size() <= 2 => (ANDconst [int64(int16(m))] n) // Convert simple bit masks to an equivalent rldic[lr] if possible. (AND x:(MOVDconst [m]) n) && isPPC64ValidShiftMask(m) => (RLDICL [encodePPC64RotateMask(0,m,64)] n)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Wed May 22 19:59:38 UTC 2024 - 3.8K bytes - Viewed (0) -
test/codegen/bits.go
} func bitSetTest(x int) bool { // amd64:"ANDL\t[$]9, AX" // amd64:"CMPQ\tAX, [$]9" return x&9 == 9 } // mask contiguous one bits func cont1Mask64U(x uint64) uint64 { // s390x:"RISBGZ\t[$]16, [$]47, [$]0," return x & 0x0000ffffffff0000 } // mask contiguous zero bits func cont0Mask64U(x uint64) uint64 { // s390x:"RISBGZ\t[$]48, [$]15, [$]0," return x & 0xffff00000000ffff }
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Jun 07 19:02:52 UTC 2024 - 7.8K bytes - Viewed (0) -
android/guava/src/com/google/common/hash/LittleEndianByteArray.java
source[offset]); } @Override public void putLongLittleEndian(byte[] sink, int offset, long value) { long mask = 0xFFL; for (int i = 0; i < 8; mask <<= 8, i++) { sink[offset + i] = (byte) ((value & mask) >> (i * 8)); } } } } static { LittleEndianBytes theGetter = JavaLittleEndianBytes.INSTANCE; try { /*
Registered: Wed Jun 12 16:38:11 UTC 2024 - Last Modified: Fri Jun 07 22:25:23 UTC 2024 - 9.7K bytes - Viewed (0) -
src/crypto/aes/gcm_ppc64x.go
data = data[siz:] } if len(data) > 0 { var s [16]byte copy(s[:], data) gcmHash(hash[:], &g.productTable, s[:], len(s)) } } // auth calculates GHASH(ciphertext, additionalData), masks the result with // tagMask and writes the result to out. func (g *gcmAsm) auth(out, ciphertext, aad []byte, tagMask *[gcmTagSize]byte) { var hash [16]byte g.paddedGHASH(&hash, aad) g.paddedGHASH(&hash, ciphertext)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.4K bytes - Viewed (0) -
src/crypto/ecdh/nist.go
return newBoringPrivateKey(c, key, bytes) } key := make([]byte, len(c.scalarOrder)) randutil.MaybeReadByte(rand) for { if _, err := io.ReadFull(rand, key); err != nil { return nil, err } // Mask off any excess bits if the size of the underlying field is not a // whole number of bytes, which is only the case for P-521. We use a // pointer to the scalarOrder field because comparing generic and
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 8.1K bytes - Viewed (0)