- Sort Score
- Result 10 results
- Languages All
Results 101 - 110 of 182 for blockSize (0.28 sec)
-
src/crypto/tls/conn.go
plaintext, err = c.Open(payload[:0], nonce, payload, additionalData) if err != nil { return nil, 0, alertBadRecordMAC } case cbcMode: blockSize := c.BlockSize() minPayload := explicitNonceLen + roundUp(hc.mac.Size()+1, blockSize) if len(payload)%blockSize != 0 || len(payload) < minPayload { return nil, 0, alertBadRecordMAC } if explicitNonceLen > 0 { c.SetIV(payload[:explicitNonceLen])
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/crypto/aes/gcm_ppc64x.go
// details. func (g *gcmAsm) Seal(dst, nonce, plaintext, data []byte) []byte { if len(nonce) != g.nonceSize { panic("cipher: incorrect nonce length given to GCM") } if uint64(len(plaintext)) > ((1<<32)-2)*BlockSize { panic("cipher: message too large for GCM") } ret, out := sliceForAppend(dst, len(plaintext)+g.tagSize) var counter, tagMask [gcmBlockSize]byte g.deriveCounter(&counter, nonce)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 6.4K bytes - Viewed (0) -
cmd/erasure-multipart.go
case size < fi.Erasure.BlockSize: // No need to allocate fully fi.Erasure.BlockSize buffer if the incoming data is smaller. buffer = make([]byte, size, 2*size+int64(fi.Erasure.ParityBlocks+fi.Erasure.DataBlocks-1)) } if len(buffer) > int(fi.Erasure.BlockSize) { buffer = buffer[:fi.Erasure.BlockSize] } writers := make([]io.Writer, len(onlineDisks)) for i, disk := range onlineDisks { if disk == nil {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 06:56:12 UTC 2024 - 44.8K bytes - Viewed (0) -
cmd/erasure-metadata.go
if totalLength == -1 { return -1 } numShards := totalLength / e.BlockSize lastBlockSize := totalLength % e.BlockSize lastShardSize := ceilFrac(lastBlockSize, int64(e.DataBlocks)) return numShards*e.ShardSize() + lastShardSize } // ShardSize - returns actual shared size from erasure blockSize. func (e ErasureInfo) ShardSize() int64 { return ceilFrac(e.BlockSize, int64(e.DataBlocks)) }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Fri May 24 23:05:23 UTC 2024 - 19.4K bytes - Viewed (0) -
src/cmd/internal/notsha256/sha256_test.go
} func TestBlockSize(t *testing.T) { c := New() if got := c.BlockSize(); got != BlockSize { t.Errorf("BlockSize = %d want %d", got, BlockSize) } } // Tests that blockGeneric (pure Go) and block (in assembly for some architectures) match. func TestBlockGeneric(t *testing.T) { gen, asm := New().(*digest), New().(*digest) buf := make([]byte, BlockSize*20) // arbitrary factor rand.Read(buf) blockGeneric(gen, buf)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Fri Apr 29 14:23:17 UTC 2022 - 16.2K bytes - Viewed (0) -
src/image/jpeg/writer.go
// encoder copies and scales the tables according to its quality parameter. // The values are derived from section K.1 after converting from natural to // zig-zag order. var unscaledQuant = [nQuantIndex][blockSize]byte{ // Luminance. { 16, 11, 12, 14, 12, 10, 16, 14, 13, 14, 18, 17, 16, 19, 24, 40, 26, 24, 22, 22, 24, 49, 35, 37, 29, 40, 58, 51, 61, 60, 57, 51, 56, 55, 64, 72, 92, 78, 64, 68,
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Thu Oct 19 12:02:45 UTC 2023 - 17.1K bytes - Viewed (0) -
src/crypto/md5/md5block.go
package md5 import ( "internal/byteorder" "math/bits" ) func blockGeneric(dig *digest, p []byte) { // load state a, b, c, d := dig.s[0], dig.s[1], dig.s[2], dig.s[3] for i := 0; i <= len(p)-BlockSize; i += BlockSize { // eliminate bounds checks on p q := p[i:] q = q[:BlockSize:BlockSize] // save current state aa, bb, cc, dd := a, b, c, d // load input block x0 := byteorder.LeUint32(q[4*0x0:])
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon May 13 18:57:38 UTC 2024 - 5.2K bytes - Viewed (0) -
src/vendor/golang.org/x/crypto/sha3/sha3_s390x.go
func (s *asmState) Size() int { return s.outputLen } // BlockSize returns the hash's underlying block size. // The Write method must be able to accept any amount // of data, but it may operate more efficiently if all writes // are a multiple of the block size. func (s *asmState) BlockSize() int { return s.rate } // Clone returns a copy of the ShakeHash in its current state.
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Jun 04 16:19:04 UTC 2024 - 7.5K bytes - Viewed (0) -
src/hash/adler32/adler32.go
// state of the hash. func New() hash.Hash32 { d := new(digest) d.Reset() return d } func (d *digest) Size() int { return Size } func (d *digest) BlockSize() int { return 4 } const ( magic = "adl\x01" marshaledSize = len(magic) + 4 ) func (d *digest) MarshalBinary() ([]byte, error) { b := make([]byte, 0, marshaledSize) b = append(b, magic...)
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Sun May 12 05:36:29 UTC 2024 - 3K bytes - Viewed (0) -
pkg/volume/util/fs/fs.go
if _, ok := dedupedInodes[s.Ino]; !ok { dedupedInodes[s.Ino] = struct{}{} } else { return nil } } if consumption == nil { usage.Bytes += int64(s.Blocks) * int64(512) // blocksize in bytes } if inodes == nil { usage.Inodes++ } return nil }) return usage, err
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Thu Jan 20 02:56:02 UTC 2022 - 3.8K bytes - Viewed (0)