- Sort Score
- Num 10 results
- Language All
Results 11 - 18 of 18 for RX (0.06 seconds)
-
src/cmd/asm/internal/asm/testdata/s390x.s
MOVB $-1, n-8(SP) // 92fff010 MOVB $255, 4096(R4) // ebff40000152 MOVB $-128, -524288(R5) // eb8050008052 MOVB $1, -524289(R6) // c0a1fff7ffff41aa60009201a000 // RX (12-bit displacement) and RXY (20-bit displacement) instruction encoding (e.g: ST vs STY) MOVW R1, 4095(R2)(R3) // 50132fff MOVW R1, 4096(R2)(R3) // e31320000150 MOVWZ R1, 4095(R2)(R3) // 50132fff
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Wed Jul 30 19:29:15 GMT 2025 - 22.9K bytes - Click Count (0) -
cmd/admin-handlers-site-replication.go
globalSiteNetPerfRX.Connect() defer globalSiteNetPerfRX.Disconnect() connectTime := time.Now() for { n, err := io.CopyN(xioutil.Discard, r.Body, 128*humanize.KiByte) atomic.AddUint64(&globalSiteNetPerfRX.RX, uint64(n)) if err != nil && err != io.EOF && err != io.ErrUnexpectedEOF { // If there is a disconnection before globalNetPerfMinDuration (we give a margin of error of 1 sec)
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 19.4K bytes - Click Count (0) -
cmd/notification.go
// FIXME: network calls made in this manner such as one goroutine per node, // can easily eat into the internode bandwidth. This function would be mostly // TX saturating, however there are situations where a RX might also saturate. // To avoid these problems we must split the work at scale. With 1000 node // setup becoming a reality we must try to shard the work properly such as
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 46K bytes - Click Count (0) -
cmd/peer-rest-server.go
defer globalNetPerfRX.Disconnect() connectTime := time.Now() ctx := newContext(r, w, "DevNull") for { n, err := io.CopyN(xioutil.Discard, r.Body, 128*humanize.KiByte) atomic.AddUint64(&globalNetPerfRX.RX, uint64(n)) if err != nil && err != io.EOF { // If there is a disconnection before globalNetPerfMinDuration (we give a margin of error of 1 sec)
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 53.6K bytes - Click Count (0) -
go.sum
github.com/nats-io/stan.go v0.10.4/go.mod h1:3XJXH8GagrGqajoO/9+HgPyKV5MWsv7S5ccdda+pc6k= github.com/ncw/directio v1.0.5 h1:JSUBhdjEvVaJvOoyPAbcW0fnd0tvRXD76wEfZ1KcQz4= github.com/ncw/directio v1.0.5/go.mod h1:rX/pKEYkOXBGOggmcyJeJGloCkleSvphPx2eV3t6ROk= github.com/nsqio/go-nsq v1.1.0 h1:PQg+xxiUjA7V+TLdXw7nVrJ5Jbl3sN86EhGCQj4+FYE= github.com/nsqio/go-nsq v1.1.0/go.mod h1:vKq36oyeVXgsS5Q8YEO7WghqidAVXQlcFxzQbQTuDEY=
Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Sun Sep 28 20:59:21 GMT 2025 - 79.8K bytes - Click Count (0) -
cmd/testdata/decryptObjectInfo.json.zst
e-Encryption-Seal-Algorithm":"DAREv2-HMAC-SHA256","content-type":"application/octet-stream"}},{"Bucket":"buck1","Name":"go_113/src/cmd/vendor/golang.org/x/crypto/ssh/terminal/util_solaris.go","UserDef":{"X-Minio-Internal-Server-Side-Encryption-Iv":"RX+x32G/vf9P1wkReP9k3wKldAtp=","X-Minio-Internal-Server-Side-Encryption-S3-Kms-Key-Id":"my-minio-key","X-Minio-Internal-Server-Side-Encryption-S3-Kms-Sealed-Key":"IAAfAPQoCIsvhE+JXJE5cgunjyte7SWJz4L/v9ZXUiEBecn16OYtVkOi==","X-Minio-Internal-Server-Sid...Created: Sun Dec 28 19:28:13 GMT 2025 - Last Modified: Thu Oct 29 16:34:20 GMT 2020 - 164K bytes - Click Count (0) -
lib/fips140/v1.0.0-c2097c7c.zip
FIPS 186-5, Section 6.4.1 k, R, err := randomPoint(c, func(b []byte) error { drbg.Generate(b) return nil }) if err != nil { return nil, err } // kInv = k⁻¹ kInv := bigmod.NewNat() inverse(c, kInv, k) Rx, err := R.BytesX() if err != nil { return nil, err } r, err := bigmod.NewNat().SetOverflowingBytes(Rx, c.N) if err != nil { return nil, err } // The spec wants us to retry here, but the chance of hitting this condition // on a large prime-order group like the NIST curves we support is // cryptographically...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Sep 25 19:53:19 GMT 2025 - 642.7K bytes - Click Count (0) -
lib/fips140/v1.1.0-rc1.zip
FIPS 186-5, Section 6.4.1 k, R, err := randomPoint(c, func(b []byte) error { drbg.Generate(b) return nil }) if err != nil { return nil, err } // kInv = k⁻¹ kInv := bigmod.NewNat() inverse(c, kInv, k) Rx, err := R.BytesX() if err != nil { return nil, err } r, err := bigmod.NewNat().SetOverflowingBytes(Rx, c.N) if err != nil { return nil, err } // The spec wants us to retry here, but the chance of hitting this condition // on a large prime-order group like the NIST curves we support is // cryptographically...
Created: Tue Dec 30 11:13:12 GMT 2025 - Last Modified: Thu Dec 11 16:27:41 GMT 2025 - 663K bytes - Click Count (0)