)
switch e := entry.(type) {
- case *bc.Issuance:
- a1 := e.Value.AssetId.Bytes()
+ case *bc.CrossChainInput:
+ mainchainOutput := tx.Entries[*e.MainchainOutputId].(*bc.IntraChainOutput)
+ a1 := mainchainOutput.Source.Value.AssetId.Bytes()
assetID = &a1
- amount = &e.Value.Amount
+ amount = &mainchainOutput.Source.Value.Amount
destPos = &e.WitnessDestination.Position
+ s := e.MainchainOutputId.Bytes()
+ spentOutputID = &s
case *bc.Spend:
spentOutput := tx.Entries[*e.SpentOutputId].(*bc.IntraChainOutput)
destPos = &e.WitnessDestination.Position
s := e.SpentOutputId.Bytes()
spentOutputID = &s
+
+ case *bc.VetoInput:
+ voteOutput := tx.Entries[*e.SpentOutputId].(*bc.VoteOutput)
+ a1 := voteOutput.Source.Value.AssetId.Bytes()
+ assetID = &a1
+ amount = &voteOutput.Source.Value.Amount
+ destPos = &e.WitnessDestination.Position
+ s := e.SpentOutputId.Bytes()
+ spentOutputID = &s
+
}
var txSigHash *[]byte
case *bc.IntraChainOutput:
return check(e.ControlProgram, e.Source.Value), nil
+ case *bc.VoteOutput:
+ return check(e.ControlProgram, e.Source.Value), nil
+
case *bc.Retirement:
var prog bc.Program
if expansion {
case *bc.Mux:
return checkMux(e)
- case *bc.Issuance:
+ case *bc.Spend:
d, ok := ec.entries[*e.WitnessDestination.Ref]
if !ok {
- return false, errors.Wrapf(bc.ErrMissingEntry, "entry for issuance destination %x not found", e.WitnessDestination.Ref.Bytes())
+ return false, errors.Wrapf(bc.ErrMissingEntry, "entry for spend destination %x not found", e.WitnessDestination.Ref.Bytes())
}
if m, ok := d.(*bc.Mux); ok {
return checkMux(m)
}
return checkEntry(d)
- case *bc.Spend:
+ case *bc.VetoInput:
d, ok := ec.entries[*e.WitnessDestination.Ref]
if !ok {
- return false, errors.Wrapf(bc.ErrMissingEntry, "entry for spend destination %x not found", e.WitnessDestination.Ref.Bytes())
+ return false, errors.Wrapf(bc.ErrMissingEntry, "entry for vetoInput destination %x not found", e.WitnessDestination.Ref.Bytes())
}
if m, ok := d.(*bc.Mux); ok {
return checkMux(m)