-
Notifications
You must be signed in to change notification settings - Fork 724
Commit
This commit does not belong to any branch on this repository, and may belong to a fork outside of the repository.
apply txIndex fix to StoreTransactions; add migration to fix wrong tx…
- Loading branch information
Showing
5 changed files
with
248 additions
and
77 deletions.
There are no files selected for viewing
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -1,12 +1,25 @@ | ||
-- +migrate Up | ||
|
||
-- +migrate Up | ||
ALTER TABLE state.exit_root | ||
ADD COLUMN IF NOT EXISTS l1_info_tree_recursive_index BIGINT DEFAULT NULL UNIQUE; | ||
CREATE INDEX IF NOT EXISTS idx_exit_root_l1_info_tree_recursive_index ON state.exit_root (l1_info_tree_recursive_index); | ||
-- the update below fix the wrong receipt TX indexes | ||
WITH map_fix_tx_index AS ( | ||
SELECT t.l2_block_num AS block_num | ||
, t.hash AS tx_hash | ||
, r.tx_index AS current_index | ||
, (ROW_NUMBER() OVER (PARTITION BY t.l2_block_num ORDER BY r.tx_index))-1 AS correct_index | ||
FROM state.receipt r | ||
INNER JOIN state."transaction" t | ||
ON t.hash = r.tx_hash | ||
) | ||
UPDATE state.receipt AS r | ||
SET tx_index = m.correct_index | ||
FROM map_fix_tx_index m | ||
WHERE m.block_num = r.block_num | ||
AND m.tx_hash = r.tx_hash | ||
AND m.current_index = r.tx_index | ||
AND m.current_index != m.correct_index; | ||
|
||
|
||
-- +migrate Down | ||
ALTER TABLE state.exit_root | ||
DROP COLUMN IF EXISTS l1_info_tree_recursive_index; | ||
DROP INDEX IF EXISTS state.idx_exit_root_l1_info_tree_recursive_index; | ||
|
||
-- no action is needed, the data fixed by the | ||
-- migrate up must remain fixed |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,12 @@ | ||
-- +migrate Up | ||
|
||
-- +migrate Up | ||
ALTER TABLE state.exit_root | ||
ADD COLUMN IF NOT EXISTS l1_info_tree_recursive_index BIGINT DEFAULT NULL UNIQUE; | ||
CREATE INDEX IF NOT EXISTS idx_exit_root_l1_info_tree_recursive_index ON state.exit_root (l1_info_tree_recursive_index); | ||
|
||
-- +migrate Down | ||
ALTER TABLE state.exit_root | ||
DROP COLUMN IF EXISTS l1_info_tree_recursive_index; | ||
DROP INDEX IF EXISTS state.idx_exit_root_l1_info_tree_recursive_index; | ||
|
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters
Original file line number | Diff line number | Diff line change |
---|---|---|
@@ -0,0 +1,106 @@ | ||
package migrations_test | ||
|
||
import ( | ||
"database/sql" | ||
"testing" | ||
"time" | ||
|
||
"github.com/stretchr/testify/assert" | ||
) | ||
|
||
type migrationTest0020 struct { | ||
migrationBase | ||
|
||
blockHashValue string | ||
mainExitRootValue string | ||
rollupExitRootValue string | ||
globalExitRootValue string | ||
previousBlockHashValue string | ||
l1InfoRootValue string | ||
} | ||
|
||
func (m migrationTest0020) insertBlock(blockNumber uint64, db *sql.DB) error { | ||
const addBlock = "INSERT INTO state.block (block_num, received_at, block_hash) VALUES ($1, $2, $3)" | ||
if _, err := db.Exec(addBlock, blockNumber, time.Now(), m.blockHashValue); err != nil { | ||
return err | ||
} | ||
return nil | ||
} | ||
|
||
func (m migrationTest0020) insertRowInOldTable(db *sql.DB, args ...interface{}) error { | ||
sql := ` | ||
INSERT INTO state.exit_root (block_num, "timestamp", mainnet_exit_root, rollup_exit_root, global_exit_root, prev_block_hash, l1_info_root, l1_info_tree_index) | ||
VALUES ( $1, $2, $3, $4, $5, $6, $7, $8);` | ||
|
||
_, err := db.Exec(sql, args...) | ||
return err | ||
} | ||
|
||
func (m migrationTest0020) insertRowInMigratedTable(db *sql.DB, args ...interface{}) error { | ||
sql := ` | ||
INSERT INTO state.exit_root (block_num, "timestamp", mainnet_exit_root, rollup_exit_root, global_exit_root, prev_block_hash, l1_info_root, l1_info_tree_index, l1_info_tree_recursive_index) | ||
VALUES ( $1, $2, $3, $4, $5, $6, $7, $8, $9);` | ||
|
||
_, err := db.Exec(sql, args...) | ||
return err | ||
} | ||
|
||
func (m migrationTest0020) InsertData(db *sql.DB) error { | ||
var err error | ||
for i := uint64(1); i <= 6; i++ { | ||
if err = m.insertBlock(i, db); err != nil { | ||
return err | ||
} | ||
} | ||
|
||
return nil | ||
} | ||
|
||
func (m migrationTest0020) RunAssertsAfterMigrationUp(t *testing.T, db *sql.DB) { | ||
m.AssertNewAndRemovedItemsAfterMigrationUp(t, db) | ||
|
||
var nilL1InfoTreeIndex *uint = nil | ||
err := m.insertRowInOldTable(db, 1, time.Now().UTC(), m.mainExitRootValue, m.rollupExitRootValue, m.globalExitRootValue, m.previousBlockHashValue, m.l1InfoRootValue, nilL1InfoTreeIndex) | ||
assert.NoError(t, err) | ||
|
||
err = m.insertRowInOldTable(db, 2, time.Now().UTC(), m.mainExitRootValue, m.rollupExitRootValue, m.globalExitRootValue, m.previousBlockHashValue, m.l1InfoRootValue, uint(1)) | ||
assert.NoError(t, err) | ||
|
||
err = m.insertRowInMigratedTable(db, 3, time.Now().UTC(), m.mainExitRootValue, m.rollupExitRootValue, m.globalExitRootValue, m.previousBlockHashValue, m.l1InfoRootValue, nilL1InfoTreeIndex, 1) | ||
assert.NoError(t, err) | ||
} | ||
|
||
func (m migrationTest0020) RunAssertsAfterMigrationDown(t *testing.T, db *sql.DB) { | ||
m.AssertNewAndRemovedItemsAfterMigrationDown(t, db) | ||
|
||
var nilL1InfoTreeIndex *uint = nil | ||
err := m.insertRowInOldTable(db, 4, time.Now().UTC(), m.mainExitRootValue, m.rollupExitRootValue, m.globalExitRootValue, m.previousBlockHashValue, m.l1InfoRootValue, nilL1InfoTreeIndex) | ||
assert.NoError(t, err) | ||
|
||
err = m.insertRowInOldTable(db, 5, time.Now().UTC(), m.mainExitRootValue, m.rollupExitRootValue, m.globalExitRootValue, m.previousBlockHashValue, m.l1InfoRootValue, uint(2)) | ||
assert.NoError(t, err) | ||
|
||
err = m.insertRowInMigratedTable(db, 6, time.Now().UTC(), m.mainExitRootValue, m.rollupExitRootValue, m.globalExitRootValue, m.previousBlockHashValue, m.l1InfoRootValue, nilL1InfoTreeIndex, 2) | ||
assert.Error(t, err) | ||
} | ||
|
||
func TestMigration0020(t *testing.T) { | ||
m := migrationTest0020{ | ||
migrationBase: migrationBase{ | ||
newIndexes: []string{ | ||
"idx_exit_root_l1_info_tree_recursive_index", | ||
}, | ||
newColumns: []columnMetadata{ | ||
{"state", "exit_root", "l1_info_tree_recursive_index"}, | ||
}, | ||
}, | ||
|
||
blockHashValue: "0x29e885edaf8e4b51e1d2e05f9da28161d2fb4f6b1d53827d9b80a23cf2d7d9f1", | ||
mainExitRootValue: "0x83fc198de31e1b2b1a8212d2430fbb7766c13d9ad305637dea3759065606475d", | ||
rollupExitRootValue: "0xadb91a6a1fce56eaea561002bc9a993f4e65a7710bd72f4eee3067cbd73a743c", | ||
globalExitRootValue: "0x5bf4af1a651a2a74b36e6eb208481f94c69fc959f756223dfa49608061937585", | ||
previousBlockHashValue: "0xe865e912b504572a4d80ad018e29797e3c11f00bf9ae2549548a25779c9d7e57", | ||
l1InfoRootValue: "0x2b9484b83c6398033241865b015fb9430eb3e159182a6075d00c924845cc393e", | ||
} | ||
runMigrationTest(t, 20, m) | ||
} |
This file contains bidirectional Unicode text that may be interpreted or compiled differently than what appears below. To review, open the file in an editor that reveals hidden Unicode characters.
Learn more about bidirectional Unicode characters