Spaces:
Running
Running
File size: 2,280 Bytes
b110593 |
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 |
// _ _
// __ _____ __ ___ ___ __ _| |_ ___
// \ \ /\ / / _ \/ _` \ \ / / |/ _` | __/ _ \
// \ V V / __/ (_| |\ V /| | (_| | || __/
// \_/\_/ \___|\__,_| \_/ |_|\__,_|\__\___|
//
// Copyright © 2016 - 2024 Weaviate B.V. All rights reserved.
//
// CONTACT: [email protected]
//
package hnsw
import (
"io"
"os"
"github.com/davecgh/go-spew/spew"
"github.com/pkg/errors"
)
type MmapCondensor struct {
connectionsPerLevel int
}
func NewMmapCondensor(connectionsPerLevel int) *MmapCondensor {
return &MmapCondensor{connectionsPerLevel: connectionsPerLevel}
}
func (c *MmapCondensor) Do(fileName string) error {
fd, err := os.Open(fileName)
if err != nil {
return errors.Wrap(err, "open commit log to be condensed")
}
defer fd.Close()
index, err := c.analyze(fd)
if err != nil {
return errors.Wrap(err, "analyze commit log and build index")
}
index.calculateOffsets()
// "rewind" file so we can read it again, this time into the mmap file
if _, err := fd.Seek(0, io.SeekStart); err != nil {
return errors.Wrap(err, "rewind uncondensed")
}
if err := c.read(fd, index, fileName+".scratch.tmp"); err != nil {
return errors.Wrap(err, "read uncondensed into mmap file")
}
spew.Dump(index)
spew.Dump(index.Size())
return nil
}
func (c *MmapCondensor) analyze(file *os.File) (mmapIndex, error) {
return newMmapCondensorAnalyzer(c.connectionsPerLevel).Do(file)
}
func (c *MmapCondensor) read(source *os.File, index mmapIndex,
targetName string,
) error {
return newMmapCondensorReader().Do(source, index, targetName)
}
func (mi *mmapIndex) calculateOffsets() {
for i := range mi.nodes {
if i == 0 {
// offset for the first element is 0, nothing to do
continue
}
// we now have the guarantee that elem i-1 exists
mi.nodes[i].offset = mi.nodes[i-1].offset + uint64(mi.nodes[i-1].Size(mi.connectionsPerLevel))
}
}
// Size can only return a useful result if offsets have been calculated prior
// to calling Size()
func (mi *mmapIndex) Size() int {
if len(mi.nodes) == 0 {
return -1
}
return int(mi.nodes[len(mi.nodes)-1].offset) +
mi.nodes[len(mi.nodes)-1].Size(mi.connectionsPerLevel)
}
|