2011-05-22 01:19:37 +00:00
|
|
|
/*
|
|
|
|
Copyright 2011 Google Inc.
|
|
|
|
|
|
|
|
Licensed under the Apache License, Version 2.0 (the "License");
|
|
|
|
you may not use this file except in compliance with the License.
|
|
|
|
You may obtain a copy of the License at
|
|
|
|
|
|
|
|
http://www.apache.org/licenses/LICENSE-2.0
|
|
|
|
|
|
|
|
Unless required by applicable law or agreed to in writing, software
|
|
|
|
distributed under the License is distributed on an "AS IS" BASIS,
|
|
|
|
WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
|
|
|
See the License for the specific language governing permissions and
|
|
|
|
limitations under the License.
|
|
|
|
*/
|
|
|
|
|
|
|
|
package blobserver
|
|
|
|
|
|
|
|
import (
|
|
|
|
"os"
|
|
|
|
|
|
|
|
"camli/blobref"
|
|
|
|
)
|
|
|
|
|
2011-05-22 19:39:54 +00:00
|
|
|
const buffered = 8
|
|
|
|
|
2011-05-22 01:19:37 +00:00
|
|
|
// TODO: it'd be nice to make sources be []BlobEnumerator, but that
|
|
|
|
// makes callers more complex since assignable interfaces' slice forms
|
|
|
|
// aren't assignable.
|
2011-05-22 19:39:54 +00:00
|
|
|
func MergedEnumerate(dest chan<- blobref.SizedBlobRef, sources []Storage, after string, limit uint, waitSeconds int) os.Error {
|
|
|
|
defer close(dest)
|
|
|
|
|
|
|
|
startEnum := func(source Storage) (*blobref.ChanPeeker, <-chan os.Error) {
|
|
|
|
ch := make(chan blobref.SizedBlobRef, buffered)
|
|
|
|
errch := make(chan os.Error, 1)
|
|
|
|
go func() {
|
|
|
|
errch <- source.EnumerateBlobs(ch, after, limit, waitSeconds)
|
|
|
|
}()
|
|
|
|
return &blobref.ChanPeeker{Ch: ch}, errch
|
|
|
|
}
|
|
|
|
|
|
|
|
peekers := make([]*blobref.ChanPeeker, 0, len(sources))
|
|
|
|
errs := make([]<-chan os.Error, 0, len(sources))
|
|
|
|
for _, source := range sources {
|
|
|
|
peeker, errch := startEnum(source)
|
|
|
|
peekers = append(peekers, peeker)
|
|
|
|
errs = append(errs, errch)
|
|
|
|
}
|
|
|
|
|
|
|
|
nSent := 0
|
|
|
|
lastSent := ""
|
|
|
|
for nSent < int(limit) {
|
|
|
|
lowestIdx := -1
|
|
|
|
var lowest blobref.SizedBlobRef
|
|
|
|
for idx, peeker := range peekers {
|
|
|
|
for !peeker.Closed() && peeker.Peek().BlobRef.String() <= lastSent {
|
|
|
|
peeker.Take()
|
|
|
|
}
|
|
|
|
if peeker.Closed() {
|
|
|
|
continue
|
|
|
|
}
|
|
|
|
sb := peeker.Peek() // can't be nil if not Closed
|
|
|
|
if lowestIdx == -1 || sb.BlobRef.String() < lowest.BlobRef.String() {
|
|
|
|
lowestIdx = idx
|
|
|
|
lowest = *sb
|
|
|
|
}
|
|
|
|
}
|
|
|
|
if lowestIdx == -1 {
|
|
|
|
// all closed
|
|
|
|
break
|
|
|
|
}
|
|
|
|
|
|
|
|
dest <- lowest
|
|
|
|
nSent++
|
|
|
|
lastSent = lowest.BlobRef.String()
|
|
|
|
}
|
|
|
|
|
|
|
|
// Once we've gotten enough, ignore the rest of whatever's
|
|
|
|
// coming in.
|
|
|
|
for _, peeker := range peekers {
|
|
|
|
go peeker.ConsumeAll()
|
|
|
|
}
|
|
|
|
|
|
|
|
// If any part returns an error, we return an error.
|
|
|
|
var retErr os.Error
|
|
|
|
for _, errch := range errs {
|
|
|
|
if err := <-errch; err != nil {
|
|
|
|
retErr = err
|
|
|
|
}
|
|
|
|
}
|
|
|
|
return retErr
|
2011-05-22 01:19:37 +00:00
|
|
|
}
|