2022-10-05 14:24:04 +01:00
// Copyright (C) 2022 Storj Labs, Inc.
// See LICENSE for copying information.
package satellitedb_test
import (
"context"
2023-01-25 22:34:40 +00:00
"sort"
2022-10-05 14:24:04 +01:00
"testing"
"time"
"github.com/stretchr/testify/require"
2023-01-25 22:34:40 +00:00
"storj.io/common/storj"
2022-10-05 14:24:04 +01:00
"storj.io/common/sync2"
"storj.io/common/testcontext"
"storj.io/common/testrand"
"storj.io/storj/satellite"
"storj.io/storj/satellite/audit"
"storj.io/storj/satellite/metabase"
"storj.io/storj/satellite/satellitedb/satellitedbtest"
)
2022-11-21 23:53:00 +00:00
func randomLocator ( ) * audit . PieceLocator {
return & audit . PieceLocator {
StreamID : testrand . UUID ( ) ,
Position : metabase . SegmentPosition {
Part : uint32 ( testrand . Intn ( 1 << 10 ) ) ,
Index : uint32 ( testrand . Intn ( 1 << 20 ) ) ,
} ,
NodeID : testrand . NodeID ( ) ,
PieceNum : testrand . Intn ( 1 << 10 ) ,
}
}
2022-11-22 00:35:13 +00:00
const (
retryInterval = 30 * time . Minute
)
2022-10-05 14:24:04 +01:00
func TestReverifyQueue ( t * testing . T ) {
satellitedbtest . Run ( t , func ( ctx * testcontext . Context , t * testing . T , db satellite . DB ) {
reverifyQueue := db . ReverifyQueue ( )
2023-02-09 23:03:20 +00:00
reverifyQueueTest := reverifyQueue . ( interface {
TestingFudgeUpdateTime ( ctx context . Context , piece * audit . PieceLocator , updateTime time . Time ) error
} )
2022-10-05 14:24:04 +01:00
2022-11-21 23:53:00 +00:00
locator1 := randomLocator ( )
locator2 := randomLocator ( )
2022-10-05 14:24:04 +01:00
err := reverifyQueue . Insert ( ctx , locator1 )
require . NoError ( t , err )
// Postgres/Cockroach have only microsecond time resolution, so make
// sure at least 1us has elapsed before inserting the second.
sync2 . Sleep ( ctx , time . Microsecond )
err = reverifyQueue . Insert ( ctx , locator2 )
require . NoError ( t , err )
2023-01-25 22:34:40 +00:00
checkGetAllContainedNodes ( ctx , t , reverifyQueue , locator1 . NodeID , locator2 . NodeID )
2023-02-09 23:03:20 +00:00
// pretend that retryInterval has elapsed for both jobs
err = reverifyQueueTest . TestingFudgeUpdateTime ( ctx , locator1 , time . Now ( ) . Add ( - retryInterval ) )
require . NoError ( t , err )
err = reverifyQueueTest . TestingFudgeUpdateTime ( ctx , locator2 , time . Now ( ) . Add ( - retryInterval ) )
require . NoError ( t , err )
// fetch both jobs from the queue and expect the right contents
2022-11-22 00:35:13 +00:00
job1 , err := reverifyQueue . GetNextJob ( ctx , retryInterval )
2022-10-05 14:24:04 +01:00
require . NoError ( t , err )
2022-11-21 23:53:00 +00:00
require . Equal ( t , * locator1 , job1 . Locator )
2022-11-22 00:35:13 +00:00
require . EqualValues ( t , 1 , job1 . ReverifyCount )
2022-10-05 14:24:04 +01:00
2022-11-22 00:35:13 +00:00
job2 , err := reverifyQueue . GetNextJob ( ctx , retryInterval )
2022-10-05 14:24:04 +01:00
require . NoError ( t , err )
2022-11-21 23:53:00 +00:00
require . Equal ( t , * locator2 , job2 . Locator )
2022-11-22 00:35:13 +00:00
require . EqualValues ( t , 1 , job2 . ReverifyCount )
2022-10-05 14:24:04 +01:00
2023-01-25 22:34:40 +00:00
checkGetAllContainedNodes ( ctx , t , reverifyQueue , locator1 . NodeID , locator2 . NodeID )
2022-10-05 14:24:04 +01:00
require . Truef ( t , job1 . InsertedAt . Before ( job2 . InsertedAt ) , "job1 [%s] should have an earlier insertion time than job2 [%s]" , job1 . InsertedAt , job2 . InsertedAt )
2022-11-22 00:35:13 +00:00
_ , err = reverifyQueue . GetNextJob ( ctx , retryInterval )
require . Truef ( t , audit . ErrEmptyQueue . Has ( err ) , "expected empty queue error, but got error %+v" , err )
2022-10-05 14:24:04 +01:00
// pretend that ReverifyRetryInterval has elapsed
2022-11-22 00:35:13 +00:00
err = reverifyQueueTest . TestingFudgeUpdateTime ( ctx , locator1 , time . Now ( ) . Add ( - retryInterval ) )
2022-10-05 14:24:04 +01:00
require . NoError ( t , err )
// job 1 should be eligible for a new worker to take over now (whatever
// worker acquired job 1 before is presumed to have died or timed out).
2022-11-22 00:35:13 +00:00
job3 , err := reverifyQueue . GetNextJob ( ctx , retryInterval )
2022-10-05 14:24:04 +01:00
require . NoError ( t , err )
2022-11-21 23:53:00 +00:00
require . Equal ( t , * locator1 , job3 . Locator )
2022-11-22 00:35:13 +00:00
require . EqualValues ( t , 2 , job3 . ReverifyCount )
2022-10-05 14:24:04 +01:00
2023-01-25 22:34:40 +00:00
checkGetAllContainedNodes ( ctx , t , reverifyQueue , locator1 . NodeID , locator2 . NodeID )
2022-10-05 14:24:04 +01:00
wasDeleted , err := reverifyQueue . Remove ( ctx , locator1 )
require . NoError ( t , err )
require . True ( t , wasDeleted )
2023-01-25 22:34:40 +00:00
checkGetAllContainedNodes ( ctx , t , reverifyQueue , locator2 . NodeID )
2022-10-05 14:24:04 +01:00
wasDeleted , err = reverifyQueue . Remove ( ctx , locator2 )
require . NoError ( t , err )
require . True ( t , wasDeleted )
2023-01-25 22:34:40 +00:00
checkGetAllContainedNodes ( ctx , t , reverifyQueue )
2022-10-05 14:24:04 +01:00
wasDeleted , err = reverifyQueue . Remove ( ctx , locator1 )
require . NoError ( t , err )
require . False ( t , wasDeleted )
2023-01-25 22:34:40 +00:00
checkGetAllContainedNodes ( ctx , t , reverifyQueue )
2022-10-05 14:24:04 +01:00
2022-11-22 00:35:13 +00:00
_ , err = reverifyQueue . GetNextJob ( ctx , retryInterval )
require . Truef ( t , audit . ErrEmptyQueue . Has ( err ) , "expected empty queue error, but got error %+v" , err )
2022-10-05 14:24:04 +01:00
} )
}
2022-11-21 23:53:00 +00:00
func TestReverifyQueueGetByNodeID ( t * testing . T ) {
satellitedbtest . Run ( t , func ( ctx * testcontext . Context , t * testing . T , db satellite . DB ) {
reverifyQueue := db . ReverifyQueue ( )
locator1 := randomLocator ( )
locator2 := randomLocator ( )
locator3 := randomLocator ( )
// two jobs on the same node
locator3 . NodeID = locator1 . NodeID
err := reverifyQueue . Insert ( ctx , locator1 )
require . NoError ( t , err )
// Postgres/Cockroach have only microsecond time resolution, so make
// sure at least 1us has elapsed between inserts.
sync2 . Sleep ( ctx , time . Microsecond )
err = reverifyQueue . Insert ( ctx , locator2 )
require . NoError ( t , err )
sync2 . Sleep ( ctx , time . Microsecond )
err = reverifyQueue . Insert ( ctx , locator3 )
require . NoError ( t , err )
job1 , err := reverifyQueue . GetByNodeID ( ctx , locator1 . NodeID )
require . NoError ( t , err )
// we got either locator1 or locator3
if job1 . Locator . StreamID == locator1 . StreamID {
require . Equal ( t , locator1 . NodeID , job1 . Locator . NodeID )
require . Equal ( t , locator1 . PieceNum , job1 . Locator . PieceNum )
require . Equal ( t , locator1 . Position , job1 . Locator . Position )
} else {
require . Equal ( t , locator3 . StreamID , job1 . Locator . StreamID )
require . Equal ( t , locator3 . NodeID , job1 . Locator . NodeID )
require . Equal ( t , locator3 . PieceNum , job1 . Locator . PieceNum )
require . Equal ( t , locator3 . Position , job1 . Locator . Position )
}
job2 , err := reverifyQueue . GetByNodeID ( ctx , locator2 . NodeID )
require . NoError ( t , err )
require . Equal ( t , locator2 . StreamID , job2 . Locator . StreamID )
require . Equal ( t , locator2 . NodeID , job2 . Locator . NodeID )
require . Equal ( t , locator2 . PieceNum , job2 . Locator . PieceNum )
require . Equal ( t , locator2 . Position , job2 . Locator . Position )
// ask for a nonexistent node ID
job3 , err := reverifyQueue . GetByNodeID ( ctx , testrand . NodeID ( ) )
require . Error ( t , err )
require . Truef ( t , audit . ErrContainedNotFound . Has ( err ) , "expected ErrContainedNotFound error but got %+v" , err )
require . Nil ( t , job3 )
} )
}
2023-01-25 22:34:40 +00:00
// checkGetAllContainedNodes checks that the GetAllContainedNodes method works as expected
// in a particular situation.
func checkGetAllContainedNodes ( ctx context . Context , t testing . TB , reverifyQueue audit . ReverifyQueue , expectedIDs ... storj . NodeID ) {
containedNodes , err := reverifyQueue . GetAllContainedNodes ( ctx )
require . NoError ( t , err )
sort . Slice ( containedNodes , func ( i , j int ) bool {
return containedNodes [ i ] . Compare ( containedNodes [ j ] ) < 0
} )
sort . Slice ( expectedIDs , func ( i , j int ) bool {
return expectedIDs [ i ] . Compare ( expectedIDs [ j ] ) < 0
} )
require . Equal ( t , expectedIDs , containedNodes )
}