File Manager

X7ROOT File Manager

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

📁 ..
📄 HACKING.md(13.85 KB)
📄 Makefile(178 B)
📄 abi_test.go(2.83 KB)
📄 alg.go(10.99 KB)
📄 align_runtime_test.go(1.82 KB)
📄 align_test.go(5.37 KB)
📄 arena.go(31.66 KB)
📄 arena_test.go(13.39 KB)
📁 asan
📄 asan.go(1.55 KB)
📄 asan0.go(760 B)
📄 asan_amd64.s(2.45 KB)
📄 asan_arm64.s(2.14 KB)
📄 asan_loong64.s(2.12 KB)
📄 asan_ppc64le.s(2.75 KB)
📄 asan_riscv64.s(1.92 KB)
📄 asm.s(719 B)
📄 asm_386.s(42.54 KB)
📄 asm_amd64.h(631 B)
📄 asm_amd64.s(60.09 KB)
📄 asm_arm.s(31.58 KB)
📄 asm_arm64.s(43.33 KB)
📄 asm_loong64.s(27.58 KB)
📄 asm_mips64x.s(24.34 KB)
📄 asm_mipsx.s(25.82 KB)
📄 asm_ppc64x.h(1.93 KB)
📄 asm_ppc64x.s(45.19 KB)
📄 asm_riscv64.s(26.97 KB)
📄 asm_s390x.s(27.55 KB)
📄 asm_wasm.s(11.82 KB)
📄 atomic_arm64.s(259 B)
📄 atomic_loong64.s(245 B)
📄 atomic_mips64x.s(300 B)
📄 atomic_mipsx.s(262 B)
📄 atomic_pointer.go(3.66 KB)
📄 atomic_ppc64x.s(437 B)
📄 atomic_riscv64.s(275 B)
📄 auxv_none.go(298 B)
📄 callers_test.go(12.13 KB)
📁 cgo
📄 cgo.go(2.5 KB)
📄 cgo_mmap.go(2.42 KB)
📄 cgo_ppc64x.go(418 B)
📄 cgo_sigaction.go(3.28 KB)
📄 cgocall.go(23.23 KB)
📄 cgocallback.go(317 B)
📄 cgocheck.go(7.97 KB)
📄 chan.go(23.74 KB)
📄 chan_test.go(23.44 KB)
📄 chanbarrier_test.go(1.4 KB)
📄 checkptr.go(3.29 KB)
📄 checkptr_test.go(2.86 KB)
📄 closure_test.go(937 B)
📄 compiler.go(410 B)
📄 complex.go(1.59 KB)
📄 complex_test.go(1.05 KB)
📄 conv_wasm_test.go(2.96 KB)
📄 coro.go(4.92 KB)
📁 coverage
📄 covercounter.go(749 B)
📄 covermeta.go(2.4 KB)
📄 cpuflags.go(810 B)
📄 cpuflags_amd64.go(533 B)
📄 cpuflags_arm64.go(312 B)
📄 cpuprof.go(7.94 KB)
📄 cputicks.go(437 B)
📄 crash_cgo_test.go(23.35 KB)
📄 crash_test.go(23.12 KB)
📄 crash_unix_test.go(9.19 KB)
📄 create_file_nounix.go(305 B)
📄 create_file_unix.go(368 B)
📁 debug
📄 debug.go(3.53 KB)
📄 debug_test.go(7.99 KB)
📄 debugcall.go(6.75 KB)
📄 debuglog.go(18.24 KB)
📄 debuglog_off.go(357 B)
📄 debuglog_on.go(1.09 KB)
📄 debuglog_test.go(4.9 KB)
📄 defer_test.go(11.4 KB)
📄 defs1_linux.go(845 B)
📄 defs1_netbsd_386.go(2.91 KB)
📄 defs1_netbsd_amd64.go(3.14 KB)
📄 defs1_netbsd_arm.go(3.03 KB)
📄 defs1_netbsd_arm64.go(3.25 KB)
📄 defs1_solaris_amd64.go(4.01 KB)
📄 defs2_linux.go(3.22 KB)
📄 defs3_linux.go(1.09 KB)
📄 defs_aix.go(4.17 KB)
📄 defs_aix_ppc64.go(3.63 KB)
📄 defs_arm_linux.go(2.67 KB)
📄 defs_darwin.go(4.18 KB)
📄 defs_darwin_amd64.go(6.34 KB)
📄 defs_darwin_arm64.go(4.17 KB)
📄 defs_dragonfly.go(2.73 KB)
📄 defs_dragonfly_amd64.go(3.41 KB)
📄 defs_freebsd.go(3.96 KB)
📄 defs_freebsd_386.go(4.52 KB)
📄 defs_freebsd_amd64.go(4.79 KB)
📄 defs_freebsd_arm.go(3.92 KB)
📄 defs_freebsd_arm64.go(4.18 KB)
📄 defs_freebsd_riscv64.go(4.19 KB)
📄 defs_illumos_amd64.go(285 B)
📄 defs_linux.go(2.92 KB)
📄 defs_linux_386.go(4.2 KB)
📄 defs_linux_amd64.go(4.7 KB)
📄 defs_linux_arm.go(3.89 KB)
📄 defs_linux_arm64.go(3.62 KB)
📄 defs_linux_loong64.go(3.43 KB)
📄 defs_linux_mips64x.go(3.6 KB)
📄 defs_linux_mipsx.go(3.6 KB)
📄 defs_linux_ppc64.go(3.69 KB)
📄 defs_linux_ppc64le.go(3.69 KB)
📄 defs_linux_riscv64.go(3.81 KB)
📄 defs_linux_s390x.go(3.16 KB)
📄 defs_netbsd.go(2.83 KB)
📄 defs_netbsd_386.go(855 B)
📄 defs_netbsd_amd64.go(1.01 KB)
📄 defs_netbsd_arm.go(764 B)
📄 defs_openbsd.go(3.06 KB)
📄 defs_openbsd_386.go(2.91 KB)
📄 defs_openbsd_amd64.go(3.11 KB)
📄 defs_openbsd_arm.go(3.03 KB)
📄 defs_openbsd_arm64.go(2.78 KB)
📄 defs_openbsd_mips64.go(2.75 KB)
📄 defs_openbsd_ppc64.go(3 KB)
📄 defs_openbsd_riscv64.go(2.89 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.32 KB)
📄 defs_solaris_amd64.go(1004 B)
📄 defs_windows.go(2.25 KB)
📄 defs_windows_386.go(2.28 KB)
📄 defs_windows_amd64.go(3.19 KB)
📄 defs_windows_arm.go(2.57 KB)
📄 defs_windows_arm64.go(3.07 KB)
📄 duff_386.s(8.24 KB)
📄 duff_amd64.s(5.64 KB)
📄 duff_arm.s(7.11 KB)
📄 duff_arm64.s(5.27 KB)
📄 duff_loong64.s(11.9 KB)
📄 duff_mips64x.s(11.28 KB)
📄 duff_ppc64x.s(7.06 KB)
📄 duff_riscv64.s(11.4 KB)
📄 duff_s390x.s(507 B)
📄 ehooks_test.go(2.04 KB)
📄 env_plan9.go(3 KB)
📄 env_posix.go(1.56 KB)
📄 env_test.go(1.16 KB)
📄 error.go(9.29 KB)
📄 example_test.go(1.55 KB)
📄 exithook.go(2.32 KB)
📄 export_aix_test.go(207 B)
📄 export_arm_test.go(226 B)
📄 export_darwin_test.go(207 B)
📄 export_debug_amd64_test.go(3.6 KB)
📄 export_debug_arm64_test.go(3.49 KB)
📄 export_debug_ppc64le_test.go(3.5 KB)
📄 export_debug_test.go(5.07 KB)
📄 export_debuglog_test.go(1.27 KB)
📄 export_linux_test.go(378 B)
📄 export_mmap_test.go(429 B)
📄 export_pipe2_test.go(310 B)
📄 export_pipe_test.go(219 B)
📄 export_test.go(50.52 KB)
📄 export_unix_test.go(2.27 KB)
📄 export_windows_test.go(903 B)
📄 extern.go(18.58 KB)
📄 fastlog2.go(1.22 KB)
📄 fastlog2_test.go(784 B)
📄 fastlog2table.go(904 B)
📄 fds_nonunix.go(256 B)
📄 fds_test.go(1.43 KB)
📄 fds_unix.go(1.27 KB)
📄 float.go(1.35 KB)
📄 float_test.go(699 B)
📄 funcdata.h(2.53 KB)
📄 gc_test.go(20.32 KB)
📄 gcinfo_test.go(5.95 KB)
📄 go_tls.h(366 B)
📄 hash32.go(1.58 KB)
📄 hash64.go(1.95 KB)
📄 hash_test.go(17.24 KB)
📄 heap_test.go(529 B)
📄 heapdump.go(17.88 KB)
📄 histogram.go(7.3 KB)
📄 histogram_test.go(3.51 KB)
📄 iface.go(20.92 KB)
📄 iface_test.go(7.45 KB)
📄 import_test.go(1.42 KB)
📄 importx_test.go(763 B)
📁 internal
📄 lfstack.go(2.03 KB)
📄 lfstack_test.go(2.74 KB)
📄 libfuzzer.go(6.34 KB)
📄 libfuzzer_amd64.s(5.03 KB)
📄 libfuzzer_arm64.s(3.15 KB)
📄 lock_futex.go(5.4 KB)
📄 lock_js.go(7.28 KB)
📄 lock_sema.go(6.75 KB)
📄 lock_wasip1.go(2.01 KB)
📄 lockrank.go(18.19 KB)
📄 lockrank_off.go(1.17 KB)
📄 lockrank_on.go(10.27 KB)
📄 lockrank_test.go(856 B)
📄 malloc.go(58.5 KB)
📄 malloc_test.go(10.64 KB)
📄 map.go(52.17 KB)
📄 map_benchmark_test.go(10.59 KB)
📄 map_fast32.go(12.74 KB)
📄 map_fast64.go(12.92 KB)
📄 map_faststr.go(14.32 KB)
📄 map_test.go(31.75 KB)
📄 mbarrier.go(13.78 KB)
📄 mbitmap.go(22.54 KB)
📄 mbitmap_allocheaders.go(44.67 KB)
📄 mbitmap_noallocheaders.go(28.95 KB)
📄 mcache.go(10 KB)
📄 mcentral.go(8.05 KB)
📄 mcheckmark.go(2.85 KB)
📄 mem.go(6.72 KB)
📄 mem_aix.go(2.01 KB)
📄 mem_bsd.go(2.21 KB)
📄 mem_darwin.go(1.96 KB)
📄 mem_js.go(457 B)
📄 mem_linux.go(4.98 KB)
📄 mem_plan9.go(447 B)
📄 mem_sbrk.go(4.19 KB)
📄 mem_wasip1.go(392 B)
📄 mem_wasm.go(488 B)
📄 mem_windows.go(3.88 KB)
📄 memclr_386.s(2.38 KB)
📄 memclr_amd64.s(4.91 KB)
📄 memclr_arm.s(2.6 KB)
📄 memclr_arm64.s(3.62 KB)
📄 memclr_loong64.s(843 B)
📄 memclr_mips64x.s(1.72 KB)
📄 memclr_mipsx.s(1.32 KB)
📄 memclr_plan9_386.s(983 B)
📄 memclr_plan9_amd64.s(511 B)
📄 memclr_ppc64x.s(4.44 KB)
📄 memclr_riscv64.s(1.71 KB)
📄 memclr_s390x.s(1.96 KB)
📄 memclr_wasm.s(485 B)
📄 memmove_386.s(4.42 KB)
📄 memmove_amd64.s(12.48 KB)
📄 memmove_arm.s(5.9 KB)
📄 memmove_arm64.s(5.96 KB)
📄 memmove_linux_amd64_test.go(1.53 KB)
📄 memmove_loong64.s(1.87 KB)
📄 memmove_mips64x.s(1.83 KB)
📄 memmove_mipsx.s(4.4 KB)
📄 memmove_plan9_386.s(3.06 KB)
📄 memmove_plan9_amd64.s(3.04 KB)
📄 memmove_ppc64x.s(4.91 KB)
📄 memmove_riscv64.s(5.46 KB)
📄 memmove_s390x.s(2.92 KB)
📄 memmove_test.go(21.23 KB)
📄 memmove_wasm.s(479 B)
📁 metrics
📄 metrics.go(26.01 KB)
📄 metrics_test.go(42.46 KB)
📄 mfinal.go(18.91 KB)
📄 mfinal_test.go(5.57 KB)
📄 mfixalloc.go(3.13 KB)
📄 mgc.go(59.29 KB)
📄 mgclimit.go(17.28 KB)
📄 mgclimit_test.go(9.02 KB)
📄 mgcmark.go(53.07 KB)
📄 mgcpacer.go(55.36 KB)
📄 mgcpacer_test.go(39.26 KB)
📄 mgcscavenge.go(52.32 KB)
📄 mgcscavenge_test.go(25.2 KB)
📄 mgcstack.go(10.58 KB)
📄 mgcsweep.go(32.26 KB)
📄 mgcwork.go(12.89 KB)
📄 mheap.go(72.64 KB)
📄 minmax.go(1.46 KB)
📄 minmax_test.go(3.31 KB)
📄 mkduff.go(8.04 KB)
📄 mkfastlog2table.go(3.08 KB)
📄 mklockrank.go(9 KB)
📄 mkpreempt.go(15.33 KB)
📄 mksizeclasses.go(9.52 KB)
📄 mmap.go(844 B)
📄 mpagealloc.go(39.23 KB)
📄 mpagealloc_32bit.go(4.56 KB)
📄 mpagealloc_64bit.go(9.34 KB)
📄 mpagealloc_test.go(32.59 KB)
📄 mpagecache.go(5.59 KB)
📄 mpagecache_test.go(10.79 KB)
📄 mpallocbits.go(12.58 KB)
📄 mpallocbits_test.go(13.69 KB)
📄 mprof.go(47.4 KB)
📄 mranges.go(14.46 KB)
📄 mranges_test.go(5.68 KB)
📁 msan
📄 msan.go(1.5 KB)
📄 msan0.go(725 B)
📄 msan_amd64.s(2.3 KB)
📄 msan_arm64.s(1.98 KB)
📄 msan_loong64.s(1.96 KB)
📄 msize_allocheaders.go(1.32 KB)
📄 msize_noallocheaders.go(915 B)
📄 mspanset.go(13.12 KB)
📄 mstats.go(33.81 KB)
📄 mwbbuf.go(8.13 KB)
📄 nbpipe_pipe.go(405 B)
📄 nbpipe_pipe2.go(344 B)
📄 nbpipe_pipe_test.go(706 B)
📄 nbpipe_test.go(1.99 KB)
📄 net_plan9.go(645 B)
📄 netpoll.go(20.55 KB)
📄 netpoll_aix.go(5.06 KB)
📄 netpoll_epoll.go(4.4 KB)
📄 netpoll_fake.go(664 B)
📄 netpoll_kqueue.go(5.62 KB)
📄 netpoll_os_test.go(520 B)
📄 netpoll_solaris.go(11.2 KB)
📄 netpoll_stub.go(1.48 KB)
📄 netpoll_wasip1.go(6.08 KB)
📄 netpoll_windows.go(4.01 KB)
📄 nonwindows_stub.go(729 B)
📄 norace_linux_test.go(915 B)
📄 norace_test.go(983 B)
📄 numcpu_freebsd_test.go(381 B)
📄 os2_aix.go(20.88 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.94 KB)
📄 os3_solaris.go(17.59 KB)
📄 os_aix.go(8.89 KB)
📄 os_android.go(463 B)
📄 os_darwin.go(11.92 KB)
📄 os_darwin_arm64.go(329 B)
📄 os_dragonfly.go(7.14 KB)
📄 os_freebsd.go(11.64 KB)
📄 os_freebsd2.go(603 B)
📄 os_freebsd_amd64.go(658 B)
📄 os_freebsd_arm.go(1.45 KB)
📄 os_freebsd_arm64.go(320 B)
📄 os_freebsd_noauxv.go(241 B)
📄 os_freebsd_riscv64.go(198 B)
📄 os_illumos.go(3.93 KB)
📄 os_js.go(767 B)
📄 os_linux.go(25.71 KB)
📄 os_linux_arm.go(1.51 KB)
📄 os_linux_arm64.go(478 B)
📄 os_linux_be64.go(806 B)
📄 os_linux_generic.go(870 B)
📄 os_linux_loong64.go(263 B)
📄 os_linux_mips64x.go(996 B)
📄 os_linux_mipsx.go(987 B)
📄 os_linux_noauxv.go(337 B)
📄 os_linux_novdso.go(347 B)
📄 os_linux_ppc64x.go(526 B)
📄 os_linux_riscv64.go(198 B)
📄 os_linux_s390x.go(825 B)
📄 os_linux_x86.go(234 B)
📄 os_netbsd.go(10.12 KB)
📄 os_netbsd_386.go(617 B)
📄 os_netbsd_amd64.go(614 B)
📄 os_netbsd_arm.go(1.07 KB)
📄 os_netbsd_arm64.go(769 B)
📄 os_nonopenbsd.go(437 B)
📄 os_only_solaris.go(357 B)
📄 os_openbsd.go(6.23 KB)
📄 os_openbsd_arm.go(662 B)
📄 os_openbsd_arm64.go(329 B)
📄 os_openbsd_libc.go(1.49 KB)
📄 os_openbsd_mips64.go(329 B)
📄 os_openbsd_syscall.go(1.36 KB)
📄 os_openbsd_syscall1.go(441 B)
📄 os_openbsd_syscall2.go(2.51 KB)
📄 os_plan9.go(10.18 KB)
📄 os_plan9_arm.go(375 B)
📄 os_solaris.go(6.62 KB)
📄 os_unix.go(436 B)
📄 os_unix_nonlinux.go(374 B)
📄 os_wasip1.go(7 KB)
📄 os_wasm.go(3.15 KB)
📄 os_windows.go(41.39 KB)
📄 os_windows_arm.go(511 B)
📄 os_windows_arm64.go(339 B)
📄 pagetrace_off.go(550 B)
📄 pagetrace_on.go(10.36 KB)
📄 panic.go(41.85 KB)
📄 panic32.go(4.8 KB)
📄 panic_test.go(1.71 KB)
📄 panicnil_test.go(1.25 KB)
📄 pinner.go(10.98 KB)
📄 pinner_test.go(11.04 KB)
📄 plugin.go(4.37 KB)
📁 pprof
📄 preempt.go(15.03 KB)
📄 preempt_386.s(824 B)
📄 preempt_amd64.s(1.67 KB)
📄 preempt_arm.s(1.49 KB)
📄 preempt_arm64.s(1.97 KB)
📄 preempt_loong64.s(2.41 KB)
📄 preempt_mips64x.s(2.72 KB)
📄 preempt_mipsx.s(2.68 KB)
📄 preempt_nonwindows.go(290 B)
📄 preempt_ppc64x.s(2.72 KB)
📄 preempt_riscv64.s(2.26 KB)
📄 preempt_s390x.s(1.01 KB)
📄 preempt_wasm.s(176 B)
📄 print.go(5.92 KB)
📄 proc.go(204.28 KB)
📄 proc_runtime_test.go(1.38 KB)
📄 proc_test.go(25.85 KB)
📄 profbuf.go(18.26 KB)
📄 profbuf_test.go(8.54 KB)
📄 proflabel.go(1.52 KB)
📁 race
📄 race.go(18.81 KB)
📄 race0.go(2.79 KB)
📄 race_amd64.s(13.94 KB)
📄 race_arm64.s(14.21 KB)
📄 race_ppc64le.s(15.93 KB)
📄 race_s390x.s(11.99 KB)
📄 rand.go(7.11 KB)
📄 rand_test.go(1.95 KB)
📄 rdebug.go(550 B)
📄 retry.go(760 B)
📄 rt0_aix_ppc64.s(4.09 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(1.69 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(1.88 KB)
📄 rt0_freebsd_riscv64.s(2.72 KB)
📄 rt0_illumos_amd64.s(311 B)
📄 rt0_ios_amd64.s(425 B)
📄 rt0_ios_arm64.s(425 B)
📄 rt0_js_wasm.s(1.53 KB)
📄 rt0_linux_386.s(450 B)
📄 rt0_linux_amd64.s(307 B)
📄 rt0_linux_arm.s(1007 B)
📄 rt0_linux_arm64.s(1.81 KB)
📄 rt0_linux_loong64.s(2.01 KB)
📄 rt0_linux_mips64x.s(1014 B)
📄 rt0_linux_mipsx.s(797 B)
📄 rt0_linux_ppc64.s(847 B)
📄 rt0_linux_ppc64le.s(2.89 KB)
📄 rt0_linux_riscv64.s(2.65 KB)
📄 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(1.8 KB)
📄 rt0_openbsd_386.s(454 B)
📄 rt0_openbsd_amd64.s(311 B)
📄 rt0_openbsd_arm.s(298 B)
📄 rt0_openbsd_arm64.s(1.96 KB)
📄 rt0_openbsd_mips64.s(976 B)
📄 rt0_openbsd_ppc64.s(370 B)
📄 rt0_openbsd_riscv64.s(372 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_wasip1_wasm.s(387 B)
📄 rt0_windows_386.s(1.28 KB)
📄 rt0_windows_amd64.s(1.14 KB)
📄 rt0_windows_arm.s(386 B)
📄 rt0_windows_arm64.s(733 B)
📄 runtime-gdb.py(15.44 KB)
📄 runtime-gdb_test.go(24.04 KB)
📄 runtime-gdb_unix_test.go(9.4 KB)
📄 runtime-lldb_test.go(4.95 KB)
📄 runtime-seh_windows_test.go(4.7 KB)
📄 runtime.go(7.1 KB)
📄 runtime1.go(16.66 KB)
📄 runtime2.go(46.16 KB)
📄 runtime_boring.go(606 B)
📄 runtime_linux_test.go(1.77 KB)
📄 runtime_mmap_test.go(1.77 KB)
📄 runtime_test.go(11.81 KB)
📄 runtime_unix_test.go(1.22 KB)
📄 rwmutex.go(5 KB)
📄 rwmutex_test.go(4.21 KB)
📄 security_aix.go(449 B)
📄 security_issetugid.go(502 B)
📄 security_linux.go(335 B)
📄 security_nonunix.go(256 B)
📄 security_test.go(4.09 KB)
📄 security_unix.go(818 B)
📄 select.go(14.82 KB)
📄 sema.go(18.43 KB)
📄 sema_test.go(4.21 KB)
📄 semasleep_test.go(3.46 KB)
📄 sigaction.go(489 B)
📄 signal_386.go(1.72 KB)
📄 signal_aix_ppc64.go(3.54 KB)
📄 signal_amd64.go(2.73 KB)
📄 signal_arm.go(2.54 KB)
📄 signal_arm64.go(3.83 KB)
📄 signal_darwin.go(2.13 KB)
📄 signal_darwin_amd64.go(4 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.24 KB)
📄 signal_freebsd_riscv64.go(3.08 KB)
📄 signal_linux_386.go(1.59 KB)
📄 signal_linux_amd64.go(2.05 KB)
📄 signal_linux_arm.go(2.12 KB)
📄 signal_linux_arm64.go(2.95 KB)
📄 signal_linux_loong64.go(3.22 KB)
📄 signal_linux_mips64x.go(3.35 KB)
📄 signal_linux_mipsx.go(3.67 KB)
📄 signal_linux_ppc64x.go(3.5 KB)
📄 signal_linux_riscv64.go(2.92 KB)
📄 signal_linux_s390x.go(4.49 KB)
📄 signal_loong64.go(3.01 KB)
📄 signal_mips64x.go(3.18 KB)
📄 signal_mipsx.go(3.06 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.39 KB)
📄 signal_openbsd_mips64.go(3.28 KB)
📄 signal_openbsd_ppc64.go(3.53 KB)
📄 signal_openbsd_riscv64.go(3.12 KB)
📄 signal_plan9.go(1.93 KB)
📄 signal_ppc64x.go(3.71 KB)
📄 signal_riscv64.go(2.91 KB)
📄 signal_solaris.go(4.5 KB)
📄 signal_solaris_amd64.go(2.47 KB)
📄 signal_unix.go(44.11 KB)
📄 signal_windows.go(14.48 KB)
📄 signal_windows_test.go(8.98 KB)
📄 sigqueue.go(7.62 KB)
📄 sigqueue_note.go(648 B)
📄 sigqueue_plan9.go(3.25 KB)
📄 sigtab_aix.go(11.3 KB)
📄 sigtab_linux_generic.go(3.52 KB)
📄 sigtab_linux_mipsx.go(5.95 KB)
📄 sizeclasses.go(9.17 KB)
📄 sizeof_test.go(1003 B)
📄 slice.go(11.23 KB)
📄 slice_test.go(10.32 KB)
📄 softfloat64.go(11.54 KB)
📄 softfloat64_test.go(4.04 KB)
📄 stack.go(40.02 KB)
📄 stack_test.go(23.14 KB)
📄 start_line_amd64_test.go(647 B)
📄 start_line_test.go(2.58 KB)
📄 stkframe.go(9.88 KB)
📄 string.go(13.35 KB)
📄 string_test.go(13.33 KB)
📄 stubs.go(17.39 KB)
📄 stubs2.go(1.15 KB)
📄 stubs3.go(324 B)
📄 stubs_386.go(708 B)
📄 stubs_amd64.go(1.38 KB)
📄 stubs_arm.go(689 B)
📄 stubs_arm64.go(700 B)
📄 stubs_linux.go(650 B)
📄 stubs_loong64.go(638 B)
📄 stubs_mips64x.go(522 B)
📄 stubs_mipsx.go(441 B)
📄 stubs_nonlinux.go(298 B)
📄 stubs_ppc64.go(302 B)
📄 stubs_ppc64x.go(688 B)
📄 stubs_riscv64.go(695 B)
📄 stubs_s390x.go(414 B)
📄 symtab.go(34.76 KB)
📄 symtab_test.go(7.48 KB)
📄 symtabinl.go(3.81 KB)
📄 symtabinl_test.go(2.97 KB)
📄 sys_aix_ppc64.s(7.42 KB)
📄 sys_arm.go(521 B)
📄 sys_arm64.go(469 B)
📄 sys_darwin.go(22.56 KB)
📄 sys_darwin_amd64.s(19.65 KB)
📄 sys_darwin_arm64.go(1.74 KB)
📄 sys_darwin_arm64.s(18.28 KB)
📄 sys_dragonfly_amd64.s(8.31 KB)
📄 sys_freebsd_386.s(9.41 KB)
📄 sys_freebsd_amd64.s(12.67 KB)
📄 sys_freebsd_arm.s(10.38 KB)
📄 sys_freebsd_arm64.s(9.49 KB)
📄 sys_freebsd_riscv64.s(8.92 KB)
📄 sys_libc.go(1.84 KB)
📄 sys_linux_386.s(17.89 KB)
📄 sys_linux_amd64.s(15.74 KB)
📄 sys_linux_arm.s(13.5 KB)
📄 sys_linux_arm64.s(16.71 KB)
📄 sys_linux_loong64.s(14.16 KB)
📄 sys_linux_mips64x.s(11.96 KB)
📄 sys_linux_mipsx.s(9.69 KB)
📄 sys_linux_ppc64x.s(18.09 KB)
📄 sys_linux_riscv64.s(11.48 KB)
📄 sys_linux_s390x.s(12.49 KB)
📄 sys_loong64.go(489 B)
📄 sys_mips64x.go(500 B)
📄 sys_mipsx.go(496 B)
📄 sys_netbsd_386.s(9.61 KB)
📄 sys_netbsd_amd64.s(9.78 KB)
📄 sys_netbsd_arm.s(10.58 KB)
📄 sys_netbsd_arm64.s(9.47 KB)
📄 sys_nonppc64x.go(245 B)
📄 sys_openbsd.go(2.59 KB)
📄 sys_openbsd1.go(1.23 KB)
📄 sys_openbsd2.go(8.67 KB)
📄 sys_openbsd3.go(3.37 KB)
📄 sys_openbsd_386.s(20.4 KB)
📄 sys_openbsd_amd64.s(15.54 KB)
📄 sys_openbsd_arm.s(18.46 KB)
📄 sys_openbsd_arm64.s(15.05 KB)
📄 sys_openbsd_mips64.s(8.81 KB)
📄 sys_openbsd_ppc64.s(15.3 KB)
📄 sys_openbsd_riscv64.s(16.8 KB)
📄 sys_plan9_386.s(4.48 KB)
📄 sys_plan9_amd64.s(4.56 KB)
📄 sys_plan9_arm.s(7.03 KB)
📄 sys_ppc64x.go(532 B)
📄 sys_riscv64.go(469 B)
📄 sys_s390x.go(469 B)
📄 sys_solaris_amd64.s(6.42 KB)
📄 sys_wasm.go(758 B)
📄 sys_wasm.s(1.43 KB)
📄 sys_windows_386.s(6.46 KB)
📄 sys_windows_amd64.s(8.41 KB)
📄 sys_windows_arm.s(7.72 KB)
📄 sys_windows_arm64.s(6.8 KB)
📄 sys_x86.go(552 B)
📄 syscall2_solaris.go(1.85 KB)
📄 syscall_aix.go(6.33 KB)
📄 syscall_solaris.go(8.38 KB)
📄 syscall_unix_test.go(635 B)
📄 syscall_windows.go(16.57 KB)
📄 syscall_windows_test.go(32.45 KB)
📄 tagptr.go(496 B)
📄 tagptr_32bit.go(927 B)
📄 tagptr_64bit.go(3.23 KB)
📄 test_amd64.go(196 B)
📄 test_amd64.s(316 B)
📄 test_stubs.go(218 B)
📁 testdata
📄 textflag.h(1.47 KB)
📄 time.go(30.57 KB)
📄 time_fake.go(2.5 KB)
📄 time_linux_amd64.s(2.02 KB)
📄 time_nofake.go(709 B)
📄 time_test.go(2.04 KB)
📄 time_windows.h(753 B)
📄 time_windows_386.s(1.71 KB)
📄 time_windows_amd64.s(786 B)
📄 time_windows_arm.s(1.97 KB)
📄 time_windows_arm64.s(906 B)
📄 timeasm.go(418 B)
📄 timestub.go(532 B)
📄 timestub2.go(363 B)
📄 tls_arm.s(3.45 KB)
📄 tls_arm64.h(1.1 KB)
📄 tls_arm64.s(1.2 KB)
📄 tls_loong64.s(589 B)
📄 tls_mips64x.s(733 B)
📄 tls_mipsx.s(710 B)
📄 tls_ppc64x.s(1.52 KB)
📄 tls_riscv64.s(615 B)
📄 tls_s390x.s(1.55 KB)
📄 tls_stub.go(260 B)
📄 tls_windows_amd64.go(294 B)
📁 trace
📄 trace.go(62.76 KB)
📄 trace2.go(33.81 KB)
📄 trace2buf.go(6.58 KB)
📄 trace2cpu.go(8.87 KB)
📄 trace2event.go(8.39 KB)
📄 trace2map.go(4.36 KB)
📄 trace2region.go(1.68 KB)
📄 trace2runtime.go(24.2 KB)
📄 trace2stack.go(9.45 KB)
📄 trace2status.go(7.24 KB)
📄 trace2string.go(2.59 KB)
📄 trace2time.go(3.21 KB)
📄 trace_cgo_test.go(4.47 KB)
📄 traceback.go(54.61 KB)
📄 traceback_test.go(22.95 KB)
📄 tracebackx_test.go(509 B)
📄 type.go(12.1 KB)
📄 typekind.go(743 B)
📄 unsafe.go(2.97 KB)
📄 unsafepoint_test.go(3.27 KB)
📄 utf8.go(3.39 KB)
📄 vdso_elf32.go(2.76 KB)
📄 vdso_elf64.go(2.84 KB)
📄 vdso_freebsd.go(2.44 KB)
📄 vdso_freebsd_arm.go(454 B)
📄 vdso_freebsd_arm64.go(454 B)
📄 vdso_freebsd_riscv64.go(429 B)
📄 vdso_freebsd_x86.go(1.86 KB)
📄 vdso_in_none.go(443 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_loong64.go(793 B)
📄 vdso_linux_mips64x.go(850 B)
📄 vdso_linux_ppc64x.go(672 B)
📄 vdso_linux_riscv64.go(666 B)
📄 vdso_linux_s390x.go(659 B)
📄 vdso_test.go(3.71 KB)
📄 vlop_386.s(2.02 KB)
📄 vlop_arm.s(7.06 KB)
📄 vlop_arm_test.go(3.75 KB)
📄 vlrt.go(6.71 KB)
📄 wincallback.go(3.45 KB)
📄 write_err.go(291 B)
📄 write_err_android.go(4.65 KB)
📄 zcallback_windows.go(155 B)
📄 zcallback_windows.s(63.06 KB)
📄 zcallback_windows_arm.s(89.32 KB)
📄 zcallback_windows_arm64.s(89.32 KB)

Editing: stack_test.go

// Copyright 2012 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_test

import (
	"fmt"
	"internal/testenv"
	"reflect"
	"regexp"
	. "runtime"
	"strings"
	"sync"
	"sync/atomic"
	"testing"
	"time"
	_ "unsafe" // for go:linkname
)

// TestStackMem measures per-thread stack segment cache behavior.
// The test consumed up to 500MB in the past.
func TestStackMem(t *testing.T) {
	const (
		BatchSize      = 32
		BatchCount     = 256
		ArraySize      = 1024
		RecursionDepth = 128
	)
	if testing.Short() {
		return
	}
	defer GOMAXPROCS(GOMAXPROCS(BatchSize))
	s0 := new(MemStats)
	ReadMemStats(s0)
	for b := 0; b < BatchCount; b++ {
		c := make(chan bool, BatchSize)
		for i := 0; i < BatchSize; i++ {
			go func() {
				var f func(k int, a [ArraySize]byte)
				f = func(k int, a [ArraySize]byte) {
					if k == 0 {
						time.Sleep(time.Millisecond)
						return
					}
					f(k-1, a)
				}
				f(RecursionDepth, [ArraySize]byte{})
				c <- true
			}()
		}
		for i := 0; i < BatchSize; i++ {
			<-c
		}

// The goroutines have signaled via c that they are ready to exit.
		// Give them a chance to exit by sleeping. If we don't wait, we
		// might not reuse them on the next batch.
		time.Sleep(10 * time.Millisecond)
	}
	s1 := new(MemStats)
	ReadMemStats(s1)
	consumed := int64(s1.StackSys - s0.StackSys)
	t.Logf("Consumed %vMB for stack mem", consumed>>20)
	estimate := int64(8 * BatchSize * ArraySize * RecursionDepth) // 8 is to reduce flakiness.
	if consumed > estimate {
		t.Fatalf("Stack mem: want %v, got %v", estimate, consumed)
	}
	// Due to broken stack memory accounting (https://golang.org/issue/7468),
	// StackInuse can decrease during function execution, so we cast the values to int64.
	inuse := int64(s1.StackInuse) - int64(s0.StackInuse)
	t.Logf("Inuse %vMB for stack mem", inuse>>20)
	if inuse > 4<<20 {
		t.Fatalf("Stack inuse: want %v, got %v", 4<<20, inuse)
	}
}

// Test stack growing in different contexts.
func TestStackGrowth(t *testing.T) {
	if *flagQuick {
		t.Skip("-quick")
	}

var wg sync.WaitGroup

// in a normal goroutine
	var growDuration time.Duration // For debugging failures
	wg.Add(1)
	go func() {
		defer wg.Done()
		start := time.Now()
		growStack(nil)
		growDuration = time.Since(start)
	}()
	wg.Wait()
	t.Log("first growStack took", growDuration)

// in locked goroutine
	wg.Add(1)
	go func() {
		defer wg.Done()
		LockOSThread()
		growStack(nil)
		UnlockOSThread()
	}()
	wg.Wait()

// in finalizer
	var finalizerStart time.Time
	var started atomic.Bool
	var progress atomic.Uint32
	wg.Add(1)
	s := new(string) // Must be of a type that avoids the tiny allocator, or else the finalizer might not run.
	SetFinalizer(s, func(ss *string) {
		defer wg.Done()
		finalizerStart = time.Now()
		started.Store(true)
		growStack(&progress)
	})
	setFinalizerTime := time.Now()
	s = nil

if d, ok := t.Deadline(); ok {
		// Pad the timeout by an arbitrary 5% to give the AfterFunc time to run.
		timeout := time.Until(d) * 19 / 20
		timer := time.AfterFunc(timeout, func() {
			// Panic — instead of calling t.Error and returning from the test — so
			// that we get a useful goroutine dump if the test times out, especially
			// if GOTRACEBACK=system or GOTRACEBACK=crash is set.
			if !started.Load() {
				panic("finalizer did not start")
			} else {
				panic(fmt.Sprintf("finalizer started %s ago (%s after registration) and ran %d iterations, but did not return", time.Since(finalizerStart), finalizerStart.Sub(setFinalizerTime), progress.Load()))
			}
		})
		defer timer.Stop()
	}

GC()
	wg.Wait()
	t.Logf("finalizer started after %s and ran %d iterations in %v", finalizerStart.Sub(setFinalizerTime), progress.Load(), time.Since(finalizerStart))
}

// ... and in init
//func init() {
//	growStack()
//}

func growStack(progress *atomic.Uint32) {
	n := 1 << 10
	if testing.Short() {
		n = 1 << 8
	}
	for i := 0; i < n; i++ {
		x := 0
		growStackIter(&x, i)
		if x != i+1 {
			panic("stack is corrupted")
		}
		if progress != nil {
			progress.Store(uint32(i))
		}
	}
	GC()
}

// This function is not an anonymous func, so that the compiler can do escape
// analysis and place x on stack (and subsequently stack growth update the pointer).
func growStackIter(p *int, n int) {
	if n == 0 {
		*p = n + 1
		GC()
		return
	}
	*p = n + 1
	x := 0
	growStackIter(&x, n-1)
	if x != n {
		panic("stack is corrupted")
	}
}

func TestStackGrowthCallback(t *testing.T) {
	t.Parallel()
	var wg sync.WaitGroup

// test stack growth at chan op
	wg.Add(1)
	go func() {
		defer wg.Done()
		c := make(chan int, 1)
		growStackWithCallback(func() {
			c <- 1
			<-c
		})
	}()

// test stack growth at map op
	wg.Add(1)
	go func() {
		defer wg.Done()
		m := make(map[int]int)
		growStackWithCallback(func() {
			_, _ = m[1]
			m[1] = 1
		})
	}()

// test stack growth at goroutine creation
	wg.Add(1)
	go func() {
		defer wg.Done()
		growStackWithCallback(func() {
			done := make(chan bool)
			go func() {
				done <- true
			}()
			<-done
		})
	}()
	wg.Wait()
}

func growStackWithCallback(cb func()) {
	var f func(n int)
	f = func(n int) {
		if n == 0 {
			cb()
			return
		}
		f(n - 1)
	}
	for i := 0; i < 1<<10; i++ {
		f(i)
	}
}

// TestDeferPtrs tests the adjustment of Defer's argument pointers (p aka &y)
// during a stack copy.
func set(p *int, x int) {
	*p = x
}
func TestDeferPtrs(t *testing.T) {
	var y int

defer func() {
		if y != 42 {
			t.Errorf("defer's stack references were not adjusted appropriately")
		}
	}()
	defer set(&y, 42)
	growStack(nil)
}

type bigBuf [4 * 1024]byte

// TestDeferPtrsGoexit is like TestDeferPtrs but exercises the possibility that the
// stack grows as part of starting the deferred function. It calls Goexit at various
// stack depths, forcing the deferred function (with >4kB of args) to be run at
// the bottom of the stack. The goal is to find a stack depth less than 4kB from
// the end of the stack. Each trial runs in a different goroutine so that an earlier
// stack growth does not invalidate a later attempt.
func TestDeferPtrsGoexit(t *testing.T) {
	for i := 0; i < 100; i++ {
		c := make(chan int, 1)
		go testDeferPtrsGoexit(c, i)
		if n := <-c; n != 42 {
			t.Fatalf("defer's stack references were not adjusted appropriately (i=%d n=%d)", i, n)
		}
	}
}

func testDeferPtrsGoexit(c chan int, i int) {
	var y int
	defer func() {
		c <- y
	}()
	defer setBig(&y, 42, bigBuf{})
	useStackAndCall(i, Goexit)
}

func setBig(p *int, x int, b bigBuf) {
	*p = x
}

// TestDeferPtrsPanic is like TestDeferPtrsGoexit, but it's using panic instead
// of Goexit to run the Defers. Those two are different execution paths
// in the runtime.
func TestDeferPtrsPanic(t *testing.T) {
	for i := 0; i < 100; i++ {
		c := make(chan int, 1)
		go testDeferPtrsGoexit(c, i)
		if n := <-c; n != 42 {
			t.Fatalf("defer's stack references were not adjusted appropriately (i=%d n=%d)", i, n)
		}
	}
}

func testDeferPtrsPanic(c chan int, i int) {
	var y int
	defer func() {
		if recover() == nil {
			c <- -1
			return
		}
		c <- y
	}()
	defer setBig(&y, 42, bigBuf{})
	useStackAndCall(i, func() { panic(1) })
}

//go:noinline
func testDeferLeafSigpanic1() {
	// Cause a sigpanic to be injected in this frame.
	//
	// This function has to be declared before
	// TestDeferLeafSigpanic so the runtime will crash if we think
	// this function's continuation PC is in
	// TestDeferLeafSigpanic.
	*(*int)(nil) = 0
}

// TestDeferLeafSigpanic tests defer matching around leaf functions
// that sigpanic. This is tricky because on LR machines the outer
// function and the inner function have the same SP, but it's critical
// that we match up the defer correctly to get the right liveness map.
// See issue #25499.
func TestDeferLeafSigpanic(t *testing.T) {
	// Push a defer that will walk the stack.
	defer func() {
		if err := recover(); err == nil {
			t.Fatal("expected panic from nil pointer")
		}
		GC()
	}()
	// Call a leaf function. We must set up the exact call stack:
	//
	//  deferring function -> leaf function -> sigpanic
	//
	// On LR machines, the leaf function will have the same SP as
	// the SP pushed for the defer frame.
	testDeferLeafSigpanic1()
}

// TestPanicUseStack checks that a chain of Panic structs on the stack are
// updated correctly if the stack grows during the deferred execution that
// happens as a result of the panic.
func TestPanicUseStack(t *testing.T) {
	pc := make([]uintptr, 10000)
	defer func() {
		recover()
		Callers(0, pc) // force stack walk
		useStackAndCall(100, func() {
			defer func() {
				recover()
				Callers(0, pc) // force stack walk
				useStackAndCall(200, func() {
					defer func() {
						recover()
						Callers(0, pc) // force stack walk
					}()
					panic(3)
				})
			}()
			panic(2)
		})
	}()
	panic(1)
}

func TestPanicFar(t *testing.T) {
	var xtree *xtreeNode
	pc := make([]uintptr, 10000)
	defer func() {
		// At this point we created a large stack and unwound
		// it via recovery. Force a stack walk, which will
		// check the stack's consistency.
		Callers(0, pc)
	}()
	defer func() {
		recover()
	}()
	useStackAndCall(100, func() {
		// Kick off the GC and make it do something nontrivial.
		// (This used to force stack barriers to stick around.)
		xtree = makeTree(18)
		// Give the GC time to start scanning stacks.
		time.Sleep(time.Millisecond)
		panic(1)
	})
	_ = xtree
}

type xtreeNode struct {
	l, r *xtreeNode
}

func makeTree(d int) *xtreeNode {
	if d == 0 {
		return new(xtreeNode)
	}
	return &xtreeNode{makeTree(d - 1), makeTree(d - 1)}
}

// use about n KB of stack and call f
func useStackAndCall(n int, f func()) {
	if n == 0 {
		f()
		return
	}
	var b [1024]byte // makes frame about 1KB
	useStackAndCall(n-1+int(b[99]), f)
}

func useStack(n int) {
	useStackAndCall(n, func() {})
}

func growing(c chan int, done chan struct{}) {
	for n := range c {
		useStack(n)
		done <- struct{}{}
	}
	done <- struct{}{}
}

func TestStackCache(t *testing.T) {
	// Allocate a bunch of goroutines and grow their stacks.
	// Repeat a few times to test the stack cache.
	const (
		R = 4
		G = 200
		S = 5
	)
	for i := 0; i < R; i++ {
		var reqchans [G]chan int
		done := make(chan struct{})
		for j := 0; j < G; j++ {
			reqchans[j] = make(chan int)
			go growing(reqchans[j], done)
		}
		for s := 0; s < S; s++ {
			for j := 0; j < G; j++ {
				reqchans[j] <- 1 << uint(s)
			}
			for j := 0; j < G; j++ {
				<-done
			}
		}
		for j := 0; j < G; j++ {
			close(reqchans[j])
		}
		for j := 0; j < G; j++ {
			<-done
		}
	}
}

func TestStackOutput(t *testing.T) {
	b := make([]byte, 1024)
	stk := string(b[:Stack(b, false)])
	if !strings.HasPrefix(stk, "goroutine ") {
		t.Errorf("Stack (len %d):\n%s", len(stk), stk)
		t.Errorf("Stack output should begin with \"goroutine \"")
	}
}

func TestStackAllOutput(t *testing.T) {
	b := make([]byte, 1024)
	stk := string(b[:Stack(b, true)])
	if !strings.HasPrefix(stk, "goroutine ") {
		t.Errorf("Stack (len %d):\n%s", len(stk), stk)
		t.Errorf("Stack output should begin with \"goroutine \"")
	}
}

func TestStackPanic(t *testing.T) {
	// Test that stack copying copies panics correctly. This is difficult
	// to test because it is very unlikely that the stack will be copied
	// in the middle of gopanic. But it can happen.
	// To make this test effective, edit panic.go:gopanic and uncomment
	// the GC() call just before freedefer(d).
	defer func() {
		if x := recover(); x == nil {
			t.Errorf("recover failed")
		}
	}()
	useStack(32)
	panic("test panic")
}

func BenchmarkStackCopyPtr(b *testing.B) {
	c := make(chan bool)
	for i := 0; i < b.N; i++ {
		go func() {
			i := 1000000
			countp(&i)
			c <- true
		}()
		<-c
	}
}

func countp(n *int) {
	if *n == 0 {
		return
	}
	*n--
	countp(n)
}

func BenchmarkStackCopy(b *testing.B) {
	c := make(chan bool)
	for i := 0; i < b.N; i++ {
		go func() {
			count(1000000)
			c <- true
		}()
		<-c
	}
}

func count(n int) int {
	if n == 0 {
		return 0
	}
	return 1 + count(n-1)
}

func BenchmarkStackCopyNoCache(b *testing.B) {
	c := make(chan bool)
	for i := 0; i < b.N; i++ {
		go func() {
			count1(1000000)
			c <- true
		}()
		<-c
	}
}

func count1(n int) int {
	if n <= 0 {
		return 0
	}
	return 1 + count2(n-1)
}

func count2(n int) int  { return 1 + count3(n-1) }
func count3(n int) int  { return 1 + count4(n-1) }
func count4(n int) int  { return 1 + count5(n-1) }
func count5(n int) int  { return 1 + count6(n-1) }
func count6(n int) int  { return 1 + count7(n-1) }
func count7(n int) int  { return 1 + count8(n-1) }
func count8(n int) int  { return 1 + count9(n-1) }
func count9(n int) int  { return 1 + count10(n-1) }
func count10(n int) int { return 1 + count11(n-1) }
func count11(n int) int { return 1 + count12(n-1) }
func count12(n int) int { return 1 + count13(n-1) }
func count13(n int) int { return 1 + count14(n-1) }
func count14(n int) int { return 1 + count15(n-1) }
func count15(n int) int { return 1 + count16(n-1) }
func count16(n int) int { return 1 + count17(n-1) }
func count17(n int) int { return 1 + count18(n-1) }
func count18(n int) int { return 1 + count19(n-1) }
func count19(n int) int { return 1 + count20(n-1) }
func count20(n int) int { return 1 + count21(n-1) }
func count21(n int) int { return 1 + count22(n-1) }
func count22(n int) int { return 1 + count23(n-1) }
func count23(n int) int { return 1 + count1(n-1) }

type stkobjT struct {
	p *stkobjT
	x int64
	y [20]int // consume some stack
}

// Sum creates a linked list of stkobjTs.
func Sum(n int64, p *stkobjT) {
	if n == 0 {
		return
	}
	s := stkobjT{p: p, x: n}
	Sum(n-1, &s)
	p.x += s.x
}

func BenchmarkStackCopyWithStkobj(b *testing.B) {
	c := make(chan bool)
	for i := 0; i < b.N; i++ {
		go func() {
			var s stkobjT
			Sum(100000, &s)
			c <- true
		}()
		<-c
	}
}

func BenchmarkIssue18138(b *testing.B) {
	// Channel with N "can run a goroutine" tokens
	const N = 10
	c := make(chan []byte, N)
	for i := 0; i < N; i++ {
		c <- make([]byte, 1)
	}

for i := 0; i < b.N; i++ {
		<-c // get token
		go func() {
			useStackPtrs(1000, false) // uses ~1MB max
			m := make([]byte, 8192)   // make GC trigger occasionally
			c <- m                    // return token
		}()
	}
}

func useStackPtrs(n int, b bool) {
	if b {
		// This code contributes to the stack frame size, and hence to the
		// stack copying cost. But since b is always false, it costs no
		// execution time (not even the zeroing of a).
		var a [128]*int // 1KB of pointers
		a[n] = &n
		n = *a[0]
	}
	if n == 0 {
		return
	}
	useStackPtrs(n-1, b)
}

type structWithMethod struct{}

func (s structWithMethod) caller() string {
	_, file, line, ok := Caller(1)
	if !ok {
		panic("Caller failed")
	}
	return fmt.Sprintf("%s:%d", file, line)
}

func (s structWithMethod) callers() []uintptr {
	pc := make([]uintptr, 16)
	return pc[:Callers(0, pc)]
}

func (s structWithMethod) stack() string {
	buf := make([]byte, 4<<10)
	return string(buf[:Stack(buf, false)])
}

func (s structWithMethod) nop() {}

func (s structWithMethod) inlinablePanic() { panic("panic") }

func TestStackWrapperCaller(t *testing.T) {
	var d structWithMethod
	// Force the compiler to construct a wrapper method.
	wrapper := (*structWithMethod).caller
	// Check that the wrapper doesn't affect the stack trace.
	if dc, ic := d.caller(), wrapper(&d); dc != ic {
		t.Fatalf("direct caller %q != indirect caller %q", dc, ic)
	}
}

func TestStackWrapperCallers(t *testing.T) {
	var d structWithMethod
	wrapper := (*structWithMethod).callers
	// Check that <autogenerated> doesn't appear in the stack trace.
	pcs := wrapper(&d)
	frames := CallersFrames(pcs)
	for {
		fr, more := frames.Next()
		if fr.File == "<autogenerated>" {
			t.Fatalf("<autogenerated> appears in stack trace: %+v", fr)
		}
		if !more {
			break
		}
	}
}

func TestStackWrapperStack(t *testing.T) {
	var d structWithMethod
	wrapper := (*structWithMethod).stack
	// Check that <autogenerated> doesn't appear in the stack trace.
	stk := wrapper(&d)
	if strings.Contains(stk, "<autogenerated>") {
		t.Fatalf("<autogenerated> appears in stack trace:\n%s", stk)
	}
}

func TestStackWrapperStackInlinePanic(t *testing.T) {
	// Test that inline unwinding correctly tracks the callee by creating a
	// stack of the form wrapper -> inlined function -> panic. If we mess up
	// callee tracking, it will look like the wrapper called panic and we'll see
	// the wrapper in the stack trace.
	var d structWithMethod
	wrapper := (*structWithMethod).inlinablePanic
	defer func() {
		err := recover()
		if err == nil {
			t.Fatalf("expected panic")
		}
		buf := make([]byte, 4<<10)
		stk := string(buf[:Stack(buf, false)])
		if strings.Contains(stk, "<autogenerated>") {
			t.Fatalf("<autogenerated> appears in stack trace:\n%s", stk)
		}
		// Self-check: make sure inlinablePanic got inlined.
		if !testenv.OptimizationOff() {
			if !strings.Contains(stk, "inlinablePanic(...)") {
				t.Fatalf("inlinablePanic not inlined")
			}
		}
	}()
	wrapper(&d)
}

type I interface {
	M()
}

func TestStackWrapperStackPanic(t *testing.T) {
	t.Run("sigpanic", func(t *testing.T) {
		// nil calls to interface methods cause a sigpanic.
		testStackWrapperPanic(t, func() { I.M(nil) }, "runtime_test.I.M")
	})
	t.Run("panicwrap", func(t *testing.T) {
		// Nil calls to value method wrappers call panicwrap.
		wrapper := (*structWithMethod).nop
		testStackWrapperPanic(t, func() { wrapper(nil) }, "runtime_test.(*structWithMethod).nop")
	})
}

func testStackWrapperPanic(t *testing.T, cb func(), expect string) {
	// Test that the stack trace from a panicking wrapper includes
	// the wrapper, even though elide these when they don't panic.
	t.Run("CallersFrames", func(t *testing.T) {
		defer func() {
			err := recover()
			if err == nil {
				t.Fatalf("expected panic")
			}
			pcs := make([]uintptr, 10)
			n := Callers(0, pcs)
			frames := CallersFrames(pcs[:n])
			for {
				frame, more := frames.Next()
				t.Log(frame.Function)
				if frame.Function == expect {
					return
				}
				if !more {
					break
				}
			}
			t.Fatalf("panicking wrapper %s missing from stack trace", expect)
		}()
		cb()
	})
	t.Run("Stack", func(t *testing.T) {
		defer func() {
			err := recover()
			if err == nil {
				t.Fatalf("expected panic")
			}
			buf := make([]byte, 4<<10)
			stk := string(buf[:Stack(buf, false)])
			if !strings.Contains(stk, "\n"+expect) {
				t.Fatalf("panicking wrapper %s missing from stack trace:\n%s", expect, stk)
			}
		}()
		cb()
	})
}

func TestCallersFromWrapper(t *testing.T) {
	// Test that invoking CallersFrames on a stack where the first
	// PC is an autogenerated wrapper keeps the wrapper in the
	// trace. Normally we elide these, assuming that the wrapper
	// calls the thing you actually wanted to see, but in this
	// case we need to keep it.
	pc := reflect.ValueOf(I.M).Pointer()
	frames := CallersFrames([]uintptr{pc})
	frame, more := frames.Next()
	if frame.Function != "runtime_test.I.M" {
		t.Fatalf("want function %s, got %s", "runtime_test.I.M", frame.Function)
	}
	if more {
		t.Fatalf("want 1 frame, got > 1")
	}
}

func TestTracebackSystemstack(t *testing.T) {
	if GOARCH == "ppc64" || GOARCH == "ppc64le" {
		t.Skip("systemstack tail call not implemented on ppc64x")
	}

// Test that profiles correctly jump over systemstack,
	// including nested systemstack calls.
	pcs := make([]uintptr, 20)
	pcs = pcs[:TracebackSystemstack(pcs, 5)]
	// Check that runtime.TracebackSystemstack appears five times
	// and that we see TestTracebackSystemstack.
	countIn, countOut := 0, 0
	frames := CallersFrames(pcs)
	var tb strings.Builder
	for {
		frame, more := frames.Next()
		fmt.Fprintf(&tb, "\n%s+0x%x %s:%d", frame.Function, frame.PC-frame.Entry, frame.File, frame.Line)
		switch frame.Function {
		case "runtime.TracebackSystemstack":
			countIn++
		case "runtime_test.TestTracebackSystemstack":
			countOut++
		}
		if !more {
			break
		}
	}
	if countIn != 5 || countOut != 1 {
		t.Fatalf("expected 5 calls to TracebackSystemstack and 1 call to TestTracebackSystemstack, got:%s", tb.String())
	}
}

func TestTracebackAncestors(t *testing.T) {
	goroutineRegex := regexp.MustCompile(`goroutine [0-9]+ \[`)
	for _, tracebackDepth := range []int{0, 1, 5, 50} {
		output := runTestProg(t, "testprog", "TracebackAncestors", fmt.Sprintf("GODEBUG=tracebackancestors=%d", tracebackDepth))

numGoroutines := 3
		numFrames := 2
		ancestorsExpected := numGoroutines
		if numGoroutines > tracebackDepth {
			ancestorsExpected = tracebackDepth
		}

matches := goroutineRegex.FindAllStringSubmatch(output, -1)
		if len(matches) != 2 {
			t.Fatalf("want 2 goroutines, got:\n%s", output)
		}

// Check functions in the traceback.
		fns := []string{"main.recurseThenCallGo", "main.main", "main.printStack", "main.TracebackAncestors"}
		for _, fn := range fns {
			if !strings.Contains(output, "\n"+fn+"(") {
				t.Fatalf("expected %q function in traceback:\n%s", fn, output)
			}
		}

if want, count := "originating from goroutine", ancestorsExpected; strings.Count(output, want) != count {
			t.Errorf("output does not contain %d instances of %q:\n%s", count, want, output)
		}

if want, count := "main.recurseThenCallGo(...)", ancestorsExpected*(numFrames+1); strings.Count(output, want) != count {
			t.Errorf("output does not contain %d instances of %q:\n%s", count, want, output)
		}

if want, count := "main.recurseThenCallGo(0x", 1; strings.Count(output, want) != count {
			t.Errorf("output does not contain %d instances of %q:\n%s", count, want, output)
		}
	}
}

// Test that defer closure is correctly scanned when the stack is scanned.
func TestDeferLiveness(t *testing.T) {
	output := runTestProg(t, "testprog", "DeferLiveness", "GODEBUG=clobberfree=1")
	if output != "" {
		t.Errorf("output:\n%s\n\nwant no output", output)
	}
}

func TestDeferHeapAndStack(t *testing.T) {
	P := 4     // processors
	N := 10000 //iterations
	D := 200   // stack depth

if testing.Short() {
		P /= 2
		N /= 10
		D /= 10
	}
	c := make(chan bool)
	for p := 0; p < P; p++ {
		go func() {
			for i := 0; i < N; i++ {
				if deferHeapAndStack(D) != 2*D {
					panic("bad result")
				}
			}
			c <- true
		}()
	}
	for p := 0; p < P; p++ {
		<-c
	}
}

// deferHeapAndStack(n) computes 2*n
func deferHeapAndStack(n int) (r int) {
	if n == 0 {
		return 0
	}
	if n%2 == 0 {
		// heap-allocated defers
		for i := 0; i < 2; i++ {
			defer func() {
				r++
			}()
		}
	} else {
		// stack-allocated defers
		defer func() {
			r++
		}()
		defer func() {
			r++
		}()
	}
	r = deferHeapAndStack(n - 1)
	escapeMe(new([1024]byte)) // force some GCs
	return
}

// Pass a value to escapeMe to force it to escape.
var escapeMe = func(x any) {}

func TestFramePointerAdjust(t *testing.T) {
	switch GOARCH {
	case "amd64", "arm64":
	default:
		t.Skipf("frame pointer is not supported on %s", GOARCH)
	}
	output := runTestProg(t, "testprog", "FramePointerAdjust")
	if output != "" {
		t.Errorf("output:\n%s\n\nwant no output", output)
	}
}

// TestSystemstackFramePointerAdjust is a regression test for issue 59692 that
// ensures that the frame pointer of systemstack is correctly adjusted. See CL
// 489015 for more details.
func TestSystemstackFramePointerAdjust(t *testing.T) {
	growAndShrinkStack(512, [1024]byte{})
}

// growAndShrinkStack grows the stack of the current goroutine in order to
// shrink it again and verify that all frame pointers on the new stack have
// been correctly adjusted. stackBallast is used to ensure we're not depending
// on the current heuristics of stack shrinking too much.
func growAndShrinkStack(n int, stackBallast [1024]byte) {
	if n <= 0 {
		return
	}
	growAndShrinkStack(n-1, stackBallast)
	ShrinkStackAndVerifyFramePointers()
}

X7ROOT File Manager

Editing: stack_test.go

Upload File

Create Folder