2022-05-06 21:24:27 +02:00
// Package chunksize calculates a suitable chunk size for large uploads
package chunksize
import (
"github.com/rclone/rclone/fs"
)
2022-08-09 11:44:54 +02:00
// Calculator calculates the minimum chunk size needed to fit within
// the maximum number of parts, rounded up to the nearest fs.Mebi.
//
// For most backends, (chunk_size) * (concurrent_upload_routines)
// memory will be required so we want to use the smallest possible
// chunk size that's going to allow the upload to proceed. Rounding up
// to the nearest fs.Mebi on the assumption that some backends may
// only allow integer type parameters when specifying the chunk size.
//
// Returns the default chunk size if it is sufficiently large enough
// to support the given file size otherwise returns the smallest chunk
// size necessary to allow the upload to proceed.
build: modernize Go usage
This commit modernizes Go usage. This was done with:
go run golang.org/x/tools/gopls/internal/analysis/modernize/cmd/modernize@latest -fix -test ./...
Then files needed to be `go fmt`ed and a few comments needed to be
restored.
The modernizations include replacing
- if/else conditional assignment by a call to the built-in min or max functions added in go1.21
- sort.Slice(x, func(i, j int) bool) { return s[i] < s[j] } by a call to slices.Sort(s), added in go1.21
- interface{} by the 'any' type added in go1.18
- append([]T(nil), s...) by slices.Clone(s) or slices.Concat(s), added in go1.21
- loop around an m[k]=v map update by a call to one of the Collect, Copy, Clone, or Insert functions from the maps package, added in go1.21
- []byte(fmt.Sprintf...) by fmt.Appendf(nil, ...), added in go1.19
- append(s[:i], s[i+1]...) by slices.Delete(s, i, i+1), added in go1.21
- a 3-clause for i := 0; i < n; i++ {} loop by for i := range n {}, added in go1.22
2025-02-26 22:08:12 +01:00
func Calculator ( o any , size int64 , maxParts int , defaultChunkSize fs . SizeSuffix ) fs . SizeSuffix {
2022-08-09 11:44:54 +02:00
// If streaming then use default chunk size
if size < 0 {
fs . Debugf ( o , "Streaming upload with chunk_size %s allows uploads of up to %s and will fail only when that limit is reached." , defaultChunkSize , fs . SizeSuffix ( maxParts ) * defaultChunkSize )
2022-05-06 21:24:27 +02:00
2022-08-09 11:44:54 +02:00
return defaultChunkSize
}
fileSize := fs . SizeSuffix ( size )
2022-05-06 21:24:27 +02:00
requiredChunks := fileSize / defaultChunkSize
if requiredChunks < fs . SizeSuffix ( maxParts ) || ( requiredChunks == fs . SizeSuffix ( maxParts ) && fileSize % defaultChunkSize == 0 ) {
return defaultChunkSize
}
minChunk := fileSize / fs . SizeSuffix ( maxParts )
remainder := minChunk % fs . Mebi
if remainder != 0 {
minChunk += fs . Mebi - remainder
}
if fileSize / minChunk == fs . SizeSuffix ( maxParts ) && fileSize % fs . SizeSuffix ( maxParts ) != 0 { // when right on the boundary, we need to add a MiB
minChunk += fs . Mebi
}
2022-08-09 11:44:54 +02:00
fs . Debugf ( o , "size: %v, parts: %v, default: %v, new: %v; default chunk size insufficient, returned new chunk size" , fileSize , maxParts , defaultChunkSize , minChunk )
2022-05-06 21:24:27 +02:00
return minChunk
}