mirror of
https://github.com/netbirdio/gvisor.git
synced 2026-05-22 17:12:49 -07:00
Andrei Vagin
5f4abad306
It is an idea of running codespell as part of our presubmit checks. Before enabling it for new changes, let's fix what it has found. Signed-off-by: Andrei Vagin <avagin@gmail.com>
87 lines
2.4 KiB
Go
87 lines
2.4 KiB
Go
// Copyright 2022 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 lisafs
|
|
|
|
import (
|
|
"fmt"
|
|
"testing"
|
|
)
|
|
|
|
func TestLookup(t *testing.T) {
|
|
for _, numChildren := range []int{
|
|
numStaticChildren, // For static children.
|
|
2 * numStaticChildren, // For dynamic children.
|
|
} {
|
|
t.Run(fmt.Sprintf("%dChildren", numChildren), func(t *testing.T) {
|
|
var root Node
|
|
root.InitLocked("", nil)
|
|
root.childrenMu.Lock()
|
|
defer root.childrenMu.Unlock()
|
|
|
|
// truth is the source of truth.
|
|
truth := make(map[string]*Node)
|
|
|
|
// Fill node with children.
|
|
for i := 0; i < numChildren; i++ {
|
|
name := fmt.Sprintf("%d", i)
|
|
var child Node
|
|
child.InitLocked(name, &root)
|
|
truth[name] = &child
|
|
}
|
|
|
|
// Test that lookup finds child correctly.
|
|
for i := 0; i < numChildren; i++ {
|
|
name := fmt.Sprintf("%d", i)
|
|
if got, want := root.LookupChildLocked(name), truth[name]; got != want {
|
|
t.Errorf("incorrect child returned by root: want %p, got %p", want, got)
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|
|
|
|
func TestDelete(t *testing.T) {
|
|
for _, numChildren := range []int{
|
|
numStaticChildren, // For static children.
|
|
2 * numStaticChildren, // For dynamic children.
|
|
} {
|
|
t.Run(fmt.Sprintf("%dChildren", numChildren), func(t *testing.T) {
|
|
var root Node
|
|
root.InitLocked("", nil)
|
|
root.childrenMu.Lock()
|
|
defer root.childrenMu.Unlock()
|
|
|
|
// truth is the source of truth.
|
|
truth := make(map[string]*Node)
|
|
|
|
// Fill node with children.
|
|
for i := 0; i < numChildren; i++ {
|
|
name := fmt.Sprintf("%d", i)
|
|
var child Node
|
|
child.InitLocked(name, &root)
|
|
truth[name] = &child
|
|
}
|
|
|
|
// Now remove them and check if correct node is removed.
|
|
for i := 0; i < numChildren; i++ {
|
|
name := fmt.Sprintf("%d", i)
|
|
if got, want := root.removeChildLocked(name), truth[name]; got != want {
|
|
t.Errorf("root deleted incorrect node: want %p, got %p", want, got)
|
|
}
|
|
}
|
|
})
|
|
}
|
|
}
|