File Manager

X7ROOT File Manager

Current Path: /opt/golang/1.17.2/src/runtime

📁 ..
📄 HACKING.md(13.07 KB)
📄 Makefile(178 B)
📄 abi_test.go(2.88 KB)
📄 alg.go(9.45 KB)
📄 asm.s(715 B)
📄 asm_386.s(40.27 KB)
📄 asm_amd64.s(56.93 KB)
📄 asm_arm.s(30.23 KB)
📄 asm_arm64.s(33 KB)
📄 asm_mips64x.s(22.43 KB)
📄 asm_mipsx.s(24.39 KB)
📄 asm_ppc64x.h(1023 B)
📄 asm_ppc64x.s(29.16 KB)
📄 asm_riscv64.s(22.43 KB)
📄 asm_s390x.s(26.04 KB)
📄 asm_wasm.s(9.8 KB)
📄 atomic_arm64.s(259 B)
📄 atomic_mips64x.s(326 B)
📄 atomic_mipsx.s(284 B)
📄 atomic_pointer.go(2.62 KB)
📄 atomic_ppc64x.s(461 B)
📄 atomic_riscv64.s(275 B)
📄 auxv_none.go(360 B)
📄 callers_test.go(7.72 KB)
📁 cgo
📄 cgo.go(2.01 KB)
📄 cgo_mmap.go(2.42 KB)
📄 cgo_ppc64x.go(439 B)
📄 cgo_sigaction.go(3.17 KB)
📄 cgocall.go(18.88 KB)
📄 cgocallback.go(317 B)
📄 cgocheck.go(6.83 KB)
📄 chan.go(23.54 KB)
📄 chan_test.go(23.01 KB)
📄 chanbarrier_test.go(1.4 KB)
📄 checkptr.go(3.29 KB)
📄 checkptr_test.go(1.62 KB)
📄 closure_test.go(937 B)
📄 compiler.go(413 B)
📄 complex.go(1.59 KB)
📄 complex_test.go(1.05 KB)
📄 conv_wasm_test.go(2.96 KB)
📄 cpuflags.go(800 B)
📄 cpuflags_amd64.go(533 B)
📄 cpuflags_arm64.go(334 B)
📄 cpuprof.go(6.92 KB)
📄 cputicks.go(497 B)
📄 crash_cgo_test.go(16.17 KB)
📄 crash_nonunix_test.go(429 B)
📄 crash_test.go(20.96 KB)
📄 crash_unix_test.go(8.52 KB)
📁 debug
📄 debug.go(1.63 KB)
📄 debug_test.go(6.82 KB)
📄 debugcall.go(6.21 KB)
📄 debuglog.go(17.49 KB)
📄 debuglog_off.go(377 B)
📄 debuglog_on.go(1.11 KB)
📄 debuglog_test.go(4.56 KB)
📄 defer_test.go(10.32 KB)
📄 defs1_linux.go(862 B)
📄 defs1_netbsd_386.go(2.84 KB)
📄 defs1_netbsd_amd64.go(3.07 KB)
📄 defs1_netbsd_arm.go(2.96 KB)
📄 defs1_netbsd_arm64.go(3.18 KB)
📄 defs1_solaris_amd64.go(4.02 KB)
📄 defs2_linux.go(3.52 KB)
📄 defs3_linux.go(1.11 KB)
📄 defs_aix.go(4.18 KB)
📄 defs_aix_ppc64.go(3.63 KB)
📄 defs_arm_linux.go(2.69 KB)
📄 defs_darwin.go(3.79 KB)
📄 defs_darwin_amd64.go(6.07 KB)
📄 defs_darwin_arm64.go(3.89 KB)
📄 defs_dragonfly.go(2.63 KB)
📄 defs_dragonfly_amd64.go(3.31 KB)
📄 defs_freebsd.go(3.86 KB)
📄 defs_freebsd_386.go(4.38 KB)
📄 defs_freebsd_amd64.go(4.65 KB)
📄 defs_freebsd_arm.go(3.71 KB)
📄 defs_freebsd_arm64.go(4.03 KB)
📄 defs_illumos_amd64.go(285 B)
📄 defs_linux.go(3.05 KB)
📄 defs_linux_386.go(3.77 KB)
📄 defs_linux_amd64.go(4.28 KB)
📄 defs_linux_arm.go(3.45 KB)
📄 defs_linux_arm64.go(3.21 KB)
📄 defs_linux_mips64x.go(3.24 KB)
📄 defs_linux_mipsx.go(3.21 KB)
📄 defs_linux_ppc64.go(3.28 KB)
📄 defs_linux_ppc64le.go(3.28 KB)
📄 defs_linux_riscv64.go(3.27 KB)
📄 defs_linux_s390x.go(2.76 KB)
📄 defs_netbsd.go(2.76 KB)
📄 defs_netbsd_386.go(872 B)
📄 defs_netbsd_amd64.go(1.03 KB)
📄 defs_netbsd_arm.go(781 B)
📄 defs_openbsd.go(3.1 KB)
📄 defs_openbsd_386.go(2.89 KB)
📄 defs_openbsd_amd64.go(3.09 KB)
📄 defs_openbsd_arm.go(3 KB)
📄 defs_openbsd_arm64.go(2.76 KB)
📄 defs_openbsd_mips64.go(2.66 KB)
📄 defs_plan9_386.go(1.63 KB)
📄 defs_plan9_amd64.go(1.82 KB)
📄 defs_plan9_arm.go(1.73 KB)
📄 defs_solaris.go(3.35 KB)
📄 defs_solaris_amd64.go(1021 B)
📄 defs_windows.go(2.09 KB)
📄 defs_windows_386.go(1.98 KB)
📄 defs_windows_amd64.go(2.71 KB)
📄 defs_windows_arm.go(2.11 KB)
📄 defs_windows_arm64.go(2.63 KB)
📄 duff_386.s(8.24 KB)
📄 duff_amd64.s(5.62 KB)
📄 duff_arm.s(7.11 KB)
📄 duff_arm64.s(5.25 KB)
📄 duff_mips64x.s(11.31 KB)
📄 duff_ppc64x.s(2.43 KB)
📄 duff_riscv64.s(11.38 KB)
📄 duff_s390x.s(507 B)
📄 env_plan9.go(2.99 KB)
📄 env_posix.go(1.95 KB)
📄 env_test.go(1.16 KB)
📄 error.go(9.23 KB)
📄 example_test.go(1.55 KB)
📄 export_aix_test.go(204 B)
📄 export_arm_test.go(226 B)
📄 export_darwin_test.go(351 B)
📄 export_debug_regabiargs_off_test.go(416 B)
📄 export_debug_regabiargs_on_test.go(1.39 KB)
📄 export_debug_test.go(5.86 KB)
📄 export_debuglog_test.go(1.27 KB)
📄 export_futex_test.go(570 B)
📄 export_linux_test.go(429 B)
📄 export_mmap_test.go(571 B)
📄 export_pipe2_test.go(436 B)
📄 export_pipe_test.go(240 B)
📄 export_solaris_test.go(282 B)
📄 export_test.go(30.12 KB)
📄 export_unix_test.go(2.35 KB)
📄 export_windows_test.go(652 B)
📄 extern.go(12.58 KB)
📄 fastlog2.go(1.22 KB)
📄 fastlog2_test.go(784 B)
📄 fastlog2table.go(904 B)
📄 float.go(1.35 KB)
📄 funcdata.h(2.47 KB)
📄 futex_test.go(2.15 KB)
📄 gc_test.go(19.21 KB)
📄 gcinfo_test.go(5.69 KB)
📄 go_tls.h(366 B)
📄 hash32.go(1.61 KB)
📄 hash64.go(2.01 KB)
📄 hash_test.go(16.5 KB)
📄 heapdump.go(17.74 KB)
📄 histogram.go(6.42 KB)
📄 histogram_test.go(1.85 KB)
📄 iface.go(16.13 KB)
📄 iface_test.go(7.51 KB)
📁 internal
📄 lfstack.go(1.77 KB)
📄 lfstack_32bit.go(562 B)
📄 lfstack_64bit.go(2.24 KB)
📄 lfstack_test.go(2.78 KB)
📄 libfuzzer.go(2.6 KB)
📄 libfuzzer_amd64.s(961 B)
📄 libfuzzer_arm64.s(772 B)
📄 lock_futex.go(5.22 KB)
📄 lock_js.go(5.81 KB)
📄 lock_sema.go(6.8 KB)
📄 lockrank.go(11.62 KB)
📄 lockrank_off.go(1.17 KB)
📄 lockrank_on.go(9.84 KB)
📄 lockrank_test.go(1.15 KB)
📄 malloc.go(52.33 KB)
📄 malloc_test.go(10.83 KB)
📄 map.go(42.47 KB)
📄 map_benchmark_test.go(10.51 KB)
📄 map_fast32.go(12.63 KB)
📄 map_fast64.go(12.82 KB)
📄 map_faststr.go(14.15 KB)
📄 map_test.go(27.52 KB)
📄 mbarrier.go(12.2 KB)
📄 mbitmap.go(65.27 KB)
📄 mcache.go(9.68 KB)
📄 mcentral.go(7.8 KB)
📄 mcheckmark.go(2.81 KB)
📄 mem_aix.go(1.94 KB)
📄 mem_bsd.go(2.12 KB)
📄 mem_darwin.go(1.88 KB)
📄 mem_js.go(2.35 KB)
📄 mem_linux.go(5.59 KB)
📄 mem_plan9.go(4.53 KB)
📄 mem_windows.go(3.87 KB)
📄 memclr_386.s(2.42 KB)
📄 memclr_amd64.s(3.89 KB)
📄 memclr_arm.s(2.6 KB)
📄 memclr_arm64.s(3.65 KB)
📄 memclr_mips64x.s(1.75 KB)
📄 memclr_mipsx.s(1.35 KB)
📄 memclr_plan9_386.s(983 B)
📄 memclr_plan9_amd64.s(511 B)
📄 memclr_ppc64x.s(4.31 KB)
📄 memclr_riscv64.s(926 B)
📄 memclr_s390x.s(1.96 KB)
📄 memclr_wasm.s(622 B)
📄 memmove_386.s(4.46 KB)
📄 memmove_amd64.s(12.66 KB)
📄 memmove_arm.s(5.9 KB)
📄 memmove_arm64.s(6 KB)
📄 memmove_linux_amd64_test.go(1.6 KB)
📄 memmove_mips64x.s(1.85 KB)
📄 memmove_mipsx.s(4.42 KB)
📄 memmove_plan9_386.s(3.06 KB)
📄 memmove_plan9_amd64.s(3.04 KB)
📄 memmove_ppc64x.s(4.11 KB)
📄 memmove_riscv64.s(1.81 KB)
📄 memmove_s390x.s(2.92 KB)
📄 memmove_test.go(12.04 KB)
📄 memmove_wasm.s(1.74 KB)
📁 metrics
📄 metrics.go(17.69 KB)
📄 metrics_test.go(12.48 KB)
📄 mfinal.go(15.76 KB)
📄 mfinal_test.go(5.85 KB)
📄 mfixalloc.go(2.73 KB)
📄 mgc.go(55.18 KB)
📄 mgcmark.go(45.54 KB)
📄 mgcpacer.go(29.56 KB)
📄 mgcscavenge.go(35.05 KB)
📄 mgcscavenge_test.go(12.74 KB)
📄 mgcstack.go(10.58 KB)
📄 mgcsweep.go(23.56 KB)
📄 mgcwork.go(12.82 KB)
📄 mheap.go(66.31 KB)
📄 mkduff.go(7.19 KB)
📄 mkfastlog2table.go(1.32 KB)
📄 mkpreempt.go(14.17 KB)
📄 mksizeclasses.go(9.31 KB)
📄 mmap.go(990 B)
📄 mpagealloc.go(36.77 KB)
📄 mpagealloc_32bit.go(3.81 KB)
📄 mpagealloc_64bit.go(6.65 KB)
📄 mpagealloc_test.go(32.38 KB)
📄 mpagecache.go(5.28 KB)
📄 mpagecache_test.go(9.93 KB)
📄 mpallocbits.go(12.01 KB)
📄 mpallocbits_test.go(13.69 KB)
📄 mprof.go(25.82 KB)
📄 mranges.go(11.84 KB)
📄 mranges_test.go(5.68 KB)
📁 msan
📄 msan.go(1.51 KB)
📄 msan0.go(741 B)
📄 msan_amd64.s(2.32 KB)
📄 msan_arm64.s(2.01 KB)
📄 msize.go(777 B)
📄 mspanset.go(12.2 KB)
📄 mstats.go(30.65 KB)
📄 mwbbuf.go(9.3 KB)
📄 nbpipe_fcntl_libc_test.go(499 B)
📄 nbpipe_fcntl_unix_test.go(507 B)
📄 nbpipe_pipe.go(426 B)
📄 nbpipe_pipe2.go(592 B)
📄 nbpipe_test.go(2.26 KB)
📄 net_plan9.go(645 B)
📄 netpoll.go(16.24 KB)
📄 netpoll_aix.go(4.87 KB)
📄 netpoll_epoll.go(4.21 KB)
📄 netpoll_fake.go(670 B)
📄 netpoll_kqueue.go(4.64 KB)
📄 netpoll_os_test.go(360 B)
📄 netpoll_solaris.go(10.75 KB)
📄 netpoll_stub.go(1.42 KB)
📄 netpoll_windows.go(3.75 KB)
📄 norace_linux_test.go(905 B)
📄 norace_test.go(996 B)
📄 numcpu_freebsd_test.go(381 B)
📄 os2_aix.go(20.45 KB)
📄 os2_freebsd.go(302 B)
📄 os2_openbsd.go(296 B)
📄 os2_plan9.go(1.48 KB)
📄 os2_solaris.go(320 B)
📄 os3_plan9.go(3.88 KB)
📄 os3_solaris.go(17.02 KB)
📄 os_aix.go(8.06 KB)
📄 os_android.go(463 B)
📄 os_darwin.go(11.54 KB)
📄 os_darwin_arm64.go(416 B)
📄 os_dragonfly.go(6.46 KB)
📄 os_freebsd.go(11.2 KB)
📄 os_freebsd2.go(507 B)
📄 os_freebsd_amd64.go(529 B)
📄 os_freebsd_arm.go(1.32 KB)
📄 os_freebsd_arm64.go(398 B)
📄 os_freebsd_noauxv.go(264 B)
📄 os_illumos.go(3.93 KB)
📄 os_js.go(3.26 KB)
📄 os_linux.go(13.47 KB)
📄 os_linux_arm.go(1.35 KB)
📄 os_linux_arm64.go(572 B)
📄 os_linux_be64.go(862 B)
📄 os_linux_generic.go(950 B)
📄 os_linux_mips64x.go(1.11 KB)
📄 os_linux_mipsx.go(1.09 KB)
📄 os_linux_noauxv.go(408 B)
📄 os_linux_novdso.go(387 B)
📄 os_linux_ppc64x.go(566 B)
📄 os_linux_riscv64.go(198 B)
📄 os_linux_s390x.go(316 B)
📄 os_linux_x86.go(270 B)
📄 os_netbsd.go(9.09 KB)
📄 os_netbsd_386.go(588 B)
📄 os_netbsd_amd64.go(585 B)
📄 os_netbsd_arm.go(1.13 KB)
📄 os_netbsd_arm64.go(827 B)
📄 os_nonopenbsd.go(456 B)
📄 os_only_solaris.go(376 B)
📄 os_openbsd.go(6.01 KB)
📄 os_openbsd_arm.go(749 B)
📄 os_openbsd_arm64.go(416 B)
📄 os_openbsd_libc.go(1.7 KB)
📄 os_openbsd_mips64.go(416 B)
📄 os_openbsd_syscall.go(1.27 KB)
📄 os_openbsd_syscall1.go(466 B)
📄 os_openbsd_syscall2.go(2.5 KB)
📄 os_plan9.go(10.2 KB)
📄 os_plan9_arm.go(462 B)
📄 os_solaris.go(6.49 KB)
📄 os_windows.go(43.68 KB)
📄 os_windows_arm.go(511 B)
📄 os_windows_arm64.go(339 B)
📄 panic.go(44.28 KB)
📄 panic32.go(4.83 KB)
📄 panic_test.go(1.71 KB)
📄 plugin.go(4.27 KB)
📁 pprof
📄 preempt.go(15.4 KB)
📄 preempt_386.s(1.07 KB)
📄 preempt_amd64.s(1.81 KB)
📄 preempt_arm.s(1.66 KB)
📄 preempt_arm64.s(2.99 KB)
📄 preempt_mips64x.s(2.93 KB)
📄 preempt_mipsx.s(2.89 KB)
📄 preempt_nonwindows.go(309 B)
📄 preempt_ppc64x.s(2.92 KB)
📄 preempt_riscv64.s(2.48 KB)
📄 preempt_s390x.s(1.19 KB)
📄 preempt_wasm.s(365 B)
📄 print.go(5.95 KB)
📄 proc.go(181.46 KB)
📄 proc_runtime_test.go(820 B)
📄 proc_test.go(25.02 KB)
📄 profbuf.go(18.26 KB)
📄 profbuf_test.go(8.65 KB)
📄 proflabel.go(1.52 KB)
📁 race
📄 race.go(18.56 KB)
📄 race0.go(2.81 KB)
📄 race_amd64.s(14.46 KB)
📄 race_arm64.s(13.71 KB)
📄 race_ppc64le.s(17.72 KB)
📄 rand_test.go(783 B)
📄 rdebug.go(553 B)
📄 relax_stub.go(617 B)
📄 rt0_aix_ppc64.s(4.33 KB)
📄 rt0_android_386.s(822 B)
📄 rt0_android_amd64.s(754 B)
📄 rt0_android_arm.s(843 B)
📄 rt0_android_arm64.s(941 B)
📄 rt0_darwin_amd64.s(399 B)
📄 rt0_darwin_arm64.s(2.27 KB)
📄 rt0_dragonfly_amd64.s(448 B)
📄 rt0_freebsd_386.s(454 B)
📄 rt0_freebsd_amd64.s(442 B)
📄 rt0_freebsd_arm.s(298 B)
📄 rt0_freebsd_arm64.s(2.46 KB)
📄 rt0_illumos_amd64.s(311 B)
📄 rt0_ios_amd64.s(425 B)
📄 rt0_ios_arm64.s(425 B)
📄 rt0_js_wasm.s(2.3 KB)
📄 rt0_linux_386.s(450 B)
📄 rt0_linux_amd64.s(307 B)
📄 rt0_linux_arm.s(1007 B)
📄 rt0_linux_arm64.s(2.39 KB)
📄 rt0_linux_mips64x.s(1.03 KB)
📄 rt0_linux_mipsx.s(835 B)
📄 rt0_linux_ppc64.s(865 B)
📄 rt0_linux_ppc64le.s(3.88 KB)
📄 rt0_linux_riscv64.s(370 B)
📄 rt0_linux_s390x.s(676 B)
📄 rt0_netbsd_386.s(452 B)
📄 rt0_netbsd_amd64.s(309 B)
📄 rt0_netbsd_arm.s(296 B)
📄 rt0_netbsd_arm64.s(2.38 KB)
📄 rt0_openbsd_386.s(454 B)
📄 rt0_openbsd_amd64.s(311 B)
📄 rt0_openbsd_arm.s(298 B)
📄 rt0_openbsd_arm64.s(2.54 KB)
📄 rt0_openbsd_mips64.s(976 B)
📄 rt0_plan9_386.s(523 B)
📄 rt0_plan9_amd64.s(481 B)
📄 rt0_plan9_arm.s(397 B)
📄 rt0_solaris_amd64.s(311 B)
📄 rt0_windows_386.s(1.28 KB)
📄 rt0_windows_amd64.s(986 B)
📄 rt0_windows_arm.s(386 B)
📄 rt0_windows_arm64.s(725 B)
📄 runtime-gdb.py(15.02 KB)
📄 runtime-gdb_test.go(20.19 KB)
📄 runtime-lldb_test.go(4.95 KB)
📄 runtime.go(1.42 KB)
📄 runtime1.go(12.63 KB)
📄 runtime2.go(42.27 KB)
📄 runtime_linux_test.go(1.46 KB)
📄 runtime_mmap_test.go(1.91 KB)
📄 runtime_test.go(7.81 KB)
📄 runtime_unix_test.go(1.29 KB)
📄 rwmutex.go(3.53 KB)
📄 rwmutex_test.go(4.03 KB)
📄 select.go(14.45 KB)
📄 sema.go(16.08 KB)
📄 sema_test.go(2.5 KB)
📄 semasleep_test.go(1.65 KB)
📄 sigaction.go(543 B)
📄 signal_386.go(1.72 KB)
📄 signal_aix_ppc64.go(3.56 KB)
📄 signal_amd64.go(2.71 KB)
📄 signal_arm.go(2.56 KB)
📄 signal_arm64.go(3.16 KB)
📄 signal_darwin.go(2.13 KB)
📄 signal_darwin_amd64.go(3.85 KB)
📄 signal_darwin_arm64.go(3.6 KB)
📄 signal_dragonfly.go(2.17 KB)
📄 signal_dragonfly_amd64.go(2.01 KB)
📄 signal_freebsd.go(2.2 KB)
📄 signal_freebsd_386.go(1.55 KB)
📄 signal_freebsd_amd64.go(2.03 KB)
📄 signal_freebsd_arm.go(2.18 KB)
📄 signal_freebsd_arm64.go(3.23 KB)
📄 signal_linux_386.go(1.59 KB)
📄 signal_linux_amd64.go(2.05 KB)
📄 signal_linux_arm.go(2.13 KB)
📄 signal_linux_arm64.go(2.95 KB)
📄 signal_linux_mips64x.go(3.39 KB)
📄 signal_linux_mipsx.go(3.7 KB)
📄 signal_linux_ppc64x.go(3.46 KB)
📄 signal_linux_riscv64.go(2.92 KB)
📄 signal_linux_s390x.go(4.43 KB)
📄 signal_mips64x.go(3.2 KB)
📄 signal_mipsx.go(3.07 KB)
📄 signal_netbsd.go(2.18 KB)
📄 signal_netbsd_386.go(1.76 KB)
📄 signal_netbsd_amd64.go(2.33 KB)
📄 signal_netbsd_arm.go(2.3 KB)
📄 signal_netbsd_arm64.go(3.4 KB)
📄 signal_openbsd.go(2.18 KB)
📄 signal_openbsd_386.go(1.58 KB)
📄 signal_openbsd_amd64.go(2.04 KB)
📄 signal_openbsd_arm.go(2.12 KB)
📄 signal_openbsd_arm64.go(3.38 KB)
📄 signal_openbsd_mips64.go(3.28 KB)
📄 signal_plan9.go(1.93 KB)
📄 signal_ppc64x.go(3.64 KB)
📄 signal_riscv64.go(2.88 KB)
📄 signal_solaris.go(4.5 KB)
📄 signal_solaris_amd64.go(2.47 KB)
📄 signal_unix.go(37.82 KB)
📄 signal_windows.go(9.2 KB)
📄 signal_windows_test.go(5.73 KB)
📄 sigqueue.go(8.76 KB)
📄 sigqueue_note.go(673 B)
📄 sigqueue_plan9.go(3.39 KB)
📄 sigtab_aix.go(11.3 KB)
📄 sigtab_linux_generic.go(3.56 KB)
📄 sigtab_linux_mipsx.go(6.01 KB)
📄 sizeclasses.go(9.14 KB)
📄 sizeof_test.go(905 B)
📄 slice.go(8.94 KB)
📄 slice_test.go(10.32 KB)
📄 softfloat64.go(10.78 KB)
📄 softfloat64_test.go(4.05 KB)
📄 stack.go(41.92 KB)
📄 stack_test.go(21.05 KB)
📄 string.go(10.85 KB)
📄 string_test.go(9.62 KB)
📄 stubs.go(18.17 KB)
📄 stubs2.go(1.14 KB)
📄 stubs3.go(331 B)
📄 stubs_386.go(550 B)
📄 stubs_amd64.go(1.2 KB)
📄 stubs_arm.go(531 B)
📄 stubs_arm64.go(351 B)
📄 stubs_linux.go(663 B)
📄 stubs_mips64x.go(390 B)
📄 stubs_mipsx.go(305 B)
📄 stubs_nonlinux.go(315 B)
📄 stubs_ppc64.go(383 B)
📄 stubs_ppc64le.go(271 B)
📄 stubs_s390x.go(256 B)
📄 symtab.go(32.29 KB)
📄 symtab_test.go(6.78 KB)
📄 sys_aix_ppc64.s(7.13 KB)
📄 sys_arm.go(521 B)
📄 sys_arm64.go(469 B)
📄 sys_darwin.go(15.91 KB)
📄 sys_darwin_amd64.s(18.52 KB)
📄 sys_darwin_arm64.go(1.68 KB)
📄 sys_darwin_arm64.s(17.23 KB)
📄 sys_dragonfly_amd64.s(8.42 KB)
📄 sys_freebsd_386.s(8.98 KB)
📄 sys_freebsd_amd64.s(10.55 KB)
📄 sys_freebsd_arm.s(10.69 KB)
📄 sys_freebsd_arm64.s(10.33 KB)
📄 sys_libc.go(1.87 KB)
📄 sys_linux_386.s(18.17 KB)
📄 sys_linux_amd64.s(16.25 KB)
📄 sys_linux_arm.s(15.84 KB)
📄 sys_linux_arm64.s(15.26 KB)
📄 sys_linux_mips64x.s(13.4 KB)
📄 sys_linux_mipsx.s(11.16 KB)
📄 sys_linux_ppc64x.s(21.48 KB)
📄 sys_linux_riscv64.s(10.35 KB)
📄 sys_linux_s390x.s(10.52 KB)
📄 sys_mips64x.go(526 B)
📄 sys_mipsx.go(518 B)
📄 sys_netbsd_386.s(10.13 KB)
📄 sys_netbsd_amd64.s(9.91 KB)
📄 sys_netbsd_arm.s(10.94 KB)
📄 sys_netbsd_arm64.s(10.42 KB)
📄 sys_nonppc64x.go(271 B)
📄 sys_openbsd.go(2.3 KB)
📄 sys_openbsd1.go(1.16 KB)
📄 sys_openbsd2.go(7.31 KB)
📄 sys_openbsd3.go(3.29 KB)
📄 sys_openbsd_386.s(19.97 KB)
📄 sys_openbsd_amd64.s(16.44 KB)
📄 sys_openbsd_arm.s(18.09 KB)
📄 sys_openbsd_arm64.s(15.92 KB)
📄 sys_openbsd_mips64.s(9.22 KB)
📄 sys_plan9_386.s(4.4 KB)
📄 sys_plan9_amd64.s(4.47 KB)
📄 sys_plan9_arm.s(7.03 KB)
📄 sys_ppc64x.go(556 B)
📄 sys_riscv64.go(469 B)
📄 sys_s390x.go(469 B)
📄 sys_solaris_amd64.s(6.69 KB)
📄 sys_wasm.go(732 B)
📄 sys_wasm.s(2.65 KB)
📄 sys_windows_386.s(7.74 KB)
📄 sys_windows_amd64.s(9.16 KB)
📄 sys_windows_arm.s(12.02 KB)
📄 sys_windows_arm64.s(12.51 KB)
📄 sys_x86.go(574 B)
📄 syscall2_solaris.go(1.65 KB)
📄 syscall_aix.go(5.99 KB)
📄 syscall_solaris.go(8.26 KB)
📄 syscall_windows.go(16.48 KB)
📄 syscall_windows_test.go(32.53 KB)
📁 testdata
📄 textflag.h(1.52 KB)
📄 time.go(30.56 KB)
📄 time_fake.go(2.38 KB)
📄 time_linux_amd64.s(2.18 KB)
📄 time_nofake.go(587 B)
📄 time_test.go(2.03 KB)
📄 time_windows.h(694 B)
📄 time_windows_386.s(1.81 KB)
📄 time_windows_amd64.s(1.07 KB)
📄 time_windows_arm.s(2.07 KB)
📄 time_windows_arm64.s(1.33 KB)
📄 timeasm.go(468 B)
📄 timestub.go(595 B)
📄 timestub2.go(447 B)
📄 tls_arm.s(3.33 KB)
📄 tls_arm64.h(1.22 KB)
📄 tls_arm64.s(1.2 KB)
📄 tls_mips64x.s(759 B)
📄 tls_mipsx.s(731 B)
📄 tls_ppc64x.s(1.52 KB)
📄 tls_riscv64.s(726 B)
📄 tls_s390x.s(1.55 KB)
📄 tls_stub.go(294 B)
📄 tls_windows_amd64.go(294 B)
📁 trace
📄 trace.go(38.36 KB)
📄 traceback.go(46.51 KB)
📄 traceback_test.go(8.04 KB)
📄 type.go(18.59 KB)
📄 typekind.go(742 B)
📄 utf8.go(3.39 KB)
📄 vdso_elf32.go(2.79 KB)
📄 vdso_elf64.go(2.87 KB)
📄 vdso_freebsd.go(2.46 KB)
📄 vdso_freebsd_arm.go(454 B)
📄 vdso_freebsd_arm64.go(443 B)
📄 vdso_freebsd_x86.go(1.89 KB)
📄 vdso_in_none.go(490 B)
📄 vdso_linux.go(7.77 KB)
📄 vdso_linux_386.go(669 B)
📄 vdso_linux_amd64.go(685 B)
📄 vdso_linux_arm.go(669 B)
📄 vdso_linux_arm64.go(670 B)
📄 vdso_linux_mips64x.go(892 B)
📄 vdso_linux_ppc64x.go(712 B)
📄 vlop_386.s(2.02 KB)
📄 vlop_arm.s(7.06 KB)
📄 vlop_arm_test.go(3.75 KB)
📄 vlrt.go(5.91 KB)
📄 wincallback.go(3.52 KB)
📄 write_err.go(310 B)
📄 write_err_android.go(4.65 KB)
📄 zcallback_windows.go(155 B)
📄 zcallback_windows.s(63.05 KB)
📄 zcallback_windows_arm.s(89.34 KB)
📄 zcallback_windows_arm64.s(89.34 KB)

Editing: mgcpacer.go

// Copyright 2021 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.

package runtime

import (
	"internal/cpu"
	"runtime/internal/atomic"
	"unsafe"
)

const (
	// gcGoalUtilization is the goal CPU utilization for
	// marking as a fraction of GOMAXPROCS.
	gcGoalUtilization = 0.30

// gcBackgroundUtilization is the fixed CPU utilization for background
	// marking. It must be <= gcGoalUtilization. The difference between
	// gcGoalUtilization and gcBackgroundUtilization will be made up by
	// mark assists. The scheduler will aim to use within 50% of this
	// goal.
	//
	// Setting this to < gcGoalUtilization avoids saturating the trigger
	// feedback controller when there are no assists, which allows it to
	// better control CPU and heap growth. However, the larger the gap,
	// the more mutator assists are expected to happen, which impact
	// mutator latency.
	gcBackgroundUtilization = 0.25

// gcCreditSlack is the amount of scan work credit that can
	// accumulate locally before updating gcController.scanWork and,
	// optionally, gcController.bgScanCredit. Lower values give a more
	// accurate assist ratio and make it more likely that assists will
	// successfully steal background credit. Higher values reduce memory
	// contention.
	gcCreditSlack = 2000

// gcAssistTimeSlack is the nanoseconds of mutator assist time that
	// can accumulate on a P before updating gcController.assistTime.
	gcAssistTimeSlack = 5000

// gcOverAssistWork determines how many extra units of scan work a GC
	// assist does when an assist happens. This amortizes the cost of an
	// assist by pre-paying for this many bytes of future allocations.
	gcOverAssistWork = 64 << 10

// defaultHeapMinimum is the value of heapMinimum for GOGC==100.
	defaultHeapMinimum = 4 << 20
)

func init() {
	if offset := unsafe.Offsetof(gcController.heapLive); offset%8 != 0 {
		println(offset)
		throw("gcController.heapLive not aligned to 8 bytes")
	}
}

// gcController implements the GC pacing controller that determines
// when to trigger concurrent garbage collection and how much marking
// work to do in mutator assists and background marking.
//
// It uses a feedback control algorithm to adjust the gcController.trigger
// trigger based on the heap growth and GC CPU utilization each cycle.
// This algorithm optimizes for heap growth to match GOGC and for CPU
// utilization between assist and background marking to be 25% of
// GOMAXPROCS. The high-level design of this algorithm is documented
// at https://golang.org/s/go15gcpacing.
//
// All fields of gcController are used only during a single mark
// cycle.
var gcController gcControllerState

type gcControllerState struct {
	// Initialized from $GOGC. GOGC=off means no GC.
	gcPercent int32

_ uint32 // padding so following 64-bit values are 8-byte aligned

// heapMinimum is the minimum heap size at which to trigger GC.
	// For small heaps, this overrides the usual GOGC*live set rule.
	//
	// When there is a very small live set but a lot of allocation, simply
	// collecting when the heap reaches GOGC*live results in many GC
	// cycles and high total per-GC overhead. This minimum amortizes this
	// per-GC overhead while keeping the heap reasonably small.
	//
	// During initialization this is set to 4MB*GOGC/100. In the case of
	// GOGC==0, this will set heapMinimum to 0, resulting in constant
	// collection even when the heap size is small, which is useful for
	// debugging.
	heapMinimum uint64

// triggerRatio is the heap growth ratio that triggers marking.
	//
	// E.g., if this is 0.6, then GC should start when the live
	// heap has reached 1.6 times the heap size marked by the
	// previous cycle. This should be ≤ GOGC/100 so the trigger
	// heap size is less than the goal heap size. This is set
	// during mark termination for the next cycle's trigger.
	//
	// Protected by mheap_.lock or a STW.
	triggerRatio float64

// trigger is the heap size that triggers marking.
	//
	// When heapLive ≥ trigger, the mark phase will start.
	// This is also the heap size by which proportional sweeping
	// must be complete.
	//
	// This is computed from triggerRatio during mark termination
	// for the next cycle's trigger.
	//
	// Protected by mheap_.lock or a STW.
	trigger uint64

// heapGoal is the goal heapLive for when next GC ends.
	// Set to ^uint64(0) if disabled.
	//
	// Read and written atomically, unless the world is stopped.
	heapGoal uint64

// lastHeapGoal is the value of heapGoal for the previous GC.
	// Note that this is distinct from the last value heapGoal had,
	// because it could change if e.g. gcPercent changes.
	//
	// Read and written with the world stopped or with mheap_.lock held.
	lastHeapGoal uint64

// heapLive is the number of bytes considered live by the GC.
	// That is: retained by the most recent GC plus allocated
	// since then. heapLive ≤ memstats.heapAlloc, since heapAlloc includes
	// unmarked objects that have not yet been swept (and hence goes up as we
	// allocate and down as we sweep) while heapLive excludes these
	// objects (and hence only goes up between GCs).
	//
	// This is updated atomically without locking. To reduce
	// contention, this is updated only when obtaining a span from
	// an mcentral and at this point it counts all of the
	// unallocated slots in that span (which will be allocated
	// before that mcache obtains another span from that
	// mcentral). Hence, it slightly overestimates the "true" live
	// heap size. It's better to overestimate than to
	// underestimate because 1) this triggers the GC earlier than
	// necessary rather than potentially too late and 2) this
	// leads to a conservative GC rate rather than a GC rate that
	// is potentially too low.
	//
	// Reads should likewise be atomic (or during STW).
	//
	// Whenever this is updated, call traceHeapAlloc() and
	// this gcControllerState's revise() method.
	heapLive uint64

// heapScan is the number of bytes of "scannable" heap. This
	// is the live heap (as counted by heapLive), but omitting
	// no-scan objects and no-scan tails of objects.
	//
	// Whenever this is updated, call this gcControllerState's
	// revise() method.
	//
	// Read and written atomically or with the world stopped.
	heapScan uint64

// heapMarked is the number of bytes marked by the previous
	// GC. After mark termination, heapLive == heapMarked, but
	// unlike heapLive, heapMarked does not change until the
	// next mark termination.
	heapMarked uint64

// scanWork is the total scan work performed this cycle. This
	// is updated atomically during the cycle. Updates occur in
	// bounded batches, since it is both written and read
	// throughout the cycle. At the end of the cycle, this is how
	// much of the retained heap is scannable.
	//
	// Currently this is the bytes of heap scanned. For most uses,
	// this is an opaque unit of work, but for estimation the
	// definition is important.
	scanWork int64

// bgScanCredit is the scan work credit accumulated by the
	// concurrent background scan. This credit is accumulated by
	// the background scan and stolen by mutator assists. This is
	// updated atomically. Updates occur in bounded batches, since
	// it is both written and read throughout the cycle.
	bgScanCredit int64

// assistTime is the nanoseconds spent in mutator assists
	// during this cycle. This is updated atomically. Updates
	// occur in bounded batches, since it is both written and read
	// throughout the cycle.
	assistTime int64

// dedicatedMarkTime is the nanoseconds spent in dedicated
	// mark workers during this cycle. This is updated atomically
	// at the end of the concurrent mark phase.
	dedicatedMarkTime int64

// fractionalMarkTime is the nanoseconds spent in the
	// fractional mark worker during this cycle. This is updated
	// atomically throughout the cycle and will be up-to-date if
	// the fractional mark worker is not currently running.
	fractionalMarkTime int64

// idleMarkTime is the nanoseconds spent in idle marking
	// during this cycle. This is updated atomically throughout
	// the cycle.
	idleMarkTime int64

// markStartTime is the absolute start time in nanoseconds
	// that assists and background mark workers started.
	markStartTime int64

// dedicatedMarkWorkersNeeded is the number of dedicated mark
	// workers that need to be started. This is computed at the
	// beginning of each cycle and decremented atomically as
	// dedicated mark workers get started.
	dedicatedMarkWorkersNeeded int64

// assistWorkPerByte is the ratio of scan work to allocated
	// bytes that should be performed by mutator assists. This is
	// computed at the beginning of each cycle and updated every
	// time heapScan is updated.
	//
	// Stored as a uint64, but it's actually a float64. Use
	// float64frombits to get the value.
	//
	// Read and written atomically.
	assistWorkPerByte uint64

// assistBytesPerWork is 1/assistWorkPerByte.
	//
	// Stored as a uint64, but it's actually a float64. Use
	// float64frombits to get the value.
	//
	// Read and written atomically.
	//
	// Note that because this is read and written independently
	// from assistWorkPerByte users may notice a skew between
	// the two values, and such a state should be safe.
	assistBytesPerWork uint64

// fractionalUtilizationGoal is the fraction of wall clock
	// time that should be spent in the fractional mark worker on
	// each P that isn't running a dedicated worker.
	//
	// For example, if the utilization goal is 25% and there are
	// no dedicated workers, this will be 0.25. If the goal is
	// 25%, there is one dedicated worker, and GOMAXPROCS is 5,
	// this will be 0.05 to make up the missing 5%.
	//
	// If this is zero, no fractional workers are needed.
	fractionalUtilizationGoal float64

_ cpu.CacheLinePad
}

func (c *gcControllerState) init(gcPercent int32) {
	c.heapMinimum = defaultHeapMinimum

// Set a reasonable initial GC trigger.
	c.triggerRatio = 7 / 8.0

// Fake a heapMarked value so it looks like a trigger at
	// heapMinimum is the appropriate growth from heapMarked.
	// This will go into computing the initial GC goal.
	c.heapMarked = uint64(float64(c.heapMinimum) / (1 + c.triggerRatio))

// This will also compute and set the GC trigger and goal.
	c.setGCPercent(gcPercent)
}

// startCycle resets the GC controller's state and computes estimates
// for a new GC cycle. The caller must hold worldsema and the world
// must be stopped.
func (c *gcControllerState) startCycle() {
	c.scanWork = 0
	c.bgScanCredit = 0
	c.assistTime = 0
	c.dedicatedMarkTime = 0
	c.fractionalMarkTime = 0
	c.idleMarkTime = 0

// Ensure that the heap goal is at least a little larger than
	// the current live heap size. This may not be the case if GC
	// start is delayed or if the allocation that pushed gcController.heapLive
	// over trigger is large or if the trigger is really close to
	// GOGC. Assist is proportional to this distance, so enforce a
	// minimum distance, even if it means going over the GOGC goal
	// by a tiny bit.
	if c.heapGoal < c.heapLive+1024*1024 {
		c.heapGoal = c.heapLive + 1024*1024
	}

// Compute the background mark utilization goal. In general,
	// this may not come out exactly. We round the number of
	// dedicated workers so that the utilization is closest to
	// 25%. For small GOMAXPROCS, this would introduce too much
	// error, so we add fractional workers in that case.
	totalUtilizationGoal := float64(gomaxprocs) * gcBackgroundUtilization
	c.dedicatedMarkWorkersNeeded = int64(totalUtilizationGoal + 0.5)
	utilError := float64(c.dedicatedMarkWorkersNeeded)/totalUtilizationGoal - 1
	const maxUtilError = 0.3
	if utilError < -maxUtilError || utilError > maxUtilError {
		// Rounding put us more than 30% off our goal. With
		// gcBackgroundUtilization of 25%, this happens for
		// GOMAXPROCS<=3 or GOMAXPROCS=6. Enable fractional
		// workers to compensate.
		if float64(c.dedicatedMarkWorkersNeeded) > totalUtilizationGoal {
			// Too many dedicated workers.
			c.dedicatedMarkWorkersNeeded--
		}
		c.fractionalUtilizationGoal = (totalUtilizationGoal - float64(c.dedicatedMarkWorkersNeeded)) / float64(gomaxprocs)
	} else {
		c.fractionalUtilizationGoal = 0
	}

// In STW mode, we just want dedicated workers.
	if debug.gcstoptheworld > 0 {
		c.dedicatedMarkWorkersNeeded = int64(gomaxprocs)
		c.fractionalUtilizationGoal = 0
	}

// Clear per-P state
	for _, p := range allp {
		p.gcAssistTime = 0
		p.gcFractionalMarkTime = 0
	}

// Compute initial values for controls that are updated
	// throughout the cycle.
	c.revise()

if debug.gcpacertrace > 0 {
		assistRatio := float64frombits(atomic.Load64(&c.assistWorkPerByte))
		print("pacer: assist ratio=", assistRatio,
			" (scan ", gcController.heapScan>>20, " MB in ",
			work.initialHeapLive>>20, "->",
			c.heapGoal>>20, " MB)",
			" workers=", c.dedicatedMarkWorkersNeeded,
			"+", c.fractionalUtilizationGoal, "\n")
	}
}

// revise updates the assist ratio during the GC cycle to account for
// improved estimates. This should be called whenever gcController.heapScan,
// gcController.heapLive, or gcController.heapGoal is updated. It is safe to
// call concurrently, but it may race with other calls to revise.
//
// The result of this race is that the two assist ratio values may not line
// up or may be stale. In practice this is OK because the assist ratio
// moves slowly throughout a GC cycle, and the assist ratio is a best-effort
// heuristic anyway. Furthermore, no part of the heuristic depends on
// the two assist ratio values being exact reciprocals of one another, since
// the two values are used to convert values from different sources.
//
// The worst case result of this raciness is that we may miss a larger shift
// in the ratio (say, if we decide to pace more aggressively against the
// hard heap goal) but even this "hard goal" is best-effort (see #40460).
// The dedicated GC should ensure we don't exceed the hard goal by too much
// in the rare case we do exceed it.
//
// It should only be called when gcBlackenEnabled != 0 (because this
// is when assists are enabled and the necessary statistics are
// available).
func (c *gcControllerState) revise() {
	gcPercent := c.gcPercent
	if gcPercent < 0 {
		// If GC is disabled but we're running a forced GC,
		// act like GOGC is huge for the below calculations.
		gcPercent = 100000
	}
	live := atomic.Load64(&c.heapLive)
	scan := atomic.Load64(&c.heapScan)
	work := atomic.Loadint64(&c.scanWork)

// Assume we're under the soft goal. Pace GC to complete at
	// heapGoal assuming the heap is in steady-state.
	heapGoal := int64(atomic.Load64(&c.heapGoal))

// Compute the expected scan work remaining.
	//
	// This is estimated based on the expected
	// steady-state scannable heap. For example, with
	// GOGC=100, only half of the scannable heap is
	// expected to be live, so that's what we target.
	//
	// (This is a float calculation to avoid overflowing on
	// 100*heapScan.)
	scanWorkExpected := int64(float64(scan) * 100 / float64(100+gcPercent))

if int64(live) > heapGoal || work > scanWorkExpected {
		// We're past the soft goal, or we've already done more scan
		// work than we expected. Pace GC so that in the worst case it
		// will complete by the hard goal.
		const maxOvershoot = 1.1
		heapGoal = int64(float64(heapGoal) * maxOvershoot)

// Compute the upper bound on the scan work remaining.
		scanWorkExpected = int64(scan)
	}

// Compute the remaining scan work estimate.
	//
	// Note that we currently count allocations during GC as both
	// scannable heap (heapScan) and scan work completed
	// (scanWork), so allocation will change this difference
	// slowly in the soft regime and not at all in the hard
	// regime.
	scanWorkRemaining := scanWorkExpected - work
	if scanWorkRemaining < 1000 {
		// We set a somewhat arbitrary lower bound on
		// remaining scan work since if we aim a little high,
		// we can miss by a little.
		//
		// We *do* need to enforce that this is at least 1,
		// since marking is racy and double-scanning objects
		// may legitimately make the remaining scan work
		// negative, even in the hard goal regime.
		scanWorkRemaining = 1000
	}

// Compute the heap distance remaining.
	heapRemaining := heapGoal - int64(live)
	if heapRemaining <= 0 {
		// This shouldn't happen, but if it does, avoid
		// dividing by zero or setting the assist negative.
		heapRemaining = 1
	}

// Compute the mutator assist ratio so by the time the mutator
	// allocates the remaining heap bytes up to heapGoal, it will
	// have done (or stolen) the remaining amount of scan work.
	// Note that the assist ratio values are updated atomically
	// but not together. This means there may be some degree of
	// skew between the two values. This is generally OK as the
	// values shift relatively slowly over the course of a GC
	// cycle.
	assistWorkPerByte := float64(scanWorkRemaining) / float64(heapRemaining)
	assistBytesPerWork := float64(heapRemaining) / float64(scanWorkRemaining)
	atomic.Store64(&c.assistWorkPerByte, float64bits(assistWorkPerByte))
	atomic.Store64(&c.assistBytesPerWork, float64bits(assistBytesPerWork))
}

// endCycle computes the trigger ratio for the next cycle.
// userForced indicates whether the current GC cycle was forced
// by the application.
func (c *gcControllerState) endCycle(userForced bool) float64 {
	if userForced {
		// Forced GC means this cycle didn't start at the
		// trigger, so where it finished isn't good
		// information about how to adjust the trigger.
		// Just leave it where it is.
		return c.triggerRatio
	}

// Proportional response gain for the trigger controller. Must
	// be in [0, 1]. Lower values smooth out transient effects but
	// take longer to respond to phase changes. Higher values
	// react to phase changes quickly, but are more affected by
	// transient changes. Values near 1 may be unstable.
	const triggerGain = 0.5

// Compute next cycle trigger ratio. First, this computes the
	// "error" for this cycle; that is, how far off the trigger
	// was from what it should have been, accounting for both heap
	// growth and GC CPU utilization. We compute the actual heap
	// growth during this cycle and scale that by how far off from
	// the goal CPU utilization we were (to estimate the heap
	// growth if we had the desired CPU utilization). The
	// difference between this estimate and the GOGC-based goal
	// heap growth is the error.
	goalGrowthRatio := c.effectiveGrowthRatio()
	actualGrowthRatio := float64(c.heapLive)/float64(c.heapMarked) - 1
	assistDuration := nanotime() - c.markStartTime

// Assume background mark hit its utilization goal.
	utilization := gcBackgroundUtilization
	// Add assist utilization; avoid divide by zero.
	if assistDuration > 0 {
		utilization += float64(c.assistTime) / float64(assistDuration*int64(gomaxprocs))
	}

triggerError := goalGrowthRatio - c.triggerRatio - utilization/gcGoalUtilization*(actualGrowthRatio-c.triggerRatio)

// Finally, we adjust the trigger for next time by this error,
	// damped by the proportional gain.
	triggerRatio := c.triggerRatio + triggerGain*triggerError

if debug.gcpacertrace > 0 {
		// Print controller state in terms of the design
		// document.
		H_m_prev := c.heapMarked
		h_t := c.triggerRatio
		H_T := c.trigger
		h_a := actualGrowthRatio
		H_a := c.heapLive
		h_g := goalGrowthRatio
		H_g := int64(float64(H_m_prev) * (1 + h_g))
		u_a := utilization
		u_g := gcGoalUtilization
		W_a := c.scanWork
		print("pacer: H_m_prev=", H_m_prev,
			" h_t=", h_t, " H_T=", H_T,
			" h_a=", h_a, " H_a=", H_a,
			" h_g=", h_g, " H_g=", H_g,
			" u_a=", u_a, " u_g=", u_g,
			" W_a=", W_a,
			" goalΔ=", goalGrowthRatio-h_t,
			" actualΔ=", h_a-h_t,
			" u_a/u_g=", u_a/u_g,
			"\n")
	}

return triggerRatio
}

// enlistWorker encourages another dedicated mark worker to start on
// another P if there are spare worker slots. It is used by putfull
// when more work is made available.
//
//go:nowritebarrier
func (c *gcControllerState) enlistWorker() {
	// If there are idle Ps, wake one so it will run an idle worker.
	// NOTE: This is suspected of causing deadlocks. See golang.org/issue/19112.
	//
	//	if atomic.Load(&sched.npidle) != 0 && atomic.Load(&sched.nmspinning) == 0 {
	//		wakep()
	//		return
	//	}

// There are no idle Ps. If we need more dedicated workers,
	// try to preempt a running P so it will switch to a worker.
	if c.dedicatedMarkWorkersNeeded <= 0 {
		return
	}
	// Pick a random other P to preempt.
	if gomaxprocs <= 1 {
		return
	}
	gp := getg()
	if gp == nil || gp.m == nil || gp.m.p == 0 {
		return
	}
	myID := gp.m.p.ptr().id
	for tries := 0; tries < 5; tries++ {
		id := int32(fastrandn(uint32(gomaxprocs - 1)))
		if id >= myID {
			id++
		}
		p := allp[id]
		if p.status != _Prunning {
			continue
		}
		if preemptone(p) {
			return
		}
	}
}

// findRunnableGCWorker returns a background mark worker for _p_ if it
// should be run. This must only be called when gcBlackenEnabled != 0.
func (c *gcControllerState) findRunnableGCWorker(_p_ *p) *g {
	if gcBlackenEnabled == 0 {
		throw("gcControllerState.findRunnable: blackening not enabled")
	}

if !gcMarkWorkAvailable(_p_) {
		// No work to be done right now. This can happen at
		// the end of the mark phase when there are still
		// assists tapering off. Don't bother running a worker
		// now because it'll just return immediately.
		return nil
	}

// Grab a worker before we commit to running below.
	node := (*gcBgMarkWorkerNode)(gcBgMarkWorkerPool.pop())
	if node == nil {
		// There is at least one worker per P, so normally there are
		// enough workers to run on all Ps, if necessary. However, once
		// a worker enters gcMarkDone it may park without rejoining the
		// pool, thus freeing a P with no corresponding worker.
		// gcMarkDone never depends on another worker doing work, so it
		// is safe to simply do nothing here.
		//
		// If gcMarkDone bails out without completing the mark phase,
		// it will always do so with queued global work. Thus, that P
		// will be immediately eligible to re-run the worker G it was
		// just using, ensuring work can complete.
		return nil
	}

decIfPositive := func(ptr *int64) bool {
		for {
			v := atomic.Loadint64(ptr)
			if v <= 0 {
				return false
			}

if atomic.Casint64(ptr, v, v-1) {
				return true
			}
		}
	}

if decIfPositive(&c.dedicatedMarkWorkersNeeded) {
		// This P is now dedicated to marking until the end of
		// the concurrent mark phase.
		_p_.gcMarkWorkerMode = gcMarkWorkerDedicatedMode
	} else if c.fractionalUtilizationGoal == 0 {
		// No need for fractional workers.
		gcBgMarkWorkerPool.push(&node.node)
		return nil
	} else {
		// Is this P behind on the fractional utilization
		// goal?
		//
		// This should be kept in sync with pollFractionalWorkerExit.
		delta := nanotime() - c.markStartTime
		if delta > 0 && float64(_p_.gcFractionalMarkTime)/float64(delta) > c.fractionalUtilizationGoal {
			// Nope. No need to run a fractional worker.
			gcBgMarkWorkerPool.push(&node.node)
			return nil
		}
		// Run a fractional worker.
		_p_.gcMarkWorkerMode = gcMarkWorkerFractionalMode
	}

// Run the background mark worker.
	gp := node.gp.ptr()
	casgstatus(gp, _Gwaiting, _Grunnable)
	if trace.enabled {
		traceGoUnpark(gp, 0)
	}
	return gp
}

// commit sets the trigger ratio and updates everything
// derived from it: the absolute trigger, the heap goal, mark pacing,
// and sweep pacing.
//
// This can be called any time. If GC is the in the middle of a
// concurrent phase, it will adjust the pacing of that phase.
//
// This depends on gcPercent, gcController.heapMarked, and
// gcController.heapLive. These must be up to date.
//
// mheap_.lock must be held or the world must be stopped.
func (c *gcControllerState) commit(triggerRatio float64) {
	assertWorldStoppedOrLockHeld(&mheap_.lock)

// Compute the next GC goal, which is when the allocated heap
	// has grown by GOGC/100 over the heap marked by the last
	// cycle.
	goal := ^uint64(0)
	if c.gcPercent >= 0 {
		goal = c.heapMarked + c.heapMarked*uint64(c.gcPercent)/100
	}

// Set the trigger ratio, capped to reasonable bounds.
	if c.gcPercent >= 0 {
		scalingFactor := float64(c.gcPercent) / 100
		// Ensure there's always a little margin so that the
		// mutator assist ratio isn't infinity.
		maxTriggerRatio := 0.95 * scalingFactor
		if triggerRatio > maxTriggerRatio {
			triggerRatio = maxTriggerRatio
		}

// If we let triggerRatio go too low, then if the application
		// is allocating very rapidly we might end up in a situation
		// where we're allocating black during a nearly always-on GC.
		// The result of this is a growing heap and ultimately an
		// increase in RSS. By capping us at a point >0, we're essentially
		// saying that we're OK using more CPU during the GC to prevent
		// this growth in RSS.
		//
		// The current constant was chosen empirically: given a sufficiently
		// fast/scalable allocator with 48 Ps that could drive the trigger ratio
		// to <0.05, this constant causes applications to retain the same peak
		// RSS compared to not having this allocator.
		minTriggerRatio := 0.6 * scalingFactor
		if triggerRatio < minTriggerRatio {
			triggerRatio = minTriggerRatio
		}
	} else if triggerRatio < 0 {
		// gcPercent < 0, so just make sure we're not getting a negative
		// triggerRatio. This case isn't expected to happen in practice,
		// and doesn't really matter because if gcPercent < 0 then we won't
		// ever consume triggerRatio further on in this function, but let's
		// just be defensive here; the triggerRatio being negative is almost
		// certainly undesirable.
		triggerRatio = 0
	}
	c.triggerRatio = triggerRatio

// Compute the absolute GC trigger from the trigger ratio.
	//
	// We trigger the next GC cycle when the allocated heap has
	// grown by the trigger ratio over the marked heap size.
	trigger := ^uint64(0)
	if c.gcPercent >= 0 {
		trigger = uint64(float64(c.heapMarked) * (1 + triggerRatio))
		// Don't trigger below the minimum heap size.
		minTrigger := c.heapMinimum
		if !isSweepDone() {
			// Concurrent sweep happens in the heap growth
			// from gcController.heapLive to trigger, so ensure
			// that concurrent sweep has some heap growth
			// in which to perform sweeping before we
			// start the next GC cycle.
			sweepMin := atomic.Load64(&c.heapLive) + sweepMinHeapDistance
			if sweepMin > minTrigger {
				minTrigger = sweepMin
			}
		}
		if trigger < minTrigger {
			trigger = minTrigger
		}
		if int64(trigger) < 0 {
			print("runtime: heapGoal=", c.heapGoal, " heapMarked=", c.heapMarked, " gcController.heapLive=", c.heapLive, " initialHeapLive=", work.initialHeapLive, "triggerRatio=", triggerRatio, " minTrigger=", minTrigger, "\n")
			throw("trigger underflow")
		}
		if trigger > goal {
			// The trigger ratio is always less than GOGC/100, but
			// other bounds on the trigger may have raised it.
			// Push up the goal, too.
			goal = trigger
		}
	}

// Commit to the trigger and goal.
	c.trigger = trigger
	atomic.Store64(&c.heapGoal, goal)
	if trace.enabled {
		traceHeapGoal()
	}

// Update mark pacing.
	if gcphase != _GCoff {
		c.revise()
	}

// Update sweep pacing.
	if isSweepDone() {
		mheap_.sweepPagesPerByte = 0
	} else {
		// Concurrent sweep needs to sweep all of the in-use
		// pages by the time the allocated heap reaches the GC
		// trigger. Compute the ratio of in-use pages to sweep
		// per byte allocated, accounting for the fact that
		// some might already be swept.
		heapLiveBasis := atomic.Load64(&c.heapLive)
		heapDistance := int64(trigger) - int64(heapLiveBasis)
		// Add a little margin so rounding errors and
		// concurrent sweep are less likely to leave pages
		// unswept when GC starts.
		heapDistance -= 1024 * 1024
		if heapDistance < _PageSize {
			// Avoid setting the sweep ratio extremely high
			heapDistance = _PageSize
		}
		pagesSwept := atomic.Load64(&mheap_.pagesSwept)
		pagesInUse := atomic.Load64(&mheap_.pagesInUse)
		sweepDistancePages := int64(pagesInUse) - int64(pagesSwept)
		if sweepDistancePages <= 0 {
			mheap_.sweepPagesPerByte = 0
		} else {
			mheap_.sweepPagesPerByte = float64(sweepDistancePages) / float64(heapDistance)
			mheap_.sweepHeapLiveBasis = heapLiveBasis
			// Write pagesSweptBasis last, since this
			// signals concurrent sweeps to recompute
			// their debt.
			atomic.Store64(&mheap_.pagesSweptBasis, pagesSwept)
		}
	}

gcPaceScavenger()
}

// effectiveGrowthRatio returns the current effective heap growth
// ratio (GOGC/100) based on heapMarked from the previous GC and
// heapGoal for the current GC.
//
// This may differ from gcPercent/100 because of various upper and
// lower bounds on gcPercent. For example, if the heap is smaller than
// heapMinimum, this can be higher than gcPercent/100.
//
// mheap_.lock must be held or the world must be stopped.
func (c *gcControllerState) effectiveGrowthRatio() float64 {
	assertWorldStoppedOrLockHeld(&mheap_.lock)

egogc := float64(atomic.Load64(&c.heapGoal)-c.heapMarked) / float64(c.heapMarked)
	if egogc < 0 {
		// Shouldn't happen, but just in case.
		egogc = 0
	}
	return egogc
}

// setGCPercent updates gcPercent and all related pacer state.
// Returns the old value of gcPercent.
//
// The world must be stopped, or mheap_.lock must be held.
func (c *gcControllerState) setGCPercent(in int32) int32 {
	assertWorldStoppedOrLockHeld(&mheap_.lock)

out := c.gcPercent
	if in < 0 {
		in = -1
	}
	c.gcPercent = in
	c.heapMinimum = defaultHeapMinimum * uint64(c.gcPercent) / 100
	// Update pacing in response to gcPercent change.
	c.commit(c.triggerRatio)

return out
}

//go:linkname setGCPercent runtime/debug.setGCPercent
func setGCPercent(in int32) (out int32) {
	// Run on the system stack since we grab the heap lock.
	systemstack(func() {
		lock(&mheap_.lock)
		out = gcController.setGCPercent(in)
		unlock(&mheap_.lock)
	})

// If we just disabled GC, wait for any concurrent GC mark to
	// finish so we always return with no GC running.
	if in < 0 {
		gcWaitOnMark(atomic.Load(&work.cycles))
	}

return out
}

func readGOGC() int32 {
	p := gogetenv("GOGC")
	if p == "off" {
		return -1
	}
	if n, ok := atoi32(p); ok {
		return n
	}
	return 100
}

X7ROOT File Manager

Editing: mgcpacer.go

Upload File

Create Folder