@@ -123,17 +123,17 @@ func decodeNode(hash, buf []byte, cachegen uint16) (node, error) {
123
123
}
124
124
switch c , _ := rlp .CountValues (elems ); c {
125
125
case 2 :
126
- n , err := decodeShort (hash , buf , elems , cachegen )
126
+ n , err := decodeShort (hash , elems , cachegen )
127
127
return n , wrapError (err , "short" )
128
128
case 17 :
129
- n , err := decodeFull (hash , buf , elems , cachegen )
129
+ n , err := decodeFull (hash , elems , cachegen )
130
130
return n , wrapError (err , "full" )
131
131
default :
132
132
return nil , fmt .Errorf ("invalid number of list elements: %v" , c )
133
133
}
134
134
}
135
135
136
- func decodeShort (hash , buf , elems []byte , cachegen uint16 ) (node , error ) {
136
+ func decodeShort (hash , elems []byte , cachegen uint16 ) (node , error ) {
137
137
kbuf , rest , err := rlp .SplitString (elems )
138
138
if err != nil {
139
139
return nil , err
@@ -155,7 +155,7 @@ func decodeShort(hash, buf, elems []byte, cachegen uint16) (node, error) {
155
155
return & shortNode {key , r , flag }, nil
156
156
}
157
157
158
- func decodeFull (hash , buf , elems []byte , cachegen uint16 ) (* fullNode , error ) {
158
+ func decodeFull (hash , elems []byte , cachegen uint16 ) (* fullNode , error ) {
159
159
n := & fullNode {flags : nodeFlag {hash : hash , gen : cachegen }}
160
160
for i := 0 ; i < 16 ; i ++ {
161
161
cld , rest , err := decodeRef (elems , cachegen )
0 commit comments