-
Notifications
You must be signed in to change notification settings - Fork 4
/
main.go
166 lines (153 loc) · 3.7 KB
/
main.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
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
// Copyright 2015 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Grepdiff greps diffs.
//
// Usage:
//
// grepdiff regexp [file.diff ...]
//
// Grepdiff reads diffs from the named files (or standard input)
// and prints a reduced diff containing only the hunks matching
// the regular expression.
//
// The diffs are expected to be in unified diff format,
// as produced by commands like ``git diff'' or ``hg diff''.
//
// The regular expression syntax is that of the Go regexp package,
// which matches RE2 and roughly matches PCRE, Perl, and most
// other languages.
// For details, see ``go doc regexp/syntax'' or https://godoc.org/regexp/syntax.
//
// Unlike grep, the regexp search considers the entire hunk
// starting with the @@ line, not individual lines.
// It is therefore possible to search for multiline matches.
// As a nod to grep, however, by default the regexp search allows ^ and $ to
// match the start and end of each line, not just the start and end of the hunk.
// (To restrict ^ and $ to the start and end of the entire hunk,
// begin prefix the regexp passed to grepdiff with ``(?-m)''.)
//
// Grepdiff exits with status 0 if it found any matches, 1 if it found no matches, and 2 if an error occurred.
//
// Examples
//
// Diff two Git revisions and extract just the hunks mentioning foo:
//
// git diff rev1 rev2 | grepdiff foo
//
// For the adventurous, apply those changes:
//
// git diff rev1 rev2 | grepdiff foo | git apply
//
// Extract changes in func New:
//
// git diff rev1 HEAD | grepdiff ' @@ func New\('
//
// Search for new TODOs before sending out for review:
//
// git diff origin...HEAD | grepdiff '^\+.*TODO'
//
package main
import (
"bytes"
"flag"
"fmt"
"io/ioutil"
"log"
"os"
"regexp"
)
func usage() {
fmt.Fprintf(os.Stderr, "usage: grepdiff regexp [file.diff ...]\n")
// fmt.Fprintf(os.Stderr, "options:\n")
// flag.PrintDefaults()
os.Exit(2)
}
var exitStatus = 1
func main() {
log.SetFlags(0)
log.SetPrefix("grepdiff: ")
flag.Usage = usage
flag.Parse()
if flag.NArg() < 1 {
usage()
}
reStr := flag.Arg(0)
files := flag.Args()[1:]
// Compile regexp twice: once unmodified for reporting errors,
// and again with (?m) for real use. If somehow the (?m) does cause
// a problem, handle it gracefully.
re, err := regexp.Compile(reStr)
if err != nil {
log.Fatal(err)
}
re, err = regexp.Compile("(?m)" + reStr)
if err != nil {
log.Fatal(err)
}
if len(files) == 0 {
grepDiff(re, os.Stdin)
} else {
for _, file := range files {
f, err := os.Open(file)
if err != nil {
log.Print(err)
exitStatus = 2
continue
}
grepDiff(re, f)
f.Close()
}
}
os.Exit(exitStatus)
}
func grepDiff(re *regexp.Regexp, file *os.File) {
data, err := ioutil.ReadAll(file)
grepDiffData(re, data, file.Name())
if err != nil {
log.Print("%v", err)
exitStatus = 2
}
}
var (
diffLine = []byte("\ndiff ")
hunkLine = []byte("\n@@ ")
)
func grepDiffData(re *regexp.Regexp, data []byte, name string) {
forEach(data, "diff ", func(diff []byte) {
var hdr []byte
forEach(diff, "@@ ", func(hunk []byte) {
if hdr == nil {
hdr = diff[:cap(diff)-cap(hunk)]
}
if re.Match(hunk) {
os.Stdout.Write(hdr)
hdr = hdr[:0] // not nil
os.Stdout.Write(hunk)
if exitStatus == 1 {
exitStatus = 0
}
}
})
})
}
func forEach(x []byte, prefix string, f func([]byte)) {
b := []byte("\n" + prefix)
start := 0
if !bytes.HasPrefix(x, b[1:]) {
start = bytes.Index(x, b) + 1
if start == 0 {
return
}
}
for start < len(x) {
i := bytes.Index(x[start:], b) + start + 1
if i == start {
i = len(x)
}
if start >= 0 {
f(x[start:i])
}
start = i
}
}