state: more robust handling of state Serial
Previously we relied on a constellation of coincidences for everything to work out correctly with state serials. In particular, callers needed to be very careful about mutating states (or not) because many different bits of code shared pointers to the same objects. Here we move to a model where all of the state managers always use distinct instances of state, copied when WriteState is called. This means that they are truly a snapshot of the state as it was at that call, even if the caller goes on mutating the state that was passed. We also adjust the handling of serials so that the state managers ignore any serials in incoming states and instead just treat each Persist as the next version after what was most recently Refreshed. (An exception exists for when nothing has been refreshed, e.g. because we are writing a state to a location for the first time. In that case we _do_ trust the caller, since the given state is either a new state or it's a copy of something we're migrating from elsewhere with its state and lineage intact.) The intent here is to allow the rest of Terraform to not worry about serials and state identity, and instead just treat the state as a mutable structure. We'll just snapshot it occasionally, when WriteState is called, and deal with serials _only_ at persist time. This is intended as a more robust version of #15423, which was a quick hotfix to an issue that resulted from our previous slopping handling of state serials but arguably makes the problem worse by depending on an additional coincidental behavior of the local backend's apply implementation.
This commit is contained in:
parent
909989acfa
commit
4d53eaa6df
|
@ -186,6 +186,7 @@ func TestWorkspace_createWithState(t *testing.T) {
|
||||||
}
|
}
|
||||||
|
|
||||||
newState := envState.State()
|
newState := envState.State()
|
||||||
|
originalState.Version = newState.Version // the round-trip through the state manager implicitly populates version
|
||||||
if !originalState.Equal(newState) {
|
if !originalState.Equal(newState) {
|
||||||
t.Fatalf("states not equal\norig: %s\nnew: %s", originalState, newState)
|
t.Fatalf("states not equal\norig: %s\nnew: %s", originalState, newState)
|
||||||
}
|
}
|
||||||
|
|
|
@ -32,8 +32,18 @@ func (s *InmemState) WriteState(state *terraform.State) error {
|
||||||
s.mu.Lock()
|
s.mu.Lock()
|
||||||
defer s.mu.Unlock()
|
defer s.mu.Unlock()
|
||||||
|
|
||||||
state.IncrementSerialMaybe(s.state)
|
state = state.DeepCopy()
|
||||||
|
|
||||||
|
if s.state != nil {
|
||||||
|
state.Serial = s.state.Serial
|
||||||
|
|
||||||
|
if !s.state.MarshalEqual(state) {
|
||||||
|
state.Serial++
|
||||||
|
}
|
||||||
|
}
|
||||||
|
|
||||||
s.state = state
|
s.state = state
|
||||||
|
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -48,8 +48,8 @@ func (s *LocalState) SetState(state *terraform.State) {
|
||||||
s.mu.Lock()
|
s.mu.Lock()
|
||||||
defer s.mu.Unlock()
|
defer s.mu.Unlock()
|
||||||
|
|
||||||
s.state = state
|
s.state = state.DeepCopy()
|
||||||
s.readState = state
|
s.readState = state.DeepCopy()
|
||||||
}
|
}
|
||||||
|
|
||||||
// StateReader impl.
|
// StateReader impl.
|
||||||
|
@ -74,7 +74,14 @@ func (s *LocalState) WriteState(state *terraform.State) error {
|
||||||
}
|
}
|
||||||
defer s.stateFileOut.Sync()
|
defer s.stateFileOut.Sync()
|
||||||
|
|
||||||
s.state = state
|
s.state = state.DeepCopy() // don't want mutations before we actually get this written to disk
|
||||||
|
|
||||||
|
if s.readState != nil && s.state != nil {
|
||||||
|
// We don't trust callers to properly manage serials. Instead, we assume
|
||||||
|
// that a WriteState is always for the next version after what was
|
||||||
|
// most recently read.
|
||||||
|
s.state.Serial = s.readState.Serial
|
||||||
|
}
|
||||||
|
|
||||||
if _, err := s.stateFileOut.Seek(0, os.SEEK_SET); err != nil {
|
if _, err := s.stateFileOut.Seek(0, os.SEEK_SET); err != nil {
|
||||||
return err
|
return err
|
||||||
|
@ -88,8 +95,9 @@ func (s *LocalState) WriteState(state *terraform.State) error {
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
s.state.IncrementSerialMaybe(s.readState)
|
if !s.state.MarshalEqual(s.readState) {
|
||||||
s.readState = s.state
|
s.state.Serial++
|
||||||
|
}
|
||||||
|
|
||||||
if err := terraform.WriteState(s.state, s.stateFileOut); err != nil {
|
if err := terraform.WriteState(s.state, s.stateFileOut); err != nil {
|
||||||
return err
|
return err
|
||||||
|
@ -147,7 +155,7 @@ func (s *LocalState) RefreshState() error {
|
||||||
}
|
}
|
||||||
|
|
||||||
s.state = state
|
s.state = state
|
||||||
s.readState = state
|
s.readState = s.state.DeepCopy()
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
|
@ -2,6 +2,7 @@ package remote
|
||||||
|
|
||||||
import (
|
import (
|
||||||
"bytes"
|
"bytes"
|
||||||
|
"fmt"
|
||||||
"sync"
|
"sync"
|
||||||
|
|
||||||
"github.com/hashicorp/terraform/state"
|
"github.com/hashicorp/terraform/state"
|
||||||
|
@ -33,7 +34,28 @@ func (s *State) WriteState(state *terraform.State) error {
|
||||||
s.mu.Lock()
|
s.mu.Lock()
|
||||||
defer s.mu.Unlock()
|
defer s.mu.Unlock()
|
||||||
|
|
||||||
s.state = state
|
if s.readState != nil && !state.SameLineage(s.readState) {
|
||||||
|
return fmt.Errorf("incompatible state lineage; given %s but want %s", state.Lineage, s.readState.Lineage)
|
||||||
|
}
|
||||||
|
|
||||||
|
// We create a deep copy of the state here, because the caller also has
|
||||||
|
// a reference to the given object and can potentially go on to mutate
|
||||||
|
// it after we return, but we want the snapshot at this point in time.
|
||||||
|
s.state = state.DeepCopy()
|
||||||
|
|
||||||
|
// Force our new state to have the same serial as our read state. We'll
|
||||||
|
// update this if PersistState is called later. (We don't require nor trust
|
||||||
|
// the caller to properly maintain serial for transient state objects since
|
||||||
|
// the rest of Terraform treats state as an openly mutable object.)
|
||||||
|
//
|
||||||
|
// If we have no read state then we assume we're either writing a new
|
||||||
|
// state for the first time or we're migrating a state from elsewhere,
|
||||||
|
// and in both cases we wish to retain the lineage and serial from
|
||||||
|
// the given state.
|
||||||
|
if s.readState != nil {
|
||||||
|
s.state.Serial = s.readState.Serial
|
||||||
|
}
|
||||||
|
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -58,7 +80,7 @@ func (s *State) RefreshState() error {
|
||||||
}
|
}
|
||||||
|
|
||||||
s.state = state
|
s.state = state
|
||||||
s.readState = state
|
s.readState = s.state.DeepCopy() // our states must be separate instances so we can track changes
|
||||||
return nil
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
|
@ -67,14 +89,28 @@ func (s *State) PersistState() error {
|
||||||
s.mu.Lock()
|
s.mu.Lock()
|
||||||
defer s.mu.Unlock()
|
defer s.mu.Unlock()
|
||||||
|
|
||||||
s.state.IncrementSerialMaybe(s.readState)
|
if !s.state.MarshalEqual(s.readState) {
|
||||||
|
// Our new state does not marshal as byte-for-byte identical to
|
||||||
|
// the old, so we need to increment the serial.
|
||||||
|
// Note that in WriteState we force the serial to match that of
|
||||||
|
// s.readState, if we have a readState.
|
||||||
|
s.state.Serial++
|
||||||
|
}
|
||||||
|
|
||||||
var buf bytes.Buffer
|
var buf bytes.Buffer
|
||||||
if err := terraform.WriteState(s.state, &buf); err != nil {
|
if err := terraform.WriteState(s.state, &buf); err != nil {
|
||||||
return err
|
return err
|
||||||
}
|
}
|
||||||
|
|
||||||
return s.Client.Put(buf.Bytes())
|
err := s.Client.Put(buf.Bytes())
|
||||||
|
if err != nil {
|
||||||
|
return err
|
||||||
|
}
|
||||||
|
|
||||||
|
// After we've successfully persisted, what we just wrote is our new
|
||||||
|
// reference state until someone calls RefreshState again.
|
||||||
|
s.readState = s.state.DeepCopy()
|
||||||
|
return nil
|
||||||
}
|
}
|
||||||
|
|
||||||
// Lock calls the Client's Lock method if it's implemented.
|
// Lock calls the Client's Lock method if it's implemented.
|
||||||
|
|
|
@ -36,6 +36,11 @@ type State interface {
|
||||||
// the state here must not error. Loading the state fresh (an operation that
|
// the state here must not error. Loading the state fresh (an operation that
|
||||||
// can likely error) should be implemented by RefreshState. If a state hasn't
|
// can likely error) should be implemented by RefreshState. If a state hasn't
|
||||||
// been loaded yet, it is okay for State to return nil.
|
// been loaded yet, it is okay for State to return nil.
|
||||||
|
//
|
||||||
|
// Each caller of this function must get a distinct copy of the state, and
|
||||||
|
// it must also be distinct from any instance cached inside the reader, to
|
||||||
|
// ensure that mutations of the returned state will not affect the values
|
||||||
|
// returned to other callers.
|
||||||
type StateReader interface {
|
type StateReader interface {
|
||||||
State() *terraform.State
|
State() *terraform.State
|
||||||
}
|
}
|
||||||
|
@ -43,6 +48,15 @@ type StateReader interface {
|
||||||
// StateWriter is the interface that must be implemented by something that
|
// StateWriter is the interface that must be implemented by something that
|
||||||
// can write a state. Writing the state can be cached or in-memory, as
|
// can write a state. Writing the state can be cached or in-memory, as
|
||||||
// full persistence should be implemented by StatePersister.
|
// full persistence should be implemented by StatePersister.
|
||||||
|
//
|
||||||
|
// Implementors that cache the state in memory _must_ take a copy of it
|
||||||
|
// before returning, since the caller may continue to modify it once
|
||||||
|
// control returns. The caller must ensure that the state instance is not
|
||||||
|
// concurrently modified _during_ the call, or behavior is undefined.
|
||||||
|
//
|
||||||
|
// If an object implements StatePersister in conjunction with StateReader
|
||||||
|
// then these methods must coordinate such that a subsequent read returns
|
||||||
|
// a copy of the most recent write, even if it has not yet been persisted.
|
||||||
type StateWriter interface {
|
type StateWriter interface {
|
||||||
WriteState(*terraform.State) error
|
WriteState(*terraform.State) error
|
||||||
}
|
}
|
||||||
|
@ -57,6 +71,10 @@ type StateRefresher interface {
|
||||||
// StatePersister is implemented to truly persist a state. Whereas StateWriter
|
// StatePersister is implemented to truly persist a state. Whereas StateWriter
|
||||||
// is allowed to perhaps be caching in memory, PersistState must write the
|
// is allowed to perhaps be caching in memory, PersistState must write the
|
||||||
// state to some durable storage.
|
// state to some durable storage.
|
||||||
|
//
|
||||||
|
// If an object implements StatePersister in conjunction with StateReader
|
||||||
|
// and/or StateRefresher then these methods must coordinate such that
|
||||||
|
// subsequent reads after a persist return an updated value.
|
||||||
type StatePersister interface {
|
type StatePersister interface {
|
||||||
PersistState() error
|
PersistState() error
|
||||||
}
|
}
|
||||||
|
|
|
@ -31,6 +31,12 @@ func TestState(t *testing.T, s interface{}) {
|
||||||
t.Fatalf("not initial:\n%#v\n\n%#v", state, current)
|
t.Fatalf("not initial:\n%#v\n\n%#v", state, current)
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// Now we've proven that the state we're starting with is an initial
|
||||||
|
// state, we'll complete our work here with that state, since otherwise
|
||||||
|
// further writes would violate the invariant that we only try to write
|
||||||
|
// states that share the same lineage as what was initially written.
|
||||||
|
current = reader.State()
|
||||||
|
|
||||||
// Write a new state and verify that we have it
|
// Write a new state and verify that we have it
|
||||||
if ws, ok := s.(StateWriter); ok {
|
if ws, ok := s.(StateWriter); ok {
|
||||||
current.AddModuleState(&terraform.ModuleState{
|
current.AddModuleState(&terraform.ModuleState{
|
||||||
|
@ -74,12 +80,12 @@ func TestState(t *testing.T, s interface{}) {
|
||||||
}
|
}
|
||||||
|
|
||||||
// If we can write and persist then verify that the serial
|
// If we can write and persist then verify that the serial
|
||||||
// is only implemented on change.
|
// is only incremented on change.
|
||||||
writer, writeOk := s.(StateWriter)
|
writer, writeOk := s.(StateWriter)
|
||||||
persister, persistOk := s.(StatePersister)
|
persister, persistOk := s.(StatePersister)
|
||||||
if writeOk && persistOk {
|
if writeOk && persistOk {
|
||||||
// Same serial
|
// Same serial
|
||||||
serial := current.Serial
|
serial := reader.State().Serial
|
||||||
if err := writer.WriteState(current); err != nil {
|
if err := writer.WriteState(current); err != nil {
|
||||||
t.Fatalf("err: %s", err)
|
t.Fatalf("err: %s", err)
|
||||||
}
|
}
|
||||||
|
@ -88,7 +94,7 @@ func TestState(t *testing.T, s interface{}) {
|
||||||
}
|
}
|
||||||
|
|
||||||
if reader.State().Serial != serial {
|
if reader.State().Serial != serial {
|
||||||
t.Fatalf("bad: expected %d, got %d", serial, reader.State().Serial)
|
t.Fatalf("serial changed after persisting with no changes: got %d, want %d", reader.State().Serial, serial)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Change the serial
|
// Change the serial
|
||||||
|
@ -113,7 +119,7 @@ func TestState(t *testing.T, s interface{}) {
|
||||||
}
|
}
|
||||||
|
|
||||||
if reader.State().Serial <= serial {
|
if reader.State().Serial <= serial {
|
||||||
t.Fatalf("bad: expected %d, got %d", serial, reader.State().Serial)
|
t.Fatalf("serial incorrect after persisting with changes: got %d, want > %d", reader.State().Serial, serial)
|
||||||
}
|
}
|
||||||
|
|
||||||
// Check that State() returns a copy by modifying the copy and comparing
|
// Check that State() returns a copy by modifying the copy and comparing
|
||||||
|
|
|
@ -533,6 +533,43 @@ func (s *State) equal(other *State) bool {
|
||||||
return true
|
return true
|
||||||
}
|
}
|
||||||
|
|
||||||
|
// MarshalEqual is similar to Equal but provides a stronger definition of
|
||||||
|
// "equal", where two states are equal if and only if their serialized form
|
||||||
|
// is byte-for-byte identical.
|
||||||
|
//
|
||||||
|
// This is primarily useful for callers that are trying to save snapshots
|
||||||
|
// of state to persistent storage, allowing them to detect when a new
|
||||||
|
// snapshot must be taken.
|
||||||
|
//
|
||||||
|
// Note that the serial number and lineage are included in the serialized form,
|
||||||
|
// so it's the caller's responsibility to properly manage these attributes
|
||||||
|
// so that this method is only called on two states that have the same
|
||||||
|
// serial and lineage, unless detecting such differences is desired.
|
||||||
|
func (s *State) MarshalEqual(other *State) bool {
|
||||||
|
if s == nil && other == nil {
|
||||||
|
return true
|
||||||
|
} else if s == nil || other == nil {
|
||||||
|
return false
|
||||||
|
}
|
||||||
|
|
||||||
|
recvBuf := &bytes.Buffer{}
|
||||||
|
otherBuf := &bytes.Buffer{}
|
||||||
|
|
||||||
|
err := WriteState(s, recvBuf)
|
||||||
|
if err != nil {
|
||||||
|
// should never happen, since we're writing to a buffer
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
err = WriteState(other, otherBuf)
|
||||||
|
if err != nil {
|
||||||
|
// should never happen, since we're writing to a buffer
|
||||||
|
panic(err)
|
||||||
|
}
|
||||||
|
|
||||||
|
return bytes.Equal(recvBuf.Bytes(), otherBuf.Bytes())
|
||||||
|
}
|
||||||
|
|
||||||
type StateAgeComparison int
|
type StateAgeComparison int
|
||||||
|
|
||||||
const (
|
const (
|
||||||
|
@ -603,6 +640,10 @@ func (s *State) SameLineage(other *State) bool {
|
||||||
// DeepCopy performs a deep copy of the state structure and returns
|
// DeepCopy performs a deep copy of the state structure and returns
|
||||||
// a new structure.
|
// a new structure.
|
||||||
func (s *State) DeepCopy() *State {
|
func (s *State) DeepCopy() *State {
|
||||||
|
if s == nil {
|
||||||
|
return nil
|
||||||
|
}
|
||||||
|
|
||||||
copy, err := copystructure.Config{Lock: true}.Copy(s)
|
copy, err := copystructure.Config{Lock: true}.Copy(s)
|
||||||
if err != nil {
|
if err != nil {
|
||||||
panic(err)
|
panic(err)
|
||||||
|
@ -611,30 +652,6 @@ func (s *State) DeepCopy() *State {
|
||||||
return copy.(*State)
|
return copy.(*State)
|
||||||
}
|
}
|
||||||
|
|
||||||
// IncrementSerialMaybe increments the serial number of this state
|
|
||||||
// if it different from the other state.
|
|
||||||
func (s *State) IncrementSerialMaybe(other *State) {
|
|
||||||
if s == nil {
|
|
||||||
return
|
|
||||||
}
|
|
||||||
if other == nil {
|
|
||||||
return
|
|
||||||
}
|
|
||||||
s.Lock()
|
|
||||||
defer s.Unlock()
|
|
||||||
|
|
||||||
if s.Serial > other.Serial {
|
|
||||||
return
|
|
||||||
}
|
|
||||||
if other.TFVersion != s.TFVersion || !s.equal(other) {
|
|
||||||
if other.Serial > s.Serial {
|
|
||||||
s.Serial = other.Serial
|
|
||||||
}
|
|
||||||
|
|
||||||
s.Serial++
|
|
||||||
}
|
|
||||||
}
|
|
||||||
|
|
||||||
// FromFutureTerraform checks if this state was written by a Terraform
|
// FromFutureTerraform checks if this state was written by a Terraform
|
||||||
// version from the future.
|
// version from the future.
|
||||||
func (s *State) FromFutureTerraform() bool {
|
func (s *State) FromFutureTerraform() bool {
|
||||||
|
|
|
@ -631,87 +631,121 @@ func TestStateSameLineage(t *testing.T) {
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
func TestStateIncrementSerialMaybe(t *testing.T) {
|
func TestStateMarshalEqual(t *testing.T) {
|
||||||
cases := map[string]struct {
|
tests := map[string]struct {
|
||||||
S1, S2 *State
|
S1, S2 *State
|
||||||
Serial int64
|
Want bool
|
||||||
}{
|
}{
|
||||||
"S2 is nil": {
|
"both nil": {
|
||||||
|
nil,
|
||||||
|
nil,
|
||||||
|
true,
|
||||||
|
},
|
||||||
|
"first zero, second nil": {
|
||||||
&State{},
|
&State{},
|
||||||
nil,
|
nil,
|
||||||
0,
|
false,
|
||||||
},
|
},
|
||||||
"S2 is identical": {
|
"first nil, second zero": {
|
||||||
|
nil,
|
||||||
&State{},
|
&State{},
|
||||||
&State{},
|
false,
|
||||||
0,
|
|
||||||
},
|
},
|
||||||
"S2 is different": {
|
"both zero": {
|
||||||
|
// These are not equal because they both implicitly init with
|
||||||
|
// different lineage.
|
||||||
&State{},
|
&State{},
|
||||||
|
&State{},
|
||||||
|
false,
|
||||||
|
},
|
||||||
|
"both set, same lineage": {
|
||||||
&State{
|
&State{
|
||||||
Modules: []*ModuleState{
|
Lineage: "abc123",
|
||||||
&ModuleState{Path: rootModulePath},
|
|
||||||
},
|
|
||||||
},
|
},
|
||||||
1,
|
|
||||||
},
|
|
||||||
"S2 is different, but only via Instance Metadata": {
|
|
||||||
&State{
|
&State{
|
||||||
Serial: 3,
|
Lineage: "abc123",
|
||||||
|
},
|
||||||
|
true,
|
||||||
|
},
|
||||||
|
"both set, same lineage, different serial": {
|
||||||
|
&State{
|
||||||
|
Lineage: "abc123",
|
||||||
|
Serial: 1,
|
||||||
|
},
|
||||||
|
&State{
|
||||||
|
Lineage: "abc123",
|
||||||
|
Serial: 2,
|
||||||
|
},
|
||||||
|
false,
|
||||||
|
},
|
||||||
|
"both set, same lineage, same serial, same resources": {
|
||||||
|
&State{
|
||||||
|
Lineage: "abc123",
|
||||||
|
Serial: 1,
|
||||||
Modules: []*ModuleState{
|
Modules: []*ModuleState{
|
||||||
&ModuleState{
|
{
|
||||||
Path: rootModulePath,
|
Path: []string{"root"},
|
||||||
Resources: map[string]*ResourceState{
|
Resources: map[string]*ResourceState{
|
||||||
"test_instance.foo": &ResourceState{
|
"foo_bar.baz": {},
|
||||||
Primary: &InstanceState{
|
|
||||||
Meta: map[string]interface{}{},
|
|
||||||
},
|
|
||||||
},
|
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
&State{
|
&State{
|
||||||
Serial: 3,
|
Lineage: "abc123",
|
||||||
|
Serial: 1,
|
||||||
Modules: []*ModuleState{
|
Modules: []*ModuleState{
|
||||||
&ModuleState{
|
{
|
||||||
Path: rootModulePath,
|
Path: []string{"root"},
|
||||||
Resources: map[string]*ResourceState{
|
Resources: map[string]*ResourceState{
|
||||||
"test_instance.foo": &ResourceState{
|
"foo_bar.baz": {},
|
||||||
Primary: &InstanceState{
|
|
||||||
Meta: map[string]interface{}{
|
|
||||||
"schema_version": "1",
|
|
||||||
},
|
|
||||||
},
|
|
||||||
},
|
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
4,
|
true,
|
||||||
},
|
},
|
||||||
"S1 serial is higher": {
|
"both set, same lineage, same serial, different resources": {
|
||||||
&State{Serial: 5},
|
|
||||||
&State{
|
&State{
|
||||||
Serial: 3,
|
Lineage: "abc123",
|
||||||
|
Serial: 1,
|
||||||
Modules: []*ModuleState{
|
Modules: []*ModuleState{
|
||||||
&ModuleState{Path: rootModulePath},
|
{
|
||||||
|
Path: []string{"root"},
|
||||||
|
Resources: map[string]*ResourceState{
|
||||||
|
"foo_bar.baz": {},
|
||||||
|
},
|
||||||
|
},
|
||||||
},
|
},
|
||||||
},
|
},
|
||||||
5,
|
&State{
|
||||||
},
|
Lineage: "abc123",
|
||||||
"S2 has a different TFVersion": {
|
Serial: 1,
|
||||||
&State{TFVersion: "0.1"},
|
Modules: []*ModuleState{
|
||||||
&State{TFVersion: "0.2"},
|
{
|
||||||
1,
|
Path: []string{"root"},
|
||||||
|
Resources: map[string]*ResourceState{
|
||||||
|
"pizza_crust.tasty": {},
|
||||||
|
},
|
||||||
|
},
|
||||||
|
},
|
||||||
|
},
|
||||||
|
false,
|
||||||
},
|
},
|
||||||
}
|
}
|
||||||
|
|
||||||
for name, tc := range cases {
|
for name, test := range tests {
|
||||||
tc.S1.IncrementSerialMaybe(tc.S2)
|
t.Run(name, func(t *testing.T) {
|
||||||
if tc.S1.Serial != tc.Serial {
|
got := test.S1.MarshalEqual(test.S2)
|
||||||
t.Fatalf("Bad: %s\nGot: %d", name, tc.S1.Serial)
|
if got != test.Want {
|
||||||
}
|
t.Errorf("wrong result %#v; want %#v", got, test.Want)
|
||||||
|
s1Buf := &bytes.Buffer{}
|
||||||
|
s2Buf := &bytes.Buffer{}
|
||||||
|
_ = WriteState(test.S1, s1Buf)
|
||||||
|
_ = WriteState(test.S2, s2Buf)
|
||||||
|
t.Logf("\nState 1: %s\nState 2: %s", s1Buf.Bytes(), s2Buf.Bytes())
|
||||||
|
}
|
||||||
|
})
|
||||||
}
|
}
|
||||||
}
|
}
|
||||||
|
|
||||||
|
|
Loading…
Reference in New Issue