Browse Source

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

main
mleku 4 months ago
parent
commit
45c31795e7
No known key found for this signature in database
  1. 2
      pkg/encoders/event/event.go

2
pkg/encoders/event/event.go

@ -121,7 +121,7 @@ func (ev *E) Marshal(dst []byte) (b []byte) { @@ -121,7 +121,7 @@ func (ev *E) Marshal(dst []byte) (b []byte) {
// integrates properly with the buffer pool, reducing GC pressure and
// avoiding new heap allocations.
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)
b2 = b2[:len(b)]
// return the old buffer to the pool for reuse.

Loading…
Cancel
Save