-
-
Notifications
You must be signed in to change notification settings - Fork 487
/
scanner.go
283 lines (250 loc) · 5.44 KB
/
scanner.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
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
// Package dump implements an haveibeenpwned.com dump scanner. It is designed
// to operate on HIBP SHA-1 dumps which are ordered by hash. It will work with
// dumps ordered by prevalence, too. But processing those will take much, much
// longer.
//
// Unfortunately these dumps need to be unpacked before use, since there is no
// 7z implementation for Go at the time of this writing.
package dump
import (
"bufio"
"compress/gzip"
"context"
"fmt"
"io"
"os"
"runtime"
"sort"
"strings"
"github.com/gopasspw/gopass/internal/out"
"github.com/gopasspw/gopass/pkg/debug"
"github.com/gopasspw/gopass/pkg/fsutil"
)
// Scanner is a HIBP dump scanner
type Scanner struct {
dumps []string
}
// New creates a new scanner. Provide a list of filenames to HIBP SHA-1 dumps.
// Those should be ordered by hash or lookups will take forever.
func New(dumps ...string) (*Scanner, error) {
ok := make([]string, 0, len(dumps))
for _, dump := range dumps {
if !fsutil.IsFile(dump) {
continue
}
ok = append(ok, dump)
}
if len(ok) < 1 {
return nil, fmt.Errorf("no valid dumps given")
}
return &Scanner{
dumps: ok,
}, nil
}
// LookupBatch takes a slice SHA1 hashes and matches them against
// the provided dumps
func (s *Scanner) LookupBatch(ctx context.Context, in []string) []string {
if len(in) < 1 {
return nil
}
sort.Strings(in)
for i, hash := range in {
in[i] = strings.ToUpper(hash)
}
out := make([]string, 0, len(in))
results := make(chan string, len(in))
done := make(chan struct{}, len(s.dumps))
for _, fn := range s.dumps {
go s.scanFile(ctx, fn, in, results, done)
}
go func() {
for result := range results {
out = append(out, result)
}
done <- struct{}{}
}()
for range s.dumps {
<-done
}
close(results)
<-done
return out
}
func (s *Scanner) scanFile(ctx context.Context, fn string, in []string, results chan string, done chan struct{}) {
defer func() {
done <- struct{}{}
}()
if isSorted(fn) {
debug.Log("file %s appears to be sorted", fn)
s.scanSortedFile(ctx, fn, in, results)
return
}
debug.Log("file %s is not sorted", fn)
s.scanUnsortedFile(ctx, fn, in, results)
}
func isSorted(fn string) bool {
var rdr io.Reader
fh, err := os.Open(fn)
if err != nil {
return false
}
defer func() {
_ = fh.Close()
}()
rdr = fh
if strings.HasSuffix(fn, ".gz") {
gzr, err := gzip.NewReader(fh)
if err != nil {
return false
}
defer func() {
_ = gzr.Close()
}()
rdr = gzr
}
lineNo := 0
lastLine := ""
scanner := bufio.NewScanner(rdr)
for scanner.Scan() {
lineNo++
if lineNo > 100 {
return true
}
line := scanner.Text()
if len(line) > 40 {
line = line[:40]
}
if line < lastLine {
return false
}
lastLine = line
}
return true
}
func (s *Scanner) scanSortedFile(ctx context.Context, fn string, in []string, results chan string) {
var rdr io.Reader
fh, err := os.Open(fn)
if err != nil {
out.Errorf(ctx, "Failed to open file %s: %s", fn, err)
return
}
defer func() {
_ = fh.Close()
}()
rdr = fh
if strings.HasSuffix(fn, ".gz") {
gzr, err := gzip.NewReader(fh)
if err != nil {
out.Errorf(ctx, "Failed to open the file %s: %s", fn, err)
return
}
defer func() {
_ = gzr.Close()
}()
rdr = gzr
}
debug.Log("Checking file %s ...\n", fn)
// index in input (sorted SHA sums)
i := 0
lineNo := 0
numMatches := 0
scanner := bufio.NewScanner(rdr)
SCAN:
for scanner.Scan() {
// check for context cancelation
select {
case <-ctx.Done():
break SCAN
default:
}
lineNo++
if i >= len(in) {
break
}
line := strings.TrimSpace(scanner.Text())
hash := line[:40]
if hash == in[i] {
results <- hash
debug.Log("[%s] MATCH at line %d: %s", fn, lineNo, hash)
numMatches++
// advance to next sha sum from store and next line in file
i++
continue
}
// advance in sha sums from store until we've reached the position in
// the file
for i < len(in) && line > in[i] {
i++
}
}
debug.Log("Finished checking file %s", fn)
}
func (s *Scanner) scanUnsortedFile(ctx context.Context, fn string, in []string, results chan string) {
var rdr io.Reader
fh, err := os.Open(fn)
if err != nil {
out.Errorf(ctx, "Failed to open file %s: %s", fn, err)
return
}
defer func() {
_ = fh.Close()
}()
rdr = fh
if strings.HasSuffix(fn, ".gz") {
gzr, err := gzip.NewReader(fh)
if err != nil {
out.Errorf(ctx, "Failed to open the file %s: %s", fn, err)
return
}
defer func() {
_ = gzr.Close()
}()
rdr = gzr
}
lines := make(chan string, 1024)
worker := runtime.NumCPU()
done := make(chan struct{}, worker)
for i := 0; i < worker; i++ {
debug.Log("[%d] Starting matcher ...", i)
go s.matcher(ctx, in, lines, results, done)
}
debug.Log("Checking file %s ...\n", fn)
scanner := bufio.NewScanner(rdr)
SCAN:
for scanner.Scan() {
// check for context cancelation
select {
case <-ctx.Done():
break SCAN
default:
}
lines <- scanner.Text()
}
close(lines)
for i := 0; i < worker; i++ {
<-done
}
debug.Log("Finished checking file %s", fn)
}
func (s *Scanner) matcher(ctx context.Context, in []string, lines chan string, results chan string, done chan struct{}) {
defer func() {
done <- struct{}{}
}()
LINE:
for line := range lines {
// check for context cancelation
select {
case <-ctx.Done():
break LINE
default:
}
line := strings.ToUpper(strings.TrimSpace(line))
hash := line[:40]
for _, candidate := range in {
if candidate == hash {
results <- hash
continue LINE
}
}
}
}