-
Notifications
You must be signed in to change notification settings - Fork 4
/
michelson.go
153 lines (142 loc) · 3.21 KB
/
michelson.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
package forge
import (
"encoding/hex"
"fmt"
"github.com/dipdup-net/go-lib/tools/base"
"github.com/pkg/errors"
)
// pack prefix
const (
PackPrefix = "05"
PackPrefixByte = 0x05
)
// Michelson -
type Michelson struct {
Nodes []*base.Node
}
// NewMichelson -
func NewMichelson() *Michelson {
return &Michelson{
Nodes: make([]*base.Node, 0),
}
}
// UnforgeString -
func (m *Michelson) UnforgeString(s string) (int, error) {
b, err := hex.DecodeString(s)
if err != nil {
return 0, err
}
return m.Unforge(b)
}
// Unforge -
func (m *Michelson) Unforge(b []byte) (n int, err error) {
if len(b) == 0 {
return 0, nil
}
switch b[0] {
case ByteInt:
unforger := NewInt()
n, err = unforger.Unforge(b[1:])
if err != nil {
return n, err
}
m.Nodes = append(m.Nodes, (*base.Node)(unforger))
case ByteString:
unforger := new(String)
n, err = unforger.Unforge(b[1:])
if err != nil {
return n, err
}
m.Nodes = append(m.Nodes, (*base.Node)(unforger))
case ByteArray:
unforger := NewArray()
n, err = unforger.Unforge(b[1:])
if err != nil {
return n, err
}
m.Nodes = append(m.Nodes, (*base.Node)(unforger))
case BytePrim, BytePrimAnnots, BytePrimArg, BytePrimArgAnnots, BytePrimArgs, BytePrimArgsAnnots:
argsCount := int((b[0] - 3) / 2)
hasAnnots := b[0]%2 == 0
unforger := NewObject(argsCount, hasAnnots)
n, err = unforger.Unforge(b[1:])
if err != nil {
return n, err
}
m.Nodes = append(m.Nodes, &base.Node{
Prim: unforger.Prim,
Args: unforger.Args,
Annots: unforger.Annots,
})
case ByteGeneralPrim:
unforger := NewObject(-1, true)
n, err = unforger.Unforge(b[1:])
if err != nil {
return n, err
}
m.Nodes = append(m.Nodes, &base.Node{
Prim: unforger.Prim,
Args: unforger.Args,
Annots: unforger.Annots,
})
case ByteBytes:
unforger := new(Bytes)
n, err = unforger.Unforge(b[1:])
if err != nil {
return n, err
}
m.Nodes = append(m.Nodes, (*base.Node)(unforger))
default:
return 1, errors.Wrap(ErrUnknownTypeCode, fmt.Sprintf("%x", b[0]))
}
return n + 1, nil
}
// Forge -
func (m *Michelson) Forge() ([]byte, error) {
data := make([]byte, 0)
for i := range m.Nodes {
var forger Forger
switch {
case m.Nodes[i].IntValue != nil:
forger = (*Int)(m.Nodes[i])
case m.Nodes[i].StringValue != nil:
forger = (*String)(m.Nodes[i])
case m.Nodes[i].BytesValue != nil:
forger = (*Bytes)(m.Nodes[i])
case m.Nodes[i].Prim == PrimArray:
forger = (*Array)(m.Nodes[i])
case m.Nodes[i].Prim != "":
forger = &Object{*m.Nodes[i], -1, false}
}
body, err := forger.Forge()
if err != nil {
return nil, err
}
data = append(data, body...)
}
return data, nil
}
// Forge -
func Forge(node *base.Node) ([]byte, error) {
if node == nil {
return nil, errors.New("[Forge] Node is nil")
}
forger := NewMichelson()
forger.Nodes = []*base.Node{node}
return forger.Forge()
}
// ToString -
func ToString(node *base.Node) (string, error) {
b, err := Forge(node)
if err != nil {
return "", err
}
return hex.EncodeToString(b), nil
}
// TrimPackByte -
func TrimPackByte(data []byte) ([]byte, error) {
if len(data) == 0 || data[0] != PackPrefixByte {
return nil, errors.Errorf("Invalid unpack data: %v", data)
}
return data[1:], nil
}