261 lines
6.3 KiB
Go
261 lines
6.3 KiB
Go
package cache
|
|
|
|
import (
|
|
"code.google.com/p/goprotobuf/proto"
|
|
"container/list"
|
|
"goposm/binary"
|
|
"goposm/element"
|
|
"sort"
|
|
"sync"
|
|
)
|
|
|
|
type Nodes []element.Node
|
|
|
|
func (s Nodes) Len() int { return len(s) }
|
|
func (s Nodes) Swap(i, j int) { s[i], s[j] = s[j], s[i] }
|
|
func (s Nodes) Less(i, j int) bool { return s[i].Id < s[j].Id }
|
|
|
|
func packNodes(nodes []element.Node) *DeltaCoords {
|
|
var lastLon, lastLat int64
|
|
var lon, lat int64
|
|
var lastId int64
|
|
ids := make([]int64, len(nodes))
|
|
lons := make([]int64, len(nodes))
|
|
lats := make([]int64, len(nodes))
|
|
|
|
i := 0
|
|
for _, nd := range nodes {
|
|
lon = int64(binary.CoordToInt(nd.Long))
|
|
lat = int64(binary.CoordToInt(nd.Lat))
|
|
ids[i] = nd.Id - lastId
|
|
lons[i] = lon - lastLon
|
|
lats[i] = lat - lastLat
|
|
|
|
lastId = nd.Id
|
|
lastLon = lon
|
|
lastLat = lat
|
|
i++
|
|
}
|
|
return &DeltaCoords{Ids: ids, Lats: lats, Lons: lons}
|
|
}
|
|
|
|
func unpackNodes(deltaCoords *DeltaCoords, nodes []element.Node) []element.Node {
|
|
if len(deltaCoords.Ids) > cap(nodes) {
|
|
nodes = make([]element.Node, len(deltaCoords.Ids))
|
|
} else {
|
|
nodes = nodes[:len(deltaCoords.Ids)]
|
|
}
|
|
|
|
var lastLon, lastLat int64
|
|
var lon, lat int64
|
|
var lastId, id int64
|
|
|
|
for i := 0; i < len(deltaCoords.Ids); i++ {
|
|
id = lastId + deltaCoords.Ids[i]
|
|
lon = lastLon + deltaCoords.Lons[i]
|
|
lat = lastLat + deltaCoords.Lats[i]
|
|
nodes[i] = element.Node{
|
|
OSMElem: element.OSMElem{Id: int64(id)},
|
|
Long: binary.IntToCoord(uint32(lon)),
|
|
Lat: binary.IntToCoord(uint32(lat)),
|
|
}
|
|
|
|
lastId = id
|
|
lastLon = lon
|
|
lastLat = lat
|
|
}
|
|
return nodes
|
|
}
|
|
|
|
type CoordsBunch struct {
|
|
sync.Mutex
|
|
id int64
|
|
coords []element.Node
|
|
elem *list.Element
|
|
needsWrite bool
|
|
}
|
|
|
|
type DeltaCoordsCache struct {
|
|
Cache
|
|
lruList *list.List
|
|
table map[int64]*CoordsBunch
|
|
freeNodes [][]element.Node
|
|
capacity int64
|
|
linearImport bool
|
|
mu sync.Mutex
|
|
}
|
|
|
|
// bunchSize defines how many coordinates should be stored in a
|
|
// single record. This is the maximum and a bunch will typically contain
|
|
// less coordinates (e.g. when nodes are removes).
|
|
//
|
|
// A higher number improves -read mode (writing the cache) but also
|
|
// increases the overhead during -write mode (reading coords).
|
|
const bunchSize = 128
|
|
|
|
func NewDeltaCoordsCache(path string) (*DeltaCoordsCache, error) {
|
|
coordsCache := DeltaCoordsCache{}
|
|
err := coordsCache.open(path)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
coordsCache.lruList = list.New()
|
|
coordsCache.table = make(map[int64]*CoordsBunch)
|
|
coordsCache.capacity = 1024 * 8
|
|
coordsCache.freeNodes = make([][]element.Node, 0)
|
|
return &coordsCache, nil
|
|
}
|
|
|
|
func (self *DeltaCoordsCache) SetLinearImport(v bool) {
|
|
self.linearImport = v
|
|
}
|
|
|
|
func (self *DeltaCoordsCache) Close() {
|
|
for bunchId, bunch := range self.table {
|
|
if bunch.needsWrite {
|
|
self.putCoordsPacked(bunchId, bunch.coords)
|
|
}
|
|
}
|
|
self.Cache.Close()
|
|
}
|
|
|
|
func (self *DeltaCoordsCache) GetCoord(id int64) (element.Node, bool) {
|
|
bunchId := getBunchId(id)
|
|
bunch := self.getBunch(bunchId)
|
|
defer bunch.Unlock()
|
|
idx := sort.Search(len(bunch.coords), func(i int) bool {
|
|
return bunch.coords[i].Id >= id
|
|
})
|
|
if idx < len(bunch.coords) && bunch.coords[idx].Id == id {
|
|
return bunch.coords[idx], true
|
|
}
|
|
return element.Node{}, false
|
|
}
|
|
|
|
func (self *DeltaCoordsCache) FillWay(way *element.Way) bool {
|
|
if way == nil {
|
|
return false
|
|
}
|
|
way.Nodes = make([]element.Node, len(way.Refs))
|
|
var ok bool
|
|
for i, id := range way.Refs {
|
|
way.Nodes[i], ok = self.GetCoord(id)
|
|
if !ok {
|
|
return false
|
|
}
|
|
}
|
|
return true
|
|
}
|
|
|
|
// PutCoords puts nodes into cache.
|
|
// nodes need to be sorted by Id.
|
|
func (self *DeltaCoordsCache) PutCoords(nodes []element.Node) {
|
|
var start, currentBunchId int64
|
|
currentBunchId = getBunchId(nodes[0].Id)
|
|
start = 0
|
|
totalNodes := len(nodes)
|
|
for i, node := range nodes {
|
|
bunchId := getBunchId(node.Id)
|
|
if bunchId != currentBunchId {
|
|
if self.linearImport && i > bunchSize && i < totalNodes-bunchSize {
|
|
// no need to handle concurrent updates to the same
|
|
// bunch if we are not at the boundary of a bunchSize
|
|
self.putCoordsPacked(currentBunchId, nodes[start:i])
|
|
} else {
|
|
bunch := self.getBunch(currentBunchId)
|
|
bunch.coords = append(bunch.coords, nodes[start:i]...)
|
|
sort.Sort(Nodes(bunch.coords))
|
|
bunch.needsWrite = true
|
|
bunch.Unlock()
|
|
}
|
|
currentBunchId = bunchId
|
|
start = int64(i)
|
|
}
|
|
}
|
|
bunch := self.getBunch(currentBunchId)
|
|
bunch.coords = append(bunch.coords, nodes[start:]...)
|
|
sort.Sort(Nodes(bunch.coords))
|
|
bunch.needsWrite = true
|
|
bunch.Unlock()
|
|
}
|
|
|
|
func (p *DeltaCoordsCache) putCoordsPacked(bunchId int64, nodes []element.Node) {
|
|
if len(nodes) == 0 {
|
|
return
|
|
}
|
|
keyBuf := idToKeyBuf(bunchId)
|
|
|
|
deltaCoords := packNodes(nodes)
|
|
data, err := proto.Marshal(deltaCoords)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
err = p.db.Put(p.wo, keyBuf, data)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
}
|
|
|
|
func (p *DeltaCoordsCache) getCoordsPacked(bunchId int64, nodes []element.Node) []element.Node {
|
|
keyBuf := idToKeyBuf(bunchId)
|
|
|
|
data, err := p.db.Get(p.ro, keyBuf)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
if data == nil {
|
|
// clear before returning
|
|
return nodes[:0]
|
|
}
|
|
deltaCoords := &DeltaCoords{}
|
|
err = proto.Unmarshal(data, deltaCoords)
|
|
if err != nil {
|
|
panic(err)
|
|
}
|
|
|
|
nodes = unpackNodes(deltaCoords, nodes)
|
|
return nodes
|
|
}
|
|
|
|
func getBunchId(nodeId int64) int64 {
|
|
return nodeId / deltaCachBunchSize
|
|
}
|
|
|
|
func (self *DeltaCoordsCache) getBunch(bunchId int64) *CoordsBunch {
|
|
self.mu.Lock()
|
|
defer self.mu.Unlock()
|
|
bunch, ok := self.table[bunchId]
|
|
var nodes []element.Node
|
|
if !ok {
|
|
elem := self.lruList.PushFront(bunchId)
|
|
if len(self.freeNodes) > 0 {
|
|
nodes = self.freeNodes[len(self.freeNodes)-1]
|
|
self.freeNodes = self.freeNodes[:len(self.freeNodes)-1]
|
|
} else {
|
|
nodes = make([]element.Node, 0)
|
|
}
|
|
nodes = self.getCoordsPacked(bunchId, nodes)
|
|
bunch = &CoordsBunch{id: bunchId, coords: nodes, elem: elem}
|
|
self.table[bunchId] = bunch
|
|
} else {
|
|
self.lruList.MoveToFront(bunch.elem)
|
|
}
|
|
bunch.Lock()
|
|
self.CheckCapacity()
|
|
return bunch
|
|
}
|
|
|
|
func (self *DeltaCoordsCache) CheckCapacity() {
|
|
for int64(len(self.table)) > self.capacity {
|
|
elem := self.lruList.Back()
|
|
bunchId := self.lruList.Remove(elem).(int64)
|
|
bunch := self.table[bunchId]
|
|
bunch.elem = nil
|
|
if bunch.needsWrite {
|
|
self.putCoordsPacked(bunchId, bunch.coords)
|
|
}
|
|
self.freeNodes = append(self.freeNodes, bunch.coords)
|
|
delete(self.table, bunchId)
|
|
}
|
|
}
|