forked from sourcegraph/zoekt
-
Notifications
You must be signed in to change notification settings - Fork 0
/
merge.go
265 lines (224 loc) · 6.35 KB
/
merge.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
package zoekt
import (
"crypto/sha1"
"fmt"
"io"
"log"
"net/url"
"os"
"path/filepath"
"runtime"
"sort"
)
// Merge files into a compound shard in dstDir. Merge returns tmpName and a
// dstName. It is the responsibility of the caller to delete the input shards and
// rename the temporary compound shard from tmpName to dstName.
func Merge(dstDir string, files ...IndexFile) (tmpName, dstName string, _ error) {
var ds []*indexData
for _, f := range files {
searcher, err := NewSearcher(f)
if err != nil {
return "", "", err
}
ds = append(ds, searcher.(*indexData))
}
ib, err := merge(ds...)
if err != nil {
return "", "", err
}
hasher := sha1.New()
for _, d := range ds {
for i, md := range d.repoMetaData {
if d.repoMetaData[i].Tombstone {
continue
}
hasher.Write([]byte(md.Name))
hasher.Write([]byte{0})
}
}
dstName = filepath.Join(dstDir, fmt.Sprintf("compound-%x_v%d.%05d.zoekt", hasher.Sum(nil), NextIndexFormatVersion, 0))
tmpName = dstName + ".tmp"
if err := builderWriteAll(tmpName, ib); err != nil {
return "", "", err
}
return tmpName, dstName, nil
}
func builderWriteAll(fn string, ib *IndexBuilder) error {
dir := filepath.Dir(fn)
if err := os.MkdirAll(dir, 0o700); err != nil {
return err
}
f, err := os.CreateTemp(dir, filepath.Base(fn)+".*.tmp")
if err != nil {
return err
}
if runtime.GOOS != "windows" {
// umask?
if err := f.Chmod(0o666); err != nil {
return err
}
}
defer f.Close()
if err := ib.Write(f); err != nil {
return err
}
fi, err := f.Stat()
if err != nil {
return err
}
if err := f.Close(); err != nil {
return err
}
if err := os.Rename(f.Name(), fn); err != nil {
return err
}
log.Printf("finished shard %s: %d index bytes (overhead %3.1f)", fn, fi.Size(),
float64(fi.Size())/float64(ib.ContentSize()+1))
return nil
}
func merge(ds ...*indexData) (*IndexBuilder, error) {
if len(ds) == 0 {
return nil, fmt.Errorf("need 1 or more indexData to merge")
}
sort.Slice(ds, func(i, j int) bool {
return ds[i].repoMetaData[0].priority > ds[j].repoMetaData[0].priority
})
ib := newIndexBuilder()
ib.indexFormatVersion = NextIndexFormatVersion
for _, d := range ds {
lastRepoID := -1
for docID := uint32(0); int(docID) < len(d.fileBranchMasks); docID++ {
repoID := int(d.repos[docID])
if d.repoMetaData[repoID].Tombstone {
continue
}
if repoID != lastRepoID {
if lastRepoID > repoID {
return nil, fmt.Errorf("non-contiguous repo ids in %s for document %d: old=%d current=%d", d.String(), docID, lastRepoID, repoID)
}
lastRepoID = repoID
// TODO we are losing empty repos on merging since we only get here if
// there is an associated document.
if err := ib.setRepository(&d.repoMetaData[repoID]); err != nil {
return nil, err
}
}
if err := addDocument(d, ib, repoID, docID); err != nil {
return nil, err
}
}
}
return ib, nil
}
// Explode takes an IndexFile f and creates 1 simple shard per repository
// contained in f. Explode returns a map of tmpName -> dstName. It is the
// responsibility of the caller to rename the temporary shard(s) and delete the
// input shard.
func Explode(dstDir string, f IndexFile) (map[string]string, error) {
return explode(dstDir, f)
}
type indexBuilderFunc func(ib *IndexBuilder)
// explode offers a richer signature compared to Explode for testing. You
// probably want to call Explode instead.
func explode(dstDir string, f IndexFile, ibFuncs ...indexBuilderFunc) (map[string]string, error) {
searcher, err := NewSearcher(f)
if err != nil {
return nil, err
}
d := searcher.(*indexData)
shardNames := make(map[string]string, len(d.repoMetaData))
writeShard := func(ib *IndexBuilder) error {
if len(ib.repoList) != 1 {
return fmt.Errorf("expected ib to contain exactly 1 repository")
}
for _, ibFunc := range ibFuncs {
ibFunc(ib)
}
fn := filepath.Join(dstDir, shardName(ib.repoList[0].Name, ib.indexFormatVersion, 0))
fnTmp := fn + ".tmp"
shardNames[fnTmp] = fn
return builderWriteAll(fnTmp, ib)
}
var ib *IndexBuilder
lastRepoID := -1
for docID := uint32(0); int(docID) < len(d.fileBranchMasks); docID++ {
repoID := int(d.repos[docID])
if d.repoMetaData[repoID].Tombstone {
continue
}
if repoID != lastRepoID {
if lastRepoID > repoID {
return shardNames, fmt.Errorf("non-contiguous repo ids in %s for document %d: old=%d current=%d", d.String(), docID, lastRepoID, repoID)
}
lastRepoID = repoID
if ib != nil {
if err := writeShard(ib); err != nil {
return shardNames, err
}
}
ib = newIndexBuilder()
ib.indexFormatVersion = IndexFormatVersion
if err := ib.setRepository(&d.repoMetaData[repoID]); err != nil {
return shardNames, err
}
}
err := addDocument(d, ib, repoID, docID)
if err != nil {
return shardNames, err
}
}
if ib != nil {
if err := writeShard(ib); err != nil {
return shardNames, err
}
}
return shardNames, nil
}
func addDocument(d *indexData, ib *IndexBuilder, repoID int, docID uint32) error {
doc := Document{
Name: string(d.fileName(docID)),
// Content set below since it can return an error
// Branches set below since it requires lookups
SubRepositoryPath: d.subRepoPaths[repoID][d.subRepos[docID]],
Language: d.languageMap[d.getLanguage(docID)],
// SkipReason not set, will be part of content from original indexer.
}
var err error
if doc.Content, err = d.readContents(docID); err != nil {
return err
}
if doc.Symbols, _, err = d.readDocSections(docID, nil); err != nil {
return err
}
doc.SymbolsMetaData = make([]*Symbol, len(doc.Symbols))
for i := range doc.SymbolsMetaData {
doc.SymbolsMetaData[i] = d.symbols.data(d.fileEndSymbol[docID] + uint32(i))
}
// calculate branches
{
mask := d.fileBranchMasks[docID]
id := uint32(1)
for mask != 0 {
if mask&0x1 != 0 {
doc.Branches = append(doc.Branches, d.branchNames[repoID][uint(id)])
}
id <<= 1
mask >>= 1
}
}
return ib.Add(doc)
}
// copied from builder package to avoid circular imports.
func hashString(s string) string {
h := sha1.New()
_, _ = io.WriteString(h, s)
return fmt.Sprintf("%x", h.Sum(nil))
}
// copied from builder package to avoid circular imports.
func shardName(name string, version, n int) string {
abs := url.QueryEscape(name)
if len(abs) > 200 {
abs = abs[:200] + hashString(abs)[:8]
}
return fmt.Sprintf("%s_v%d.%05d.zoekt", abs, version, n)
}