mirror of
https://github.com/lionsoul2014/ip2region.git
synced 2025-12-08 19:25:22 +00:00
270 lines
6.5 KiB
Go
270 lines
6.5 KiB
Go
// Copyright 2022 The Ip2Region Authors. All rights reserved.
|
|
// Use of this source code is governed by a Apache2.0-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
// ---
|
|
// Ip2Region database v2.0 searcher.
|
|
// @Note this is a Not thread safe implementation.
|
|
//
|
|
// @Author Lion <chenxin619315@gmail.com>
|
|
// @Date 2022/06/16
|
|
|
|
package xdb
|
|
|
|
import (
|
|
"encoding/binary"
|
|
"fmt"
|
|
"os"
|
|
)
|
|
|
|
const (
|
|
Structure20 = 2
|
|
Structure30 = 3
|
|
HeaderInfoLength = 256
|
|
VectorIndexRows = 256
|
|
VectorIndexCols = 256
|
|
VectorIndexSize = 8
|
|
)
|
|
|
|
// --- Index policy define
|
|
|
|
type IndexPolicy int
|
|
|
|
const (
|
|
VectorIndexPolicy IndexPolicy = 1
|
|
BTreeIndexPolicy IndexPolicy = 2
|
|
)
|
|
|
|
func (i IndexPolicy) String() string {
|
|
switch i {
|
|
case VectorIndexPolicy:
|
|
return "VectorIndex"
|
|
case BTreeIndexPolicy:
|
|
return "BtreeIndex"
|
|
default:
|
|
return "unknown"
|
|
}
|
|
}
|
|
|
|
// --- Header define
|
|
|
|
type Header struct {
|
|
// data []byte
|
|
Version uint16
|
|
IndexPolicy IndexPolicy
|
|
CreatedAt uint32
|
|
StartIndexPtr uint32
|
|
EndIndexPtr uint32
|
|
|
|
// since IPv6 supporting
|
|
IPVersion int
|
|
RuntimePtrBytes int
|
|
}
|
|
|
|
func NewHeader(input []byte) (*Header, error) {
|
|
if len(input) < 16 {
|
|
return nil, fmt.Errorf("invalid input buffer")
|
|
}
|
|
|
|
return &Header{
|
|
Version: binary.LittleEndian.Uint16(input[0:]),
|
|
IndexPolicy: IndexPolicy(binary.LittleEndian.Uint16(input[2:])),
|
|
CreatedAt: binary.LittleEndian.Uint32(input[4:]),
|
|
StartIndexPtr: binary.LittleEndian.Uint32(input[8:]),
|
|
EndIndexPtr: binary.LittleEndian.Uint32(input[12:]),
|
|
|
|
IPVersion: int(binary.LittleEndian.Uint16(input[16:])),
|
|
RuntimePtrBytes: int(binary.LittleEndian.Uint16(input[18:])),
|
|
}, nil
|
|
}
|
|
|
|
// --- searcher implementation
|
|
|
|
type Searcher struct {
|
|
version *Version
|
|
handle *os.File
|
|
|
|
// header info
|
|
header *Header
|
|
ioCount int
|
|
|
|
// use it only when this feature enabled.
|
|
// Preload the vector index will reduce the number of IO operations
|
|
// thus speedup the search process
|
|
vectorIndex []byte
|
|
|
|
// content buffer.
|
|
// running with the whole xdb file cached
|
|
contentBuff []byte
|
|
}
|
|
|
|
func baseNew(version *Version, dbFile string, vIndex []byte, cBuff []byte) (*Searcher, error) {
|
|
var err error
|
|
|
|
// content buff first
|
|
if cBuff != nil {
|
|
return &Searcher{
|
|
version: version,
|
|
vectorIndex: nil,
|
|
contentBuff: cBuff,
|
|
}, nil
|
|
}
|
|
|
|
// open the xdb binary file
|
|
handle, err := os.OpenFile(dbFile, os.O_RDONLY, 0600)
|
|
if err != nil {
|
|
return nil, err
|
|
}
|
|
|
|
return &Searcher{
|
|
version: version,
|
|
handle: handle,
|
|
vectorIndex: vIndex,
|
|
}, nil
|
|
}
|
|
|
|
func NewWithFileOnly(version *Version, dbFile string) (*Searcher, error) {
|
|
return baseNew(version, dbFile, nil, nil)
|
|
}
|
|
|
|
func NewWithVectorIndex(version *Version, dbFile string, vIndex []byte) (*Searcher, error) {
|
|
return baseNew(version, dbFile, vIndex, nil)
|
|
}
|
|
|
|
func NewWithBuffer(version *Version, cBuff []byte) (*Searcher, error) {
|
|
return baseNew(version, "", nil, cBuff)
|
|
}
|
|
|
|
func (s *Searcher) Close() {
|
|
if s.handle != nil {
|
|
err := s.handle.Close()
|
|
if err != nil {
|
|
return
|
|
}
|
|
}
|
|
}
|
|
|
|
// IPVersion return the ip version
|
|
func (s *Searcher) IPVersion() *Version {
|
|
return s.version
|
|
}
|
|
|
|
// GetIOCount return the global io count for the last search
|
|
func (s *Searcher) GetIOCount() int {
|
|
return s.ioCount
|
|
}
|
|
|
|
// SearchByStr find the region for the specified ip string
|
|
func (s *Searcher) SearchByStr(str string) (string, error) {
|
|
ip, err := ParseIP(str)
|
|
if err != nil {
|
|
return "", err
|
|
}
|
|
|
|
return s.Search(ip)
|
|
}
|
|
|
|
// Search find the region for the specified long ip
|
|
func (s *Searcher) Search(ip []byte) (string, error) {
|
|
// ip version check
|
|
if len(ip) != s.version.Bytes {
|
|
return "", fmt.Errorf("invalid ip address(%s expected)", s.version.Name)
|
|
}
|
|
|
|
// reset the global ioCount
|
|
s.ioCount = 0
|
|
|
|
// locate the segment index block based on the vector index
|
|
var il0, il1 = int(ip[0]), int(ip[1])
|
|
var idx = il0*VectorIndexCols*VectorIndexSize + il1*VectorIndexSize
|
|
var sPtr, ePtr = uint32(0), uint32(0)
|
|
if s.vectorIndex != nil {
|
|
sPtr = binary.LittleEndian.Uint32(s.vectorIndex[idx:])
|
|
ePtr = binary.LittleEndian.Uint32(s.vectorIndex[idx+4:])
|
|
} else if s.contentBuff != nil {
|
|
sPtr = binary.LittleEndian.Uint32(s.contentBuff[HeaderInfoLength+idx:])
|
|
ePtr = binary.LittleEndian.Uint32(s.contentBuff[HeaderInfoLength+idx+4:])
|
|
} else {
|
|
// read the vector index block
|
|
var buff = make([]byte, VectorIndexSize)
|
|
err := s.read(int64(HeaderInfoLength+idx), buff)
|
|
if err != nil {
|
|
return "", fmt.Errorf("read vector index block at %d: %w", HeaderInfoLength+idx, err)
|
|
}
|
|
|
|
sPtr = binary.LittleEndian.Uint32(buff)
|
|
ePtr = binary.LittleEndian.Uint32(buff[4:])
|
|
}
|
|
|
|
// fmt.Printf("sPtr=%d, ePtr=%d\n", sPtr, ePtr)
|
|
|
|
// binary search the segment index to get the region
|
|
var bytes, dBytes = len(ip), len(ip) << 1
|
|
var segIndexSize = uint32(s.version.SegmentIndexSize)
|
|
var dataLen, dataPtr = 0, uint32(0)
|
|
var buff = make([]byte, segIndexSize)
|
|
var l, h = 0, int((ePtr - sPtr) / segIndexSize)
|
|
for l <= h {
|
|
m := (l + h) >> 1
|
|
p := sPtr + uint32(m)*segIndexSize
|
|
err := s.read(int64(p), buff)
|
|
if err != nil {
|
|
return "", fmt.Errorf("read segment index at %d: %w", p, err)
|
|
}
|
|
|
|
// decode the data step by step to reduce the unnecessary operations
|
|
if s.version.IPCompare(ip, buff[0:bytes]) < 0 {
|
|
h = m - 1
|
|
} else if s.version.IPCompare(ip, buff[bytes:dBytes]) > 0 {
|
|
l = m + 1
|
|
} else {
|
|
dataLen = int(binary.LittleEndian.Uint16(buff[dBytes:]))
|
|
dataPtr = binary.LittleEndian.Uint32(buff[dBytes+2:])
|
|
break
|
|
}
|
|
}
|
|
|
|
// fmt.Printf("dataLen: %d, dataPtr: %d\n", dataLen, dataPtr)
|
|
if dataLen == 0 {
|
|
return "", nil
|
|
}
|
|
|
|
// load and return the region data
|
|
var regionBuff = make([]byte, dataLen)
|
|
err := s.read(int64(dataPtr), regionBuff)
|
|
if err != nil {
|
|
return "", fmt.Errorf("read region at %d: %w", dataPtr, err)
|
|
}
|
|
|
|
return string(regionBuff), nil
|
|
}
|
|
|
|
// do the data read operation based on the setting.
|
|
// content buffer first or will read from the file.
|
|
// this operation will invoke the Seek for file based read.
|
|
func (s *Searcher) read(offset int64, buff []byte) error {
|
|
if s.contentBuff != nil {
|
|
cLen := copy(buff, s.contentBuff[offset:])
|
|
if cLen != len(buff) {
|
|
return fmt.Errorf("incomplete read: readed bytes should be %d", len(buff))
|
|
}
|
|
} else {
|
|
_, err := s.handle.Seek(offset, 0)
|
|
if err != nil {
|
|
return fmt.Errorf("seek to %d: %w", offset, err)
|
|
}
|
|
|
|
s.ioCount++
|
|
rLen, err := s.handle.Read(buff)
|
|
if err != nil {
|
|
return fmt.Errorf("handle read: %w", err)
|
|
}
|
|
|
|
if rLen != len(buff) {
|
|
return fmt.Errorf("incomplete read: readed bytes should be %d", len(buff))
|
|
}
|
|
}
|
|
|
|
return nil
|
|
}
|