forked from gagliardetto/solana-go
-
Notifications
You must be signed in to change notification settings - Fork 0
/
message.go
871 lines (772 loc) · 27 KB
/
message.go
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
608
609
610
611
612
613
614
615
616
617
618
619
620
621
622
623
624
625
626
627
628
629
630
631
632
633
634
635
636
637
638
639
640
641
642
643
644
645
646
647
648
649
650
651
652
653
654
655
656
657
658
659
660
661
662
663
664
665
666
667
668
669
670
671
672
673
674
675
676
677
678
679
680
681
682
683
684
685
686
687
688
689
690
691
692
693
694
695
696
697
698
699
700
701
702
703
704
705
706
707
708
709
710
711
712
713
714
715
716
717
718
719
720
721
722
723
724
725
726
727
728
729
730
731
732
733
734
735
736
737
738
739
740
741
742
743
744
745
746
747
748
749
750
751
752
753
754
755
756
757
758
759
760
761
762
763
764
765
766
767
768
769
770
771
772
773
774
775
776
777
778
779
780
781
782
783
784
785
786
787
788
789
790
791
792
793
794
795
796
797
798
799
800
801
802
803
804
805
806
807
808
809
810
811
812
813
814
815
816
817
818
819
820
821
822
823
824
825
826
827
828
829
830
831
832
833
834
835
836
837
838
839
840
841
842
843
844
845
846
847
848
849
850
851
852
853
854
855
856
857
858
859
860
861
862
863
864
865
866
867
868
869
870
871
// Copyright 2021 github.com/gagliardetto
// This file has been modified by github.com/gagliardetto
//
// Copyright 2020 dfuse Platform Inc.
//
// Licensed under the Apache License, Version 2.0 (the "License");
// you may not use this file except in compliance with the License.
// You may obtain a copy of the License at
//
// http://www.apache.org/licenses/LICENSE-2.0
//
// Unless required by applicable law or agreed to in writing, software
// distributed under the License is distributed on an "AS IS" BASIS,
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
// See the License for the specific language governing permissions and
// limitations under the License.
package solana
import (
"encoding/base64"
"fmt"
bin "github.com/gagliardetto/binary"
"github.com/gagliardetto/treeout"
"github.com/gagliardetto/solana-go/text"
)
type MessageAddressTableLookupSlice []MessageAddressTableLookup
// NumLookups returns the number of accounts from all the lookups.
func (lookups MessageAddressTableLookupSlice) NumLookups() int {
count := 0
for _, lookup := range lookups {
count += len(lookup.ReadonlyIndexes)
count += len(lookup.WritableIndexes)
}
return count
}
// NumWritableLookups returns the number of writable accounts
// across all the lookups (all the address tables).
func (lookups MessageAddressTableLookupSlice) NumWritableLookups() int {
count := 0
for _, lookup := range lookups {
count += len(lookup.WritableIndexes)
}
return count
}
// GetTableIDs returns the list of all address table IDs.
func (lookups MessageAddressTableLookupSlice) GetTableIDs() PublicKeySlice {
if lookups == nil {
return nil
}
ids := make(PublicKeySlice, 0)
for _, lookup := range lookups {
ids.UniqueAppend(lookup.AccountKey)
}
return ids
}
type MessageAddressTableLookup struct {
AccountKey PublicKey `json:"accountKey"` // The account key of the address table.
WritableIndexes Uint8SliceAsNum `json:"writableIndexes"`
ReadonlyIndexes Uint8SliceAsNum `json:"readonlyIndexes"`
}
// Uint8SliceAsNum is a slice of uint8s that can be marshaled as numbers instead of a byte slice.
type Uint8SliceAsNum []uint8
// MarshalJSON implements json.Marshaler.
func (slice Uint8SliceAsNum) MarshalJSON() ([]byte, error) {
out := make([]uint16, len(slice))
for i, idx := range slice {
out[i] = uint16(idx)
}
return json.Marshal(out)
}
type MessageVersion int
const (
MessageVersionLegacy MessageVersion = 0 // default
MessageVersionV0 MessageVersion = 1 // v0
)
type Message struct {
version MessageVersion
// List of base-58 encoded public keys used by the transaction,
// including by the instructions and for signatures.
// The first `message.header.numRequiredSignatures` public keys must sign the transaction.
AccountKeys PublicKeySlice `json:"accountKeys"` // static keys; static keys + dynamic keys if after resolution (i.e. call to `ResolveLookups()`)
// Details the account types and signatures required by the transaction.
Header MessageHeader `json:"header"`
// A base-58 encoded hash of a recent block in the ledger used to
// prevent transaction duplication and to give transactions lifetimes.
RecentBlockhash Hash `json:"recentBlockhash"`
// List of program instructions that will be executed in sequence
// and committed in one atomic transaction if all succeed.
Instructions []CompiledInstruction `json:"instructions"`
// List of address table lookups used to load additional accounts for this transaction.
AddressTableLookups MessageAddressTableLookupSlice `json:"addressTableLookups"`
// The actual tables that contain the list of account pubkeys.
// NOTE: you need to fetch these from the chain, and then call `SetAddressTables`
// before you use this transaction -- otherwise, you will get a panic.
addressTables map[PublicKey]PublicKeySlice
resolved bool // if true, the lookups have been resolved, and the `AccountKeys` slice contains all the accounts (static + dynamic).
}
// SetAddressTables sets the actual address tables used by this message.
// Use `mx.GetAddressTableLookups().GetTableIDs()` to get the list of all address table IDs.
// NOTE: you can call this once.
func (mx *Message) SetAddressTables(tables map[PublicKey]PublicKeySlice) error {
if mx.addressTables != nil {
return fmt.Errorf("address tables already set")
}
mx.addressTables = tables
return nil
}
// GetAddressTables returns the actual address tables used by this message.
// NOTE: you must have called `SetAddressTable` before being able to use this method.
func (mx *Message) GetAddressTables() map[PublicKey]PublicKeySlice {
return mx.addressTables
}
var _ bin.EncoderDecoder = &Message{}
// SetVersion sets the message version.
// This method forces the message to be encoded in the specified version.
// NOTE: if you set lookups, the version will default to V0.
func (m *Message) SetVersion(version MessageVersion) *Message {
// check if the version is valid
switch version {
case MessageVersionV0, MessageVersionLegacy:
default:
panic(fmt.Errorf("invalid message version: %d", version))
}
m.version = version
return m
}
// GetVersion returns the message version.
func (m *Message) GetVersion() MessageVersion {
return m.version
}
// SetAddressTableLookups (re)sets the lookups used by this message.
func (mx *Message) SetAddressTableLookups(lookups []MessageAddressTableLookup) *Message {
mx.AddressTableLookups = lookups
mx.version = MessageVersionV0
return mx
}
// AddAddressTableLookup adds a new lookup to the message.
func (mx *Message) AddAddressTableLookup(lookup MessageAddressTableLookup) *Message {
mx.AddressTableLookups = append(mx.AddressTableLookups, lookup)
mx.version = MessageVersionV0
return mx
}
// GetAddressTableLookups returns the lookups used by this message.
func (mx *Message) GetAddressTableLookups() MessageAddressTableLookupSlice {
return mx.AddressTableLookups
}
func (mx Message) NumLookups() int {
if mx.AddressTableLookups == nil {
return 0
}
return mx.AddressTableLookups.NumLookups()
}
func (mx Message) NumWritableLookups() int {
if mx.AddressTableLookups == nil {
return 0
}
return mx.AddressTableLookups.NumWritableLookups()
}
func (mx Message) MarshalJSON() ([]byte, error) {
if mx.version == MessageVersionLegacy {
out := struct {
AccountKeys []string `json:"accountKeys"`
Header MessageHeader `json:"header"`
RecentBlockhash string `json:"recentBlockhash"`
Instructions []CompiledInstruction `json:"instructions"`
}{
AccountKeys: make([]string, len(mx.AccountKeys)),
Header: mx.Header,
RecentBlockhash: mx.RecentBlockhash.String(),
Instructions: mx.Instructions,
}
for i, key := range mx.AccountKeys {
out.AccountKeys[i] = key.String()
}
return json.Marshal(out)
}
// Versioned message:
out := struct {
AccountKeys []string `json:"accountKeys"`
Header MessageHeader `json:"header"`
RecentBlockhash string `json:"recentBlockhash"`
Instructions []CompiledInstruction `json:"instructions"`
AddressTableLookups []MessageAddressTableLookup `json:"addressTableLookups"`
}{
AccountKeys: make([]string, len(mx.AccountKeys)),
Header: mx.Header,
RecentBlockhash: mx.RecentBlockhash.String(),
Instructions: mx.Instructions,
AddressTableLookups: mx.AddressTableLookups,
}
for i, key := range mx.AccountKeys {
out.AccountKeys[i] = key.String()
}
if out.AddressTableLookups == nil {
out.AddressTableLookups = make([]MessageAddressTableLookup, 0)
}
return json.Marshal(out)
}
func (mx *Message) EncodeToTree(txTree treeout.Branches) {
switch mx.version {
case MessageVersionV0:
txTree.Child("Version: v0")
case MessageVersionLegacy:
txTree.Child("Version: legacy")
default:
txTree.Child(text.Sf("Version (unknown): %v", mx.version))
}
txTree.Child(text.Sf("RecentBlockhash: %s", mx.RecentBlockhash))
txTree.Child(fmt.Sprintf("AccountKeys[len=%v]", mx.numStaticAccounts()+mx.AddressTableLookups.NumLookups())).ParentFunc(func(accountKeysBranch treeout.Branches) {
accountKeys, err := mx.AccountMetaList()
if err != nil {
accountKeysBranch.Child(text.RedBG(fmt.Sprintf("AccountMetaList: %s", err)))
} else {
for keyIndex, key := range accountKeys {
isFromTable := mx.IsVersioned() && keyIndex >= mx.numStaticAccounts()
if isFromTable {
accountKeysBranch.Child(text.Sf("%s (from Address Table Lookup)", text.ColorizeBG(key.PublicKey.String())))
} else {
accountKeysBranch.Child(text.ColorizeBG(key.PublicKey.String()))
}
}
}
})
if mx.IsVersioned() {
txTree.Child(fmt.Sprintf("AddressTableLookups[len=%v]", len(mx.AddressTableLookups))).ParentFunc(func(lookupsBranch treeout.Branches) {
for _, lookup := range mx.AddressTableLookups {
lookupsBranch.Child(text.Sf("%s", text.ColorizeBG(lookup.AccountKey.String()))).ParentFunc(func(lookupBranch treeout.Branches) {
lookupBranch.Child(text.Sf("WritableIndexes: %v", lookup.WritableIndexes))
lookupBranch.Child(text.Sf("ReadonlyIndexes: %v", lookup.ReadonlyIndexes))
})
}
})
}
txTree.Child("Header").ParentFunc(func(message treeout.Branches) {
mx.Header.EncodeToTree(message)
})
}
func (header *MessageHeader) EncodeToTree(mxBranch treeout.Branches) {
mxBranch.Child(text.Sf("NumRequiredSignatures: %v", header.NumRequiredSignatures))
mxBranch.Child(text.Sf("NumReadonlySignedAccounts: %v", header.NumReadonlySignedAccounts))
mxBranch.Child(text.Sf("NumReadonlyUnsignedAccounts: %v", header.NumReadonlyUnsignedAccounts))
}
func (mx *Message) MarshalBinary() ([]byte, error) {
switch mx.version {
case MessageVersionV0:
return mx.MarshalV0()
case MessageVersionLegacy:
return mx.MarshalLegacy()
default:
return nil, fmt.Errorf("invalid message version: %d", mx.version)
}
}
func (mx *Message) MarshalLegacy() ([]byte, error) {
buf := []byte{
mx.Header.NumRequiredSignatures,
mx.Header.NumReadonlySignedAccounts,
mx.Header.NumReadonlyUnsignedAccounts,
}
bin.EncodeCompactU16Length(&buf, len(mx.AccountKeys))
for _, key := range mx.AccountKeys {
buf = append(buf, key[:]...)
}
buf = append(buf, mx.RecentBlockhash[:]...)
bin.EncodeCompactU16Length(&buf, len(mx.Instructions))
for _, instruction := range mx.Instructions {
buf = append(buf, byte(instruction.ProgramIDIndex))
bin.EncodeCompactU16Length(&buf, len(instruction.Accounts))
for _, accountIdx := range instruction.Accounts {
buf = append(buf, byte(accountIdx))
}
bin.EncodeCompactU16Length(&buf, len(instruction.Data))
buf = append(buf, instruction.Data...)
}
return buf, nil
}
func (mx *Message) MarshalV0() ([]byte, error) {
buf := []byte{
mx.Header.NumRequiredSignatures,
mx.Header.NumReadonlySignedAccounts,
mx.Header.NumReadonlyUnsignedAccounts,
}
{
// Encode only the keys that are not in the address table lookups.
staticAccountKeys := mx.getStaticKeys()
bin.EncodeCompactU16Length(&buf, len(staticAccountKeys))
for _, key := range staticAccountKeys {
buf = append(buf, key[:]...)
}
buf = append(buf, mx.RecentBlockhash[:]...)
bin.EncodeCompactU16Length(&buf, len(mx.Instructions))
for _, instruction := range mx.Instructions {
buf = append(buf, byte(instruction.ProgramIDIndex))
bin.EncodeCompactU16Length(&buf, len(instruction.Accounts))
for _, accountIdx := range instruction.Accounts {
buf = append(buf, byte(accountIdx))
}
bin.EncodeCompactU16Length(&buf, len(instruction.Data))
buf = append(buf, instruction.Data...)
}
}
versionNum := byte(mx.version) // TODO: what number is this?
if versionNum > 127 {
return nil, fmt.Errorf("invalid message version: %d", mx.version)
}
buf = append([]byte{byte(versionNum + 127)}, buf...)
if mx.AddressTableLookups != nil && len(mx.AddressTableLookups) > 0 {
// wite length of address table lookups as u8
buf = append(buf, byte(len(mx.AddressTableLookups)))
for _, lookup := range mx.AddressTableLookups {
// write account pubkey
buf = append(buf, lookup.AccountKey[:]...)
// write writable indexes
bin.EncodeCompactU16Length(&buf, len(lookup.WritableIndexes))
buf = append(buf, lookup.WritableIndexes...)
// write readonly indexes
bin.EncodeCompactU16Length(&buf, len(lookup.ReadonlyIndexes))
buf = append(buf, lookup.ReadonlyIndexes...)
}
} else {
buf = append(buf, 0)
}
return buf, nil
}
func (mx Message) MarshalWithEncoder(encoder *bin.Encoder) error {
out, err := mx.MarshalBinary()
if err != nil {
return err
}
return encoder.WriteBytes(out, false)
}
func (mx Message) ToBase64() string {
out, _ := mx.MarshalBinary()
return base64.StdEncoding.EncodeToString(out)
}
func (mx *Message) UnmarshalWithDecoder(decoder *bin.Decoder) (err error) {
// peek first byte to determine if this is a legacy or v0 message
versionNum, err := decoder.Peek(1)
if err != nil {
return err
}
// TODO: is this the right way to determine if this is a legacy or v0 message?
if versionNum[0] < 127 {
mx.version = MessageVersionLegacy
} else {
mx.version = MessageVersionV0
}
switch mx.version {
case MessageVersionV0:
return mx.UnmarshalV0(decoder)
case MessageVersionLegacy:
return mx.UnmarshalLegacy(decoder)
default:
return fmt.Errorf("invalid message version: %d", mx.version)
}
}
func (mx *Message) UnmarshalBase64(b64 string) error {
b, err := base64.StdEncoding.DecodeString(b64)
if err != nil {
return err
}
return mx.UnmarshalWithDecoder(bin.NewBinDecoder(b))
}
// GetAddressTableLookupAccounts associates the lookups with the accounts
// in the actual address tables, and returns the accounts.
// NOTE: you need to call `SetAddressTables` before calling this method,
// so that the lookups can be associated with the accounts in the address tables.
func (mx Message) GetAddressTableLookupAccounts() (PublicKeySlice, error) {
err := mx.checkPreconditions()
if err != nil {
return nil, err
}
var writable PublicKeySlice
var readonly PublicKeySlice
for _, lookup := range mx.AddressTableLookups {
table, ok := mx.addressTables[lookup.AccountKey]
if !ok {
return writable, fmt.Errorf("address table lookup not found for account: %s", lookup.AccountKey)
}
for _, idx := range lookup.WritableIndexes {
if int(idx) >= len(table) {
return writable, fmt.Errorf("address table lookup index out of range: %d", idx)
}
writable = append(writable, table[idx])
}
for _, idx := range lookup.ReadonlyIndexes {
if int(idx) >= len(table) {
return writable, fmt.Errorf("address table lookup index out of range: %d", idx)
}
readonly = append(readonly, table[idx])
}
}
return append(writable, readonly...), nil
}
// ResolveLookups resolves the address table lookups,
// and appends the resolved accounts to the `message.AccountKeys` field.
// NOTE: you need to call `SetAddressTables` before calling this method.
func (mx *Message) ResolveLookups() (err error) {
if mx.resolved {
return nil
}
// add accounts from the address table lookups
atlAccounts, err := mx.GetAddressTableLookupAccounts()
if err != nil {
return err
}
mx.AccountKeys = append(mx.AccountKeys, atlAccounts...)
mx.resolved = true
return nil
}
func (mx Message) IsResolved() bool {
return mx.resolved
}
// GetAllKeys returns ALL the message's account keys (including the keys from resolved address lookup tables).
func (mx Message) GetAllKeys() (keys PublicKeySlice, err error) {
if mx.resolved {
// If the message has been resolved, then the account keys have already
// been appended to the `AccountKeys` field of the message.
return mx.AccountKeys, nil
}
// If not resolved, then we need to resolve the lookups first...
atlAccounts, err := mx.GetAddressTableLookupAccounts()
if err != nil {
return keys, err
}
// ...and return the account keys with the lookups appended:
return append(mx.AccountKeys, atlAccounts...), nil
}
func (mx Message) getStaticKeys() (keys PublicKeySlice) {
if mx.resolved {
// If the message has been resolved, then the account keys have already
// been appended to the `AccountKeys` field of the message.
return mx.AccountKeys[:mx.numStaticAccounts()]
}
return mx.AccountKeys
}
func (mx *Message) UnmarshalV0(decoder *bin.Decoder) (err error) {
version, err := decoder.ReadByte()
if err != nil {
return fmt.Errorf("failed to read message version: %w", err)
}
// TODO: check version
mx.version = MessageVersion(version - 127)
// The middle of the message is the same as the legacy message:
err = mx.UnmarshalLegacy(decoder)
if err != nil {
return err
}
// Read address table lookups length:
addressTableLookupsLen, err := decoder.ReadByte()
if err != nil {
return fmt.Errorf("failed to read address table lookups length: %w", err)
}
if addressTableLookupsLen > 0 {
mx.AddressTableLookups = make([]MessageAddressTableLookup, addressTableLookupsLen)
for i := 0; i < int(addressTableLookupsLen); i++ {
// read account pubkey
_, err = decoder.Read(mx.AddressTableLookups[i].AccountKey[:])
if err != nil {
return fmt.Errorf("failed to read account pubkey: %w", err)
}
// read writable indexes
writableIndexesLen, err := decoder.ReadCompactU16()
if err != nil {
return fmt.Errorf("failed to read writable indexes length: %w", err)
}
if writableIndexesLen > decoder.Remaining() {
return fmt.Errorf("writable indexes length is too large: %d", writableIndexesLen)
}
mx.AddressTableLookups[i].WritableIndexes = make([]byte, writableIndexesLen)
_, err = decoder.Read(mx.AddressTableLookups[i].WritableIndexes)
if err != nil {
return fmt.Errorf("failed to read writable indexes: %w", err)
}
// read readonly indexes
readonlyIndexesLen, err := decoder.ReadCompactU16()
if err != nil {
return fmt.Errorf("failed to read readonly indexes length: %w", err)
}
if readonlyIndexesLen > decoder.Remaining() {
return fmt.Errorf("readonly indexes length is too large: %d", readonlyIndexesLen)
}
mx.AddressTableLookups[i].ReadonlyIndexes = make([]byte, readonlyIndexesLen)
_, err = decoder.Read(mx.AddressTableLookups[i].ReadonlyIndexes)
if err != nil {
return fmt.Errorf("failed to read readonly indexes: %w", err)
}
}
}
return nil
}
func (mx *Message) UnmarshalLegacy(decoder *bin.Decoder) (err error) {
{
mx.Header.NumRequiredSignatures, err = decoder.ReadUint8()
if err != nil {
return fmt.Errorf("unable to decode mx.Header.NumRequiredSignatures: %w", err)
}
mx.Header.NumReadonlySignedAccounts, err = decoder.ReadUint8()
if err != nil {
return fmt.Errorf("unable to decode mx.Header.NumReadonlySignedAccounts: %w", err)
}
mx.Header.NumReadonlyUnsignedAccounts, err = decoder.ReadUint8()
if err != nil {
return fmt.Errorf("unable to decode mx.Header.NumReadonlyUnsignedAccounts: %w", err)
}
}
{
numAccountKeys, err := decoder.ReadCompactU16()
if err != nil {
return fmt.Errorf("unable to decode numAccountKeys: %w", err)
}
if numAccountKeys > decoder.Remaining()/32 {
return fmt.Errorf("numAccountKeys %d is too large for remaining bytes %d", numAccountKeys, decoder.Remaining())
}
mx.AccountKeys = make(PublicKeySlice, numAccountKeys)
for i := 0; i < numAccountKeys; i++ {
_, err := decoder.Read(mx.AccountKeys[i][:])
if err != nil {
return fmt.Errorf("unable to decode mx.AccountKeys[%d]: %w", i, err)
}
}
}
{
_, err := decoder.Read(mx.RecentBlockhash[:])
if err != nil {
return fmt.Errorf("unable to decode mx.RecentBlockhash: %w", err)
}
}
{
numInstructions, err := decoder.ReadCompactU16()
if err != nil {
return fmt.Errorf("unable to decode numInstructions: %w", err)
}
if numInstructions > decoder.Remaining() {
return fmt.Errorf("numInstructions %d is greater than remaining bytes %d", numInstructions, decoder.Remaining())
}
mx.Instructions = make([]CompiledInstruction, numInstructions)
for instructionIndex := 0; instructionIndex < numInstructions; instructionIndex++ {
programIDIndex, err := decoder.ReadUint8()
if err != nil {
return fmt.Errorf("unable to decode mx.Instructions[%d].ProgramIDIndex: %w", instructionIndex, err)
}
mx.Instructions[instructionIndex].ProgramIDIndex = uint16(programIDIndex)
{
numAccounts, err := decoder.ReadCompactU16()
if err != nil {
return fmt.Errorf("unable to decode numAccounts for ix[%d]: %w", instructionIndex, err)
}
if numAccounts > decoder.Remaining() {
return fmt.Errorf("ix[%v]: numAccounts %d is greater than remaining bytes %d", instructionIndex, numAccounts, decoder.Remaining())
}
mx.Instructions[instructionIndex].Accounts = make([]uint16, numAccounts)
for i := 0; i < numAccounts; i++ {
accountIndex, err := decoder.ReadUint8()
if err != nil {
return fmt.Errorf("unable to decode accountIndex for ix[%d].Accounts[%d]: %w", instructionIndex, i, err)
}
mx.Instructions[instructionIndex].Accounts[i] = uint16(accountIndex)
}
}
{
dataLen, err := decoder.ReadCompactU16()
if err != nil {
return fmt.Errorf("unable to decode dataLen for ix[%d]: %w", instructionIndex, err)
}
if dataLen > decoder.Remaining() {
return fmt.Errorf("ix[%v]: dataLen %d is greater than remaining bytes %d", instructionIndex, dataLen, decoder.Remaining())
}
dataBytes, err := decoder.ReadBytes(dataLen)
if err != nil {
return fmt.Errorf("unable to decode dataBytes for ix[%d]: %w", instructionIndex, err)
}
mx.Instructions[instructionIndex].Data = (Base58)(dataBytes)
}
}
}
return nil
}
func (m Message) checkPreconditions() error {
// if this is versioned,
// and there are > 0 lookups,
// but the address table is empty,
// then we can't build the account meta list:
if m.IsVersioned() && m.AddressTableLookups.NumLookups() > 0 && (m.addressTables == nil || len(m.addressTables) == 0) {
return fmt.Errorf("cannot build account meta list without address tables")
}
return nil
}
func (m Message) AccountMetaList() (AccountMetaSlice, error) {
err := m.checkPreconditions()
if err != nil {
return nil, err
}
accountKeys, err := m.GetAllKeys()
if err != nil {
return nil, err
}
out := make(AccountMetaSlice, len(accountKeys))
for i, a := range accountKeys {
isWritable, err := m.IsWritable(a)
if err != nil {
return nil, err
}
out[i] = &AccountMeta{
PublicKey: a,
IsSigner: m.IsSigner(a),
IsWritable: isWritable,
}
}
return out, nil
}
func (m Message) IsVersioned() bool {
return m.version != MessageVersionLegacy
}
// Signers returns the pubkeys of all accounts that are signers.
func (m Message) Signers() PublicKeySlice {
// signers always in AccountKeys
out := make(PublicKeySlice, 0, len(m.AccountKeys))
for _, a := range m.AccountKeys {
if m.IsSigner(a) {
out = append(out, a)
}
}
return out
}
// Writable returns the pubkeys of all accounts that are writable.
func (m Message) Writable() (out PublicKeySlice, err error) {
err = m.checkPreconditions()
if err != nil {
return nil, err
}
accountKeys, err := m.GetAllKeys()
if err != nil {
return nil, err
}
for _, a := range accountKeys {
isWritable, err := m.IsWritable(a)
if err != nil {
return nil, err
}
if isWritable {
out = append(out, a)
}
}
return out, nil
}
// ResolveProgramIDIndex resolves the program ID index to a program ID.
// DEPRECATED: use `Program(index)` instead.
func (m Message) ResolveProgramIDIndex(programIDIndex uint16) (PublicKey, error) {
return m.Program(programIDIndex)
}
// Program returns the program key at the given index.
func (m Message) Program(programIDIndex uint16) (PublicKey, error) {
// programIDIndex always in AccountKeys
if int(programIDIndex) < len(m.AccountKeys) {
return m.AccountKeys[programIDIndex], nil
}
return PublicKey{}, fmt.Errorf("programID index not found %d", programIDIndex)
}
// Account returns the account at the given index.
func (m Message) Account(index uint16) (PublicKey, error) {
if int(index) < len(m.AccountKeys) {
return m.AccountKeys[index], nil
}
allKeys, err := m.GetAllKeys()
if err != nil {
return PublicKey{}, err
}
if int(index) < len(allKeys) {
return allKeys[index], nil
}
return PublicKey{}, fmt.Errorf("account index not found %d", index)
}
// GetAccountIndex returns the index of the given account (first occurrence of the account).
func (m Message) GetAccountIndex(account PublicKey) (uint16, error) {
err := m.checkPreconditions()
if err != nil {
return 0, err
}
accountKeys, err := m.GetAllKeys()
if err != nil {
return 0, err
}
for idx, a := range accountKeys {
if a.Equals(account) {
return uint16(idx), nil
}
}
return 0, fmt.Errorf("account not found: %s", account)
}
func (m Message) HasAccount(account PublicKey) (bool, error) {
err := m.checkPreconditions()
if err != nil {
return false, err
}
accountKeys, err := m.GetAllKeys()
if err != nil {
return false, err
}
for _, a := range accountKeys {
if a.Equals(account) {
return true, nil
}
}
return false, nil
}
func (m Message) IsSigner(account PublicKey) bool {
// signers always in AccountKeys
for idx, acc := range m.AccountKeys {
if acc.Equals(account) {
return idx < int(m.Header.NumRequiredSignatures)
}
}
return false
}
// numStaticAccounts returns the number of accounts that are always present in the
// account keys list (i.e. all the accounts that are NOT in the lookup table).
func (m Message) numStaticAccounts() int {
if !m.resolved {
return len(m.AccountKeys)
}
return len(m.AccountKeys) - m.NumLookups()
}
func (m Message) isWritableInLookups(idx int) bool {
if idx < m.numStaticAccounts() {
return false
}
return idx-m.numStaticAccounts() < m.AddressTableLookups.NumWritableLookups()
}
func (m Message) IsWritable(account PublicKey) (bool, error) {
err := m.checkPreconditions()
if err != nil {
return false, err
}
accountKeys, err := m.GetAllKeys()
if err != nil {
return false, err
}
index := 0
found := false
for idx, acc := range accountKeys {
if acc.Equals(account) {
found = true
index = idx
}
}
if !found {
return false, err
}
h := m.Header
if index >= m.numStaticAccounts() {
return m.isWritableInLookups(index), nil
} else if index >= int(h.NumRequiredSignatures) {
// unsignedAccountIndex < numWritableUnsignedAccounts
return index-int(h.NumRequiredSignatures) < (m.numStaticAccounts()-int(h.NumRequiredSignatures))-int(h.NumReadonlyUnsignedAccounts), nil
}
return index < int(h.NumRequiredSignatures-h.NumReadonlySignedAccounts), nil
}
func (m Message) signerKeys() PublicKeySlice {
return m.AccountKeys[0:m.Header.NumRequiredSignatures]
}
type MessageHeader struct {
// The total number of signatures required to make the transaction valid.
// The signatures must match the first `numRequiredSignatures` of `message.account_keys`.
NumRequiredSignatures uint8 `json:"numRequiredSignatures"`
// The last numReadonlySignedAccounts of the signed keys are read-only accounts.
// Programs may process multiple transactions that load read-only accounts within
// a single PoH entry, but are not permitted to credit or debit lamports or modify
// account data.
// Transactions targeting the same read-write account are evaluated sequentially.
NumReadonlySignedAccounts uint8 `json:"numReadonlySignedAccounts"`
// The last `numReadonlyUnsignedAccounts` of the unsigned keys are read-only accounts.
NumReadonlyUnsignedAccounts uint8 `json:"numReadonlyUnsignedAccounts"`
}