Replace 256 with layout.TileWidth/layout.EntryBundleWidth

client/client_test.go

@@ -359,7 +359,7 @@ func TestGetEntryBundleAddressing(t *testing.T) {
 		{
 			name:                "works - full tile",
 			idx:                 1,
-			logSize:             256*2 + 45,
+			logSize:             layout.TileWidth*2 + 45,
 			wantPartialTileSize: 0,
 		},
 	} {

integration/integration_test.go

@@ -35,6 +35,7 @@ import (
 	"github.com/transparency-dev/formats/log"
 	"github.com/transparency-dev/merkle/proof"
 	"github.com/transparency-dev/merkle/rfc6962"
+	"github.com/transparency-dev/trillian-tessera/api/layout"
 	"github.com/transparency-dev/trillian-tessera/client"
 	"golang.org/x/mod/sumdb/note"
 	"golang.org/x/sync/errgroup"
@@ -180,12 +181,12 @@ func TestLiveLogIntegration(t *testing.T) {
 		index := v.(uint64)
 
 		// Step 4.1 - Get entry bundles to read back what was written, check leaves are correct.
-		entryBundle, err := client.GetEntryBundle(ctx, logReadEntryBundle, index/256, checkpoint.Size)
+		entryBundle, err := client.GetEntryBundle(ctx, logReadEntryBundle, index/layout.EntryBundleWidth, checkpoint.Size)
 		if err != nil {
 			t.Fatalf("client.GetEntryBundle: %v", err)
 		}
 
-		got, want := entryBundle.Entries[index%256], []byte(fmt.Sprintf("%d", data))
+		got, want := entryBundle.Entries[index%layout.EntryBundleWidth], []byte(fmt.Sprintf("%d", data))
 		if !bytes.Equal(got, want) {
 			t.Errorf("Entry bundle (index: %d) got %v want %v", index, got, want)
 		}

internal/hammer/workers.go

@@ -22,6 +22,7 @@ import (
 	"math/rand/v2"
 	"time"
 
+	"github.com/transparency-dev/trillian-tessera/api/layout"
 	"github.com/transparency-dev/trillian-tessera/client"
 	"k8s.io/klog/v2"
 )
@@ -94,11 +95,11 @@ func (r *LeafReader) getLeaf(ctx context.Context, i uint64, logSize uint64) ([]b
 		return cached, nil
 	}
 
-	bundle, err := client.GetEntryBundle(ctx, r.f, i/256, logSize)
+	bundle, err := client.GetEntryBundle(ctx, r.f, i/layout.EntryBundleWidth, logSize)
 	if err != nil {
 		return nil, fmt.Errorf("failed to get entry bundle: %v", err)
 	}
-	ti := i % 256
+	ti := i % layout.EntryBundleWidth
 	r.c = leafBundleCache{
 		start:  i - ti,
 		leaves: bundle.Entries,

storage/aws/aws.go

@@ -59,7 +59,6 @@ import (
 )
 
 const (
-	entryBundleSize       = 256
 	logContType           = "application/octet-stream"
 	ckptContType          = "text/plain; charset=utf-8"
 	minCheckpointInterval = time.Second

storage/aws/aws_test.go

@@ -283,8 +283,8 @@ func TestTileRoundtrip(t *testing.T) {
 		{
 			name:     "ok",
 			level:    0,
-			index:    3 * 256,
-			logSize:  3*256 + 20,
+			index:    3 * layout.TileWidth,
+			logSize:  3*layout.TileWidth + 20,
 			tileSize: 20,
 		},
 	} {
@@ -339,7 +339,7 @@ func TestBundleRoundtrip(t *testing.T) {
 	}{
 		{
 			name:       "ok",
-			index:      3 * 256,
+			index:      3 * layout.EntryBundleWidth,
 			p:          20,
 			bundleSize: 20,
 		},

storage/gcp/gcp_test.go

@@ -221,8 +221,8 @@ func TestTileRoundtrip(t *testing.T) {
 		{
 			name:     "ok",
 			level:    0,
-			index:    3 * 256,
-			logSize:  3*256 + 20,
+			index:    3 * layout.TileWidth,
+			logSize:  3*layout.TileWidth + 20,
 			tileSize: 20,
 		},
 	} {
@@ -277,8 +277,8 @@ func TestBundleRoundtrip(t *testing.T) {
 	}{
 		{
 			name:       "ok",
-			index:      3 * 256,
-			logSize:    3*256 + 20,
+			index:      3 * layout.EntryBundleWidth,
+			logSize:    3*layout.EntryBundleWidth + 20,
 			bundleSize: 20,
 		},
 	} {

storage/internal/integrate.go

@@ -251,7 +251,7 @@ func (tc *tileWriteCache) Err() error {
 // minImpliedTreeSize returns the smallest possible tree size implied by the existence of a tile
 // with the given ID.
 func minImpliedTreeSize(id TileID) uint64 {
-	return (id.Index * 256) << (id.Level * 8)
+	return (id.Index * layout.TileWidth) << (id.Level * 8)
 }
 
 // Visitor returns a function suitable for use with the compact.Range visitor pattern.
@@ -312,7 +312,7 @@ type populatedTile struct {
 func newPopulatedTile(h *api.HashTile) (*populatedTile, error) {
 	ft := &populatedTile{
 		inner:  make(map[compact.NodeID][]byte),
-		leaves: make([][]byte, 0, 256),
+		leaves: make([][]byte, 0, layout.TileWidth),
 	}
 
 	if h != nil {

storage/internal/integrate_test.go

@@ -43,7 +43,7 @@ func TestNewRangeFetchesTiles(t *testing.T) {
 	}
 
 	for _, id := range wantIDs {
-		if err := m.setTile(ctx, id, treeSize, zeroTile(256)); err != nil {
+		if err := m.setTile(ctx, id, treeSize, zeroTile(layout.TileWidth)); err != nil {
 			t.Fatalf("setTile: %v", err)
 		}
 	}
@@ -78,9 +78,9 @@ func TestTileVisit(t *testing.T) {
 		{
 			name: "ok - multiple tiles",
 			visits: map[compact.NodeID][]byte{
-				{Level: 0, Index: 0}:       {0},
-				{Level: 0, Index: 1 * 256}: {1},
-				{Level: 8, Index: 2 * 256}: {2},
+				{Level: 0, Index: 0}:                    {0},
+				{Level: 0, Index: 1 * layout.TileWidth}: {1},
+				{Level: 8, Index: 2 * layout.TileWidth}: {2},
 			},
 			wantTiles: map[TileID]*api.HashTile{
 				{Level: 0, Index: 0}: {Nodes: [][]byte{{0}}},

storage/mysql/mysql.go

@@ -49,9 +49,8 @@ const (
 	selectTiledLeavesSQL             = "SELECT `size`, `data` FROM `TiledLeaves` WHERE `tile_index` = ?"
 	replaceTiledLeavesSQL            = "REPLACE INTO `TiledLeaves` (`tile_index`, `size`, `data`) VALUES (?, ?, ?)"
 
-	checkpointID    = 0
-	treeStateID     = 0
-	entryBundleSize = 256
+	checkpointID = 0
+	treeStateID  = 0
 
 	minCheckpointInterval = time.Second
 )
@@ -268,7 +267,7 @@ func (s *Storage) ReadTile(ctx context.Context, level, index uint64, p uint8) ([
 	numEntries := uint64(len(tile) / sha256.Size)
 	requestedEntries := uint64(p)
 	if requestedEntries == 0 {
-		requestedEntries = 256
+		requestedEntries = layout.TileWidth
 	}
 	if requestedEntries > numEntries {
 		// If the user has requested a size larger than we have, they can't have it
@@ -450,7 +449,7 @@ func (s *Storage) integrate(ctx context.Context, tx *sql.Tx, fromSeq uint64, ent
 	}
 
 	// Add sequenced entries to entry bundles.
-	bundleIndex, entriesInBundle := fromSeq/entryBundleSize, fromSeq%entryBundleSize
+	bundleIndex, entriesInBundle := fromSeq/layout.EntryBundleWidth, fromSeq%layout.EntryBundleWidth
 	bundleWriter := &bytes.Buffer{}
 
 	// If the latest bundle is partial, we need to read the data it contains in for our newer, larger, bundle.
@@ -482,7 +481,7 @@ func (s *Storage) integrate(ctx context.Context, tx *sql.Tx, fromSeq uint64, ent
 		entriesInBundle++
 
 		// This bundle is full, so we need to write it out.
-		if entriesInBundle == entryBundleSize {
+		if entriesInBundle == layout.EntryBundleWidth {
 			if err := s.writeEntryBundle(ctx, tx, bundleIndex, uint32(entriesInBundle), bundleWriter.Bytes()); err != nil {
 				return fmt.Errorf("writeEntryBundle: %w", err)
 			}

storage/mysql/mysql_test.go

@@ -200,7 +200,7 @@ func TestGetTile(t *testing.T) {
 		{
 			name:  "requested partial tile for a complete tile",
 			level: 0, index: 0, p: 10,
-			wantEntries:  256,
+			wantEntries:  layout.TileWidth,
 			wantNotFound: false,
 		},
 		{
@@ -438,7 +438,7 @@ func TestEntryBundleRoundTrip(t *testing.T) {
 			if err != nil {
 				t.Errorf("Add got err: %v", err)
 			}
-			entryBundleRaw, err := s.ReadEntryBundle(ctx, entryIndex/256, layout.PartialTileSize(0, entryIndex, entryIndex+1))
+			entryBundleRaw, err := s.ReadEntryBundle(ctx, entryIndex/layout.EntryBundleWidth, layout.PartialTileSize(0, entryIndex, entryIndex+1))
 			if err != nil {
 				t.Fatalf("ReadEntryBundle got err: %v", err)
 			}
@@ -451,7 +451,7 @@ func TestEntryBundleRoundTrip(t *testing.T) {
 			if len(gotEntries) == 0 {
 				t.Error("no entry found")
 			} else {
-				if !bytes.Equal(bundle.Entries[entryIndex%256], test.entry) {
+				if !bytes.Equal(bundle.Entries[entryIndex%layout.EntryBundleWidth], test.entry) {
 					t.Errorf("got entry %v want %v", bundle.Entries[0], test.entry)
 				}
 			}