mirror of
https://github.com/impact-eintr/netstack.git
synced 2025-10-05 12:56:55 +08:00
这个仓库代码量太大了 以读为主 不写了
This commit is contained in:
impact-eintr
@@ -1,31 +0,0 @@
|
||||
package buffer
|
||||
|
||||
type Prependable struct {
|
||||
buf View // Buf 是支持前置缓冲区的缓冲区
|
||||
usedIdx int // 是缓冲区的使用部分开始的索引
|
||||
}
|
||||
|
||||
func NewPrependable(size int) Prependable {
|
||||
return Prependable{}
|
||||
}
|
||||
|
||||
func NewPrependableFromView(v View) Prependable {
|
||||
return Prependable{buf: v, usedIdx: 0}
|
||||
}
|
||||
|
||||
func (p Prependable) View() View {
|
||||
return p.buf[p.usedIdx:]
|
||||
}
|
||||
|
||||
func (p Prependable) UsedLength() inty {
|
||||
return len(p.buf) - p.usedIdx
|
||||
}
|
||||
|
||||
func (p *Prependable) Prepend(size int) []byte {
|
||||
if size > p.usedIdx {
|
||||
return nil
|
||||
}
|
||||
|
||||
p.usedIdx -= size
|
||||
return p.View()[:size:size]
|
||||
}
|
||||
@@ -1,104 +0,0 @@
|
||||
package buffer
|
||||
|
||||
type View []byte
|
||||
|
||||
func NewView(size int) View {
|
||||
return make(View, size)
|
||||
}
|
||||
|
||||
func NewViewFromBytes(b []byte) View {
|
||||
return append(View(nil), b...)
|
||||
}
|
||||
|
||||
func (v *View) TrimFront(count int) {
|
||||
*v = (*v)[count:]
|
||||
}
|
||||
|
||||
func (v *View) CapLength(length int) {
|
||||
*v = (*v)[:length:length]
|
||||
}
|
||||
|
||||
func (v View) ToVectorisedView() VectorisedView {
|
||||
return NewVectorisedView(len(v), []View{v})
|
||||
}
|
||||
|
||||
// VectorisedView 是使用非连续内存的矢量化视图版本。它支持视图支持的所有便捷方法。
|
||||
type VectorisedView struct {
|
||||
views []View
|
||||
size int
|
||||
}
|
||||
|
||||
func NewVectorisedView(size int, views []View) VectorisedView {
|
||||
return VectorisedView{views: views, size: size}
|
||||
}
|
||||
|
||||
func (vv *VectorisedView) TrimFront(count int) {
|
||||
for count > 0 && len(vv.views) > 0 {
|
||||
if count < len(vv.views[0]) {
|
||||
vv.size -= count
|
||||
vv.views[0].TrimFront(count)
|
||||
return
|
||||
}
|
||||
count -= len(vv.views[0])
|
||||
vv.RemoveFirst()
|
||||
}
|
||||
}
|
||||
|
||||
func (vv *VectorisedView) CapLength(length int) {
|
||||
if length < 0 {
|
||||
length = 0
|
||||
}
|
||||
if vv.size < length {
|
||||
return
|
||||
}
|
||||
vv.size = length
|
||||
for i := range vv.views {
|
||||
v := &vv.views[i]
|
||||
if len(*v) >= length {
|
||||
if length == 0 {
|
||||
vv.views = vv.views[:i]
|
||||
} else {
|
||||
v.CapLength(length)
|
||||
vv.views = vv.views[:i+1] // 更新view 这个写法太艹了 底层数组没有共享可以直接修改
|
||||
}
|
||||
return
|
||||
}
|
||||
length -= len(*v)
|
||||
}
|
||||
}
|
||||
|
||||
// 会把buffer原来的内容覆盖
|
||||
func (vv *VectorisedView) Clone(buffer []View) VectorisedView {
|
||||
return VectorisedView{views: append(buffer[:0], vv.views...), size: vv.size}
|
||||
}
|
||||
|
||||
func (vv *VectorisedView) First() View {
|
||||
if len(vv.views) == 0 {
|
||||
return nil
|
||||
}
|
||||
return vv.views[0]
|
||||
}
|
||||
|
||||
func (vv *VectorisedView) RemoveFirst() {
|
||||
if len(vv.views) == 0 {
|
||||
return
|
||||
}
|
||||
vv.size -= len(vv.views[0])
|
||||
vv.views = vv.views[1:]
|
||||
}
|
||||
|
||||
func (vv *VectorisedView) Size() int {
|
||||
return vv.size
|
||||
}
|
||||
|
||||
func (vv VectorisedView) ToView() View {
|
||||
u := make([]byte, 0, vv.size)
|
||||
for _, v := range vv.views {
|
||||
u = append(u, v...)
|
||||
}
|
||||
return u
|
||||
}
|
||||
|
||||
func (vv VectorisedView) Views() []View {
|
||||
return vv.views
|
||||
}
|
||||
@@ -1,235 +0,0 @@
|
||||
// Copyright 2018 Google LLC
|
||||
//
|
||||
// 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 buffer_test contains tests for the VectorisedView type.
|
||||
package buffer
|
||||
|
||||
import (
|
||||
"reflect"
|
||||
"testing"
|
||||
)
|
||||
|
||||
// copy returns a deep-copy of the vectorised view.
|
||||
func (vv VectorisedView) copy() VectorisedView {
|
||||
uu := VectorisedView{
|
||||
views: make([]View, 0, len(vv.views)),
|
||||
size: vv.size,
|
||||
}
|
||||
for _, v := range vv.views {
|
||||
uu.views = append(uu.views, append(View(nil), v...))
|
||||
}
|
||||
return uu
|
||||
}
|
||||
|
||||
// vv is an helper to build VectorisedView from different strings.
|
||||
func vv(size int, pieces ...string) VectorisedView {
|
||||
views := make([]View, len(pieces))
|
||||
for i, p := range pieces {
|
||||
views[i] = []byte(p)
|
||||
}
|
||||
|
||||
return NewVectorisedView(size, views)
|
||||
}
|
||||
|
||||
var capLengthTestCases = []struct {
|
||||
comment string
|
||||
in VectorisedView
|
||||
length int
|
||||
want VectorisedView
|
||||
}{
|
||||
{
|
||||
comment: "Simple case",
|
||||
in: vv(2, "12"),
|
||||
length: 1,
|
||||
want: vv(1, "1"),
|
||||
},
|
||||
{
|
||||
comment: "Case spanning across two Views",
|
||||
in: vv(4, "123", "4"),
|
||||
length: 2,
|
||||
want: vv(2, "12"),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with negative length",
|
||||
in: vv(1, "1"),
|
||||
length: -1,
|
||||
want: vv(0),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with length = 0",
|
||||
in: vv(3, "12", "3"),
|
||||
length: 0,
|
||||
want: vv(0),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with length = size",
|
||||
in: vv(1, "1"),
|
||||
length: 1,
|
||||
want: vv(1, "1"),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with length > size",
|
||||
in: vv(1, "1"),
|
||||
length: 2,
|
||||
want: vv(1, "1"),
|
||||
},
|
||||
}
|
||||
|
||||
func TestCapLength(t *testing.T) {
|
||||
for _, c := range capLengthTestCases {
|
||||
orig := c.in.copy()
|
||||
c.in.CapLength(c.length)
|
||||
if !reflect.DeepEqual(c.in, c.want) {
|
||||
t.Errorf("Test \"%s\" failed when calling CapLength(%d) on %v. Got %v. Want %v",
|
||||
c.comment, c.length, orig, c.in, c.want)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
var trimFrontTestCases = []struct {
|
||||
comment string
|
||||
in VectorisedView
|
||||
count int
|
||||
want VectorisedView
|
||||
}{
|
||||
{
|
||||
comment: "Simple case",
|
||||
in: vv(2, "12"),
|
||||
count: 1,
|
||||
want: vv(1, "2"),
|
||||
},
|
||||
{
|
||||
comment: "Case where we trim an entire View",
|
||||
in: vv(2, "1", "2"),
|
||||
count: 1,
|
||||
want: vv(1, "2"),
|
||||
},
|
||||
{
|
||||
comment: "Case spanning across two Views",
|
||||
in: vv(3, "1", "23"),
|
||||
count: 2,
|
||||
want: vv(1, "3"),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with negative count",
|
||||
in: vv(1, "1"),
|
||||
count: -1,
|
||||
want: vv(1, "1"),
|
||||
},
|
||||
{
|
||||
comment: " Corner case with count = 0",
|
||||
in: vv(1, "1"),
|
||||
count: 0,
|
||||
want: vv(1, "1"),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with count = size",
|
||||
in: vv(1, "1"),
|
||||
count: 1,
|
||||
want: vv(0),
|
||||
},
|
||||
{
|
||||
comment: "Corner case with count > size",
|
||||
in: vv(1, "1"),
|
||||
count: 2,
|
||||
want: vv(0),
|
||||
},
|
||||
}
|
||||
|
||||
func TestTrimFront(t *testing.T) {
|
||||
for _, c := range trimFrontTestCases {
|
||||
orig := c.in.copy()
|
||||
c.in.TrimFront(c.count)
|
||||
if !reflect.DeepEqual(c.in, c.want) {
|
||||
t.Errorf("Test \"%s\" failed when calling TrimFront(%d) on %v. Got %v. Want %v",
|
||||
c.comment, c.count, orig, c.in, c.want)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
var toViewCases = []struct {
|
||||
comment string
|
||||
in VectorisedView
|
||||
want View
|
||||
}{
|
||||
{
|
||||
comment: "Simple case",
|
||||
in: vv(2, "12"),
|
||||
want: []byte("12"),
|
||||
},
|
||||
{
|
||||
comment: "Case with multiple views",
|
||||
in: vv(2, "1", "2"),
|
||||
want: []byte("12"),
|
||||
},
|
||||
{
|
||||
comment: "Empty case",
|
||||
in: vv(0),
|
||||
want: []byte(""),
|
||||
},
|
||||
}
|
||||
|
||||
func TestToView(t *testing.T) {
|
||||
for _, c := range toViewCases {
|
||||
got := c.in.ToView()
|
||||
if !reflect.DeepEqual(got, c.want) {
|
||||
t.Errorf("Test \"%s\" failed when calling ToView() on %v. Got %v. Want %v",
|
||||
c.comment, c.in, got, c.want)
|
||||
}
|
||||
}
|
||||
}
|
||||
|
||||
var toCloneCases = []struct {
|
||||
comment string
|
||||
inView VectorisedView
|
||||
inBuffer []View
|
||||
}{
|
||||
{
|
||||
comment: "Simple case",
|
||||
inView: vv(1, "1"),
|
||||
inBuffer: make([]View, 1),
|
||||
},
|
||||
{
|
||||
comment: "Case with multiple views",
|
||||
inView: vv(2, "1", "2"),
|
||||
inBuffer: make([]View, 2),
|
||||
},
|
||||
{
|
||||
comment: "Case with buffer too small",
|
||||
inView: vv(2, "1", "2"),
|
||||
inBuffer: make([]View, 1),
|
||||
},
|
||||
{
|
||||
comment: "Case with buffer larger than needed",
|
||||
inView: vv(1, "1"),
|
||||
inBuffer: make([]View, 2),
|
||||
},
|
||||
{
|
||||
comment: "Case with nil buffer",
|
||||
inView: vv(1, "1"),
|
||||
inBuffer: nil,
|
||||
},
|
||||
}
|
||||
|
||||
func TestToClone(t *testing.T) {
|
||||
for _, c := range toCloneCases {
|
||||
t.Run(c.comment, func(t *testing.T) {
|
||||
got := c.inView.Clone(c.inBuffer)
|
||||
if !reflect.DeepEqual(got, c.inView) {
|
||||
t.Fatalf("got (%+v).Clone(%+v) = %+v, want = %+v",
|
||||
c.inView, c.inBuffer, got, c.inView)
|
||||
}
|
||||
})
|
||||
}
|
||||
}
|
||||
Reference in New Issue
Block a user