mirror of
				https://github.com/juanfont/headscale.git
				synced 2025-10-28 10:51:44 +01:00 
			
		
		
		
	
		
			
				
	
	
		
			392 lines
		
	
	
		
			12 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
			
		
		
	
	
			392 lines
		
	
	
		
			12 KiB
		
	
	
	
		
			Go
		
	
	
	
	
	
| package db
 | |
| 
 | |
| import (
 | |
| 	"math/rand"
 | |
| 	"runtime"
 | |
| 	"sync"
 | |
| 	"testing"
 | |
| 	"time"
 | |
| 
 | |
| 	"github.com/juanfont/headscale/hscontrol/types"
 | |
| 	"github.com/stretchr/testify/assert"
 | |
| )
 | |
| 
 | |
| const (
 | |
| 	fiveHundred = 500 * time.Millisecond
 | |
| 	oneHundred  = 100 * time.Millisecond
 | |
| 	fifty       = 50 * time.Millisecond
 | |
| )
 | |
| 
 | |
| // TestEphemeralGarbageCollectorGoRoutineLeak is a test for a goroutine leak in EphemeralGarbageCollector().
 | |
| // It creates a new EphemeralGarbageCollector, schedules several nodes for deletion with a short expiry,
 | |
| // and verifies that the nodes are deleted when the expiry time passes, and then
 | |
| // for any leaked goroutines after the garbage collector is closed.
 | |
| func TestEphemeralGarbageCollectorGoRoutineLeak(t *testing.T) {
 | |
| 	// Count goroutines at the start
 | |
| 	initialGoroutines := runtime.NumGoroutine()
 | |
| 	t.Logf("Initial number of goroutines: %d", initialGoroutines)
 | |
| 
 | |
| 	// Basic deletion tracking mechanism
 | |
| 	var deletedIDs []types.NodeID
 | |
| 	var deleteMutex sync.Mutex
 | |
| 	var deletionWg sync.WaitGroup
 | |
| 
 | |
| 	deleteFunc := func(nodeID types.NodeID) {
 | |
| 		deleteMutex.Lock()
 | |
| 		deletedIDs = append(deletedIDs, nodeID)
 | |
| 		deleteMutex.Unlock()
 | |
| 		deletionWg.Done()
 | |
| 	}
 | |
| 
 | |
| 	// Start the GC
 | |
| 	gc := NewEphemeralGarbageCollector(deleteFunc)
 | |
| 	go gc.Start()
 | |
| 
 | |
| 	// Schedule several nodes for deletion with short expiry
 | |
| 	const expiry = fifty
 | |
| 	const numNodes = 100
 | |
| 
 | |
| 	// Set up wait group for expected deletions
 | |
| 	deletionWg.Add(numNodes)
 | |
| 
 | |
| 	for i := 1; i <= numNodes; i++ {
 | |
| 		gc.Schedule(types.NodeID(i), expiry)
 | |
| 	}
 | |
| 
 | |
| 	// Wait for all scheduled deletions to complete
 | |
| 	deletionWg.Wait()
 | |
| 
 | |
| 	// Check nodes are deleted
 | |
| 	deleteMutex.Lock()
 | |
| 	assert.Len(t, deletedIDs, numNodes, "Not all nodes were deleted")
 | |
| 	deleteMutex.Unlock()
 | |
| 
 | |
| 	// Schedule and immediately cancel to test that part of the code
 | |
| 	for i := numNodes + 1; i <= numNodes*2; i++ {
 | |
| 		nodeID := types.NodeID(i)
 | |
| 		gc.Schedule(nodeID, time.Hour)
 | |
| 		gc.Cancel(nodeID)
 | |
| 	}
 | |
| 
 | |
| 	// Create a channel to signal when we're done with cleanup checks
 | |
| 	cleanupDone := make(chan struct{})
 | |
| 
 | |
| 	// Close GC and check for leaks in a separate goroutine
 | |
| 	go func() {
 | |
| 		// Close GC
 | |
| 		gc.Close()
 | |
| 
 | |
| 		// Give any potential leaked goroutines a chance to exit
 | |
| 		// Still need a small sleep here as we're checking for absence of goroutines
 | |
| 		time.Sleep(oneHundred)
 | |
| 
 | |
| 		// Check for leaked goroutines
 | |
| 		finalGoroutines := runtime.NumGoroutine()
 | |
| 		t.Logf("Final number of goroutines: %d", finalGoroutines)
 | |
| 
 | |
| 		// NB: We have to allow for a small number of extra goroutines because of test itself
 | |
| 		assert.LessOrEqual(t, finalGoroutines, initialGoroutines+5,
 | |
| 			"There are significantly more goroutines after GC usage, which suggests a leak")
 | |
| 
 | |
| 		close(cleanupDone)
 | |
| 	}()
 | |
| 
 | |
| 	// Wait for cleanup to complete
 | |
| 	<-cleanupDone
 | |
| }
 | |
| 
 | |
| // TestEphemeralGarbageCollectorReschedule is a test for the rescheduling of nodes in EphemeralGarbageCollector().
 | |
| // It creates a new EphemeralGarbageCollector, schedules a node for deletion with a longer expiry,
 | |
| // and then reschedules it with a shorter expiry, and verifies that the node is deleted only once.
 | |
| func TestEphemeralGarbageCollectorReschedule(t *testing.T) {
 | |
| 	// Deletion tracking mechanism
 | |
| 	var deletedIDs []types.NodeID
 | |
| 	var deleteMutex sync.Mutex
 | |
| 
 | |
| 	deleteFunc := func(nodeID types.NodeID) {
 | |
| 		deleteMutex.Lock()
 | |
| 		deletedIDs = append(deletedIDs, nodeID)
 | |
| 		deleteMutex.Unlock()
 | |
| 	}
 | |
| 
 | |
| 	// Start GC
 | |
| 	gc := NewEphemeralGarbageCollector(deleteFunc)
 | |
| 	go gc.Start()
 | |
| 	defer gc.Close()
 | |
| 
 | |
| 	const shortExpiry = fifty
 | |
| 	const longExpiry = 1 * time.Hour
 | |
| 
 | |
| 	nodeID := types.NodeID(1)
 | |
| 
 | |
| 	// Schedule node for deletion with long expiry
 | |
| 	gc.Schedule(nodeID, longExpiry)
 | |
| 
 | |
| 	// Reschedule the same node with a shorter expiry
 | |
| 	gc.Schedule(nodeID, shortExpiry)
 | |
| 
 | |
| 	// Wait for deletion
 | |
| 	time.Sleep(shortExpiry * 2)
 | |
| 
 | |
| 	// Verify that the node was deleted once
 | |
| 	deleteMutex.Lock()
 | |
| 	assert.Len(t, deletedIDs, 1, "Node should be deleted exactly once")
 | |
| 	assert.Equal(t, nodeID, deletedIDs[0], "The correct node should be deleted")
 | |
| 	deleteMutex.Unlock()
 | |
| }
 | |
| 
 | |
| // TestEphemeralGarbageCollectorCancelAndReschedule is a test for the cancellation and rescheduling of nodes in EphemeralGarbageCollector().
 | |
| // It creates a new EphemeralGarbageCollector, schedules a node for deletion, cancels it, and then reschedules it,
 | |
| // and verifies that the node is deleted only once.
 | |
| func TestEphemeralGarbageCollectorCancelAndReschedule(t *testing.T) {
 | |
| 	// Deletion tracking mechanism
 | |
| 	var deletedIDs []types.NodeID
 | |
| 	var deleteMutex sync.Mutex
 | |
| 	deletionNotifier := make(chan types.NodeID, 1)
 | |
| 
 | |
| 	deleteFunc := func(nodeID types.NodeID) {
 | |
| 		deleteMutex.Lock()
 | |
| 		deletedIDs = append(deletedIDs, nodeID)
 | |
| 		deleteMutex.Unlock()
 | |
| 		deletionNotifier <- nodeID
 | |
| 	}
 | |
| 
 | |
| 	// Start the GC
 | |
| 	gc := NewEphemeralGarbageCollector(deleteFunc)
 | |
| 	go gc.Start()
 | |
| 	defer gc.Close()
 | |
| 
 | |
| 	nodeID := types.NodeID(1)
 | |
| 	const expiry = fifty
 | |
| 
 | |
| 	// Schedule node for deletion
 | |
| 	gc.Schedule(nodeID, expiry)
 | |
| 
 | |
| 	// Cancel the scheduled deletion
 | |
| 	gc.Cancel(nodeID)
 | |
| 
 | |
| 	// Use a timeout to verify no deletion occurred
 | |
| 	select {
 | |
| 	case <-deletionNotifier:
 | |
| 		t.Fatal("Node was deleted after cancellation")
 | |
| 	case <-time.After(expiry * 2): // Still need a timeout for negative test
 | |
| 		// This is expected - no deletion should occur
 | |
| 	}
 | |
| 
 | |
| 	deleteMutex.Lock()
 | |
| 	assert.Empty(t, deletedIDs, "Node should not be deleted after cancellation")
 | |
| 	deleteMutex.Unlock()
 | |
| 
 | |
| 	// Reschedule the node
 | |
| 	gc.Schedule(nodeID, expiry)
 | |
| 
 | |
| 	// Wait for deletion with timeout
 | |
| 	select {
 | |
| 	case deletedNodeID := <-deletionNotifier:
 | |
| 		// Verify the correct node was deleted
 | |
| 		assert.Equal(t, nodeID, deletedNodeID, "The correct node should be deleted")
 | |
| 	case <-time.After(time.Second): // Longer timeout as a safety net
 | |
| 		t.Fatal("Timed out waiting for node deletion")
 | |
| 	}
 | |
| 
 | |
| 	// Verify final state
 | |
| 	deleteMutex.Lock()
 | |
| 	assert.Len(t, deletedIDs, 1, "Node should be deleted after rescheduling")
 | |
| 	assert.Equal(t, nodeID, deletedIDs[0], "The correct node should be deleted")
 | |
| 	deleteMutex.Unlock()
 | |
| }
 | |
| 
 | |
| // TestEphemeralGarbageCollectorCloseBeforeTimerFires is a test for the closing of the EphemeralGarbageCollector before the timer fires.
 | |
| // It creates a new EphemeralGarbageCollector, schedules a node for deletion, closes the GC, and verifies that the node is not deleted.
 | |
| func TestEphemeralGarbageCollectorCloseBeforeTimerFires(t *testing.T) {
 | |
| 	// Deletion tracking
 | |
| 	var deletedIDs []types.NodeID
 | |
| 	var deleteMutex sync.Mutex
 | |
| 
 | |
| 	deleteFunc := func(nodeID types.NodeID) {
 | |
| 		deleteMutex.Lock()
 | |
| 		deletedIDs = append(deletedIDs, nodeID)
 | |
| 		deleteMutex.Unlock()
 | |
| 	}
 | |
| 
 | |
| 	// Start the GC
 | |
| 	gc := NewEphemeralGarbageCollector(deleteFunc)
 | |
| 	go gc.Start()
 | |
| 
 | |
| 	const longExpiry = 1 * time.Hour
 | |
| 	const shortExpiry = fifty
 | |
| 
 | |
| 	// Schedule node deletion with a long expiry
 | |
| 	gc.Schedule(types.NodeID(1), longExpiry)
 | |
| 
 | |
| 	// Close the GC before the timer
 | |
| 	gc.Close()
 | |
| 
 | |
| 	// Wait a short time
 | |
| 	time.Sleep(shortExpiry * 2)
 | |
| 
 | |
| 	// Verify that no deletion occurred
 | |
| 	deleteMutex.Lock()
 | |
| 	assert.Empty(t, deletedIDs, "No node should be deleted when GC is closed before timer fires")
 | |
| 	deleteMutex.Unlock()
 | |
| }
 | |
| 
 | |
| // TestEphemeralGarbageCollectorScheduleAfterClose verifies that calling Schedule after Close
 | |
| // is a no-op and doesn't cause any panics, goroutine leaks, or other issues.
 | |
| func TestEphemeralGarbageCollectorScheduleAfterClose(t *testing.T) {
 | |
| 	// Count initial goroutines to check for leaks
 | |
| 	initialGoroutines := runtime.NumGoroutine()
 | |
| 	t.Logf("Initial number of goroutines: %d", initialGoroutines)
 | |
| 
 | |
| 	// Deletion tracking
 | |
| 	var deletedIDs []types.NodeID
 | |
| 	var deleteMutex sync.Mutex
 | |
| 	nodeDeleted := make(chan struct{})
 | |
| 
 | |
| 	deleteFunc := func(nodeID types.NodeID) {
 | |
| 		deleteMutex.Lock()
 | |
| 		deletedIDs = append(deletedIDs, nodeID)
 | |
| 		deleteMutex.Unlock()
 | |
| 		close(nodeDeleted) // Signal that deletion happened
 | |
| 	}
 | |
| 
 | |
| 	// Start new GC
 | |
| 	gc := NewEphemeralGarbageCollector(deleteFunc)
 | |
| 
 | |
| 	// Use a WaitGroup to ensure the GC has started
 | |
| 	var startWg sync.WaitGroup
 | |
| 	startWg.Add(1)
 | |
| 	go func() {
 | |
| 		startWg.Done() // Signal that the goroutine has started
 | |
| 		gc.Start()
 | |
| 	}()
 | |
| 	startWg.Wait() // Wait for the GC to start
 | |
| 
 | |
| 	// Close GC right away
 | |
| 	gc.Close()
 | |
| 
 | |
| 	// Use a channel to signal when we should check for goroutine count
 | |
| 	gcClosedCheck := make(chan struct{})
 | |
| 	go func() {
 | |
| 		// Give the GC time to fully close and clean up resources
 | |
| 		// This is still time-based but only affects when we check the goroutine count,
 | |
| 		// not the actual test logic
 | |
| 		time.Sleep(oneHundred)
 | |
| 		close(gcClosedCheck)
 | |
| 	}()
 | |
| 
 | |
| 	// Now try to schedule node for deletion with a very short expiry
 | |
| 	// If the Schedule operation incorrectly creates a timer, it would fire quickly
 | |
| 	nodeID := types.NodeID(1)
 | |
| 	gc.Schedule(nodeID, 1*time.Millisecond)
 | |
| 
 | |
| 	// Set up a timeout channel for our test
 | |
| 	timeout := time.After(fiveHundred)
 | |
| 
 | |
| 	// Check if any node was deleted (which shouldn't happen)
 | |
| 	select {
 | |
| 	case <-nodeDeleted:
 | |
| 		t.Fatal("Node was deleted after GC was closed, which should not happen")
 | |
| 	case <-timeout:
 | |
| 		// This is the expected path - no deletion should occur
 | |
| 	}
 | |
| 
 | |
| 	// Check no node was deleted
 | |
| 	deleteMutex.Lock()
 | |
| 	nodesDeleted := len(deletedIDs)
 | |
| 	deleteMutex.Unlock()
 | |
| 	assert.Equal(t, 0, nodesDeleted, "No nodes should be deleted when Schedule is called after Close")
 | |
| 
 | |
| 	// Check for goroutine leaks after GC is fully closed
 | |
| 	<-gcClosedCheck
 | |
| 	finalGoroutines := runtime.NumGoroutine()
 | |
| 	t.Logf("Final number of goroutines: %d", finalGoroutines)
 | |
| 
 | |
| 	// Allow for small fluctuations in goroutine count for testing routines etc
 | |
| 	assert.LessOrEqual(t, finalGoroutines, initialGoroutines+2,
 | |
| 		"There should be no significant goroutine leaks when Schedule is called after Close")
 | |
| }
 | |
| 
 | |
| // TestEphemeralGarbageCollectorConcurrentScheduleAndClose tests the behavior of the garbage collector
 | |
| // when Schedule and Close are called concurrently from multiple goroutines.
 | |
| func TestEphemeralGarbageCollectorConcurrentScheduleAndClose(t *testing.T) {
 | |
| 	// Count initial goroutines
 | |
| 	initialGoroutines := runtime.NumGoroutine()
 | |
| 	t.Logf("Initial number of goroutines: %d", initialGoroutines)
 | |
| 
 | |
| 	// Deletion tracking mechanism
 | |
| 	var deletedIDs []types.NodeID
 | |
| 	var deleteMutex sync.Mutex
 | |
| 
 | |
| 	deleteFunc := func(nodeID types.NodeID) {
 | |
| 		deleteMutex.Lock()
 | |
| 		deletedIDs = append(deletedIDs, nodeID)
 | |
| 		deleteMutex.Unlock()
 | |
| 	}
 | |
| 
 | |
| 	// Start the GC
 | |
| 	gc := NewEphemeralGarbageCollector(deleteFunc)
 | |
| 	go gc.Start()
 | |
| 
 | |
| 	// Number of concurrent scheduling goroutines
 | |
| 	const numSchedulers = 10
 | |
| 	const nodesPerScheduler = 50
 | |
| 	const schedulingDuration = fiveHundred
 | |
| 
 | |
| 	// Use WaitGroup to wait for all scheduling goroutines to finish
 | |
| 	var wg sync.WaitGroup
 | |
| 	wg.Add(numSchedulers + 1) // +1 for the closer goroutine
 | |
| 
 | |
| 	// Create a stopper channel to signal scheduling goroutines to stop
 | |
| 	stopScheduling := make(chan struct{})
 | |
| 
 | |
| 	// Launch goroutines that continuously schedule nodes
 | |
| 	for schedulerIndex := range numSchedulers {
 | |
| 		go func(schedulerID int) {
 | |
| 			defer wg.Done()
 | |
| 
 | |
| 			baseNodeID := schedulerID * nodesPerScheduler
 | |
| 
 | |
| 			// Keep scheduling nodes until signaled to stop
 | |
| 			for j := range nodesPerScheduler {
 | |
| 				select {
 | |
| 				case <-stopScheduling:
 | |
| 					return
 | |
| 				default:
 | |
| 					nodeID := types.NodeID(baseNodeID + j + 1)
 | |
| 					gc.Schedule(nodeID, 1*time.Hour) // Long expiry to ensure it doesn't trigger during test
 | |
| 
 | |
| 					// Random (short) sleep to introduce randomness/variability
 | |
| 					time.Sleep(time.Duration(rand.Intn(5)) * time.Millisecond)
 | |
| 				}
 | |
| 			}
 | |
| 		}(schedulerIndex)
 | |
| 	}
 | |
| 
 | |
| 	// After a short delay, close the garbage collector while schedulers are still running
 | |
| 	go func() {
 | |
| 		defer wg.Done()
 | |
| 		time.Sleep(schedulingDuration / 2)
 | |
| 
 | |
| 		// Close GC
 | |
| 		gc.Close()
 | |
| 
 | |
| 		// Signal schedulers to stop
 | |
| 		close(stopScheduling)
 | |
| 	}()
 | |
| 
 | |
| 	// Wait for all goroutines to complete
 | |
| 	wg.Wait()
 | |
| 
 | |
| 	// Wait a bit longer to allow any leaked goroutines to do their work
 | |
| 	time.Sleep(oneHundred)
 | |
| 
 | |
| 	// Check for leaks
 | |
| 	finalGoroutines := runtime.NumGoroutine()
 | |
| 	t.Logf("Final number of goroutines: %d", finalGoroutines)
 | |
| 
 | |
| 	// Allow for a reasonable small variable routine count due to testing
 | |
| 	assert.LessOrEqual(t, finalGoroutines, initialGoroutines+5,
 | |
| 		"There should be no significant goroutine leaks during concurrent Schedule and Close operations")
 | |
| }
 |