140 lines
3.5 KiB
Go
140 lines
3.5 KiB
Go
/*
|
|
Copyright 2018 Google LLC
|
|
|
|
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 snapshot
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/json"
|
|
"fmt"
|
|
"path/filepath"
|
|
"strings"
|
|
|
|
"github.com/GoogleContainerTools/kaniko/pkg/timing"
|
|
"github.com/GoogleContainerTools/kaniko/pkg/util"
|
|
)
|
|
|
|
type LayeredMap struct {
|
|
layers []map[string]string
|
|
whiteouts []map[string]string
|
|
added []map[string]string
|
|
hasher func(string) (string, error)
|
|
// cacheHasher doesn't include mtime in it's hash so that filesystem cache keys are stable
|
|
cacheHasher func(string) (string, error)
|
|
}
|
|
|
|
func NewLayeredMap(h func(string) (string, error), c func(string) (string, error)) *LayeredMap {
|
|
l := LayeredMap{
|
|
hasher: h,
|
|
cacheHasher: c,
|
|
}
|
|
l.layers = []map[string]string{}
|
|
return &l
|
|
}
|
|
|
|
func (l *LayeredMap) Snapshot() {
|
|
l.whiteouts = append(l.whiteouts, map[string]string{})
|
|
l.layers = append(l.layers, map[string]string{})
|
|
l.added = append(l.added, map[string]string{})
|
|
}
|
|
|
|
// Key returns a hash for added files
|
|
func (l *LayeredMap) Key() (string, error) {
|
|
c := bytes.NewBuffer([]byte{})
|
|
enc := json.NewEncoder(c)
|
|
enc.Encode(l.added)
|
|
return util.SHA256(c)
|
|
}
|
|
|
|
// GetFlattenedPathsForWhiteOut returns all paths in the current FS
|
|
func (l *LayeredMap) GetFlattenedPathsForWhiteOut() map[string]struct{} {
|
|
paths := map[string]struct{}{}
|
|
for _, l := range l.layers {
|
|
for p := range l {
|
|
if strings.HasPrefix(filepath.Base(p), ".wh.") {
|
|
delete(paths, p)
|
|
} else {
|
|
paths[p] = struct{}{}
|
|
}
|
|
paths[p] = struct{}{}
|
|
}
|
|
}
|
|
return paths
|
|
}
|
|
|
|
func (l *LayeredMap) Get(s string) (string, bool) {
|
|
for i := len(l.layers) - 1; i >= 0; i-- {
|
|
if v, ok := l.layers[i][s]; ok {
|
|
return v, ok
|
|
}
|
|
}
|
|
return "", false
|
|
}
|
|
|
|
func (l *LayeredMap) GetWhiteout(s string) (string, bool) {
|
|
for i := len(l.whiteouts) - 1; i >= 0; i-- {
|
|
if v, ok := l.whiteouts[i][s]; ok {
|
|
return v, ok
|
|
}
|
|
}
|
|
return "", false
|
|
}
|
|
|
|
func (l *LayeredMap) MaybeAddWhiteout(s string) bool {
|
|
whiteout, ok := l.GetWhiteout(s)
|
|
if ok && whiteout == s {
|
|
return false
|
|
}
|
|
l.whiteouts[len(l.whiteouts)-1][s] = s
|
|
return true
|
|
}
|
|
|
|
// Add will add the specified file s to the layered map.
|
|
func (l *LayeredMap) Add(s string) error {
|
|
// Use hash function and add to layers
|
|
newV, err := l.hasher(s)
|
|
if err != nil {
|
|
return fmt.Errorf("Error creating hash for %s: %v", s, err)
|
|
}
|
|
l.layers[len(l.layers)-1][s] = newV
|
|
// Use cache hash function and add to added
|
|
cacheV, err := l.cacheHasher(s)
|
|
if err != nil {
|
|
return fmt.Errorf("Error creating cache hash for %s: %v", s, err)
|
|
}
|
|
l.added[len(l.added)-1][s] = cacheV
|
|
return nil
|
|
}
|
|
|
|
// MaybeAdd will add the specified file s to the layered map if
|
|
// the layered map's hashing function determines it has changed. If
|
|
// it has not changed, it will not be added. Returns true if the file
|
|
// was added.
|
|
func (l *LayeredMap) MaybeAdd(s string) (bool, error) {
|
|
oldV, ok := l.Get(s)
|
|
t := timing.Start("Hashing files")
|
|
defer timing.DefaultRun.Stop(t)
|
|
newV, err := l.hasher(s)
|
|
if err != nil {
|
|
return false, err
|
|
}
|
|
if ok && newV == oldV {
|
|
return false, nil
|
|
}
|
|
l.layers[len(l.layers)-1][s] = newV
|
|
return true, nil
|
|
}
|