-
Notifications
You must be signed in to change notification settings - Fork 2.3k
Replace recursive approach with iterative approach for readPacket() #170
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
Conversation
packets.go
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
we don't need the copy without the recursion - data stays valid and appending copies it anyway
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
good point! just added a commit to remove that.
|
This makes the common case (non splitted packets) a lot more expensive and destroys our current "zero allocations" approach. |
packets.go
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@julienschmidt is you critique still valid if the append above is removed and this if becomes
if pktLen >= maxPacketSize {
payload = append(payload, data...)
continue
}
return data, nilThere was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
and (handwaving) the correct variable is returned every time... (not data if it should be payload)
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
@julienschmidt I understood what you mean.
It's doing payload = append(nil, data) for common cases. (I thought golang will do payload=data for append(nil...) but obviously not.)
We can still disable the buffer copying for common case by doing what @arnehormann suggested.
|
@julienschmidt the logic after the new patch, for the common cases (non-splitting), will not invoke any allocation (like old approach); for large packets, avoids recursive calls and copying twice. |
packets.go
Outdated
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Maybe // zero allocations for non-split packets ?
I'm not a native speaker, but to me Zero-allocation sound like allocating a zero
|
The new approach looks fine to me 👍 |
|
thanks @julienschmidt, amended suggestions to previous commits. |
|
LGTM now, final review by @arnehormann |
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
what happens when the packet length of the last packet is exactly maxPacketSize? Is that possible?
I'll look it up now, but if you know, please chime in...
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
what happens when the packet length of the last packet is exactly maxPacketSize? Is that possible?
No, a packet length of maxPacketSize marks a split packet
There was a problem hiding this comment.
Choose a reason for hiding this comment
The reason will be displayed to describe this comment to others. Learn more.
Thanks
|
LGTM before and still does... |
Replace recursive approach with iterative approach for readPacket()
Possible benefits: