| Server IP : 2.57.91.174 / Your IP : 216.73.216.176 Web Server : LiteSpeed System : Linux id-dci-web1986.main-hosting.eu 5.14.0-611.26.1.el9_7.x86_64 #1 SMP PREEMPT_DYNAMIC Thu Jan 29 05:24:47 EST 2026 x86_64 User : u686484674 ( 686484674) PHP Version : 8.0.30 Disable Function : system, exec, shell_exec, passthru, mysql_list_dbs, ini_alter, dl, symlink, link, chgrp, leak, popen, apache_child_terminate, virtual, mb_send_mail MySQL : OFF | cURL : ON | WGET : ON | Perl : OFF | Python : OFF | Sudo : OFF | Pkexec : OFF Directory : /./opt/golang/1.22.0/src/internal/trace/v2/testdata/testprog/ |
Upload File : |
// Copyright 2023 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.
// Tests a GC-heavy program. This is useful for shaking out
// all sorts of corner cases about GC-related ranges.
//go:build ignore
package main
import (
"log"
"math/rand"
"os"
"runtime"
"runtime/trace"
"time"
)
type node struct {
children [4]*node
data [128]byte
}
func makeTree(depth int) *node {
if depth == 0 {
return new(node)
}
return &node{
children: [4]*node{
makeTree(depth - 1),
makeTree(depth - 1),
makeTree(depth - 1),
makeTree(depth - 1),
},
}
}
var trees [16]*node
var ballast *[16]*[8192]*node
var sink []byte
func main() {
for i := range trees {
trees[i] = makeTree(6)
}
ballast = new([16]*[8192]*node)
for i := range ballast {
ballast[i] = new([8192]*node)
for j := range ballast[i] {
ballast[i][j] = &node{
data: [128]byte{1, 2, 3, 4},
}
}
}
for i := 0; i < runtime.GOMAXPROCS(-1); i++ {
go func() {
for {
sink = make([]byte, rand.Intn(32<<10))
}
}()
}
// Increase the chance that we end up starting and stopping
// mid-GC by only starting to trace after a few milliseconds.
time.Sleep(5 * time.Millisecond)
// Start tracing.
if err := trace.Start(os.Stdout); err != nil {
log.Fatalf("failed to start tracing: %v", err)
}
defer trace.Stop()
// Let the tracing happen for a bit.
time.Sleep(400 * time.Millisecond)
}