mirror of
https://github.com/octoleo/syncthing.git
synced 2024-09-20 13:49:02 +00:00
65aaa607ab
Change made by: - running "gvt fetch" on each of the packages mentioned in Godeps/Godeps.json - `rm -rf Godeps` - tweaking the build scripts to not mention Godeps - tweaking the build scripts to test `./lib/...`, `./cmd/...` explicitly (to avoid testing vendor) - tweaking the build scripts to not juggle GOPATH for Godeps and instead set GO15VENDOREXPERIMENT. This also results in some updated packages at the same time I bet. Building with Go 1.3 and 1.4 still *works* but won't use our vendored dependencies - the user needs to have the actual packages in their GOPATH then, which they'll get with a normal "go get". Building with Go 1.6+ will get our vendored dependencies by default even when not using our build script, which is nice. By doing this we gain some freedom in that we can pick and choose manually what to include in vendor, as it's not based on just dependency analysis of our own code. This is also a risk as we might pick up dependencies we are unaware of, as the build may work locally with those packages present in GOPATH. On the other hand the build server will detect this as it has no packages in it's GOPATH beyond what is included in the repo. Recommended tool to manage dependencies is github.com/FiloSottile/gvt.
56 lines
1.7 KiB
Go
56 lines
1.7 KiB
Go
package spec
|
|
|
|
func ParallelizedIndexRange(length int, parallelTotal int, parallelNode int) (startIndex int, count int) {
|
|
if length == 0 {
|
|
return 0, 0
|
|
}
|
|
|
|
// We have more nodes than tests. Trivial case.
|
|
if parallelTotal >= length {
|
|
if parallelNode > length {
|
|
return 0, 0
|
|
} else {
|
|
return parallelNode - 1, 1
|
|
}
|
|
}
|
|
|
|
// This is the minimum amount of tests that a node will be required to run
|
|
minTestsPerNode := length / parallelTotal
|
|
|
|
// This is the maximum amount of tests that a node will be required to run
|
|
// The algorithm guarantees that this would be equal to at least the minimum amount
|
|
// and at most one more
|
|
maxTestsPerNode := minTestsPerNode
|
|
if length%parallelTotal != 0 {
|
|
maxTestsPerNode++
|
|
}
|
|
|
|
// Number of nodes that will have to run the maximum amount of tests per node
|
|
numMaxLoadNodes := length % parallelTotal
|
|
|
|
// Number of nodes that precede the current node and will have to run the maximum amount of tests per node
|
|
var numPrecedingMaxLoadNodes int
|
|
if parallelNode > numMaxLoadNodes {
|
|
numPrecedingMaxLoadNodes = numMaxLoadNodes
|
|
} else {
|
|
numPrecedingMaxLoadNodes = parallelNode - 1
|
|
}
|
|
|
|
// Number of nodes that precede the current node and will have to run the minimum amount of tests per node
|
|
var numPrecedingMinLoadNodes int
|
|
if parallelNode <= numMaxLoadNodes {
|
|
numPrecedingMinLoadNodes = 0
|
|
} else {
|
|
numPrecedingMinLoadNodes = parallelNode - numMaxLoadNodes - 1
|
|
}
|
|
|
|
// Evaluate the test start index and number of tests to run
|
|
startIndex = numPrecedingMaxLoadNodes*maxTestsPerNode + numPrecedingMinLoadNodes*minTestsPerNode
|
|
if parallelNode > numMaxLoadNodes {
|
|
count = minTestsPerNode
|
|
} else {
|
|
count = maxTestsPerNode
|
|
}
|
|
return
|
|
}
|