- Sort Score
- Result 10 results
- Languages All
Results 1 - 10 of 38 for writerPCs (0.16 sec)
-
src/internal/pkgbits/decoder.go
func (r *Decoder) Sync(mWant SyncMarker) { if !r.common.sync { return } pos, _ := r.Data.Seek(0, io.SeekCurrent) mHave := SyncMarker(r.rawUvarint()) writerPCs := make([]int, r.rawUvarint()) for i := range writerPCs { writerPCs[i] = int(r.rawUvarint()) } if mHave == mWant { return } // There's some tension here between printing: //
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Tue Sep 27 20:58:46 UTC 2022 - 13.2K bytes - Viewed (0) -
staging/src/k8s.io/apiserver/pkg/endpoints/handlers/responsewriters/writers.go
Sean Sullivan <******@****.***> 1684774997 -0700
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Wed Jun 07 18:21:43 UTC 2023 - 10.6K bytes - Viewed (0) -
cmd/erasure-encode_test.go
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 11.9K bytes - Viewed (0) -
cmd/erasure-decode_test.go
writers := make([]io.Writer, len(disks)) for i, disk := range disks { writers[i] = newBitrotWriter(disk, "", "testbucket", "object", erasure.ShardFileSize(test.data), writeAlgorithm, erasure.ShardSize()) } n, err := erasure.Encode(context.Background(), bytes.NewReader(data), writers, buffer, erasure.dataBlocks+1) closeBitrotWriters(writers) if err != nil {
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Tue Jan 30 20:43:25 UTC 2024 - 21.1K bytes - Viewed (0) -
pkg/volume/util/atomic_writer.go
// by the caller. // // The visible files in this volume are symlinks to files in the writer's data // directory. Actual files are stored in a hidden timestamped directory which // is symlinked to by the data directory. The timestamped directory and // data directory symlink are created in the writer's target dir. This scheme // allows the files to be atomically updated by changing the target of the
Registered: Sat Jun 15 01:39:40 UTC 2024 - Last Modified: Fri May 31 12:32:15 UTC 2024 - 16.6K bytes - Viewed (0) -
src/runtime/mstats.go
// // This process is why we need a ring buffer of size 3 instead // of 2: one is for the writers, one contains the most recent // data, and the last one is clear so writers can begin writing // to it the moment gen is updated. stats [3]heapStatsDelta // gen represents the current index into which writers // are writing, and can take on the value of 0, 1, or 2. gen atomic.Uint32
Registered: Wed Jun 12 16:32:35 UTC 2024 - Last Modified: Mon Apr 08 21:03:13 UTC 2024 - 34.2K bytes - Viewed (0) -
cmd/erasure-healing.go
inlineBuffers[i] = bytes.NewBuffer(buf[:0]) defer grid.PutByteBuffer(buf) writers[i] = newStreamingBitrotWriterBuffer(inlineBuffers[i], DefaultBitrotAlgorithm, erasure.ShardSize()) } else { writers[i] = newBitrotWriter(disk, bucket, minioMetaTmpBucket, partPath, tillOffset, DefaultBitrotAlgorithm, erasure.ShardSize()) } }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Mon Jun 10 15:51:27 UTC 2024 - 33.8K bytes - Viewed (0) -
pilot/pkg/model/typed_xds_cache.go
// If the cache has been updated to a newer push context, the write will be dropped silently. // This ensures stale data does not overwrite fresh data when dealing with concurrent // writers. Add(key K, entry dependents, pushRequest *PushRequest, value *discovery.Resource) // Get retrieves the cached value if it exists. Get(key K) *discovery.Resource
Registered: Fri Jun 14 15:00:06 UTC 2024 - Last Modified: Sat Mar 30 05:26:03 UTC 2024 - 11K bytes - Viewed (0) -
cmd/erasure-multipart.go
} 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 { continue } writers[i] = newBitrotWriter(disk, bucket, minioMetaTmpBucket, tmpPartPath, erasure.ShardFileSize(data.Size()), DefaultBitrotAlgorithm, erasure.ShardSize()) }
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Thu Jun 13 06:56:12 UTC 2024 - 44.8K bytes - Viewed (0) -
internal/ringbuffer/ring_buffer.go
func (r *RingBuffer) Reset() { r.mu.Lock() defer r.mu.Unlock() // Set error so any readers/writers will return immediately. r.setErr(errors.New("reset called"), true) if r.block { r.readCond.Broadcast() r.writeCond.Broadcast() } // Unlock the mutex so readers/writers can finish. r.mu.Unlock() r.wg.Wait() r.mu.Lock() r.r = 0 r.w = 0 r.err = nil r.isFull = false
Registered: Sun Jun 16 00:44:34 UTC 2024 - Last Modified: Wed May 15 00:11:04 UTC 2024 - 13.3K bytes - Viewed (0)