forked from pufferpanel/pufferpanel
-
Notifications
You must be signed in to change notification settings - Fork 0
/
files.go
129 lines (109 loc) · 2.92 KB
/
files.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
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
/*
Copyright 2019 Padduck, 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 pufferpanel
import (
"errors"
"io"
"os"
"path/filepath"
"strings"
)
const MaxRecursivePath = 256
func JoinPath(paths ...string) string {
return filepath.Join(paths...)
}
func EnsureAccess(source string, prefix string) bool {
//first resolve the correct source path so we can compare with the wanted path
expected, err := findFullPath(prefix)
if err != nil && !os.IsNotExist(err) {
return false
}
expected, err = filepath.Abs(expected)
if err != nil && !os.IsNotExist(err) {
return false
}
replacement, err := findFullPath(source)
if err != nil && !os.IsNotExist(err) {
return false
}
replacement, err = filepath.Abs(source)
if err != nil {
return false
}
return strings.HasPrefix(replacement, expected)
}
func RemoveInvalidSymlinks(files []os.FileInfo, sourceFolder, prefix string) []os.FileInfo {
i := 0
for _, v := range files {
if v.Mode()&os.ModeSymlink != 0 {
if !EnsureAccess(sourceFolder+string(os.PathSeparator)+v.Name(), prefix) {
continue
}
}
files[i] = v
i++
}
return files[:i]
}
func CopyFile(src, dest string) error {
source, err := os.Open(src)
if err != nil {
return err
}
defer Close(source)
err = os.MkdirAll(filepath.Dir(dest), 0755)
if err != nil {
return err
}
destination, err := os.Create(dest)
if err != nil {
return err
}
defer Close(destination)
_, err = io.Copy(destination, source)
return err
}
func findFullPath(source string) (string, error) {
fullPath, err := filepath.EvalSymlinks(source)
if err == nil {
return fullPath, err
}
//if file doesn't exist, then filepath doesn't resolve properly, so check backwards
if os.IsNotExist(err) {
var updatePath string
dir, filename := filepath.Split(source)
suffix := string(os.PathSeparator) + filename
i := 0
for i < MaxRecursivePath && dir != "" {
dirFullPath, err := filepath.EvalSymlinks(dir)
if err != nil && os.IsNotExist(err) {
//update our mapping to look farther down
suffix = filepath.Base(dir) + string(os.PathSeparator) + suffix
dir = filepath.Dir(dir)
} else if err != nil {
return "", err
} else {
//we found a good path!
updatePath = dirFullPath + string(os.PathSeparator) + suffix
break
}
i++
if i == MaxRecursivePath {
return "", errors.New("path too recursive")
}
}
updatePath, err := filepath.Abs(updatePath)
return updatePath, err
}
return "", err
}