mleku/next.orly.dev
1
0
Fork 1
Code Issues 2 Pull Requests Actions Packages Projects Releases Wiki Activity

Simplify buffer allocation logic in event encoding by adjusting size calculations for improved performance and reduced complexity.

Browse Source
This commit is contained in:
mleku
2025-09-12 16:25:37 +01:00
parent 3ec2f60e0b
commit 45c31795e7
1 changed files with 1 additions and 1 deletions
Download Patch File Download Diff File Expand all files Collapse all files

2
pkg/encoders/event/event.go
View File

@@ -121,7 +121,7 @@ func (ev *E) Marshal(dst []byte) (b []byte) {
// integrates properly with the buffer pool, reducing GC pressure and // integrates properly with the buffer pool, reducing GC pressure and
// avoiding new heap allocations. // avoiding new heap allocations.
if cap(b) < len(b)+len(ev.Content)+7+256+2 { if cap(b) < len(b)+len(ev.Content)+7+256+2 {
b2 := make([]byte, len(b)+len(ev.Content)*2+7+256+2) b2 := make([]byte, len(b)+len(ev.Content)*2+512)
copy(b2, b) copy(b2, b)
b2 = b2[:len(b)] b2 = b2[:len(b)]
// return the old buffer to the pool for reuse. // return the old buffer to the pool for reuse.