Skip to content

bugfix: decode prefermance issue fix #375

New issue

Have a question about this project? Sign up for a free GitHub account to open an issue and contact its maintainers and the community.

By clicking “Sign up for GitHub”, you agree to our terms of service and privacy statement. We’ll occasionally send you account related emails.

Already on GitHub? Sign in to your account

Open
wants to merge 4 commits into
base: master
Choose a base branch
from
Open
Show file tree
Hide file tree
Changes from 1 commit
Commits
File filter

Filter by extension

Filter by extension

Conversations
Failed to load comments.
Loading
Jump to
Jump to file
Failed to load files.
Loading
Diff view
Diff view
15 changes: 13 additions & 2 deletions decode.go
Original file line number Diff line number Diff line change
Expand Up @@ -42,6 +42,9 @@ type Decoder struct {
// In non-strict mode, a class data will be decoded to a map when the class is not registered.
// The default is non-strict mode, user can change it as required.
Strict bool

// count Decode() recursive depth
decodeRecursiveDepth int
}

// FindClassInfo find ClassInfo for the given name in decoder class info list.
Expand Down Expand Up @@ -237,13 +240,21 @@ func (d *Decoder) decMapType() (reflect.Type, error) {

// Decode parse hessian data, and ensure the reflection value unpacked
func (d *Decoder) Decode() (interface{}, error) {
d.decodeRecursiveDepth++
defer func() { d.decodeRecursiveDepth-- }()

v, err := d.DecodeValue()
if err != nil {
return nil, err
}

for _, holder := range d.refHolders {
holder.notify()
// Decode() will be invoked recursively.
// d.refHolders.notify() should run only at the outermost level
// to prevent performance issue
if d.decodeRecursiveDepth == 1 {
for _, holder := range d.refHolders {
holder.notify()
}
}

return EnsureRawAny(v), nil
Expand Down
93 changes: 93 additions & 0 deletions decode_largedata_test.go
Original file line number Diff line number Diff line change
@@ -0,0 +1,93 @@
package hessian

import (
"encoding/json"
"fmt"
"math/rand"
"testing"
"time"
)

func TestDecodeLargeData(t *testing.T) {
largeData := generateLargeMap(3, 5) // about 10MB

now := time.Now()
largeDataJson, err := json.Marshal(largeData)
if err != nil {
panic(err)
}
fmt.Printf("json serialize %s %dKB\n", time.Since(now), len(largeDataJson)/1024)
now = time.Now()

var data map[string]interface{}
err = json.Unmarshal(largeDataJson, &data)
if err != nil {
panic(err)
}
fmt.Printf("json deserialize %s\n", time.Since(now))
now = time.Now()

encoder := NewEncoder()
err = encoder.Encode(data)
if err != nil {
panic(err)
}
bytes := encoder.Buffer()
fmt.Printf("hessian2 serialize %s %dKB\n", time.Since(now), len(bytes)/1024)
now = time.Now()

now = time.Now()
decoder := NewDecoder(bytes)
obj, err := decoder.Decode()
if err != nil {
panic(err)
}
rt := time.Since(now)
fmt.Printf("hessian2 deserialize %s\n", rt)

if rt > 1*time.Second {
t.Error("deserialize too slow")
}
if fmt.Sprintf("%v", obj) != fmt.Sprintf("%v", data) {
t.Error("deserialize mismatched")
}
}

func generateLargeMap(depth int, size int) map[string]interface{} {
data := map[string]interface{}{}

if depth != 0 {
// generate sub map
for i := 0; i < size; i++ {
data[fmt.Sprintf("m%d", i)] = generateLargeMap(depth-1, size)
}

// generate sub list
for i := 0; i < size; i++ {
var sublist []interface{}
for j := 0; j < size; j++ {
sublist = append(sublist, generateLargeMap(depth-1, size))
}
data[fmt.Sprintf("l%d", i)] = sublist
}
}

// generate string element
for i := 0; i < size; i++ {
data[fmt.Sprintf("s%d", i)] = generateRandomString()
}
// generate int element
for i := 0; i < size; i++ {
data[fmt.Sprintf("i%d", i)] = rand.Int31()
}
// generate float element
for i := 0; i < size; i++ {
data[fmt.Sprintf("f%d", i)] = rand.Float32()
}

return data
}

func generateRandomString() string {
return "abcdefghijklmnopqrstuvwxyzABCDEFGHIJKLMNOPQRSTUVWXYZ0123456789"[rand.Int31n(20):]
}
Loading