Search Options

Results per page
Sort
Preferred Languages
Advance

Results 1 - 7 of 7 for metaDataPoolPut (0.27 sec)

  1. cmd/metacache-stream.go

    		}
    		err = w.mw.WriteString(o.name)
    		if err != nil {
    			return err
    		}
    		err = w.mw.WriteBytes(o.metadata)
    		if err != nil {
    			return err
    		}
    		if w.reuseBlocks || o.reusable {
    			metaDataPoolPut(o.metadata)
    		}
    	}
    
    	return nil
    }
    
    // stream entries to the output.
    // The returned channel should be closed when done.
    // Any error is reported when closing the metacacheWriter.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Apr 04 12:04:40 UTC 2024
    - 19.5K bytes
    - Viewed (0)
  2. cmd/xl-storage.go

    	if err != nil && err != errFileNotFound {
    		return err
    	}
    	defer metaDataPoolPut(buf)
    
    	var xlMeta xlMetaV2
    	if !isXL2V1Format(buf) {
    		// This is both legacy and without proper version.
    		if err = xlMeta.AddVersion(fi); err != nil {
    			return err
    		}
    
    		buf, err = xlMeta.AppendTo(metaDataPoolGet())
    		defer metaDataPoolPut(buf)
    		if err != nil {
    			return err
    		}
    	} else {
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Sat Oct 26 09:58:27 UTC 2024
    - 91.3K bytes
    - Viewed (0)
  3. cmd/metacache-entries.go

    	if s == "" {
    		return
    	}
    	idx := sort.Search(len(m.o), func(i int) bool {
    		return m.o[i].name >= s
    	})
    	if m.reuse {
    		for i, entry := range m.o[:idx] {
    			metaDataPoolPut(entry.metadata)
    			m.o[i].metadata = nil
    		}
    	}
    
    	m.o = m.o[idx:]
    }
    
    // forwardPast will truncate m so only entries that are after s is in the list.
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Aug 08 15:29:58 UTC 2024
    - 24.1K bytes
    - Viewed (0)
  4. cmd/xl-storage-format-v1.go

    	c.Erasure.Index = 0
    	c.Minio.Release = ""
    	crc := hashDeterministicString(c.Meta)
    	c.Meta = nil
    
    	if bts, err := c.MarshalMsg(metaDataPoolGet()); err == nil {
    		crc ^= xxhash.Sum64(bts)
    		metaDataPoolPut(bts)
    	}
    
    	// Combine upper and lower part
    	var tmp [4]byte
    	binary.LittleEndian.PutUint32(tmp[:], uint32(crc^(crc>>32)))
    	return tmp
    }
    
    // XL metadata constants.
    const (
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 8.4K bytes
    - Viewed (0)
  5. cmd/xl-storage-format-v2.go

    // It will be length 0.
    func metaDataPoolGet() []byte {
    	return metaDataPool.Get().([]byte)[:0]
    }
    
    // metaDataPoolPut will put an unused small buffer back into the pool.
    func metaDataPoolPut(buf []byte) {
    	if cap(buf) >= metaDataReadDefault && cap(buf) < metaDataReadDefault*4 {
    		//nolint:staticcheck // SA6002 we are fine with the tiny alloc
    		metaDataPool.Put(buf)
    	}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Tue Oct 22 15:30:50 UTC 2024
    - 64K bytes
    - Viewed (1)
  6. cmd/storage-rest-server.go

    		if err != nil {
    			s.writeErrorResponse(w, err)
    			return
    		}
    		verifier = NewBitrotVerifier(BitrotAlgorithmFromString(r.Form.Get(storageRESTBitrotAlgo)), hash)
    	}
    	buf := make([]byte, length)
    	defer metaDataPoolPut(buf) // Reuse if we can.
    	_, err = s.getStorage().ReadFile(r.Context(), volume, filePath, int64(offset), buf, verifier)
    	if err != nil {
    		s.writeErrorResponse(w, err)
    		return
    	}
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Wed Aug 14 17:11:51 UTC 2024
    - 45.7K bytes
    - Viewed (0)
  7. cmd/erasure-object.go

    		if errs[index] != nil {
    			continue
    		}
    
    		if readData {
    			metaFileInfos[index].Data = metadataArray[index].data.find(versionID)
    		}
    	}
    	if !readData {
    		for i := range v2bufs {
    			metaDataPoolPut(v2bufs[i])
    		}
    	}
    
    	// Return all the metadata.
    	return metaFileInfos, errs
    }
    
    // Checking if an object is dangling costs some IOPS; hence implementing this function
    Registered: Sun Nov 03 19:28:11 UTC 2024
    - Last Modified: Thu Oct 31 22:10:24 UTC 2024
    - 78.8K bytes
    - Viewed (0)
Back to top