-
Notifications
You must be signed in to change notification settings - Fork 2
/
Copy pathpatch.go
83 lines (66 loc) · 1.32 KB
/
patch.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
package main
import (
"errors"
"os"
)
func applyPatch(filename string) error {
_, err := os.Stat(filename)
if errors.Is(err, os.ErrNotExist) {
return ErrCantLocate
}
bytes, err := os.ReadFile(filename)
if err != nil {
return err
}
err = modifyBytes(bytes)
if err != nil {
return err
}
err = backupFile(filename)
if err != nil {
return err
}
out, err := os.Create(filename)
if err != nil {
return err
}
_, err = out.Write(bytes)
if err != nil {
return err
}
err = out.Close()
if err != nil {
return err
}
return nil
}
func isStartCandidate(bytes []byte) bool {
return isByteSlicesEqual(bytes, start1) || isByteSlicesEqual(bytes, start2) || isByteSlicesEqual(bytes, start3)
}
func isEndCandidate(bytes []byte) bool {
return isByteSlicesEqual(bytes, end)
}
func modifyBytes(bytes []byte) error {
atLeastOnePatched := false
for i := 0; i < len(bytes); i++ {
if i > len(bytes)-limit {
break
}
if !isStartCandidate(bytes[i : i+startLength]) {
continue
}
for j := i + startLength; j < i+startLength+limit && j < len(bytes)-endLength; j++ {
if !isEndCandidate(bytes[j : j+endLength]) {
continue
}
for k := 0; k < len(replacement); k++ {
bytes[j+k] = replacement[k]
}
atLeastOnePatched = true
}
}
if atLeastOnePatched {
return nil
}
return ErrNoMatch
}