mirror of
https://github.com/soheilhy/cmux.git
synced 2024-09-20 02:55:46 +08:00
02b84e9be9
This reverts commit 3bbbe9847675a1300cce193d9efe458b9f0bdd23. Fixes race conditions in matchers. Impact on benchmarks: name old time/op new time/op delta CMuxConnHTTP1-4 664ns ±19% 754ns ±59% ~ (p=0.796 n=9+10) CMuxConnHTTP2-4 745ns ±16% 822ns ±26% ~ (p=0.252 n=9+10) CMuxConnHTTP1n2-4 930ns ±28% 926ns ±19% ~ (p=0.912 n=10+10) CMuxConnHTTP2n1-4 1.18µs ±52% 0.92µs ±14% ~ (p=0.469 n=10+10) name old alloc/op new alloc/op delta CMuxConnHTTP1-4 256B ± 0% 260B ± 0% +1.56% (p=0.000 n=10+10) CMuxConnHTTP2-4 288B ± 0% 288B ± 0% ~ (all samples are equal) CMuxConnHTTP1n2-4 288B ± 0% 290B ± 0% +0.69% (p=0.000 n=10+10) CMuxConnHTTP2n1-4 288B ± 0% 292B ± 0% +1.39% (p=0.000 n=10+10) name old allocs/op new allocs/op delta CMuxConnHTTP1-4 3.00 ± 0% 5.00 ± 0% +66.67% (p=0.000 n=10+10) CMuxConnHTTP2-4 4.00 ± 0% 4.00 ± 0% ~ (all samples are equal) CMuxConnHTTP1n2-4 4.00 ± 0% 6.00 ± 0% +50.00% (p=0.000 n=10+10) CMuxConnHTTP2n1-4 4.00 ± 0% 6.00 ± 0% +50.00% (p=0.000 n=10+10)
188 lines
3.2 KiB
Go
188 lines
3.2 KiB
Go
// Copyright 2016 The CMux Authors. All rights reserved.
|
|
//
|
|
// 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 cmux
|
|
|
|
import (
|
|
"bytes"
|
|
"io"
|
|
)
|
|
|
|
// patriciaTree is a simple patricia tree that handles []byte instead of string
|
|
// and cannot be changed after instantiation.
|
|
type patriciaTree struct {
|
|
root *ptNode
|
|
}
|
|
|
|
func newPatriciaTree(b ...[]byte) *patriciaTree {
|
|
return &patriciaTree{
|
|
root: newNode(b),
|
|
}
|
|
}
|
|
|
|
func newPatriciaTreeString(strs ...string) *patriciaTree {
|
|
b := make([][]byte, len(strs))
|
|
for i, s := range strs {
|
|
b[i] = []byte(s)
|
|
}
|
|
return &patriciaTree{
|
|
root: newNode(b),
|
|
}
|
|
}
|
|
|
|
func (t *patriciaTree) matchPrefix(r io.Reader) bool {
|
|
return t.root.match(r, true)
|
|
}
|
|
|
|
func (t *patriciaTree) match(r io.Reader) bool {
|
|
return t.root.match(r, false)
|
|
}
|
|
|
|
type ptNode struct {
|
|
prefix []byte
|
|
next map[byte]*ptNode
|
|
terminal bool
|
|
}
|
|
|
|
func newNode(strs [][]byte) *ptNode {
|
|
if len(strs) == 0 {
|
|
return &ptNode{
|
|
prefix: []byte{},
|
|
terminal: true,
|
|
}
|
|
}
|
|
|
|
if len(strs) == 1 {
|
|
return &ptNode{
|
|
prefix: strs[0],
|
|
terminal: true,
|
|
}
|
|
}
|
|
|
|
p, strs := splitPrefix(strs)
|
|
n := &ptNode{
|
|
prefix: p,
|
|
}
|
|
|
|
nexts := make(map[byte][][]byte)
|
|
for _, s := range strs {
|
|
if len(s) == 0 {
|
|
n.terminal = true
|
|
continue
|
|
}
|
|
nexts[s[0]] = append(nexts[s[0]], s[1:])
|
|
}
|
|
|
|
n.next = make(map[byte]*ptNode)
|
|
for first, rests := range nexts {
|
|
n.next[first] = newNode(rests)
|
|
}
|
|
|
|
return n
|
|
}
|
|
|
|
func splitPrefix(bss [][]byte) (prefix []byte, rest [][]byte) {
|
|
if len(bss) == 0 || len(bss[0]) == 0 {
|
|
return prefix, bss
|
|
}
|
|
|
|
if len(bss) == 1 {
|
|
return bss[0], [][]byte{{}}
|
|
}
|
|
|
|
for i := 0; ; i++ {
|
|
var cur byte
|
|
eq := true
|
|
for j, b := range bss {
|
|
if len(b) <= i {
|
|
eq = false
|
|
break
|
|
}
|
|
|
|
if j == 0 {
|
|
cur = b[i]
|
|
continue
|
|
}
|
|
|
|
if cur != b[i] {
|
|
eq = false
|
|
break
|
|
}
|
|
}
|
|
|
|
if !eq {
|
|
break
|
|
}
|
|
|
|
prefix = append(prefix, cur)
|
|
}
|
|
|
|
rest = make([][]byte, 0, len(bss))
|
|
for _, b := range bss {
|
|
rest = append(rest, b[len(prefix):])
|
|
}
|
|
|
|
return prefix, rest
|
|
}
|
|
|
|
func readBytes(r io.Reader, n int) (b []byte, err error) {
|
|
b = make([]byte, n)
|
|
o := 0
|
|
for o < n {
|
|
nr, err := r.Read(b[o:])
|
|
if err != nil && err != io.EOF {
|
|
return b, err
|
|
}
|
|
|
|
o += nr
|
|
|
|
if err == io.EOF {
|
|
break
|
|
}
|
|
}
|
|
return b[:o], nil
|
|
}
|
|
|
|
func (n *ptNode) match(r io.Reader, prefix bool) bool {
|
|
if l := len(n.prefix); l > 0 {
|
|
b, err := readBytes(r, l)
|
|
if err != nil || len(b) != l || !bytes.Equal(b, n.prefix) {
|
|
return false
|
|
}
|
|
}
|
|
|
|
if prefix && n.terminal {
|
|
return true
|
|
}
|
|
|
|
b := make([]byte, 1)
|
|
for {
|
|
nr, err := r.Read(b)
|
|
if nr != 0 {
|
|
break
|
|
}
|
|
|
|
if err == io.EOF {
|
|
return n.terminal
|
|
}
|
|
|
|
if err != nil {
|
|
return false
|
|
}
|
|
}
|
|
|
|
nextN, ok := n.next[b[0]]
|
|
return ok && nextN.match(r, prefix)
|
|
}
|