Search Options

Display Count
Sort
Preferred Language
Advanced Search

Results 1 - 10 of 17 for dead (0.02 seconds)

  1. cmd/test-utils_test.go

    	// If the body is read in the handler the same request cannot be made use of.
    	buf, err := io.ReadAll(anonReq.Body)
    	if err != nil {
    		t.Fatal(failTestStr(anonTestStr, err.Error()))
    	}
    
    	// creating 2 read closer (to set as request body) from the body content.
    	readerOne := io.NopCloser(bytes.NewBuffer(buf))
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 77K bytes
    - Click Count (0)
  2. src/bufio/bufio_test.go

    	buf := make([]byte, 1)
    	if _, err := b.Read(nil); err != nil {
    		t.Fatalf("1st nil Read = %v; want nil", err)
    	}
    	if _, err := b.Read(buf); err != errFake {
    		t.Fatalf("1st Read = %v; want errFake", err)
    	}
    	if _, err := b.Read(nil); err != nil {
    		t.Fatalf("2nd nil Read = %v; want nil", err)
    	}
    	if _, err := b.Read(buf); err != nil {
    		t.Fatalf("3rd Read with buffer = %v; want nil", err)
    	}
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Feb 07 01:08:54 GMT 2025
    - 51.6K bytes
    - Click Count (0)
  3. cmd/xl-storage.go

    	if err != nil {
    		// We start off with '0' if we can read the attributes
    		return 0
    	}
    	return binary.LittleEndian.Uint64(buf[:8])
    }
    
    func (s *xlStorage) getWriteAttribute() uint64 {
    	attr := "user.total_writes"
    	buf, err := xattr.LGet(s.formatFile, attr)
    	if err != nil {
    		// We start off with '0' if we can read the attributes
    		return 0
    	}
    
    	return binary.LittleEndian.Uint64(buf[:8])
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 91.7K bytes
    - Click Count (0)
  4. src/archive/zip/reader_test.go

    	if z.Comment != zt.Comment {
    		t.Errorf("comment=%q, want %q", z.Comment, zt.Comment)
    	}
    	if len(z.File) != len(zt.File) {
    		t.Fatalf("file count=%d, want %d", len(z.File), len(zt.File))
    	}
    
    	// test read of each file
    	for i, ft := range zt.File {
    		readTestFile(t, zt, ft, z.File[i], raw)
    	}
    	if t.Failed() {
    		return
    	}
    
    	// test simultaneous reads
    	n := 0
    	done := make(chan bool)
    Created: Tue Dec 30 11:13:12 GMT 2025
    - Last Modified: Fri Oct 17 20:10:27 GMT 2025
    - 56.5K bytes
    - Click Count (0)
  5. cmd/erasure-object.go

    		ctx = lkctx.Context()
    
    		// Release lock when the metadata is verified, and reader
    		// is ready to be read.
    		//
    		// This is possible to be lock free because
    		// - xl.meta for inlined objects has already read the data
    		//   into memory, any mutation on xl.meta subsequently is
    		//   inconsequential to the overall read operation.
    		// - xl.meta metadata is still verified for quorum under lock()
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Oct 24 04:05:31 GMT 2025
    - 80.4K bytes
    - Click Count (0)
  6. cmd/erasure-server-pool.go

    	derrs := make([]error, len(poolIndices))
    	dobjects := make([]ObjectInfo, len(poolIndices))
    
    	// Delete concurrently in all server pools that reported no error or read quorum error
    	// where the read quorum issue is from metadata inconsistency.
    	var wg sync.WaitGroup
    	for idx, pe := range poolIndices {
    		if v, ok := pe.Err.(InsufficientReadQuorum); ok && v.Type != RQInconsistentMeta {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Sun Sep 28 20:59:21 GMT 2025
    - 89.2K bytes
    - Click Count (0)
  7. cmd/xl-storage-format-v2.go

    		fi.TransitionTier = string(sc)
    	}
    	if crcs := j.MetaSys[ReservedMetadataPrefixLower+"crc"]; len(crcs) > 0 {
    		fi.Checksum = crcs
    	}
    	return fi, nil
    }
    
    // Read at most this much on initial read.
    const metaDataReadDefault = 4 << 10
    
    // Return used metadata byte slices here.
    var metaDataPool = bpool.Pool[[]byte]{New: func() []byte { return make([]byte, 0, metaDataReadDefault) }}
    
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 65.6K bytes
    - Click Count (1)
  8. cmd/xl-storage_test.go

    		// we are attempting to read it.
    		{
    			volume: "exists",
    			path:   "as-directory",
    			err:    errFileNotFound,
    		},
    		// TestXLStorage case - 4.
    		{
    			volume: "exists",
    			path:   "as-file-parent/as-file",
    			err:    errFileNotFound,
    		},
    		// TestXLStorage case - 5.
    		// Validate the good condition file exists and we are able to read it.
    		{
    			volume: "exists",
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Fri Aug 29 02:39:48 GMT 2025
    - 66K bytes
    - Click Count (0)
  9. docs/metrics/prometheus/grafana/replication/minio-replication-cluster.json

              "interval": "1m",
              "intervalFactor": 2,
              "legendFormat": "{{instance}}",
              "range": true,
              "refId": "A"
            }
          ],
          "title": "Total Proxied Head Requests",
          "type": "timeseries"
        },
        {
          "datasource": {
            "type": "prometheus",
            "uid": "${DS_PROMETHEUS}"
          },
          "fieldConfig": {
            "defaults": {
    Created: Sun Dec 28 19:28:13 GMT 2025
    - Last Modified: Mon Aug 04 01:46:49 GMT 2025
    - 71.2K bytes
    - Click Count (0)
  10. go.sum

    aead.dev/mem v0.2.0 h1:ufgkESS9+lHV/GUjxgc2ObF43FLZGSemh+W+y27QFMI=
    aead.dev/mem v0.2.0/go.mod h1:4qj+sh8fjDhlvne9gm/ZaMRIX9EkmDrKOLwmyDtoMWM=
    aead.dev/minisign v0.2.0/go.mod h1:zdq6LdSd9TbuSxchxwhpA9zEb9YXcVGoE8JakuiGaIQ=
    aead.dev/minisign v0.3.0 h1:8Xafzy5PEVZqYDNP60yJHARlW1eOQtsKNp/Ph2c0vRA=
    aead.dev/minisign v0.3.0/go.mod h1:NLvG3Uoq3skkRMDuc3YHpWUTMTrSExqm+Ij73W13F6Y=
    aead.dev/mtls v0.2.1 h1:47NHWciMvrmEhlkpnis8/RGEa9HR9gcbDPfcArG+Yqs=
    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)
Back to Top