summaryrefslogtreecommitdiff
path: root/libpod/image/prune.go
diff options
context:
space:
mode:
authorValentin Rothberg <rothberg@redhat.com>2020-08-04 15:55:53 +0200
committerValentin Rothberg <rothberg@redhat.com>2020-08-07 12:14:11 +0200
commit8827100b98d0e8afa6cd7a8d7415cb748948a417 (patch)
treebdad0e581e317fa7a0e52c3efab489d229149e6b /libpod/image/prune.go
parent1ed1e583a06288bb2f3058f7d4dff7650af5f3bd (diff)
downloadpodman-8827100b98d0e8afa6cd7a8d7415cb748948a417.tar.gz
podman-8827100b98d0e8afa6cd7a8d7415cb748948a417.tar.bz2
podman-8827100b98d0e8afa6cd7a8d7415cb748948a417.zip
image list: speed up
Listing images has shown increasing performance penalties with an increasing number of images. Unless `--all` is specified, Podman will filter intermediate images. Determining intermediate images has been done by finding (and comparing!) parent images which is expensive. We had to query the storage many times which turned it into a bottleneck. Instead, create a layer tree and assign one or more images to nodes that match the images' top layer. Determining the children of an image is now exponentially faster as we already know the child images from the layer graph and the images using the same top layer, which may also be considered child images based on their history. On my system with 510 images, a rootful image list drops from 6 secs down to 0.3 secs. Also use the tree to compute parent nodes, and to filter intermediate images for pruning. Signed-off-by: Valentin Rothberg <rothberg@redhat.com>
Diffstat (limited to 'libpod/image/prune.go')
-rw-r--r--libpod/image/prune.go11
1 files changed, 9 insertions, 2 deletions
diff --git a/libpod/image/prune.go b/libpod/image/prune.go
index 8c9267650..5a9ca5d8e 100644
--- a/libpod/image/prune.go
+++ b/libpod/image/prune.go
@@ -66,6 +66,12 @@ func (ir *Runtime) GetPruneImages(ctx context.Context, all bool, filterFuncs []I
if err != nil {
return nil, err
}
+
+ tree, err := ir.layerTree()
+ if err != nil {
+ return nil, err
+ }
+
for _, i := range allImages {
// filter the images based on this.
for _, filterFunc := range filterFuncs {
@@ -85,8 +91,9 @@ func (ir *Runtime) GetPruneImages(ctx context.Context, all bool, filterFuncs []I
}
}
- //skip the cache or intermediate images
- intermediate, err := i.Intermediate(ctx)
+ // skip the cache (i.e., with parent) and intermediate (i.e.,
+ // with children) images
+ intermediate, err := tree.hasChildrenAndParent(ctx, i)
if err != nil {
return nil, err
}