snapshot: sagernet/gvisor v0.0.0-20250811.0-sing-box-mod.1
Содержимое пина, зафиксированного в go.mod sing-box-lx, одним коммитом без истории. Полная история SagerNet/gvisor — 1.45 ГБ и клонируется в каждой CI-джобе; наша дельта — одна вставка в одну функцию, история для неё не нужна. Module path github.com/sagernet/gvisor сохранён намеренно: на него опирается replace-директива суперпроекта. Патч поверх — отдельным коммитом, чтобы дельта читалась одним git show и переносилась на новый пин копированием. SPECS/TASKS/048-GVISOR_HANDSHAKE_NIL_CRASH
This commit is contained in:
commit
2c4ae3b0a4
712 changed files with 185689 additions and 0 deletions
51
pkg/tcpip/transport/tcp/segment_heap.go
Normal file
51
pkg/tcpip/transport/tcp/segment_heap.go
Normal file
|
|
@ -0,0 +1,51 @@
|
|||
// Copyright 2018 The gVisor Authors.
|
||||
//
|
||||
// Licensed under the Apache License, Version 2.0 (the "License");
|
||||
// you may not use this file except in compliance with the License.
|
||||
// You may obtain a copy of the License at
|
||||
//
|
||||
// http://www.apache.org/licenses/LICENSE-2.0
|
||||
//
|
||||
// Unless required by applicable law or agreed to in writing, software
|
||||
// distributed under the License is distributed on an "AS IS" BASIS,
|
||||
// WITHOUT WARRANTIES OR CONDITIONS OF ANY KIND, either express or implied.
|
||||
// See the License for the specific language governing permissions and
|
||||
// limitations under the License.
|
||||
|
||||
package tcp
|
||||
|
||||
import "container/heap"
|
||||
|
||||
type segmentHeap []*segment
|
||||
|
||||
var _ heap.Interface = (*segmentHeap)(nil)
|
||||
|
||||
// Len returns the length of h.
|
||||
func (h *segmentHeap) Len() int {
|
||||
return len(*h)
|
||||
}
|
||||
|
||||
// Less determines whether the i-th element of h is less than the j-th element.
|
||||
func (h *segmentHeap) Less(i, j int) bool {
|
||||
return (*h)[i].sequenceNumber.LessThan((*h)[j].sequenceNumber)
|
||||
}
|
||||
|
||||
// Swap swaps the i-th and j-th elements of h.
|
||||
func (h *segmentHeap) Swap(i, j int) {
|
||||
(*h)[i], (*h)[j] = (*h)[j], (*h)[i]
|
||||
}
|
||||
|
||||
// Push adds x as the last element of h.
|
||||
func (h *segmentHeap) Push(x any) {
|
||||
*h = append(*h, x.(*segment))
|
||||
}
|
||||
|
||||
// Pop removes the last element of h and returns it.
|
||||
func (h *segmentHeap) Pop() any {
|
||||
old := *h
|
||||
n := len(old)
|
||||
x := old[n-1]
|
||||
old[n-1] = nil
|
||||
*h = old[:n-1]
|
||||
return x
|
||||
}
|
||||
Loading…
Add table
Add a link
Reference in a new issue