
full diff: https://github.com/golang/net/compare/ab34263943818b32f575efc978 This fixes the same CVE as go1.21.3 and go1.20.10; - net/http: rapid stream resets can cause excessive work A malicious HTTP/2 client which rapidly creates requests and immediately resets them can cause excessive server resource consumption. While the total number of requests is bounded to the http2.Server.MaxConcurrentStreams setting, resetting an in-progress request allows the attacker to create a new request while the existing one is still executing. HTTP/2 servers now bound the number of simultaneously executing handler goroutines to the stream concurrency limit. New requests arriving when at the limit (which can only happen after the client has reset an existing, in-flight request) will be queued until a handler exits. If the request queue grows too large, the server will terminate the connection. This issue is also fixed in golang.org/x/net/http2 v0.17.0, for users manually configuring HTTP/2. The default stream concurrency limit is 250 streams (requests) per HTTP/2 connection. This value may be adjusted using the golang.org/x/net/http2 package; see the Server.MaxConcurrentStreams setting and the ConfigureServer function. This is CVE-2023-39325 and Go issue https://go.dev/issue/63417. This is also tracked by CVE-2023-44487. Dependency full diffs: a3d24e80b04bd7...v0.17.0 https://github.com/golang/sys/compare/33da011f77ade50ff5b6a6fb4a 9a1e6d6b285809...v0.13.0 https://github.com/golang/text/compare/v0.3.3...v0.13.0 https://github.com/golang/crypto/compare/c1f2f97bffc9c53fc40a1a28a5 b460094c0050d9...v0.14.0 Signed-off-by: Cory Snider <csnider@mirantis.com>
182 lines
3.9 KiB
Go
182 lines
3.9 KiB
Go
// Copyright 2016 The Go Authors. All rights reserved.
|
|
// Use of this source code is governed by a BSD-style
|
|
// license that can be found in the LICENSE file.
|
|
|
|
package bpf
|
|
|
|
import (
|
|
"encoding/binary"
|
|
"fmt"
|
|
)
|
|
|
|
func aluOpConstant(ins ALUOpConstant, regA uint32) uint32 {
|
|
return aluOpCommon(ins.Op, regA, ins.Val)
|
|
}
|
|
|
|
func aluOpX(ins ALUOpX, regA uint32, regX uint32) (uint32, bool) {
|
|
// Guard against division or modulus by zero by terminating
|
|
// the program, as the OS BPF VM does
|
|
if regX == 0 {
|
|
switch ins.Op {
|
|
case ALUOpDiv, ALUOpMod:
|
|
return 0, false
|
|
}
|
|
}
|
|
|
|
return aluOpCommon(ins.Op, regA, regX), true
|
|
}
|
|
|
|
func aluOpCommon(op ALUOp, regA uint32, value uint32) uint32 {
|
|
switch op {
|
|
case ALUOpAdd:
|
|
return regA + value
|
|
case ALUOpSub:
|
|
return regA - value
|
|
case ALUOpMul:
|
|
return regA * value
|
|
case ALUOpDiv:
|
|
// Division by zero not permitted by NewVM and aluOpX checks
|
|
return regA / value
|
|
case ALUOpOr:
|
|
return regA | value
|
|
case ALUOpAnd:
|
|
return regA & value
|
|
case ALUOpShiftLeft:
|
|
return regA << value
|
|
case ALUOpShiftRight:
|
|
return regA >> value
|
|
case ALUOpMod:
|
|
// Modulus by zero not permitted by NewVM and aluOpX checks
|
|
return regA % value
|
|
case ALUOpXor:
|
|
return regA ^ value
|
|
default:
|
|
return regA
|
|
}
|
|
}
|
|
|
|
func jumpIf(ins JumpIf, regA uint32) int {
|
|
return jumpIfCommon(ins.Cond, ins.SkipTrue, ins.SkipFalse, regA, ins.Val)
|
|
}
|
|
|
|
func jumpIfX(ins JumpIfX, regA uint32, regX uint32) int {
|
|
return jumpIfCommon(ins.Cond, ins.SkipTrue, ins.SkipFalse, regA, regX)
|
|
}
|
|
|
|
func jumpIfCommon(cond JumpTest, skipTrue, skipFalse uint8, regA uint32, value uint32) int {
|
|
var ok bool
|
|
|
|
switch cond {
|
|
case JumpEqual:
|
|
ok = regA == value
|
|
case JumpNotEqual:
|
|
ok = regA != value
|
|
case JumpGreaterThan:
|
|
ok = regA > value
|
|
case JumpLessThan:
|
|
ok = regA < value
|
|
case JumpGreaterOrEqual:
|
|
ok = regA >= value
|
|
case JumpLessOrEqual:
|
|
ok = regA <= value
|
|
case JumpBitsSet:
|
|
ok = (regA & value) != 0
|
|
case JumpBitsNotSet:
|
|
ok = (regA & value) == 0
|
|
}
|
|
|
|
if ok {
|
|
return int(skipTrue)
|
|
}
|
|
|
|
return int(skipFalse)
|
|
}
|
|
|
|
func loadAbsolute(ins LoadAbsolute, in []byte) (uint32, bool) {
|
|
offset := int(ins.Off)
|
|
size := ins.Size
|
|
|
|
return loadCommon(in, offset, size)
|
|
}
|
|
|
|
func loadConstant(ins LoadConstant, regA uint32, regX uint32) (uint32, uint32) {
|
|
switch ins.Dst {
|
|
case RegA:
|
|
regA = ins.Val
|
|
case RegX:
|
|
regX = ins.Val
|
|
}
|
|
|
|
return regA, regX
|
|
}
|
|
|
|
func loadExtension(ins LoadExtension, in []byte) uint32 {
|
|
switch ins.Num {
|
|
case ExtLen:
|
|
return uint32(len(in))
|
|
default:
|
|
panic(fmt.Sprintf("unimplemented extension: %d", ins.Num))
|
|
}
|
|
}
|
|
|
|
func loadIndirect(ins LoadIndirect, in []byte, regX uint32) (uint32, bool) {
|
|
offset := int(ins.Off) + int(regX)
|
|
size := ins.Size
|
|
|
|
return loadCommon(in, offset, size)
|
|
}
|
|
|
|
func loadMemShift(ins LoadMemShift, in []byte) (uint32, bool) {
|
|
offset := int(ins.Off)
|
|
|
|
// Size of LoadMemShift is always 1 byte
|
|
if !inBounds(len(in), offset, 1) {
|
|
return 0, false
|
|
}
|
|
|
|
// Mask off high 4 bits and multiply low 4 bits by 4
|
|
return uint32(in[offset]&0x0f) * 4, true
|
|
}
|
|
|
|
func inBounds(inLen int, offset int, size int) bool {
|
|
return offset+size <= inLen
|
|
}
|
|
|
|
func loadCommon(in []byte, offset int, size int) (uint32, bool) {
|
|
if !inBounds(len(in), offset, size) {
|
|
return 0, false
|
|
}
|
|
|
|
switch size {
|
|
case 1:
|
|
return uint32(in[offset]), true
|
|
case 2:
|
|
return uint32(binary.BigEndian.Uint16(in[offset : offset+size])), true
|
|
case 4:
|
|
return uint32(binary.BigEndian.Uint32(in[offset : offset+size])), true
|
|
default:
|
|
panic(fmt.Sprintf("invalid load size: %d", size))
|
|
}
|
|
}
|
|
|
|
func loadScratch(ins LoadScratch, regScratch [16]uint32, regA uint32, regX uint32) (uint32, uint32) {
|
|
switch ins.Dst {
|
|
case RegA:
|
|
regA = regScratch[ins.N]
|
|
case RegX:
|
|
regX = regScratch[ins.N]
|
|
}
|
|
|
|
return regA, regX
|
|
}
|
|
|
|
func storeScratch(ins StoreScratch, regScratch [16]uint32, regA uint32, regX uint32) [16]uint32 {
|
|
switch ins.Src {
|
|
case RegA:
|
|
regScratch[ins.N] = regA
|
|
case RegX:
|
|
regScratch[ins.N] = regX
|
|
}
|
|
|
|
return regScratch
|
|
}
|