2016-10-21 02:25:46 +03:00
|
|
|
// Copyright 2016 The Gorilla WebSocket Authors. All rights reserved. Use of
|
|
|
|
// this source code is governed by a BSD-style license that can be found in the
|
|
|
|
// LICENSE file.
|
|
|
|
|
2021-12-18 06:48:51 +03:00
|
|
|
//go:build !appengine
|
2017-01-01 07:13:41 +03:00
|
|
|
// +build !appengine
|
|
|
|
|
2016-10-21 02:25:46 +03:00
|
|
|
package websocket
|
|
|
|
|
2017-01-01 07:13:41 +03:00
|
|
|
import "unsafe"
|
2016-10-21 02:25:46 +03:00
|
|
|
|
2023-08-26 23:01:45 +03:00
|
|
|
// #nosec G103 -- (CWE-242) Has been audited
|
2016-10-21 02:25:46 +03:00
|
|
|
const wordSize = int(unsafe.Sizeof(uintptr(0)))
|
|
|
|
|
|
|
|
func maskBytes(key [4]byte, pos int, b []byte) int {
|
|
|
|
// Mask one byte at a time for small buffers.
|
|
|
|
if len(b) < 2*wordSize {
|
|
|
|
for i := range b {
|
|
|
|
b[i] ^= key[pos&3]
|
|
|
|
pos++
|
|
|
|
}
|
|
|
|
return pos & 3
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mask one byte at a time to word boundary.
|
2023-08-26 23:01:45 +03:00
|
|
|
//#nosec G103 -- (CWE-242) Has been audited
|
2016-11-02 19:16:35 +03:00
|
|
|
if n := int(uintptr(unsafe.Pointer(&b[0]))) % wordSize; n != 0 {
|
2016-10-21 02:25:46 +03:00
|
|
|
n = wordSize - n
|
|
|
|
for i := range b[:n] {
|
|
|
|
b[i] ^= key[pos&3]
|
|
|
|
pos++
|
|
|
|
}
|
|
|
|
b = b[n:]
|
|
|
|
}
|
|
|
|
|
|
|
|
// Create aligned word size key.
|
|
|
|
var k [wordSize]byte
|
|
|
|
for i := range k {
|
|
|
|
k[i] = key[(pos+i)&3]
|
|
|
|
}
|
2023-08-26 23:01:45 +03:00
|
|
|
//#nosec G103 -- (CWE-242) Has been audited
|
2016-10-21 02:25:46 +03:00
|
|
|
kw := *(*uintptr)(unsafe.Pointer(&k))
|
|
|
|
|
|
|
|
// Mask one word at a time.
|
|
|
|
n := (len(b) / wordSize) * wordSize
|
|
|
|
for i := 0; i < n; i += wordSize {
|
2023-08-26 23:01:45 +03:00
|
|
|
//#nosec G103 -- (CWE-242) Has been audited
|
2016-10-21 02:25:46 +03:00
|
|
|
*(*uintptr)(unsafe.Pointer(uintptr(unsafe.Pointer(&b[0])) + uintptr(i))) ^= kw
|
|
|
|
}
|
|
|
|
|
|
|
|
// Mask one byte at a time for remaining bytes.
|
|
|
|
b = b[n:]
|
|
|
|
for i := range b {
|
|
|
|
b[i] ^= key[pos&3]
|
|
|
|
pos++
|
|
|
|
}
|
|
|
|
|
|
|
|
return pos & 3
|
|
|
|
}
|