node_test.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"
)

funcTestLookup(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) {
varrootNode
root.InitLocked("", nil)
root.childrenMu.Lock()
deferroot.childrenMu.Unlock()

// truth is the source of truth.
truth:=make(map[string]*Node)

// Fill node with children.
fori:=0; i<numChildren; i++ {
name:=fmt.Sprintf("%d", i)
varchildNode
child.InitLocked(name, &root)
truth[name] =&child
 }

// Test that lookup finds child correctly.
fori:=0; i<numChildren; i++ {
name:=fmt.Sprintf("%d", i)
ifgot, want:=root.LookupChildLocked(name), truth[name]; got!=want {
t.Errorf("incorrect child returned by root: want %p, got %p", want, got)
 }
 }
 })
 }
}

funcTestDelete(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) {
varrootNode
root.InitLocked("", nil)
root.childrenMu.Lock()
deferroot.childrenMu.Unlock()

// truth is the source of truth.
truth:=make(map[string]*Node)

// Fill node with children.
fori:=0; i<numChildren; i++ {
name:=fmt.Sprintf("%d", i)
varchildNode
child.InitLocked(name, &root)
truth[name] =&child
 }

// Now remove them and check if correct node is removed.
fori:=0; i<numChildren; i++ {
name:=fmt.Sprintf("%d", i)
ifgot, want:=root.removeChildLocked(name), truth[name]; got!=want {
t.Errorf("root deleted incorrect node: want %p, got %p", want, got)
 }
 }
 })
 }
}