158 lines
		
	
	
		
			4.3 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			158 lines
		
	
	
		
			4.3 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| /*
 | |
|    Copyright The containerd Authors.
 | |
| 
 | |
|    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.
 | |
| */
 | |
| 
 | |
| // This file is a copy of moby/moby/pkg/truncindex/truncindex.go
 | |
| 
 | |
| // Package truncindex provides a general 'index tree', used by Docker
 | |
| // in order to be able to reference containers by only a few unambiguous
 | |
| // characters of their id.
 | |
| package truncindex
 | |
| 
 | |
| import (
 | |
| 	"errors"
 | |
| 	"fmt"
 | |
| 	"strings"
 | |
| 	"sync"
 | |
| 
 | |
| 	"github.com/tchap/go-patricia/v2/patricia"
 | |
| )
 | |
| 
 | |
| var (
 | |
| 	// ErrEmptyPrefix is an error returned if the prefix was empty.
 | |
| 	ErrEmptyPrefix = errors.New("prefix can't be empty")
 | |
| 
 | |
| 	// ErrIllegalChar is returned when a space is in the ID
 | |
| 	ErrIllegalChar = errors.New("illegal character: ' '")
 | |
| 
 | |
| 	// ErrNotExist is returned when ID or its prefix not found in index.
 | |
| 	ErrNotExist = errors.New("ID does not exist")
 | |
| )
 | |
| 
 | |
| // ErrAmbiguousPrefix is returned if the prefix was ambiguous
 | |
| // (multiple ids for the prefix).
 | |
| type ErrAmbiguousPrefix struct {
 | |
| 	prefix string
 | |
| }
 | |
| 
 | |
| func (e ErrAmbiguousPrefix) Error() string {
 | |
| 	return fmt.Sprintf("Multiple IDs found with provided prefix: %s", e.prefix)
 | |
| }
 | |
| 
 | |
| // TruncIndex allows the retrieval of string identifiers by any of their unique prefixes.
 | |
| // This is used to retrieve image and container IDs by more convenient shorthand prefixes.
 | |
| type TruncIndex struct {
 | |
| 	sync.RWMutex
 | |
| 	trie *patricia.Trie
 | |
| 	ids  map[string]struct{}
 | |
| }
 | |
| 
 | |
| // NewTruncIndex creates a new TruncIndex and initializes with a list of IDs.
 | |
| func NewTruncIndex(ids []string) (idx *TruncIndex) {
 | |
| 	idx = &TruncIndex{
 | |
| 		ids: make(map[string]struct{}),
 | |
| 
 | |
| 		// Change patricia max prefix per node length,
 | |
| 		// because our len(ID) always 64
 | |
| 		trie: patricia.NewTrie(patricia.MaxPrefixPerNode(64)),
 | |
| 	}
 | |
| 	for _, id := range ids {
 | |
| 		idx.addID(id)
 | |
| 	}
 | |
| 	return
 | |
| }
 | |
| 
 | |
| func (idx *TruncIndex) addID(id string) error {
 | |
| 	if strings.Contains(id, " ") {
 | |
| 		return ErrIllegalChar
 | |
| 	}
 | |
| 	if id == "" {
 | |
| 		return ErrEmptyPrefix
 | |
| 	}
 | |
| 	if _, exists := idx.ids[id]; exists {
 | |
| 		return fmt.Errorf("id already exists: '%s'", id)
 | |
| 	}
 | |
| 	idx.ids[id] = struct{}{}
 | |
| 	if inserted := idx.trie.Insert(patricia.Prefix(id), struct{}{}); !inserted {
 | |
| 		return fmt.Errorf("failed to insert id: %s", id)
 | |
| 	}
 | |
| 	return nil
 | |
| }
 | |
| 
 | |
| // Add adds a new ID to the TruncIndex.
 | |
| func (idx *TruncIndex) Add(id string) error {
 | |
| 	idx.Lock()
 | |
| 	defer idx.Unlock()
 | |
| 	return idx.addID(id)
 | |
| }
 | |
| 
 | |
| // Delete removes an ID from the TruncIndex. If there are multiple IDs
 | |
| // with the given prefix, an error is thrown.
 | |
| func (idx *TruncIndex) Delete(id string) error {
 | |
| 	idx.Lock()
 | |
| 	defer idx.Unlock()
 | |
| 	if _, exists := idx.ids[id]; !exists || id == "" {
 | |
| 		return fmt.Errorf("no such id: '%s'", id)
 | |
| 	}
 | |
| 	delete(idx.ids, id)
 | |
| 	if deleted := idx.trie.Delete(patricia.Prefix(id)); !deleted {
 | |
| 		return fmt.Errorf("no such id: '%s'", id)
 | |
| 	}
 | |
| 	return nil
 | |
| }
 | |
| 
 | |
| // Get retrieves an ID from the TruncIndex. If there are multiple IDs
 | |
| // with the given prefix, an error is thrown.
 | |
| func (idx *TruncIndex) Get(s string) (string, error) {
 | |
| 	if s == "" {
 | |
| 		return "", ErrEmptyPrefix
 | |
| 	}
 | |
| 	var (
 | |
| 		id string
 | |
| 	)
 | |
| 	subTreeVisitFunc := func(prefix patricia.Prefix, item patricia.Item) error {
 | |
| 		if id != "" {
 | |
| 			// we haven't found the ID if there are two or more IDs
 | |
| 			id = ""
 | |
| 			return ErrAmbiguousPrefix{prefix: s}
 | |
| 		}
 | |
| 		id = string(prefix)
 | |
| 		return nil
 | |
| 	}
 | |
| 
 | |
| 	idx.RLock()
 | |
| 	defer idx.RUnlock()
 | |
| 	if err := idx.trie.VisitSubtree(patricia.Prefix(s), subTreeVisitFunc); err != nil {
 | |
| 		return "", err
 | |
| 	}
 | |
| 	if id != "" {
 | |
| 		return id, nil
 | |
| 	}
 | |
| 	return "", ErrNotExist
 | |
| }
 | |
| 
 | |
| // Iterate iterates over all stored IDs and passes each of them to the given
 | |
| // handler. Take care that the handler method does not call any public
 | |
| // method on truncindex as the internal locking is not reentrant/recursive
 | |
| // and will result in deadlock.
 | |
| func (idx *TruncIndex) Iterate(handler func(id string)) {
 | |
| 	idx.Lock()
 | |
| 	defer idx.Unlock()
 | |
| 	idx.trie.Visit(func(prefix patricia.Prefix, item patricia.Item) error {
 | |
| 		handler(string(prefix))
 | |
| 		return nil
 | |
| 	})
 | |
| }
 | 
