a246104d04
* MM-21012: Revamp websocket implementation We replace the old gorilla/websocket implementation with the gobwas/ws library. The gorilla library was in maintenance mode and had a high level API due to which we cannot use that for situations where a large number of concurrent connections needs to be supported. The ws library is a very low-level library that allows us to work with raw net.Conns. We make several improvements: - We completely remove the reader goroutines, and instead replace them with a manual epoll implementation which sends off messages to be read when it receives any data on the connection. This lets us scale to a much larger number of connections. - The reader buffer is eliminated, because we directly read from the connection now. https://mattermost.atlassian.net/browse/MM-21012 ```release-notes Improved the websocket implementation by using epoll manually to read from a websocket. As a result, the number of goroutines is expected to go down by half. ``` * fix tests * fix shadowing errors * final changes * windows support! * Remove pointer to waitgroup * Fix edge case * Trigger CI * Trigger CI Co-authored-by: Mattermod <mattermod@users.noreply.github.com>
62 строки
1.8 KiB
Go
62 строки
1.8 KiB
Go
package ws
|
|
|
|
import (
|
|
"encoding/binary"
|
|
)
|
|
|
|
// Cipher applies XOR cipher to the payload using mask.
|
|
// Offset is used to cipher chunked data (e.g. in io.Reader implementations).
|
|
//
|
|
// To convert masked data into unmasked data, or vice versa, the following
|
|
// algorithm is applied. The same algorithm applies regardless of the
|
|
// direction of the translation, e.g., the same steps are applied to
|
|
// mask the data as to unmask the data.
|
|
func Cipher(payload []byte, mask [4]byte, offset int) {
|
|
n := len(payload)
|
|
if n < 8 {
|
|
for i := 0; i < n; i++ {
|
|
payload[i] ^= mask[(offset+i)%4]
|
|
}
|
|
return
|
|
}
|
|
|
|
// Calculate position in mask due to previously processed bytes number.
|
|
mpos := offset % 4
|
|
// Count number of bytes will processed one by one from the beginning of payload.
|
|
ln := remain[mpos]
|
|
// Count number of bytes will processed one by one from the end of payload.
|
|
// This is done to process payload by 8 bytes in each iteration of main loop.
|
|
rn := (n - ln) % 8
|
|
|
|
for i := 0; i < ln; i++ {
|
|
payload[i] ^= mask[(mpos+i)%4]
|
|
}
|
|
for i := n - rn; i < n; i++ {
|
|
payload[i] ^= mask[(mpos+i)%4]
|
|
}
|
|
|
|
// NOTE: we use here binary.LittleEndian regardless of what is real
|
|
// endianess on machine is. To do so, we have to use binary.LittleEndian in
|
|
// the masking loop below as well.
|
|
var (
|
|
m = binary.LittleEndian.Uint32(mask[:])
|
|
m2 = uint64(m)<<32 | uint64(m)
|
|
)
|
|
// Skip already processed right part.
|
|
// Get number of uint64 parts remaining to process.
|
|
n = (n - ln - rn) >> 3
|
|
for i := 0; i < n; i++ {
|
|
var (
|
|
j = ln + (i << 3)
|
|
chunk = payload[j : j+8]
|
|
)
|
|
p := binary.LittleEndian.Uint64(chunk)
|
|
p = p ^ m2
|
|
binary.LittleEndian.PutUint64(chunk, p)
|
|
}
|
|
}
|
|
|
|
// remain maps position in masking key [0,4) to number
|
|
// of bytes that need to be processed manually inside Cipher().
|
|
var remain = [4]int{0, 3, 2, 1}
|