mirror of
https://github.com/FlipsideCrypto/dcrd.git
synced 2026-02-06 19:06:51 +00:00
b6d426241d
This commit is the first stage of several that are planned to convert
the blockchain package into a concurrent safe package that will
ultimately allow support for multi-peer download and concurrent chain
processing. The goal is to update btcd proper after each step so it can
take advantage of the enhancements as they are developed.
In addition to the aforementioned benefit, this staged approach has been
chosen since it is absolutely critical to maintain consensus.
Separating the changes into several stages makes it easier for reviewers
to logically follow what is happening and therefore helps prevent
consensus bugs. Naturally there are significant automated tests to help
prevent consensus issues as well.
The main focus of this stage is to convert the blockchain package to use
the new database interface and implement the chain-related functionality
which it no longer handles. It also aims to improve efficiency in
various areas by making use of the new database and chain capabilities.
The following is an overview of the chain changes:
- Update to use the new database interface
- Add chain-related functionality that the old database used to handle
- Main chain structure and state
- Transaction spend tracking
- Implement a new pruned unspent transaction output (utxo) set
- Provides efficient direct access to the unspent transaction outputs
- Uses a domain specific compression algorithm that understands the
standard transaction scripts in order to significantly compress them
- Removes reliance on the transaction index and paves the way toward
eventually enabling block pruning
- Modify the New function to accept a Config struct instead of
inidividual parameters
- Replace the old TxStore type with a new UtxoViewpoint type that makes
use of the new pruned utxo set
- Convert code to treat the new UtxoViewpoint as a rolling view that is
used between connects and disconnects to improve efficiency
- Make best chain state always set when the chain instance is created
- Remove now unnecessary logic for dealing with unset best state
- Make all exported functions concurrent safe
- Currently using a single chain state lock as it provides a straight
forward and easy to review path forward however this can be improved
with more fine grained locking
- Optimize various cases where full blocks were being loaded when only
the header is needed to help reduce the I/O load
- Add the ability for callers to get a snapshot of the current best
chain stats in a concurrent safe fashion
- Does not block callers while new blocks are being processed
- Make error messages that reference transaction outputs consistently
use <transaction hash>:<output index>
- Introduce a new AssertError type an convert internal consistency
checks to use it
- Update tests and examples to reflect the changes
- Add a full suite of tests to ensure correct functionality of the new
code
The following is an overview of the btcd changes:
- Update to use the new database and chain interfaces
- Temporarily remove all code related to the transaction index
- Temporarily remove all code related to the address index
- Convert all code that uses transaction stores to use the new utxo
view
- Rework several calls that required the block manager for safe
concurrency to use the chain package directly now that it is
concurrent safe
- Change all calls to obtain the best hash to use the new best state
snapshot capability from the chain package
- Remove workaround for limits on fetching height ranges since the new
database interface no longer imposes them
- Correct the gettxout RPC handler to return the best chain hash as
opposed the hash the txout was found in
- Optimize various RPC handlers:
- Change several of the RPC handlers to use the new chain snapshot
capability to avoid needlessly loading data
- Update several handlers to use new functionality to avoid accessing
the block manager so they are able to return the data without
blocking when the server is busy processing blocks
- Update non-verbose getblock to avoid deserialization and
serialization overhead
- Update getblockheader to request the block height directly from
chain and only load the header
- Update getdifficulty to use the new cached data from chain
- Update getmininginfo to use the new cached data from chain
- Update non-verbose getrawtransaction to avoid deserialization and
serialization overhead
- Update gettxout to use the new utxo store versus loading
full transactions using the transaction index
The following is an overview of the utility changes:
- Update addblock to use the new database and chain interfaces
- Update findcheckpoint to use the new database and chain interfaces
- Remove the dropafter utility which is no longer supported
NOTE: The transaction index and address index will be reimplemented in
another commit.
626 lines
16 KiB
Go
626 lines
16 KiB
Go
// Copyright (c) 2013-2015 The btcsuite developers
|
|
// Copyright (c) 2015-2016 The Decred developers
|
|
// Use of this source code is governed by an ISC
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package txscript_test
|
|
|
|
import (
|
|
"bytes"
|
|
"encoding/hex"
|
|
"reflect"
|
|
"testing"
|
|
|
|
"github.com/decred/dcrd/chaincfg/chainhash"
|
|
"github.com/decred/dcrd/txscript"
|
|
"github.com/decred/dcrd/wire"
|
|
)
|
|
|
|
// TestPushedData ensured the PushedData function extracts the expected data out
|
|
// of various scripts.
|
|
func TestPushedData(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
var tests = []struct {
|
|
script string
|
|
out [][]byte
|
|
valid bool
|
|
}{
|
|
{
|
|
"0 IF 0 ELSE 2 ENDIF",
|
|
[][]byte{nil, nil},
|
|
true,
|
|
},
|
|
{
|
|
"16777216 10000000",
|
|
[][]byte{
|
|
{0x00, 0x00, 0x00, 0x01}, // 16777216
|
|
{0x80, 0x96, 0x98, 0x00}, // 10000000
|
|
},
|
|
true,
|
|
},
|
|
{
|
|
"DUP HASH160 '17VZNX1SN5NtKa8UQFxwQbFeFc3iqRYhem' EQUALVERIFY CHECKSIG",
|
|
[][]byte{
|
|
// 17VZNX1SN5NtKa8UQFxwQbFeFc3iqRYhem
|
|
{
|
|
0x31, 0x37, 0x56, 0x5a, 0x4e, 0x58, 0x31, 0x53, 0x4e, 0x35,
|
|
0x4e, 0x74, 0x4b, 0x61, 0x38, 0x55, 0x51, 0x46, 0x78, 0x77,
|
|
0x51, 0x62, 0x46, 0x65, 0x46, 0x63, 0x33, 0x69, 0x71, 0x52,
|
|
0x59, 0x68, 0x65, 0x6d,
|
|
},
|
|
},
|
|
true,
|
|
},
|
|
{
|
|
"PUSHDATA4 1000 EQUAL",
|
|
nil,
|
|
false,
|
|
},
|
|
}
|
|
|
|
for i, test := range tests {
|
|
script := mustParseShortForm(test.script)
|
|
data, err := txscript.PushedData(script)
|
|
if test.valid && err != nil {
|
|
t.Errorf("TestPushedData failed test #%d: %v\n", i, err)
|
|
continue
|
|
} else if !test.valid && err == nil {
|
|
t.Errorf("TestPushedData failed test #%d: test should "+
|
|
"be invalid\n", i)
|
|
continue
|
|
}
|
|
if !reflect.DeepEqual(data, test.out) {
|
|
t.Errorf("TestPushedData failed test #%d: want: %x "+
|
|
"got: %x\n", i, test.out, data)
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestHasCanonicalPush ensures the canonicalPush function works as expected.
|
|
func TestHasCanonicalPush(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
for i := 0; i < 65535; i++ {
|
|
builder := txscript.NewScriptBuilder()
|
|
builder.AddInt64(int64(i))
|
|
script, err := builder.Script()
|
|
if err != nil {
|
|
t.Errorf("Script: test #%d unexpected error: %v\n", i,
|
|
err)
|
|
continue
|
|
}
|
|
if result := txscript.IsPushOnlyScript(script); !result {
|
|
t.Errorf("IsPushOnlyScript: test #%d failed: %x\n", i,
|
|
script)
|
|
continue
|
|
}
|
|
pops, err := txscript.TstParseScript(script)
|
|
if err != nil {
|
|
t.Errorf("TstParseScript: #%d failed: %v", i, err)
|
|
continue
|
|
}
|
|
for _, pop := range pops {
|
|
if result := txscript.TstHasCanonicalPushes(pop); !result {
|
|
t.Errorf("TstHasCanonicalPushes: test #%d "+
|
|
"failed: %x\n", i, script)
|
|
break
|
|
}
|
|
}
|
|
}
|
|
for i := 0; i <= txscript.MaxScriptElementSize; i++ {
|
|
builder := txscript.NewScriptBuilder()
|
|
builder.AddData(bytes.Repeat([]byte{0x49}, i))
|
|
script, err := builder.Script()
|
|
if err != nil {
|
|
t.Errorf("StandardPushesTests test #%d unexpected error: %v\n", i, err)
|
|
continue
|
|
}
|
|
if result := txscript.IsPushOnlyScript(script); !result {
|
|
t.Errorf("StandardPushesTests IsPushOnlyScript test #%d failed: %x\n", i, script)
|
|
continue
|
|
}
|
|
pops, err := txscript.TstParseScript(script)
|
|
if err != nil {
|
|
t.Errorf("StandardPushesTests #%d failed to TstParseScript: %v", i, err)
|
|
continue
|
|
}
|
|
for _, pop := range pops {
|
|
if result := txscript.TstHasCanonicalPushes(pop); !result {
|
|
t.Errorf("StandardPushesTests TstHasCanonicalPushes test #%d failed: %x\n", i, script)
|
|
break
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestGetPreciseSigOps ensures the more precise signature operation counting
|
|
// mechanism which includes signatures in P2SH scripts works as expected.
|
|
func TestGetPreciseSigOps(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
tests := []struct {
|
|
name string
|
|
scriptSig []byte
|
|
nSigOps int
|
|
err error
|
|
}{
|
|
{
|
|
name: "scriptSig doesn't parse",
|
|
scriptSig: []byte{txscript.OP_PUSHDATA1, 2},
|
|
err: txscript.ErrStackShortScript,
|
|
},
|
|
{
|
|
name: "scriptSig isn't push only",
|
|
scriptSig: []byte{txscript.OP_1, txscript.OP_DUP},
|
|
nSigOps: 0,
|
|
},
|
|
{
|
|
name: "scriptSig length 0",
|
|
scriptSig: nil,
|
|
nSigOps: 0,
|
|
},
|
|
{
|
|
name: "No script at the end",
|
|
// No script at end but still push only.
|
|
scriptSig: []byte{txscript.OP_1, txscript.OP_1},
|
|
nSigOps: 0,
|
|
},
|
|
{
|
|
name: "pushed script doesn't parse",
|
|
scriptSig: []byte{txscript.OP_DATA_2,
|
|
txscript.OP_PUSHDATA1, 2},
|
|
err: txscript.ErrStackShortScript,
|
|
},
|
|
}
|
|
|
|
// The signature in the p2sh script is nonsensical for the tests since
|
|
// this script will never be executed. What matters is that it matches
|
|
// the right pattern.
|
|
pkScript := mustParseShortForm("HASH160 DATA_20 0x433ec2ac1ffa1b7b7d0" +
|
|
"27f564529c57197f9ae88 EQUAL")
|
|
for _, test := range tests {
|
|
count := txscript.GetPreciseSigOpCount(test.scriptSig, pkScript,
|
|
true)
|
|
if count != test.nSigOps {
|
|
t.Errorf("%s: expected count of %d, got %d", test.name,
|
|
test.nSigOps, count)
|
|
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestRemoveOpcodes ensures that removing opcodes from scripts behaves as
|
|
// expected.
|
|
func TestRemoveOpcodes(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
tests := []struct {
|
|
name string
|
|
before string
|
|
remove byte
|
|
err error
|
|
after string
|
|
}{
|
|
{
|
|
// Nothing to remove.
|
|
name: "nothing to remove",
|
|
before: "NOP",
|
|
remove: txscript.OP_CODESEPARATOR,
|
|
after: "NOP",
|
|
},
|
|
{
|
|
// Test basic opcode removal.
|
|
name: "codeseparator 1",
|
|
before: "NOP CODESEPARATOR TRUE",
|
|
remove: txscript.OP_CODESEPARATOR,
|
|
after: "NOP TRUE",
|
|
},
|
|
{
|
|
// The opcode in question is actually part of the data
|
|
// in a previous opcode.
|
|
name: "codeseparator by coincidence",
|
|
before: "NOP DATA_1 CODESEPARATOR TRUE",
|
|
remove: txscript.OP_CODESEPARATOR,
|
|
after: "NOP DATA_1 CODESEPARATOR TRUE",
|
|
},
|
|
{
|
|
name: "invalid opcode",
|
|
before: "CAT",
|
|
remove: txscript.OP_CODESEPARATOR,
|
|
after: "CAT",
|
|
},
|
|
{
|
|
name: "invalid length (insruction)",
|
|
before: "PUSHDATA1",
|
|
remove: txscript.OP_CODESEPARATOR,
|
|
err: txscript.ErrStackShortScript,
|
|
},
|
|
{
|
|
name: "invalid length (data)",
|
|
before: "PUSHDATA1 0xff 0xfe",
|
|
remove: txscript.OP_CODESEPARATOR,
|
|
err: txscript.ErrStackShortScript,
|
|
},
|
|
}
|
|
|
|
for _, test := range tests {
|
|
before := mustParseShortForm(test.before)
|
|
after := mustParseShortForm(test.after)
|
|
result, err := txscript.TstRemoveOpcode(before, test.remove)
|
|
if test.err != nil {
|
|
if err != test.err {
|
|
t.Errorf("%s: got unexpected error. exp: \"%v\" "+
|
|
"got: \"%v\"", test.name, test.err, err)
|
|
}
|
|
return
|
|
}
|
|
if err != nil {
|
|
t.Errorf("%s: unexpected failure: \"%v\"", test.name, err)
|
|
return
|
|
}
|
|
if !bytes.Equal(after, result) {
|
|
t.Errorf("%s: value does not equal expected: exp: \"%v\""+
|
|
" got: \"%v\"", test.name, after, result)
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestRemoveOpcodeByData ensures that removing data carrying opcodes based on
|
|
// the data they contain works as expected.
|
|
func TestRemoveOpcodeByData(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
tests := []struct {
|
|
name string
|
|
before []byte
|
|
remove []byte
|
|
err error
|
|
after []byte
|
|
}{
|
|
{
|
|
name: "nothing to do",
|
|
before: []byte{txscript.OP_NOP},
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: []byte{txscript.OP_NOP},
|
|
},
|
|
{
|
|
name: "simple case",
|
|
before: []byte{txscript.OP_DATA_4, 1, 2, 3, 4},
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: nil,
|
|
},
|
|
{
|
|
name: "simple case (miss)",
|
|
before: []byte{txscript.OP_DATA_4, 1, 2, 3, 4},
|
|
remove: []byte{1, 2, 3, 5},
|
|
after: []byte{txscript.OP_DATA_4, 1, 2, 3, 4},
|
|
},
|
|
// fix to allow for decred tests too
|
|
/*
|
|
{
|
|
name: "stakesubmission",
|
|
scriptclass: txscript.StakeSubmissionTy,
|
|
stringed: "stakesubmission",
|
|
},
|
|
{
|
|
name: "stakegen",
|
|
scriptclass: txscript.StakeGenTy,
|
|
stringed: "stakegen",
|
|
},
|
|
{
|
|
name: "stakerevoke",
|
|
scriptclass: txscript.StakeRevocationTy,
|
|
stringed: "stakerevoke",
|
|
},
|
|
*/
|
|
{
|
|
// padded to keep it canonical.
|
|
name: "simple case (pushdata1)",
|
|
before: append(append([]byte{txscript.OP_PUSHDATA1, 76},
|
|
bytes.Repeat([]byte{0}, 72)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: nil,
|
|
},
|
|
{
|
|
name: "simple case (pushdata1 miss)",
|
|
before: append(append([]byte{txscript.OP_PUSHDATA1, 76},
|
|
bytes.Repeat([]byte{0}, 72)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
remove: []byte{1, 2, 3, 5},
|
|
after: append(append([]byte{txscript.OP_PUSHDATA1, 76},
|
|
bytes.Repeat([]byte{0}, 72)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
},
|
|
{
|
|
name: "simple case (pushdata1 miss noncanonical)",
|
|
before: []byte{txscript.OP_PUSHDATA1, 4, 1, 2, 3, 4},
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: []byte{txscript.OP_PUSHDATA1, 4, 1, 2, 3, 4},
|
|
},
|
|
{
|
|
name: "simple case (pushdata2)",
|
|
before: append(append([]byte{txscript.OP_PUSHDATA2, 0, 1},
|
|
bytes.Repeat([]byte{0}, 252)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: nil,
|
|
},
|
|
{
|
|
name: "simple case (pushdata2 miss)",
|
|
before: append(append([]byte{txscript.OP_PUSHDATA2, 0, 1},
|
|
bytes.Repeat([]byte{0}, 252)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
remove: []byte{1, 2, 3, 4, 5},
|
|
after: append(append([]byte{txscript.OP_PUSHDATA2, 0, 1},
|
|
bytes.Repeat([]byte{0}, 252)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
},
|
|
{
|
|
name: "simple case (pushdata2 miss noncanonical)",
|
|
before: []byte{txscript.OP_PUSHDATA2, 4, 0, 1, 2, 3, 4},
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: []byte{txscript.OP_PUSHDATA2, 4, 0, 1, 2, 3, 4},
|
|
},
|
|
{
|
|
// This is padded to make the push canonical.
|
|
name: "simple case (pushdata4)",
|
|
before: append(append([]byte{txscript.OP_PUSHDATA4, 0, 0, 1, 0},
|
|
bytes.Repeat([]byte{0}, 65532)...),
|
|
[]byte{1, 2, 3, 4}...),
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: nil,
|
|
},
|
|
{
|
|
name: "simple case (pushdata4 miss noncanonical)",
|
|
before: []byte{txscript.OP_PUSHDATA4, 4, 0, 0, 0, 1, 2, 3, 4},
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: []byte{txscript.OP_PUSHDATA4, 4, 0, 0, 0, 1, 2, 3, 4},
|
|
},
|
|
{
|
|
// This is padded to make the push canonical.
|
|
name: "simple case (pushdata4 miss)",
|
|
before: append(append([]byte{txscript.OP_PUSHDATA4, 0, 0, 1, 0},
|
|
bytes.Repeat([]byte{0}, 65532)...), []byte{1, 2, 3, 4}...),
|
|
remove: []byte{1, 2, 3, 4, 5},
|
|
after: append(append([]byte{txscript.OP_PUSHDATA4, 0, 0, 1, 0},
|
|
bytes.Repeat([]byte{0}, 65532)...), []byte{1, 2, 3, 4}...),
|
|
},
|
|
{
|
|
name: "invalid opcode ",
|
|
before: []byte{txscript.OP_UNKNOWN192},
|
|
remove: []byte{1, 2, 3, 4},
|
|
after: []byte{txscript.OP_UNKNOWN192},
|
|
},
|
|
{
|
|
name: "invalid length (instruction)",
|
|
before: []byte{txscript.OP_PUSHDATA1},
|
|
remove: []byte{1, 2, 3, 4},
|
|
err: txscript.ErrStackShortScript,
|
|
},
|
|
{
|
|
name: "invalid length (data)",
|
|
before: []byte{txscript.OP_PUSHDATA1, 255, 254},
|
|
remove: []byte{1, 2, 3, 4},
|
|
err: txscript.ErrStackShortScript,
|
|
},
|
|
}
|
|
|
|
for _, test := range tests {
|
|
result, err := txscript.TstRemoveOpcodeByData(test.before,
|
|
test.remove)
|
|
if test.err != nil {
|
|
if err != test.err {
|
|
t.Errorf("%s: got unexpected error. exp: \"%v\" "+
|
|
"got: \"%v\"", test.name, test.err, err)
|
|
}
|
|
return
|
|
}
|
|
if err != nil {
|
|
t.Errorf("%s: unexpected failure: \"%v\"", test.name, err)
|
|
return
|
|
}
|
|
if !bytes.Equal(test.after, result) {
|
|
t.Errorf("%s: value does not equal expected: exp: \"%v\""+
|
|
" got: \"%v\"", test.name, test.after, result)
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestIsPayToScriptHash ensures the IsPayToScriptHash function returns the
|
|
// expected results for all the scripts in scriptClassTests.
|
|
func TestIsPayToScriptHash(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
for _, test := range scriptClassTests {
|
|
script := mustParseShortForm(test.script)
|
|
shouldBe := (test.class == txscript.ScriptHashTy)
|
|
p2sh := txscript.IsPayToScriptHash(script)
|
|
if p2sh != shouldBe {
|
|
t.Errorf("%s: epxected p2sh %v, got %v", test.name,
|
|
shouldBe, p2sh)
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestHasCanonicalPushes ensures the canonicalPush function properly determines
|
|
// what is considered a canonical push for the purposes of removeOpcodeByData.
|
|
func TestHasCanonicalPushes(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
tests := []struct {
|
|
name string
|
|
script string
|
|
expected bool
|
|
}{
|
|
{
|
|
name: "does not parse",
|
|
script: "0x046708afdb0fe5548271967f1a67130b7105cd6a82" +
|
|
"8e03909a67962e0ea1f61d",
|
|
expected: false,
|
|
},
|
|
{
|
|
name: "non-canonical push",
|
|
script: "PUSHDATA1 0x04 0x01020304",
|
|
expected: false,
|
|
},
|
|
}
|
|
|
|
for i, test := range tests {
|
|
script := mustParseShortForm(test.script)
|
|
pops, err := txscript.TstParseScript(script)
|
|
if err != nil {
|
|
if test.expected {
|
|
t.Errorf("TstParseScript #%d failed: %v", i, err)
|
|
}
|
|
continue
|
|
}
|
|
for _, pop := range pops {
|
|
if txscript.TstHasCanonicalPushes(pop) != test.expected {
|
|
t.Errorf("TstHasCanonicalPushes: #%d (%s) "+
|
|
"wrong result\ngot: %v\nwant: %v", i,
|
|
test.name, true, test.expected)
|
|
break
|
|
}
|
|
}
|
|
}
|
|
}
|
|
|
|
// TestIsPushOnlyScript ensures the IsPushOnlyScript function returns the
|
|
// expected results.
|
|
func TestIsPushOnlyScript(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
test := struct {
|
|
name string
|
|
script []byte
|
|
expected bool
|
|
}{
|
|
name: "does not parse",
|
|
script: mustParseShortForm("0x046708afdb0fe5548271967f1a67130" +
|
|
"b7105cd6a828e03909a67962e0ea1f61d"),
|
|
expected: false,
|
|
}
|
|
|
|
if txscript.IsPushOnlyScript(test.script) != test.expected {
|
|
t.Errorf("IsPushOnlyScript (%s) wrong result\ngot: %v\nwant: "+
|
|
"%v", test.name, true, test.expected)
|
|
}
|
|
}
|
|
|
|
// TestCalcSignatureHash does some rudimentary testing of msg hash calculation.
|
|
func TestCalcSignatureHash(t *testing.T) {
|
|
tx := new(wire.MsgTx)
|
|
for i := 0; i < 3; i++ {
|
|
txIn := new(wire.TxIn)
|
|
txIn.Sequence = 0xFFFFFFFF
|
|
txIn.PreviousOutPoint.Hash = chainhash.HashFuncH([]byte{byte(i)})
|
|
txIn.PreviousOutPoint.Index = uint32(i)
|
|
txIn.PreviousOutPoint.Tree = int8(0)
|
|
tx.AddTxIn(txIn)
|
|
}
|
|
for i := 0; i < 2; i++ {
|
|
txOut := new(wire.TxOut)
|
|
txOut.PkScript = []byte{0x01, 0x01, 0x02, 0x03}
|
|
txOut.Value = 0x0000FF00FF00FF00
|
|
tx.AddTxOut(txOut)
|
|
}
|
|
|
|
want, _ := hex.DecodeString("d09285b6f60c71329323bc2e76c48" +
|
|
"a462cde4e1032aa8f59c55823f1722c7f4a")
|
|
pops, _ := txscript.TstParseScript([]byte{0x01, 0x01, 0x02, 0x03})
|
|
|
|
// Test prefix caching.
|
|
msg1, err := txscript.CalcSignatureHash(pops, txscript.SigHashAll, tx, 0, nil)
|
|
if err != nil {
|
|
t.Fatalf("unexpected error %v", err.Error())
|
|
}
|
|
|
|
prefixHash := tx.TxSha()
|
|
msg2, err := txscript.CalcSignatureHash(pops, txscript.SigHashAll, tx, 0,
|
|
&prefixHash)
|
|
if err != nil {
|
|
t.Fatalf("unexpected error %v", err.Error())
|
|
}
|
|
|
|
if !bytes.Equal(msg1, want) {
|
|
t.Errorf("for sighash all sig noncached wrong msg %x given, want %x",
|
|
msg1,
|
|
want)
|
|
}
|
|
if !bytes.Equal(msg2, want) {
|
|
t.Errorf("for sighash all sig cached wrong msg %x given, want %x",
|
|
msg1,
|
|
want)
|
|
}
|
|
if !bytes.Equal(msg1, msg2) {
|
|
t.Errorf("for sighash all sig non-equivalent msgs %x and %x were "+
|
|
"returned when using a cached prefix",
|
|
msg1,
|
|
msg2)
|
|
}
|
|
|
|
// Move the index and make sure that we get a whole new hash, despite
|
|
// using the same TxOuts.
|
|
msg3, err := txscript.CalcSignatureHash(pops, txscript.SigHashAll, tx, 1,
|
|
&prefixHash)
|
|
if err != nil {
|
|
t.Fatalf("unexpected error %v", err.Error())
|
|
}
|
|
|
|
if bytes.Equal(msg1, msg3) {
|
|
t.Errorf("for sighash all sig equivalent msgs %x and %x were "+
|
|
"returned when using a cached prefix but different indices",
|
|
msg1,
|
|
msg3)
|
|
}
|
|
}
|
|
|
|
// TestIsUnspendable ensures the IsUnspendable function returns the expected
|
|
// results.
|
|
func TestIsUnspendable(t *testing.T) {
|
|
t.Parallel()
|
|
|
|
tests := []struct {
|
|
name string
|
|
amount int64
|
|
pkScript []byte
|
|
expected bool
|
|
}{
|
|
{
|
|
// Unspendable
|
|
amount: 100,
|
|
pkScript: []byte{0x6a, 0x04, 0x74, 0x65, 0x73, 0x74},
|
|
expected: true,
|
|
},
|
|
{
|
|
// Unspendable
|
|
amount: 0,
|
|
pkScript: []byte{0x76, 0xa9, 0x14, 0x29, 0x95, 0xa0,
|
|
0xfe, 0x68, 0x43, 0xfa, 0x9b, 0x95, 0x45,
|
|
0x97, 0xf0, 0xdc, 0xa7, 0xa4, 0x4d, 0xf6,
|
|
0xfa, 0x0b, 0x5c, 0x88, 0xac},
|
|
expected: true,
|
|
},
|
|
{
|
|
// Spendable
|
|
amount: 100,
|
|
pkScript: []byte{0x76, 0xa9, 0x14, 0x29, 0x95, 0xa0,
|
|
0xfe, 0x68, 0x43, 0xfa, 0x9b, 0x95, 0x45,
|
|
0x97, 0xf0, 0xdc, 0xa7, 0xa4, 0x4d, 0xf6,
|
|
0xfa, 0x0b, 0x5c, 0x88, 0xac},
|
|
expected: false,
|
|
},
|
|
}
|
|
|
|
for i, test := range tests {
|
|
res := txscript.IsUnspendable(test.amount, test.pkScript)
|
|
if res != test.expected {
|
|
t.Errorf("TestIsUnspendable #%d failed: got %v want %v",
|
|
i, res, test.expected)
|
|
continue
|
|
}
|
|
}
|
|
}
|