mirror of
https://github.com/luxfi/node.git
synced 2026-10-30 15:24:05 +00:00
zeekay
7cf87b230b
The module already called itself github.com/luxfi/node while containing no node in Go: cmd/luxd was twenty-one lines that printed the size of a few types, and the Go column of the matrix measured a VM plugin. A repo that fetches the thing it claims to be has not replaced it, so the Go sources move in — 1515 files, the daemon and everything under it — and the build reaches outside this module for nothing. Rust and C++ sit beside it unchanged and are still measured against it by the differential. That is the point of one repo: the reference implementation and the two ports are the same checkout, so parity is a thing you can run rather than a thing you assert. Verified: builds, and the closure carries no lux-private — checked at build time rather than believed. The daemon starts twelve chains on a local network (P X C Q Z A B G K M F, plus D through its plugin) and reports healthy.
113 lines
2.6 KiB
Go
113 lines
2.6 KiB
Go
// Copyright (C) 2019-2025, Lux Industries Inc. All rights reserved.
|
|
// See the file LICENSE for licensing terms.
|
|
|
|
package archivedb
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"github.com/stretchr/testify/require"
|
|
|
|
"github.com/luxfi/database"
|
|
"github.com/luxfi/database/memdb"
|
|
)
|
|
|
|
type limitIterationDB struct {
|
|
database.Database
|
|
}
|
|
|
|
func (db *limitIterationDB) NewIterator() database.Iterator {
|
|
return db.NewIteratorWithStartAndPrefix(nil, nil)
|
|
}
|
|
|
|
func (db *limitIterationDB) NewIteratorWithStart(start []byte) database.Iterator {
|
|
return db.NewIteratorWithStartAndPrefix(start, nil)
|
|
}
|
|
|
|
func (db *limitIterationDB) NewIteratorWithPrefix(prefix []byte) database.Iterator {
|
|
return db.NewIteratorWithStartAndPrefix(nil, prefix)
|
|
}
|
|
|
|
func (db *limitIterationDB) NewIteratorWithStartAndPrefix(start, prefix []byte) database.Iterator {
|
|
return &limitIterationIterator{
|
|
Iterator: db.Database.NewIteratorWithStartAndPrefix(start, prefix),
|
|
}
|
|
}
|
|
|
|
type limitIterationIterator struct {
|
|
database.Iterator
|
|
exhausted bool
|
|
}
|
|
|
|
func (it *limitIterationIterator) Next() bool {
|
|
if it.exhausted {
|
|
return false
|
|
}
|
|
it.exhausted = true
|
|
return it.Iterator.Next()
|
|
}
|
|
|
|
func TestDBEfficientLookups(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
var (
|
|
key = []byte("key")
|
|
maliciousKey, _ = newDBKeyFromUser(key, 2)
|
|
)
|
|
|
|
db := New(&limitIterationDB{Database: memdb.New()})
|
|
|
|
batch := db.NewBatch(1)
|
|
require.NoError(batch.Put(key, []byte("value")))
|
|
require.NoError(batch.Write())
|
|
|
|
for i := 0; i < 10000; i++ {
|
|
batch = db.NewBatch(uint64(i) + 2)
|
|
require.NoError(batch.Put(maliciousKey, []byte{byte(i)}))
|
|
require.NoError(batch.Write())
|
|
}
|
|
|
|
reader := db.Open(10001)
|
|
value, err := reader.Get(key)
|
|
require.NoError(err)
|
|
require.Equal([]byte("value"), value)
|
|
|
|
value, height, found, err := reader.GetEntry(key)
|
|
require.NoError(err)
|
|
require.True(found)
|
|
require.Equal(uint64(1), height)
|
|
require.Equal([]byte("value"), value)
|
|
}
|
|
|
|
func TestDBMoreEfficientLookups(t *testing.T) {
|
|
require := require.New(t)
|
|
|
|
var (
|
|
key = []byte("key")
|
|
maliciousKey = []byte("key\xff\xff\xff\xff\xff\xff\xff\xfd")
|
|
)
|
|
|
|
db := New(&limitIterationDB{Database: memdb.New()})
|
|
|
|
batch := db.NewBatch(1)
|
|
require.NoError(batch.Put(key, []byte("value")))
|
|
require.NoError(batch.Write())
|
|
|
|
for i := 2; i < 10000; i++ {
|
|
batch = db.NewBatch(uint64(i))
|
|
require.NoError(batch.Put(maliciousKey, []byte{byte(i)}))
|
|
require.NoError(batch.Write())
|
|
}
|
|
|
|
reader := db.Open(10001)
|
|
value, err := reader.Get(key)
|
|
require.NoError(err)
|
|
require.Equal([]byte("value"), value)
|
|
|
|
value, height, found, err := reader.GetEntry(key)
|
|
require.NoError(err)
|
|
require.True(found)
|
|
require.Equal(uint64(1), height)
|
|
require.Equal([]byte("value"), value)
|
|
}
|