feat(bigtable): switch to rand v2 (#14008)

sushanb · web-flow · commit ee6f4251b9c6 · 2026-02-25T14:20:07.000-05:00
diff --git a/bigtable/internal/transport/conn_recycler.go b/bigtable/internal/transport/conn_recycler.go
@@ -16,7 +16,7 @@ package internal
 
 import (
 	"context"
-	"math/rand"
+	"math/rand/v2"
 	"sync"
 	"time"
 
@@ -33,7 +33,6 @@ type ConnectionRecycler struct {
 	ticker   *time.Ticker
 	done     chan struct{}
 	stopOnce sync.Once
-	rng      *rand.Rand
 }
 
 // NewConnectionRecycler creates a new recycler with the provided configuration.
@@ -42,7 +41,6 @@ func NewConnectionRecycler(config btopt.ConnectionRecycleConfig, pool *BigtableC
 		pool:   pool,
 		config: config,
 		done:   make(chan struct{}),
-		rng:    rand.New(rand.NewSource(time.Now().UnixNano())),
 	}
 }
 
@@ -103,7 +101,7 @@ func (cr *ConnectionRecycler) checkRecycle() {
 
 		var currentJitter time.Duration
 		if hasJitter {
-			currentJitter = time.Duration(cr.rng.Int63n(jitterVal))
+			currentJitter = time.Duration(rand.Int64N(jitterVal))
 		}
 
 		if age > cr.config.MaxAge+currentJitter {
diff --git a/bigtable/internal/transport/connpool.go b/bigtable/internal/transport/connpool.go
@@ -21,7 +21,7 @@ import (
 	"io"
 	"log"
 	"math"
-	"math/rand"
+	"math/rand/v2"
 	"net"
 	"net/url"
 	"slices"
@@ -731,8 +731,8 @@ func (p *BigtableChannelPool) selectLeastLoadedRandomOfTwo() (*connEntry, error)
 
 	// Retry numConns * 2 times in worst case.
 	for i := 0; i < numConns*2 && numConns > 1; i++ {
-		idx1 := rand.Intn(numConns)
-		idx2 := rand.Intn(numConns)
+		idx1 := rand.IntN(numConns)
+		idx2 := rand.IntN(numConns)
 
 		entry1 := conns[idx1]
 		entry2 := conns[idx2]
