mirror of
https://github.com/hanzoai/visor.git
synced 2026-09-24 17:04:14 +00:00
MemoryFile allocated offsets from the top down. This can generate fragmentation when allocations happen in the opposite direction. Given that applications control the order of allocations, use simple heuristics to track the last faulted address to determine whether memory file should be allocated from the top-down or bottom-up. Here is the number of PMAs used across all processes in some common workloads: Workload | Before | After | Diff ---------|---------|---------|------ rustc | 135,269 | 1,090 | 0.8% mysql | 16,466 | 4,576 | 28% nginx | 1,738 | 1,609 | 93% jenkins | 13,830 | 6,380 | 46% redis | 334 | 308 | 92% absl | 297,419 | 292,121 | 98% Here is the direction of PMA allocations: Workload | BottomUp | TopDown | ---------|-----------|---------| mysql | 13,849 | 1,990 | nginx | 783 | 628 | jenkins | 13,922 | 2,333 | redis | 88 | 109 | absl | 212,403 | 44,019 | Tests were done on Intel x64. PiperOrigin-RevId: 409014690
157 lines
4.2 KiB
Go
157 lines
4.2 KiB
Go
// 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 kernel
|
|
|
|
import (
|
|
"testing"
|
|
|
|
"gvisor.dev/gvisor/pkg/errors/linuxerr"
|
|
"gvisor.dev/gvisor/pkg/hostarch"
|
|
"gvisor.dev/gvisor/pkg/sentry/contexttest"
|
|
"gvisor.dev/gvisor/pkg/sentry/pgalloc"
|
|
sentrytime "gvisor.dev/gvisor/pkg/sentry/time"
|
|
"gvisor.dev/gvisor/pkg/sentry/usage"
|
|
)
|
|
|
|
// mockClocks is a sentrytime.Clocks that simply returns the times in the
|
|
// struct.
|
|
type mockClocks struct {
|
|
monotonic int64
|
|
realtime int64
|
|
}
|
|
|
|
// Update implements sentrytime.Clocks.Update. It does nothing.
|
|
func (*mockClocks) Update() (monotonicParams sentrytime.Parameters, monotonicOk bool, realtimeParam sentrytime.Parameters, realtimeOk bool) {
|
|
return
|
|
}
|
|
|
|
// Update implements sentrytime.Clocks.GetTime.
|
|
func (c *mockClocks) GetTime(id sentrytime.ClockID) (int64, error) {
|
|
switch id {
|
|
case sentrytime.Monotonic:
|
|
return c.monotonic, nil
|
|
case sentrytime.Realtime:
|
|
return c.realtime, nil
|
|
default:
|
|
return 0, linuxerr.EINVAL
|
|
}
|
|
}
|
|
|
|
// stateTestClocklessTimekeeper returns a test Timekeeper which has not had
|
|
// SetClocks called.
|
|
func stateTestClocklessTimekeeper(tb testing.TB) *Timekeeper {
|
|
ctx := contexttest.Context(tb)
|
|
mfp := pgalloc.MemoryFileProviderFromContext(ctx)
|
|
fr, err := mfp.MemoryFile().Allocate(hostarch.PageSize, pgalloc.AllocOpts{Kind: usage.Anonymous})
|
|
if err != nil {
|
|
tb.Fatalf("failed to allocate memory: %v", err)
|
|
}
|
|
return &Timekeeper{
|
|
params: NewVDSOParamPage(mfp, fr),
|
|
}
|
|
}
|
|
|
|
func stateTestTimekeeper(tb testing.TB) *Timekeeper {
|
|
t := stateTestClocklessTimekeeper(tb)
|
|
t.SetClocks(sentrytime.NewCalibratedClocks())
|
|
return t
|
|
}
|
|
|
|
// TestTimekeeperMonotonicZero tests that monotonic time starts at zero.
|
|
func TestTimekeeperMonotonicZero(t *testing.T) {
|
|
c := &mockClocks{
|
|
monotonic: 100000,
|
|
}
|
|
|
|
tk := stateTestClocklessTimekeeper(t)
|
|
tk.SetClocks(c)
|
|
defer tk.Destroy()
|
|
|
|
now, err := tk.GetTime(sentrytime.Monotonic)
|
|
if err != nil {
|
|
t.Errorf("GetTime err got %v want nil", err)
|
|
}
|
|
if now != 0 {
|
|
t.Errorf("GetTime got %d want 0", now)
|
|
}
|
|
|
|
c.monotonic += 10
|
|
|
|
now, err = tk.GetTime(sentrytime.Monotonic)
|
|
if err != nil {
|
|
t.Errorf("GetTime err got %v want nil", err)
|
|
}
|
|
if now != 10 {
|
|
t.Errorf("GetTime got %d want 10", now)
|
|
}
|
|
}
|
|
|
|
// TestTimekeeperMonotonicJumpForward tests that monotonic time jumps forward
|
|
// after restore.
|
|
func TestTimekeeperMonotonicForward(t *testing.T) {
|
|
c := &mockClocks{
|
|
monotonic: 900000,
|
|
realtime: 600000,
|
|
}
|
|
|
|
tk := stateTestClocklessTimekeeper(t)
|
|
tk.restored = make(chan struct{})
|
|
tk.saveMonotonic = 100000
|
|
tk.saveRealtime = 400000
|
|
tk.SetClocks(c)
|
|
defer tk.Destroy()
|
|
|
|
// The monotonic clock should jump ahead by 200000 to 300000.
|
|
//
|
|
// The new system monotonic time (900000) is irrelevant to what the app
|
|
// sees.
|
|
now, err := tk.GetTime(sentrytime.Monotonic)
|
|
if err != nil {
|
|
t.Errorf("GetTime err got %v want nil", err)
|
|
}
|
|
if now != 300000 {
|
|
t.Errorf("GetTime got %d want 300000", now)
|
|
}
|
|
}
|
|
|
|
// TestTimekeeperMonotonicJumpBackwards tests that monotonic time does not jump
|
|
// backwards when realtime goes backwards.
|
|
func TestTimekeeperMonotonicJumpBackwards(t *testing.T) {
|
|
c := &mockClocks{
|
|
monotonic: 900000,
|
|
realtime: 400000,
|
|
}
|
|
|
|
tk := stateTestClocklessTimekeeper(t)
|
|
tk.restored = make(chan struct{})
|
|
tk.saveMonotonic = 100000
|
|
tk.saveRealtime = 600000
|
|
tk.SetClocks(c)
|
|
defer tk.Destroy()
|
|
|
|
// The monotonic clock should remain at 100000.
|
|
//
|
|
// The new system monotonic time (900000) is irrelevant to what the app
|
|
// sees and we don't want to jump the monotonic clock backwards like
|
|
// realtime did.
|
|
now, err := tk.GetTime(sentrytime.Monotonic)
|
|
if err != nil {
|
|
t.Errorf("GetTime err got %v want nil", err)
|
|
}
|
|
if now != 100000 {
|
|
t.Errorf("GetTime got %d want 100000", now)
|
|
}
|
|
}
|