Linux vmi284606.contaboserver.net 4.15.0-213-generic #224-Ubuntu SMP Mon Jun 19 13:30:12 UTC 2023 x86_64
Apache/2.4.57 (Ubuntu)
: 167.86.127.34 | : 216.73.217.1
Cant Read [ /etc/named.conf ]
7.2.24-0ubuntu0.18.04.17
root
Terminal
AUTO ROOT
Adminer
Backdoor Destroyer
Linux Exploit
Lock Shell
Lock File
Create User
CREATE RDP
PHP Mailer
BACKCONNECT
UNLOCK SHELL
HASH IDENTIFIER
README
+ Create Folder
+ Create File
/
usr /
local /
go /
test /
[ HOME SHELL ]
Name
Size
Permission
Action
alias3.dir
[ DIR ]
drwxr-xr-x
bench
[ DIR ]
drwxr-xr-x
chan
[ DIR ]
drwxr-xr-x
closure3.dir
[ DIR ]
drwxr-xr-x
codegen
[ DIR ]
drwxr-xr-x
ddd2.dir
[ DIR ]
drwxr-xr-x
dwarf
[ DIR ]
drwxr-xr-x
fixedbugs
[ DIR ]
drwxr-xr-x
import2.dir
[ DIR ]
drwxr-xr-x
import4.dir
[ DIR ]
drwxr-xr-x
interface
[ DIR ]
drwxr-xr-x
intrinsic.dir
[ DIR ]
drwxr-xr-x
ken
[ DIR ]
drwxr-xr-x
linkname.dir
[ DIR ]
drwxr-xr-x
method4.dir
[ DIR ]
drwxr-xr-x
oldescape_linkname.dir
[ DIR ]
drwxr-xr-x
retjmp.dir
[ DIR ]
drwxr-xr-x
runtime
[ DIR ]
drwxr-xr-x
stress
[ DIR ]
drwxr-xr-x
syntax
[ DIR ]
drwxr-xr-x
uintptrescapes.dir
[ DIR ]
drwxr-xr-x
235.go
1.56
KB
-rw-r--r--
64bit.go
24.83
KB
-rw-r--r--
README.md
577
B
-rw-r--r--
alg.go
822
B
-rw-r--r--
alias.go
588
B
-rw-r--r--
alias1.go
803
B
-rw-r--r--
alias2.go
2.52
KB
-rw-r--r--
alias3.go
187
B
-rw-r--r--
align.go
603
B
-rw-r--r--
append.go
9.09
KB
-rw-r--r--
append1.go
665
B
-rw-r--r--
args.go
374
B
-rw-r--r--
armimm.go
3.85
KB
-rw-r--r--
assign.go
975
B
-rw-r--r--
assign1.go
5.55
KB
-rw-r--r--
atomicload.go
798
B
-rw-r--r--
bigalg.go
2.12
KB
-rw-r--r--
bigmap.go
2.46
KB
-rw-r--r--
blank.go
2.1
KB
-rw-r--r--
blank1.go
703
B
-rw-r--r--
bom.go
406
B
-rw-r--r--
bombad.go
480
B
-rw-r--r--
bounds.go
5.65
KB
-rw-r--r--
chancap.go
1.57
KB
-rw-r--r--
chanlinear.go
2.12
KB
-rw-r--r--
char_lit.go
657
B
-rw-r--r--
char_lit1.go
813
B
-rw-r--r--
checkbce.go
3.56
KB
-rw-r--r--
clearfat.go
1.15
KB
-rw-r--r--
closedchan.go
5.79
KB
-rw-r--r--
closure.go
1.69
KB
-rw-r--r--
closure1.go
280
B
-rw-r--r--
closure2.go
1.69
KB
-rw-r--r--
closure3.go
295
B
-rw-r--r--
closure4.go
364
B
-rw-r--r--
cmp.go
7.63
KB
-rw-r--r--
cmp6.go
2.09
KB
-rw-r--r--
cmplx.go
1.39
KB
-rw-r--r--
cmplxdivide.c
2.05
KB
-rw-r--r--
cmplxdivide.go
868
B
-rw-r--r--
cmplxdivide1.go
240.68
KB
-rw-r--r--
complit.go
1.71
KB
-rw-r--r--
complit1.go
1.48
KB
-rw-r--r--
compos.go
403
B
-rw-r--r--
const.go
4.78
KB
-rw-r--r--
const1.go
3.39
KB
-rw-r--r--
const2.go
605
B
-rw-r--r--
const3.go
659
B
-rw-r--r--
const4.go
1.28
KB
-rw-r--r--
const5.go
835
B
-rw-r--r--
const6.go
834
B
-rw-r--r--
convT2X.go
3.33
KB
-rw-r--r--
convert.go
833
B
-rw-r--r--
convert1.go
3.41
KB
-rw-r--r--
convert2.go
5.05
KB
-rw-r--r--
convert3.go
544
B
-rw-r--r--
convlit.go
2.25
KB
-rw-r--r--
convlit1.go
458
B
-rw-r--r--
copy.go
6.6
KB
-rw-r--r--
copy1.go
763
B
-rw-r--r--
crlf.go
782
B
-rw-r--r--
ddd.go
4.23
KB
-rw-r--r--
ddd1.go
1.56
KB
-rw-r--r--
ddd2.go
252
B
-rw-r--r--
decl.go
926
B
-rw-r--r--
declbad.go
1.4
KB
-rw-r--r--
defer.go
875
B
-rw-r--r--
defererrcheck.go
1.53
KB
-rw-r--r--
deferfin.go
1.12
KB
-rw-r--r--
defernil.go
563
B
-rw-r--r--
deferprint.go
586
B
-rw-r--r--
deferprint.out
126
B
-rw-r--r--
devirt.go
599
B
-rw-r--r--
divide.go
1.22
KB
-rw-r--r--
divmod.go
9.28
KB
-rw-r--r--
empty.go
316
B
-rw-r--r--
env.go
585
B
-rw-r--r--
eof.go
308
B
-rw-r--r--
eof1.go
333
B
-rw-r--r--
escape.go
3.79
KB
-rw-r--r--
escape2.go
35.16
KB
-rw-r--r--
escape2n.go
35.19
KB
-rw-r--r--
escape3.go
524
B
-rw-r--r--
escape4.go
1.3
KB
-rw-r--r--
escape5.go
4.92
KB
-rw-r--r--
escape_array.go
3.64
KB
-rw-r--r--
escape_calls.go
1.26
KB
-rw-r--r--
escape_closure.go
3.94
KB
-rw-r--r--
escape_field.go
2.93
KB
-rw-r--r--
escape_goto.go
674
B
-rw-r--r--
escape_hash_maphash.go
368
B
-rw-r--r--
escape_iface.go
4.51
KB
-rw-r--r--
escape_indir.go
3.39
KB
-rw-r--r--
escape_level.go
1.79
KB
-rw-r--r--
escape_map.go
2.76
KB
-rw-r--r--
escape_param.go
9.11
KB
-rw-r--r--
escape_runtime_atomic.go
874
B
-rw-r--r--
escape_selfassign.go
538
B
-rw-r--r--
escape_slice.go
3.49
KB
-rw-r--r--
escape_struct_param1.go
9.43
KB
-rw-r--r--
escape_struct_param2.go
9.46
KB
-rw-r--r--
escape_struct_return.go
1.04
KB
-rw-r--r--
escape_sync_atomic.go
943
B
-rw-r--r--
escape_unsafe.go
2.16
KB
-rw-r--r--
fibo.go
6.28
KB
-rw-r--r--
finprofiled.go
1.95
KB
-rw-r--r--
float_lit.go
3.95
KB
-rw-r--r--
float_lit2.go
7.88
KB
-rw-r--r--
float_lit3.go
1.78
KB
-rw-r--r--
floatcmp.go
3.03
KB
-rw-r--r--
for.go
844
B
-rw-r--r--
func.go
1.29
KB
-rw-r--r--
func1.go
434
B
-rw-r--r--
func2.go
578
B
-rw-r--r--
func3.go
505
B
-rw-r--r--
func4.go
409
B
-rw-r--r--
func5.go
1.49
KB
-rw-r--r--
func6.go
393
B
-rw-r--r--
func7.go
477
B
-rw-r--r--
func8.go
599
B
-rw-r--r--
funcdup.go
1.19
KB
-rw-r--r--
funcdup2.go
655
B
-rw-r--r--
gc.go
411
B
-rw-r--r--
gc1.go
303
B
-rw-r--r--
gc2.go
972
B
-rw-r--r--
gcgort.go
34.54
KB
-rw-r--r--
gcstring.go
872
B
-rw-r--r--
goprint.go
722
B
-rw-r--r--
goprint.out
65
B
-rw-r--r--
goto.go
8.39
KB
-rw-r--r--
heapsampling.go
9.53
KB
-rw-r--r--
helloworld.go
269
B
-rw-r--r--
helloworld.out
13
B
-rw-r--r--
if.go
1.36
KB
-rw-r--r--
import.go
425
B
-rw-r--r--
import1.go
633
B
-rw-r--r--
import2.go
247
B
-rw-r--r--
import4.go
310
B
-rw-r--r--
import5.go
722
B
-rw-r--r--
import6.go
1.38
KB
-rw-r--r--
index.go
6.42
KB
-rw-r--r--
index0.go
301
B
-rw-r--r--
index1.go
305
B
-rw-r--r--
index2.go
305
B
-rw-r--r--
indirect.go
1.39
KB
-rw-r--r--
indirect1.go
1.53
KB
-rw-r--r--
init.go
432
B
-rw-r--r--
init1.go
1.08
KB
-rw-r--r--
initcomma.go
1.22
KB
-rw-r--r--
initempty.go
604
B
-rw-r--r--
initialize.go
1.24
KB
-rw-r--r--
initializerr.go
1.04
KB
-rw-r--r--
initloop.go
387
B
-rw-r--r--
inline.go
4.33
KB
-rw-r--r--
inline_big.go
12.64
KB
-rw-r--r--
inline_caller.go
1.36
KB
-rw-r--r--
inline_callers.go
1.87
KB
-rw-r--r--
inline_literal.go
1.02
KB
-rw-r--r--
inline_math_bits_rotate.go
569
B
-rw-r--r--
inline_sync.go
1.63
KB
-rw-r--r--
inline_variadic.go
516
B
-rw-r--r--
int_lit.go
387
B
-rw-r--r--
intcvt.go
4.26
KB
-rw-r--r--
intrinsic.go
259
B
-rw-r--r--
intrinsic_atomic.go
791
B
-rw-r--r--
iota.go
1.59
KB
-rw-r--r--
label.go
1007
B
-rw-r--r--
label1.go
1.88
KB
-rw-r--r--
linkmain.go
236
B
-rw-r--r--
linkmain_run.go
1.71
KB
-rw-r--r--
linkname.go
456
B
-rw-r--r--
linkobj.go
3.17
KB
-rw-r--r--
linkx.go
741
B
-rw-r--r--
linkx_run.go
1.65
KB
-rw-r--r--
literal.go
4.99
KB
-rw-r--r--
literal2.go
2.22
KB
-rw-r--r--
live.go
17.83
KB
-rw-r--r--
live1.go
1.29
KB
-rw-r--r--
live2.go
963
B
-rw-r--r--
live_syscall.go
1.13
KB
-rw-r--r--
locklinear.go
3.56
KB
-rw-r--r--
loopbce.go
9.75
KB
-rw-r--r--
makechan.go
1.29
KB
-rw-r--r--
makemap.go
1.5
KB
-rw-r--r--
makenew.go
522
B
-rw-r--r--
mallocfin.go
1.18
KB
-rw-r--r--
map.go
14.91
KB
-rw-r--r--
map1.go
1.39
KB
-rw-r--r--
mapclear.go
1.49
KB
-rw-r--r--
maplinear.go
3.62
KB
-rw-r--r--
mergemul.go
3.16
KB
-rw-r--r--
method.go
5.24
KB
-rw-r--r--
method1.go
727
B
-rw-r--r--
method2.go
1.05
KB
-rw-r--r--
method3.go
570
B
-rw-r--r--
method4.go
230
B
-rw-r--r--
method5.go
6.73
KB
-rw-r--r--
method6.go
465
B
-rw-r--r--
method7.go
940
B
-rw-r--r--
named.go
4.61
KB
-rw-r--r--
named1.go
970
B
-rw-r--r--
nil.go
2.23
KB
-rw-r--r--
nilcheck.go
3.62
KB
-rw-r--r--
nilptr.go
3.06
KB
-rw-r--r--
nilptr2.go
3.6
KB
-rw-r--r--
nilptr3.go
5.56
KB
-rw-r--r--
nilptr4.go
428
B
-rw-r--r--
nilptr5.go
814
B
-rw-r--r--
nilptr5_aix.go
805
B
-rw-r--r--
nilptr5_wasm.go
812
B
-rw-r--r--
nilptr_aix.go
3.09
KB
-rw-r--r--
nosplit.go
10.51
KB
-rw-r--r--
notinheap.go
1.39
KB
-rw-r--r--
notinheap2.go
708
B
-rw-r--r--
notinheap3.go
1.24
KB
-rw-r--r--
nowritebarrier.go
1.2
KB
-rw-r--r--
nul1.go
1.23
KB
-rw-r--r--
opt_branchlikely.go
2.08
KB
-rw-r--r--
parentype.go
424
B
-rw-r--r--
peano.go
2.22
KB
-rw-r--r--
phiopt.go
1.68
KB
-rw-r--r--
print.go
1.56
KB
-rw-r--r--
print.out
247
B
-rw-r--r--
printbig.go
315
B
-rw-r--r--
printbig.out
41
B
-rw-r--r--
prove.go
17.74
KB
-rw-r--r--
range.go
8.14
KB
-rw-r--r--
recover.go
10.64
KB
-rw-r--r--
recover1.go
2.5
KB
-rw-r--r--
recover2.go
1.22
KB
-rw-r--r--
recover3.go
1.64
KB
-rw-r--r--
recover4.go
2.17
KB
-rw-r--r--
recover5.go
408
B
-rw-r--r--
reflectmethod1.go
578
B
-rw-r--r--
reflectmethod2.go
719
B
-rw-r--r--
reflectmethod3.go
651
B
-rw-r--r--
reflectmethod4.go
573
B
-rw-r--r--
rename.go
1.52
KB
-rw-r--r--
rename1.go
1.11
KB
-rw-r--r--
reorder.go
2.1
KB
-rw-r--r--
reorder2.go
7.22
KB
-rw-r--r--
retjmp.go
252
B
-rw-r--r--
return.go
32.69
KB
-rw-r--r--
rotate.go
3.27
KB
-rw-r--r--
rotate0.go
286
B
-rw-r--r--
rotate1.go
286
B
-rw-r--r--
rotate2.go
286
B
-rw-r--r--
rotate3.go
286
B
-rw-r--r--
run.go
46.86
KB
-rw-r--r--
rune.go
603
B
-rw-r--r--
runtime.go
602
B
-rw-r--r--
shift1.go
8.89
KB
-rw-r--r--
shift2.go
1.31
KB
-rw-r--r--
sieve.go
1
KB
-rw-r--r--
sigchld.go
365
B
-rw-r--r--
sigchld.out
17
B
-rw-r--r--
simassign.go
1.12
KB
-rw-r--r--
sinit.go
5.75
KB
-rw-r--r--
sinit_run.go
853
B
-rw-r--r--
sizeof.go
2.95
KB
-rw-r--r--
slice3.go
2.92
KB
-rw-r--r--
slice3err.go
4.48
KB
-rw-r--r--
slicecap.go
1.85
KB
-rw-r--r--
sliceopt.go
735
B
-rw-r--r--
solitaire.go
2.9
KB
-rw-r--r--
stack.go
1.69
KB
-rw-r--r--
stackobj.go
975
B
-rw-r--r--
stackobj2.go
1.55
KB
-rw-r--r--
stackobj3.go
1.42
KB
-rw-r--r--
strcopy.go
674
B
-rw-r--r--
strength.go
1.02
KB
-rw-r--r--
string_lit.go
3.58
KB
-rw-r--r--
stringrange.go
1.45
KB
-rw-r--r--
struct0.go
565
B
-rw-r--r--
switch.go
6.1
KB
-rw-r--r--
switch2.go
778
B
-rw-r--r--
switch3.go
1.19
KB
-rw-r--r--
switch4.go
526
B
-rw-r--r--
switch5.go
2.21
KB
-rw-r--r--
switch6.go
1.1
KB
-rw-r--r--
switch7.go
781
B
-rw-r--r--
tinyfin.go
1.57
KB
-rw-r--r--
torture.go
7.69
KB
-rw-r--r--
turing.go
893
B
-rw-r--r--
typecheck.go
386
B
-rw-r--r--
typecheckloop.go
486
B
-rw-r--r--
typeswitch.go
1.83
KB
-rw-r--r--
typeswitch1.go
1.6
KB
-rw-r--r--
typeswitch2.go
655
B
-rw-r--r--
typeswitch2b.go
598
B
-rw-r--r--
typeswitch3.go
964
B
-rw-r--r--
uintptrescapes.go
250
B
-rw-r--r--
uintptrescapes2.go
2.18
KB
-rw-r--r--
uintptrescapes3.go
1.28
KB
-rw-r--r--
undef.go
758
B
-rw-r--r--
utf.go
1.19
KB
-rw-r--r--
varerr.go
434
B
-rw-r--r--
varinit.go
509
B
-rw-r--r--
writebarrier.go
5.57
KB
-rw-r--r--
zerodivide.go
5.71
KB
-rw-r--r--
Delete
Unzip
Zip
${this.title}
Close
Code Editor : heapsampling.go
// run // Copyright 2009 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. // Test heap sampling logic. package main import ( "fmt" "math" "runtime" ) var a16 *[16]byte var a512 *[512]byte var a256 *[256]byte var a1k *[1024]byte var a16k *[16 * 1024]byte var a17k *[17 * 1024]byte var a18k *[18 * 1024]byte // This test checks that heap sampling produces reasonable results. // Note that heap sampling uses randomization, so the results vary for // run to run. To avoid flakes, this test performs multiple // experiments and only complains if all of them consistently fail. func main() { // Sample at 16K instead of default 512K to exercise sampling more heavily. runtime.MemProfileRate = 16 * 1024 if err := testInterleavedAllocations(); err != nil { panic(err.Error()) } if err := testSmallAllocations(); err != nil { panic(err.Error()) } } // Repeatedly exercise a set of allocations and check that the heap // profile collected by the runtime unsamples to a reasonable // value. Because sampling is based on randomization, there can be // significant variability on the unsampled data. To account for that, // the testcase allows for a 10% margin of error, but only fails if it // consistently fails across three experiments, avoiding flakes. func testInterleavedAllocations() error { const iters = 100000 // Sizes of the allocations performed by each experiment. frames := []string{"main.allocInterleaved1", "main.allocInterleaved2", "main.allocInterleaved3"} // Pass if at least one of three experiments has no errors. Use a separate // function for each experiment to identify each experiment in the profile. allocInterleaved1(iters) if checkAllocations(getMemProfileRecords(), frames[0:1], iters, allocInterleavedSizes) == nil { // Passed on first try, report no error. return nil } allocInterleaved2(iters) if checkAllocations(getMemProfileRecords(), frames[0:2], iters, allocInterleavedSizes) == nil { // Passed on second try, report no error. return nil } allocInterleaved3(iters) // If it fails a third time, we may be onto something. return checkAllocations(getMemProfileRecords(), frames[0:3], iters, allocInterleavedSizes) } var allocInterleavedSizes = []int64{17 * 1024, 1024, 18 * 1024, 512, 16 * 1024, 256} // allocInterleaved stress-tests the heap sampling logic by interleaving large and small allocations. func allocInterleaved(n int) { for i := 0; i < n; i++ { // Test verification depends on these lines being contiguous. a17k = new([17 * 1024]byte) a1k = new([1024]byte) a18k = new([18 * 1024]byte) a512 = new([512]byte) a16k = new([16 * 1024]byte) a256 = new([256]byte) // Test verification depends on these lines being contiguous. } } func allocInterleaved1(n int) { allocInterleaved(n) } func allocInterleaved2(n int) { allocInterleaved(n) } func allocInterleaved3(n int) { allocInterleaved(n) } // Repeatedly exercise a set of allocations and check that the heap // profile collected by the runtime unsamples to a reasonable // value. Because sampling is based on randomization, there can be // significant variability on the unsampled data. To account for that, // the testcase allows for a 10% margin of error, but only fails if it // consistently fails across three experiments, avoiding flakes. func testSmallAllocations() error { const iters = 100000 // Sizes of the allocations performed by each experiment. sizes := []int64{1024, 512, 256} frames := []string{"main.allocSmall1", "main.allocSmall2", "main.allocSmall3"} // Pass if at least one of three experiments has no errors. Use a separate // function for each experiment to identify each experiment in the profile. allocSmall1(iters) if checkAllocations(getMemProfileRecords(), frames[0:1], iters, sizes) == nil { // Passed on first try, report no error. return nil } allocSmall2(iters) if checkAllocations(getMemProfileRecords(), frames[0:2], iters, sizes) == nil { // Passed on second try, report no error. return nil } allocSmall3(iters) // If it fails a third time, we may be onto something. return checkAllocations(getMemProfileRecords(), frames[0:3], iters, sizes) } // allocSmall performs only small allocations for sanity testing. func allocSmall(n int) { for i := 0; i < n; i++ { // Test verification depends on these lines being contiguous. a1k = new([1024]byte) a512 = new([512]byte) a256 = new([256]byte) } } // Three separate instances of testing to avoid flakes. Will report an error // only if they all consistently report failures. func allocSmall1(n int) { allocSmall(n) } func allocSmall2(n int) { allocSmall(n) } func allocSmall3(n int) { allocSmall(n) } // checkAllocations validates that the profile records collected for // the named function are consistent with count contiguous allocations // of the specified sizes. // Check multiple functions and only report consistent failures across // multiple tests. // Look only at samples that include the named frames, and group the // allocations by their line number. All these allocations are done from // the same leaf function, so their line numbers are the same. func checkAllocations(records []runtime.MemProfileRecord, frames []string, count int64, size []int64) error { objectsPerLine := map[int][]int64{} bytesPerLine := map[int][]int64{} totalCount := []int64{} // Compute the line number of the first allocation. All the // allocations are from the same leaf, so pick the first one. var firstLine int for ln := range allocObjects(records, frames[0]) { if firstLine == 0 || firstLine > ln { firstLine = ln } } for _, frame := range frames { var objectCount int64 a := allocObjects(records, frame) for s := range size { // Allocations of size size[s] should be on line firstLine + s. ln := firstLine + s objectsPerLine[ln] = append(objectsPerLine[ln], a[ln].objects) bytesPerLine[ln] = append(bytesPerLine[ln], a[ln].bytes) objectCount += a[ln].objects } totalCount = append(totalCount, objectCount) } for i, w := range size { ln := firstLine + i if err := checkValue(frames[0], ln, "objects", count, objectsPerLine[ln]); err != nil { return err } if err := checkValue(frames[0], ln, "bytes", count*w, bytesPerLine[ln]); err != nil { return err } } return checkValue(frames[0], 0, "total", count*int64(len(size)), totalCount) } // checkValue checks an unsampled value against its expected value. // Given that this is a sampled value, it will be unexact and will change // from run to run. Only report it as a failure if all the values land // consistently far from the expected value. func checkValue(fname string, ln int, testName string, want int64, got []int64) error { if got == nil { return fmt.Errorf("Unexpected empty result") } min, max := got[0], got[0] for _, g := range got[1:] { if g < min { min = g } if g > max { max = g } } margin := want / 10 // 10% margin. if min > want+margin || max < want-margin { return fmt.Errorf("%s:%d want %s in [%d: %d], got %v", fname, ln, testName, want-margin, want+margin, got) } return nil } func getMemProfileRecords() []runtime.MemProfileRecord { // Force the runtime to update the object and byte counts. // This can take up to two GC cycles to get a complete // snapshot of the current point in time. runtime.GC() runtime.GC() // Find out how many records there are (MemProfile(nil, true)), // allocate that many records, and get the data. // There's a race—more records might be added between // the two calls—so allocate a few extra records for safety // and also try again if we're very unlucky. // The loop should only execute one iteration in the common case. var p []runtime.MemProfileRecord n, ok := runtime.MemProfile(nil, true) for { // Allocate room for a slightly bigger profile, // in case a few more entries have been added // since the call to MemProfile. p = make([]runtime.MemProfileRecord, n+50) n, ok = runtime.MemProfile(p, true) if ok { p = p[0:n] break } // Profile grew; try again. } return p } type allocStat struct { bytes, objects int64 } // allocObjects examines the profile records for samples including the // named function and returns the allocation stats aggregated by // source line number of the allocation (at the leaf frame). func allocObjects(records []runtime.MemProfileRecord, function string) map[int]allocStat { a := make(map[int]allocStat) for _, r := range records { var pcs []uintptr for _, s := range r.Stack0 { if s == 0 { break } pcs = append(pcs, s) } frames := runtime.CallersFrames(pcs) line := 0 for { frame, more := frames.Next() name := frame.Function if line == 0 { line = frame.Line } if name == function { allocStat := a[line] allocStat.bytes += r.AllocBytes allocStat.objects += r.AllocObjects a[line] = allocStat } if !more { break } } } for line, stats := range a { objects, bytes := scaleHeapSample(stats.objects, stats.bytes, int64(runtime.MemProfileRate)) a[line] = allocStat{bytes, objects} } return a } // scaleHeapSample unsamples heap allocations. // Taken from src/cmd/pprof/internal/profile/legacy_profile.go func scaleHeapSample(count, size, rate int64) (int64, int64) { if count == 0 || size == 0 { return 0, 0 } if rate <= 1 { // if rate==1 all samples were collected so no adjustment is needed. // if rate<1 treat as unknown and skip scaling. return count, size } avgSize := float64(size) / float64(count) scale := 1 / (1 - math.Exp(-avgSize/float64(rate))) return int64(float64(count) * scale), int64(float64(size) * scale) }
Close