/
mount_unix.go
61 lines (49 loc) · 1.47 KB
/
mount_unix.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
//go:build !windows && !darwin && !openbsd
/*
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.
*/
package mount
import (
"sort"
"github.com/moby/sys/mountinfo"
)
// UnmountRecursive unmounts the target and all mounts underneath, starting
// with the deepest mount first.
func UnmountRecursive(target string, flags int) error {
if target == "" {
return nil
}
mounts, err := mountinfo.GetMounts(mountinfo.PrefixFilter(target))
if err != nil {
return err
}
targetSet := make(map[string]struct{})
for _, m := range mounts {
targetSet[m.Mountpoint] = struct{}{}
}
var targets []string
for m := range targetSet {
targets = append(targets, m)
}
// Make the deepest mount be first
sort.SliceStable(targets, func(i, j int) bool {
return len(targets[i]) > len(targets[j])
})
for i, target := range targets {
if err := UnmountAll(target, flags); err != nil {
if i == len(targets)-1 { // last mount
return err
}
}
}
return nil
}