2014-03-07 21:04:38 -05:00
package graph
2013-03-18 03:15:35 -04:00
import (
2015-03-30 14:19:12 -04:00
"compress/gzip"
"crypto/sha256"
2013-03-18 03:15:35 -04:00
"fmt"
2013-05-06 14:06:44 -04:00
"io"
2013-03-18 03:15:35 -04:00
"io/ioutil"
"os"
"path"
"path/filepath"
2013-12-20 11:20:08 -05:00
"runtime"
2013-03-26 08:28:17 -04:00
"strings"
2013-11-12 19:59:37 -05:00
"syscall"
2013-03-18 03:15:35 -04:00
"time"
2014-05-19 18:04:51 -04:00
2015-03-26 18:22:04 -04:00
"github.com/Sirupsen/logrus"
2015-03-30 14:19:12 -04:00
"github.com/docker/distribution/digest"
2015-02-04 16:22:38 -05:00
"github.com/docker/docker/autogen/dockerversion"
2014-07-24 18:19:50 -04:00
"github.com/docker/docker/daemon/graphdriver"
"github.com/docker/docker/image"
2014-09-30 02:23:36 -04:00
"github.com/docker/docker/pkg/archive"
2015-02-24 03:51:46 -05:00
"github.com/docker/docker/pkg/progressreader"
2015-03-17 22:18:41 -04:00
"github.com/docker/docker/pkg/streamformatter"
2015-03-24 07:25:26 -04:00
"github.com/docker/docker/pkg/stringid"
2014-07-24 18:19:50 -04:00
"github.com/docker/docker/pkg/truncindex"
"github.com/docker/docker/runconfig"
2013-03-18 03:15:35 -04:00
)
2013-03-30 03:22:24 -04:00
// A Graph is a store for versioned filesystem images and the relationship between them.
2013-03-18 03:15:35 -04:00
type Graph struct {
2013-07-17 15:13:22 -04:00
Root string
2014-06-24 13:19:15 -04:00
idIndex * truncindex . TruncIndex
2013-11-04 18:22:34 -05:00
driver graphdriver . Driver
2013-03-18 03:15:35 -04:00
}
2013-03-30 03:22:24 -04:00
// NewGraph instantiates a new graph at the given root path in the filesystem.
2013-03-30 00:13:59 -04:00
// `root` will be created if it doesn't exist.
2013-11-07 15:34:01 -05:00
func NewGraph ( root string , driver graphdriver . Driver ) ( * Graph , error ) {
2013-03-18 03:15:35 -04:00
abspath , err := filepath . Abs ( root )
if err != nil {
return nil , err
}
// Create the root directory if it doesn't exists
2013-05-08 19:22:12 -04:00
if err := os . MkdirAll ( root , 0700 ) ; err != nil && ! os . IsExist ( err ) {
2013-03-18 03:15:35 -04:00
return nil , err
}
2013-11-04 18:22:34 -05:00
2013-04-01 01:11:55 -04:00
graph := & Graph {
2013-07-17 15:13:22 -04:00
Root : abspath ,
2014-06-24 13:19:15 -04:00
idIndex : truncindex . NewTruncIndex ( [ ] string { } ) ,
2013-11-04 18:22:34 -05:00
driver : driver ,
2013-04-01 01:11:55 -04:00
}
if err := graph . restore ( ) ; err != nil {
return nil , err
}
return graph , nil
}
func ( graph * Graph ) restore ( ) error {
dir , err := ioutil . ReadDir ( graph . Root )
if err != nil {
return err
}
2014-04-11 16:39:58 -04:00
var ids = [ ] string { }
2013-04-01 01:11:55 -04:00
for _ , v := range dir {
id := v . Name ( )
2013-11-19 05:32:08 -05:00
if graph . driver . Exists ( id ) {
2014-04-11 16:39:58 -04:00
ids = append ( ids , id )
2013-11-19 05:32:08 -05:00
}
2013-04-01 01:11:55 -04:00
}
2014-06-24 13:19:15 -04:00
graph . idIndex = truncindex . NewTruncIndex ( ids )
2015-03-26 18:22:04 -04:00
logrus . Debugf ( "Restored %d elements" , len ( dir ) )
2013-04-01 01:11:55 -04:00
return nil
2013-03-18 03:15:35 -04:00
}
2013-03-26 08:28:17 -04:00
// FIXME: Implement error subclass instead of looking at the error text
// Note: This is the way golang implements os.IsNotExists on Plan9
2015-03-27 21:07:20 -04:00
func ( graph * Graph ) IsNotExist ( err error , id string ) bool {
return err != nil && ( strings . Contains ( strings . ToLower ( err . Error ( ) ) , "does not exist" ) || strings . Contains ( strings . ToLower ( err . Error ( ) ) , "no such" ) ) && strings . Contains ( err . Error ( ) , id )
2013-03-26 08:28:17 -04:00
}
2013-03-30 00:13:59 -04:00
// Exists returns true if an image is registered at the given id.
// If the image doesn't exist or if an error is encountered, false is returned.
2013-03-18 03:15:35 -04:00
func ( graph * Graph ) Exists ( id string ) bool {
if _ , err := graph . Get ( id ) ; err != nil {
return false
}
return true
}
2013-03-30 00:13:59 -04:00
// Get returns the image with the given id, or an error if the image doesn't exist.
2014-03-07 20:36:47 -05:00
func ( graph * Graph ) Get ( name string ) ( * image . Image , error ) {
2013-04-01 01:11:55 -04:00
id , err := graph . idIndex . Get ( name )
if err != nil {
2014-12-11 12:57:23 -05:00
return nil , fmt . Errorf ( "could not find image: %v" , err )
2013-04-01 01:11:55 -04:00
}
2014-03-07 20:36:47 -05:00
img , err := image . LoadImage ( graph . ImageRoot ( id ) )
2013-03-18 03:15:35 -04:00
if err != nil {
return nil , err
}
2013-06-04 14:00:22 -04:00
if img . ID != id {
return nil , fmt . Errorf ( "Image stored at '%s' has wrong id '%s'" , id , img . ID )
2013-03-18 03:15:35 -04:00
}
2014-03-07 20:36:47 -05:00
img . SetGraph ( graph )
2013-12-05 17:03:23 -05:00
if img . Size < 0 {
2014-09-10 23:30:52 -04:00
size , err := graph . driver . DiffSize ( img . ID , img . Parent )
2014-01-07 14:34:19 -05:00
if err != nil {
2014-09-10 23:30:52 -04:00
return nil , fmt . Errorf ( "unable to calculate size of image id %q: %s" , img . ID , err )
2013-05-13 09:10:26 -04:00
}
2013-12-05 17:03:23 -05:00
2013-11-07 15:34:01 -05:00
img . Size = size
2014-03-07 20:36:47 -05:00
if err := img . SaveSize ( graph . ImageRoot ( id ) ) ; err != nil {
2013-05-13 09:10:26 -04:00
return nil , err
}
}
2013-03-18 03:15:35 -04:00
return img , nil
}
2013-03-30 00:13:59 -04:00
// Create creates a new image and registers it in the graph.
2014-03-07 21:04:38 -05:00
func ( graph * Graph ) Create ( layerData archive . ArchiveReader , containerID , containerImage , comment , author string , containerConfig , config * runconfig . Config ) ( * image . Image , error ) {
2014-03-07 20:36:47 -05:00
img := & image . Image {
2015-03-24 07:25:26 -04:00
ID : stringid . GenerateRandomID ( ) ,
2013-04-04 21:38:43 -04:00
Comment : comment ,
2013-11-21 19:41:41 -05:00
Created : time . Now ( ) . UTC ( ) ,
2014-02-11 19:26:54 -05:00
DockerVersion : dockerversion . VERSION ,
2013-04-17 22:58:17 -04:00
Author : author ,
2013-04-25 19:48:31 -04:00
Config : config ,
2013-12-20 11:20:08 -05:00
Architecture : runtime . GOARCH ,
OS : runtime . GOOS ,
2013-03-18 03:15:35 -04:00
}
2014-05-19 18:04:51 -04:00
2014-03-07 21:04:38 -05:00
if containerID != "" {
img . Parent = containerImage
img . Container = containerID
img . ContainerConfig = * containerConfig
2013-03-22 00:13:27 -04:00
}
2014-05-19 18:04:51 -04:00
2014-10-27 14:00:29 -04:00
if err := graph . Register ( img , layerData ) ; err != nil {
2013-03-18 03:15:35 -04:00
return nil , err
}
return img , nil
}
2013-03-30 00:13:59 -04:00
// Register imports a pre-existing image into the graph.
2014-10-27 14:00:29 -04:00
func ( graph * Graph ) Register ( img * image . Image , layerData archive . ArchiveReader ) ( err error ) {
2013-11-25 23:48:34 -05:00
defer func ( ) {
// If any error occurs, remove the new dir from the driver.
// Don't check for errors since the dir might not have been created.
// FIXME: this leaves a possible race condition.
if err != nil {
graph . driver . Remove ( img . ID )
}
} ( )
2015-03-29 17:17:23 -04:00
if err := image . ValidateID ( img . ID ) ; err != nil {
2013-03-18 03:15:35 -04:00
return err
}
// (This is a convenience to save time. Race conditions are taken care of by os.Rename)
2013-06-04 14:00:22 -04:00
if graph . Exists ( img . ID ) {
return fmt . Errorf ( "Image %s already exists" , img . ID )
2013-03-18 03:15:35 -04:00
}
2013-11-19 05:32:08 -05:00
// Ensure that the image root does not exist on the filesystem
// when it is not registered in the graph.
// This is common when you switch from one graph driver to another
2014-03-07 20:36:47 -05:00
if err := os . RemoveAll ( graph . ImageRoot ( img . ID ) ) ; err != nil && ! os . IsNotExist ( err ) {
2013-11-19 05:32:08 -05:00
return err
}
2013-11-25 23:48:34 -05:00
// If the driver has this ID but the graph doesn't, remove it from the driver to start fresh.
// (the graph is the source of truth).
// Ignore errors, since we don't know if the driver correctly returns ErrNotExist.
// (FIXME: make that mandatory for drivers).
graph . driver . Remove ( img . ID )
2013-04-17 19:35:22 -04:00
tmp , err := graph . Mktemp ( "" )
2013-03-18 03:15:35 -04:00
defer os . RemoveAll ( tmp )
if err != nil {
return fmt . Errorf ( "Mktemp failed: %s" , err )
}
2013-11-07 15:34:01 -05:00
// Create root filesystem in the driver
2014-04-17 19:47:27 -04:00
if err := graph . driver . Create ( img . ID , img . Parent ) ; err != nil {
2013-11-07 15:34:01 -05:00
return fmt . Errorf ( "Driver %s failed to create image rootfs %s: %s" , graph . driver , img . ID , err )
}
2014-09-10 23:30:52 -04:00
// Apply the diff/layer
2014-03-07 20:36:47 -05:00
img . SetGraph ( graph )
2014-10-27 14:00:29 -04:00
if err := image . StoreImage ( img , layerData , tmp ) ; err != nil {
2013-03-18 03:15:35 -04:00
return err
}
// Commit
2014-03-07 20:36:47 -05:00
if err := os . Rename ( tmp , graph . ImageRoot ( img . ID ) ) ; err != nil {
2013-03-18 03:15:35 -04:00
return err
}
2013-06-04 14:00:22 -04:00
graph . idIndex . Add ( img . ID )
2013-03-18 03:15:35 -04:00
return nil
}
2013-04-21 17:23:55 -04:00
// TempLayerArchive creates a temporary archive of the given image's filesystem layer.
// The archive is stored on disk and will be automatically deleted as soon as has been read.
2013-04-21 18:29:26 -04:00
// If output is not nil, a human-readable progress bar will be written to it.
// FIXME: does this belong in Graph? How about MktempFile, let the caller use it for archives?
2015-03-17 22:18:41 -04:00
func ( graph * Graph ) TempLayerArchive ( id string , sf * streamformatter . StreamFormatter , output io . Writer ) ( * archive . TempArchive , error ) {
2013-04-21 17:23:55 -04:00
image , err := graph . Get ( id )
if err != nil {
return nil , err
}
2013-11-07 15:34:01 -05:00
tmp , err := graph . Mktemp ( "" )
2013-04-21 17:23:55 -04:00
if err != nil {
return nil , err
}
2013-11-20 18:37:26 -05:00
a , err := image . TarLayer ( )
2013-04-21 17:23:55 -04:00
if err != nil {
return nil , err
}
2015-02-24 03:51:46 -05:00
progressReader := progressreader . New ( progressreader . Config {
In : a ,
Out : output ,
Formatter : sf ,
Size : 0 ,
NewLines : false ,
2015-03-24 07:25:26 -04:00
ID : stringid . TruncateID ( id ) ,
2015-02-24 03:51:46 -05:00
Action : "Buffering to disk" ,
} )
defer progressReader . Close ( )
return archive . NewTempArchive ( progressReader , tmp )
2013-04-21 17:23:55 -04:00
}
2013-03-30 00:13:59 -04:00
// Mktemp creates a temporary sub-directory inside the graph's filesystem.
2013-03-18 03:15:35 -04:00
func ( graph * Graph ) Mktemp ( id string ) ( string , error ) {
2015-03-24 07:25:26 -04:00
dir := path . Join ( graph . Root , "_tmp" , stringid . GenerateRandomID ( ) )
2013-11-08 19:53:58 -05:00
if err := os . MkdirAll ( dir , 0700 ) ; err != nil {
return "" , err
2013-03-18 03:15:35 -04:00
}
2013-11-07 15:34:01 -05:00
return dir , nil
2013-03-18 03:15:35 -04:00
}
2015-01-27 21:10:28 -05:00
func ( graph * Graph ) newTempFile ( ) ( * os . File , error ) {
tmp , err := graph . Mktemp ( "" )
if err != nil {
return nil , err
}
return ioutil . TempFile ( tmp , "" )
}
2015-03-30 14:19:12 -04:00
func bufferToFile ( f * os . File , src io . Reader ) ( int64 , digest . Digest , error ) {
var (
h = sha256 . New ( )
w = gzip . NewWriter ( io . MultiWriter ( f , h ) )
)
_ , err := io . Copy ( w , src )
w . Close ( )
2015-01-27 21:10:28 -05:00
if err != nil {
2015-03-30 14:19:12 -04:00
return 0 , "" , err
2015-01-27 21:10:28 -05:00
}
if err = f . Sync ( ) ; err != nil {
2015-03-30 14:19:12 -04:00
return 0 , "" , err
}
n , err := f . Seek ( 0 , os . SEEK_CUR )
if err != nil {
return 0 , "" , err
2015-01-27 21:10:28 -05:00
}
if _ , err := f . Seek ( 0 , 0 ) ; err != nil {
2015-03-30 14:19:12 -04:00
return 0 , "" , err
2015-01-27 21:10:28 -05:00
}
2015-03-30 14:19:12 -04:00
return n , digest . NewDigest ( "sha256" , h ) , nil
2015-01-27 21:10:28 -05:00
}
2013-11-07 15:34:01 -05:00
// setupInitLayer populates a directory with mountpoints suitable
2013-06-14 19:56:08 -04:00
// for bind-mounting dockerinit into the container. The mountpoint is simply an
// empty file at /.dockerinit
//
// This extra layer is used by all containers as the top-most ro layer. It protects
// the container from unwanted side-effects on the rw layer.
2014-03-07 21:04:38 -05:00
func SetupInitLayer ( initLayer string ) error {
2013-08-08 14:25:02 -04:00
for pth , typ := range map [ string ] string {
"/dev/pts" : "dir" ,
"/dev/shm" : "dir" ,
"/proc" : "dir" ,
"/sys" : "dir" ,
"/.dockerinit" : "file" ,
2013-08-13 18:40:23 -04:00
"/.dockerenv" : "file" ,
2013-08-08 14:25:02 -04:00
"/etc/resolv.conf" : "file" ,
2013-09-09 15:40:25 -04:00
"/etc/hosts" : "file" ,
"/etc/hostname" : "file" ,
2014-02-27 20:20:10 -05:00
"/dev/console" : "file" ,
2014-03-19 14:52:38 -04:00
"/etc/mtab" : "/proc/mounts" ,
2013-08-08 14:25:02 -04:00
} {
2013-11-12 19:59:37 -05:00
parts := strings . Split ( pth , "/" )
prev := "/"
for _ , p := range parts [ 1 : ] {
prev = path . Join ( prev , p )
syscall . Unlink ( path . Join ( initLayer , prev ) )
}
2013-08-08 14:25:02 -04:00
if _ , err := os . Stat ( path . Join ( initLayer , pth ) ) ; err != nil {
if os . IsNotExist ( err ) {
2014-04-09 13:13:54 -04:00
if err := os . MkdirAll ( path . Join ( initLayer , path . Dir ( pth ) ) , 0755 ) ; err != nil {
return err
}
2013-08-08 14:25:02 -04:00
switch typ {
case "dir" :
if err := os . MkdirAll ( path . Join ( initLayer , pth ) , 0755 ) ; err != nil {
2013-11-07 15:34:01 -05:00
return err
2013-08-08 14:25:02 -04:00
}
case "file" :
2013-11-18 18:35:56 -05:00
f , err := os . OpenFile ( path . Join ( initLayer , pth ) , os . O_CREATE , 0755 )
if err != nil {
2013-11-07 15:34:01 -05:00
return err
2013-08-08 14:25:02 -04:00
}
2013-11-18 18:35:56 -05:00
f . Close ( )
2014-03-19 14:52:38 -04:00
default :
if err := os . Symlink ( typ , path . Join ( initLayer , pth ) ) ; err != nil {
return err
}
2013-08-08 14:25:02 -04:00
}
} else {
2013-11-07 15:34:01 -05:00
return err
2013-08-08 14:25:02 -04:00
}
}
2013-06-14 19:56:08 -04:00
}
2013-08-08 14:25:02 -04:00
2013-06-14 19:56:08 -04:00
// Layer is ready to use, if it wasn't before.
2013-11-07 15:34:01 -05:00
return nil
2013-04-21 17:23:55 -04:00
}
2013-03-30 03:22:24 -04:00
// Check if given error is "not empty".
// Note: this is the way golang does it internally with os.IsNotExists.
2013-03-26 06:33:47 -04:00
func isNotEmpty ( err error ) bool {
switch pe := err . ( type ) {
case nil :
return false
case * os . PathError :
err = pe . Err
case * os . LinkError :
err = pe . Err
}
return strings . Contains ( err . Error ( ) , " not empty" )
}
2013-03-30 00:13:59 -04:00
// Delete atomically removes an image from the graph.
2013-04-01 19:04:44 -04:00
func ( graph * Graph ) Delete ( name string ) error {
id , err := graph . idIndex . Get ( name )
if err != nil {
return err
}
2013-04-04 01:14:28 -04:00
tmp , err := graph . Mktemp ( "" )
2013-04-01 01:11:55 -04:00
graph . idIndex . Delete ( id )
2014-09-22 10:47:20 -04:00
if err == nil {
err = os . Rename ( graph . ImageRoot ( id ) , tmp )
// On err make tmp point to old dir and cleanup unused tmp dir
if err != nil {
os . RemoveAll ( tmp )
tmp = graph . ImageRoot ( id )
}
} else {
// On err make tmp point to old dir for cleanup
tmp = graph . ImageRoot ( id )
2013-03-18 03:15:35 -04:00
}
2013-11-07 15:34:01 -05:00
// Remove rootfs data from the driver
graph . driver . Remove ( id )
// Remove the trashed image directory
2013-04-04 01:14:28 -04:00
return os . RemoveAll ( tmp )
2013-03-18 03:15:35 -04:00
}
2013-03-30 03:22:24 -04:00
// Map returns a list of all images in the graph, addressable by ID.
2014-03-07 20:36:47 -05:00
func ( graph * Graph ) Map ( ) ( map [ string ] * image . Image , error ) {
images := make ( map [ string ] * image . Image )
err := graph . walkAll ( func ( image * image . Image ) {
2013-08-31 23:31:21 -04:00
images [ image . ID ] = image
} )
2013-03-21 20:35:49 -04:00
if err != nil {
return nil , err
}
return images , nil
}
2013-08-31 23:34:51 -04:00
// walkAll iterates over each image in the graph, and passes it to a handler.
2013-03-30 00:13:59 -04:00
// The walking order is undetermined.
2014-03-07 20:36:47 -05:00
func ( graph * Graph ) walkAll ( handler func ( * image . Image ) ) error {
2013-03-18 03:15:35 -04:00
files , err := ioutil . ReadDir ( graph . Root )
if err != nil {
2013-03-23 20:03:30 -04:00
return err
2013-03-18 03:15:35 -04:00
}
for _ , st := range files {
if img , err := graph . Get ( st . Name ( ) ) ; err != nil {
// Skip image
continue
2013-03-23 20:03:30 -04:00
} else if handler != nil {
handler ( img )
}
}
return nil
}
2013-03-30 00:13:59 -04:00
// ByParent returns a lookup table of images by their parent.
// If an image of id ID has 3 children images, then the value for key ID
// will be a list of 3 images.
// If an image has no children, it will not have an entry in the table.
2014-03-07 20:36:47 -05:00
func ( graph * Graph ) ByParent ( ) ( map [ string ] [ ] * image . Image , error ) {
byParent := make ( map [ string ] [ ] * image . Image )
err := graph . walkAll ( func ( img * image . Image ) {
parent , err := graph . Get ( img . Parent )
2013-03-23 20:03:30 -04:00
if err != nil {
return
}
2013-06-04 14:00:22 -04:00
if children , exists := byParent [ parent . ID ] ; exists {
2014-03-07 20:36:47 -05:00
byParent [ parent . ID ] = append ( children , img )
2013-08-11 03:37:16 -04:00
} else {
2014-03-07 20:36:47 -05:00
byParent [ parent . ID ] = [ ] * image . Image { img }
2013-03-18 03:15:35 -04:00
}
2013-03-23 20:03:30 -04:00
} )
return byParent , err
}
2013-03-30 00:13:59 -04:00
// Heads returns all heads in the graph, keyed by id.
// A head is an image which is not the parent of another image in the graph.
2014-03-07 20:36:47 -05:00
func ( graph * Graph ) Heads ( ) ( map [ string ] * image . Image , error ) {
heads := make ( map [ string ] * image . Image )
2013-03-23 20:03:30 -04:00
byParent , err := graph . ByParent ( )
if err != nil {
return nil , err
2013-03-18 03:15:35 -04:00
}
2014-03-07 20:36:47 -05:00
err = graph . walkAll ( func ( image * image . Image ) {
2013-03-23 20:03:30 -04:00
// If it's not in the byParent lookup table, then
// it's not a parent -> so it's a head!
2013-06-04 14:00:22 -04:00
if _ , exists := byParent [ image . ID ] ; ! exists {
heads [ image . ID ] = image
2013-03-23 20:03:30 -04:00
}
} )
return heads , err
2013-03-18 03:15:35 -04:00
}
2014-03-07 20:36:47 -05:00
func ( graph * Graph ) ImageRoot ( id string ) string {
2013-03-18 03:15:35 -04:00
return path . Join ( graph . Root , id )
}
2013-11-25 23:04:57 -05:00
func ( graph * Graph ) Driver ( ) graphdriver . Driver {
return graph . driver
}