package repository import ( "context" "sync" "github.com/restic/restic/internal/errors" "github.com/restic/restic/internal/restic" "github.com/restic/restic/internal/debug" ) // MasterIndex is a collection of indexes and IDs of chunks that are in the process of being saved. type MasterIndex struct { idx []*Index idxMutex sync.RWMutex } // NewMasterIndex creates a new master index. func NewMasterIndex() *MasterIndex { return &MasterIndex{} } // Lookup queries all known Indexes for the ID and returns the first match. func (mi *MasterIndex) Lookup(id restic.ID, tpe restic.BlobType) (blobs []restic.PackedBlob, err error) { mi.idxMutex.RLock() defer mi.idxMutex.RUnlock() debug.Log("looking up id %v, tpe %v", id.Str(), tpe) for _, idx := range mi.idx { blobs, err = idx.Lookup(id, tpe) if err == nil { debug.Log("found id %v: %v", id.Str(), blobs) return } } debug.Log("id %v not found in any index", id.Str()) return nil, errors.Errorf("id %v not found in any index", id) } // LookupSize queries all known Indexes for the ID and returns the first match. func (mi *MasterIndex) LookupSize(id restic.ID, tpe restic.BlobType) (uint, error) { mi.idxMutex.RLock() defer mi.idxMutex.RUnlock() for _, idx := range mi.idx { if idx.Has(id, tpe) { return idx.LookupSize(id, tpe) } } return 0, errors.Errorf("id %v not found in any index", id) } // ListPack returns the list of blobs in a pack. The first matching index is // returned, or nil if no index contains information about the pack id. func (mi *MasterIndex) ListPack(id restic.ID) (list []restic.PackedBlob) { mi.idxMutex.RLock() defer mi.idxMutex.RUnlock() for _, idx := range mi.idx { list := idx.ListPack(id) if len(list) > 0 { return list } } return nil } // Has queries all known Indexes for the ID and returns the first match. func (mi *MasterIndex) Has(id restic.ID, tpe restic.BlobType) bool { mi.idxMutex.RLock() defer mi.idxMutex.RUnlock() for _, idx := range mi.idx { if idx.Has(id, tpe) { return true } } return false } // Count returns the number of blobs of type t in the index. func (mi *MasterIndex) Count(t restic.BlobType) (n uint) { mi.idxMutex.RLock() defer mi.idxMutex.RUnlock() var sum uint for _, idx := range mi.idx { sum += idx.Count(t) } return sum } // Insert adds a new index to the MasterIndex. func (mi *MasterIndex) Insert(idx *Index) { mi.idxMutex.Lock() defer mi.idxMutex.Unlock() mi.idx = append(mi.idx, idx) } // Remove deletes an index from the MasterIndex. func (mi *MasterIndex) Remove(index *Index) { mi.idxMutex.Lock() defer mi.idxMutex.Unlock() for i, idx := range mi.idx { if idx == index { mi.idx = append(mi.idx[:i], mi.idx[i+1:]...) return } } } // Store remembers the id and pack in the index. func (mi *MasterIndex) Store(pb restic.PackedBlob) { mi.idxMutex.RLock() for _, idx := range mi.idx { if !idx.Final() { mi.idxMutex.RUnlock() idx.Store(pb) return } } mi.idxMutex.RUnlock() mi.idxMutex.Lock() defer mi.idxMutex.Unlock() newIdx := NewIndex() newIdx.Store(pb) mi.idx = append(mi.idx, newIdx) } // NotFinalIndexes returns all indexes that have not yet been saved. func (mi *MasterIndex) NotFinalIndexes() []*Index { mi.idxMutex.Lock() defer mi.idxMutex.Unlock() var list []*Index for _, idx := range mi.idx { if !idx.Final() { list = append(list, idx) } } debug.Log("return %d indexes", len(list)) return list } // FullIndexes returns all indexes that are full. func (mi *MasterIndex) FullIndexes() []*Index { mi.idxMutex.Lock() defer mi.idxMutex.Unlock() var list []*Index debug.Log("checking %d indexes", len(mi.idx)) for _, idx := range mi.idx { if idx.Final() { debug.Log("index %p is final", idx) continue } if IndexFull(idx) { debug.Log("index %p is full", idx) list = append(list, idx) } else { debug.Log("index %p not full", idx) } } debug.Log("return %d indexes", len(list)) return list } // All returns all indexes. func (mi *MasterIndex) All() []*Index { mi.idxMutex.Lock() defer mi.idxMutex.Unlock() return mi.idx } // Each returns a channel that yields all blobs known to the index. When the // context is cancelled, the background goroutine terminates. This blocks any // modification of the index. func (mi *MasterIndex) Each(ctx context.Context) <-chan restic.PackedBlob { mi.idxMutex.RLock() ch := make(chan restic.PackedBlob) go func() { defer mi.idxMutex.RUnlock() defer func() { close(ch) }() for _, idx := range mi.idx { idxCh := idx.Each(ctx) for pb := range idxCh { select { case <-ctx.Done(): return case ch <- pb: } } } }() return ch } // RebuildIndex combines all known indexes to a new index, leaving out any // packs whose ID is contained in packBlacklist. The new index contains the IDs // of all known indexes in the "supersedes" field. func (mi *MasterIndex) RebuildIndex(packBlacklist restic.IDSet) (*Index, error) { mi.idxMutex.Lock() defer mi.idxMutex.Unlock() debug.Log("start rebuilding index of %d indexes, pack blacklist: %v", len(mi.idx), packBlacklist) newIndex := NewIndex() ctx, cancel := context.WithCancel(context.TODO()) defer cancel() for i, idx := range mi.idx { debug.Log("adding index %d", i) for pb := range idx.Each(ctx) { if packBlacklist.Has(pb.PackID) { continue } newIndex.Store(pb) } if !idx.Final() { debug.Log("index %d isn't final, don't add to supersedes field", i) continue } id, err := idx.ID() if err != nil { debug.Log("index %d does not have an ID: %v", err) return nil, err } debug.Log("adding index id %v to supersedes field", id.Str()) err = newIndex.AddToSupersedes(id) if err != nil { return nil, err } } return newIndex, nil }