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: profbuf.go

// Copyright 2017 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 (
	"runtime/internal/atomic"
	"unsafe"
)

// A profBuf is a lock-free buffer for profiling events,
// safe for concurrent use by one reader and one writer.
// The writer may be a signal handler running without a user g.
// The reader is assumed to be a user g.
//
// Each logged event corresponds to a fixed size header, a list of
// uintptrs (typically a stack), and exactly one unsafe.Pointer tag.
// The header and uintptrs are stored in the circular buffer data and the
// tag is stored in a circular buffer tags, running in parallel.
// In the circular buffer data, each event takes 2+hdrsize+len(stk)
// words: the value 2+hdrsize+len(stk), then the time of the event, then
// hdrsize words giving the fixed-size header, and then len(stk) words
// for the stack.
//
// The current effective offsets into the tags and data circular buffers
// for reading and writing are stored in the high 30 and low 32 bits of r and w.
// The bottom bits of the high 32 are additional flag bits in w, unused in r.
// "Effective" offsets means the total number of reads or writes, mod 2^length.
// The offset in the buffer is the effective offset mod the length of the buffer.
// To make wraparound mod 2^length match wraparound mod length of the buffer,
// the length of the buffer must be a power of two.
//
// If the reader catches up to the writer, a flag passed to read controls
// whether the read blocks until more data is available. A read returns a
// pointer to the buffer data itself; the caller is assumed to be done with
// that data at the next read. The read offset rNext tracks the next offset to
// be returned by read. By definition, r ≤ rNext ≤ w (before wraparound),
// and rNext is only used by the reader, so it can be accessed without atomics.
//
// If the writer gets ahead of the reader, so that the buffer fills,
// future writes are discarded and replaced in the output stream by an
// overflow entry, which has size 2+hdrsize+1, time set to the time of
// the first discarded write, a header of all zeroed words, and a "stack"
// containing one word, the number of discarded writes.
//
// Between the time the buffer fills and the buffer becomes empty enough
// to hold more data, the overflow entry is stored as a pending overflow
// entry in the fields overflow and overflowTime. The pending overflow
// entry can be turned into a real record by either the writer or the
// reader. If the writer is called to write a new record and finds that
// the output buffer has room for both the pending overflow entry and the
// new record, the writer emits the pending overflow entry and the new
// record into the buffer. If the reader is called to read data and finds
// that the output buffer is empty but that there is a pending overflow
// entry, the reader will return a synthesized record for the pending
// overflow entry.
//
// Only the writer can create or add to a pending overflow entry, but
// either the reader or the writer can clear the pending overflow entry.
// A pending overflow entry is indicated by the low 32 bits of 'overflow'
// holding the number of discarded writes, and overflowTime holding the
// time of the first discarded write. The high 32 bits of 'overflow'
// increment each time the low 32 bits transition from zero to non-zero
// or vice versa. This sequence number avoids ABA problems in the use of
// compare-and-swap to coordinate between reader and writer.
// The overflowTime is only written when the low 32 bits of overflow are
// zero, that is, only when there is no pending overflow entry, in
// preparation for creating a new one. The reader can therefore fetch and
// clear the entry atomically using
//
//	for {
//		overflow = load(&b.overflow)
//		if uint32(overflow) == 0 {
//			// no pending entry
//			break
//		}
//		time = load(&b.overflowTime)
//		if cas(&b.overflow, overflow, ((overflow>>32)+1)<<32) {
//			// pending entry cleared
//			break
//		}
//	}
//	if uint32(overflow) > 0 {
//		emit entry for uint32(overflow), time
//	}
type profBuf struct {
	// accessed atomically
	r, w         profAtomic
	overflow     atomic.Uint64
	overflowTime atomic.Uint64
	eof          atomic.Uint32

// immutable (excluding slice content)
	hdrsize uintptr
	data    []uint64
	tags    []unsafe.Pointer

// owned by reader
	rNext       profIndex
	overflowBuf []uint64 // for use by reader to return overflow record
	wait        note
}

// A profAtomic is the atomically-accessed word holding a profIndex.
type profAtomic uint64

// A profIndex is the packet tag and data counts and flags bits, described above.
type profIndex uint64

const (
	profReaderSleeping profIndex = 1 << 32 // reader is sleeping and must be woken up
	profWriteExtra     profIndex = 1 << 33 // overflow or eof waiting
)

func (x *profAtomic) load() profIndex {
	return profIndex(atomic.Load64((*uint64)(x)))
}

func (x *profAtomic) store(new profIndex) {
	atomic.Store64((*uint64)(x), uint64(new))
}

func (x *profAtomic) cas(old, new profIndex) bool {
	return atomic.Cas64((*uint64)(x), uint64(old), uint64(new))
}

func (x profIndex) dataCount() uint32 {
	return uint32(x)
}

func (x profIndex) tagCount() uint32 {
	return uint32(x >> 34)
}

// countSub subtracts two counts obtained from profIndex.dataCount or profIndex.tagCount,
// assuming that they are no more than 2^29 apart (guaranteed since they are never more than
// len(data) or len(tags) apart, respectively).
// tagCount wraps at 2^30, while dataCount wraps at 2^32.
// This function works for both.
func countSub(x, y uint32) int {
	// x-y is 32-bit signed or 30-bit signed; sign-extend to 32 bits and convert to int.
	return int(int32(x-y) << 2 >> 2)
}

// addCountsAndClearFlags returns the packed form of "x + (data, tag) - all flags".
func (x profIndex) addCountsAndClearFlags(data, tag int) profIndex {
	return profIndex((uint64(x)>>34+uint64(uint32(tag)<<2>>2))<<34 | uint64(uint32(x)+uint32(data)))
}

// hasOverflow reports whether b has any overflow records pending.
func (b *profBuf) hasOverflow() bool {
	return uint32(b.overflow.Load()) > 0
}

// takeOverflow consumes the pending overflow records, returning the overflow count
// and the time of the first overflow.
// When called by the reader, it is racing against incrementOverflow.
func (b *profBuf) takeOverflow() (count uint32, time uint64) {
	overflow := b.overflow.Load()
	time = b.overflowTime.Load()
	for {
		count = uint32(overflow)
		if count == 0 {
			time = 0
			break
		}
		// Increment generation, clear overflow count in low bits.
		if b.overflow.CompareAndSwap(overflow, ((overflow>>32)+1)<<32) {
			break
		}
		overflow = b.overflow.Load()
		time = b.overflowTime.Load()
	}
	return uint32(overflow), time
}

// incrementOverflow records a single overflow at time now.
// It is racing against a possible takeOverflow in the reader.
func (b *profBuf) incrementOverflow(now int64) {
	for {
		overflow := b.overflow.Load()

// Once we see b.overflow reach 0, it's stable: no one else is changing it underfoot.
		// We need to set overflowTime if we're incrementing b.overflow from 0.
		if uint32(overflow) == 0 {
			// Store overflowTime first so it's always available when overflow != 0.
			b.overflowTime.Store(uint64(now))
			b.overflow.Store((((overflow >> 32) + 1) << 32) + 1)
			break
		}
		// Otherwise we're racing to increment against reader
		// who wants to set b.overflow to 0.
		// Out of paranoia, leave 2³²-1 a sticky overflow value,
		// to avoid wrapping around. Extremely unlikely.
		if int32(overflow) == -1 {
			break
		}
		if b.overflow.CompareAndSwap(overflow, overflow+1) {
			break
		}
	}
}

// newProfBuf returns a new profiling buffer with room for
// a header of hdrsize words and a buffer of at least bufwords words.
func newProfBuf(hdrsize, bufwords, tags int) *profBuf {
	if min := 2 + hdrsize + 1; bufwords < min {
		bufwords = min
	}

// Buffer sizes must be power of two, so that we don't have to
	// worry about uint32 wraparound changing the effective position
	// within the buffers. We store 30 bits of count; limiting to 28
	// gives us some room for intermediate calculations.
	if bufwords >= 1<<28 || tags >= 1<<28 {
		throw("newProfBuf: buffer too large")
	}
	var i int
	for i = 1; i < bufwords; i <<= 1 {
	}
	bufwords = i
	for i = 1; i < tags; i <<= 1 {
	}
	tags = i

b := new(profBuf)
	b.hdrsize = uintptr(hdrsize)
	b.data = make([]uint64, bufwords)
	b.tags = make([]unsafe.Pointer, tags)
	b.overflowBuf = make([]uint64, 2+b.hdrsize+1)
	return b
}

// canWriteRecord reports whether the buffer has room
// for a single contiguous record with a stack of length nstk.
func (b *profBuf) canWriteRecord(nstk int) bool {
	br := b.r.load()
	bw := b.w.load()

// room for tag?
	if countSub(br.tagCount(), bw.tagCount())+len(b.tags) < 1 {
		return false
	}

// room for data?
	nd := countSub(br.dataCount(), bw.dataCount()) + len(b.data)
	want := 2 + int(b.hdrsize) + nstk
	i := int(bw.dataCount() % uint32(len(b.data)))
	if i+want > len(b.data) {
		// Can't fit in trailing fragment of slice.
		// Skip over that and start over at beginning of slice.
		nd -= len(b.data) - i
	}
	return nd >= want
}

// canWriteTwoRecords reports whether the buffer has room
// for two records with stack lengths nstk1, nstk2, in that order.
// Each record must be contiguous on its own, but the two
// records need not be contiguous (one can be at the end of the buffer
// and the other can wrap around and start at the beginning of the buffer).
func (b *profBuf) canWriteTwoRecords(nstk1, nstk2 int) bool {
	br := b.r.load()
	bw := b.w.load()

// room for tag?
	if countSub(br.tagCount(), bw.tagCount())+len(b.tags) < 2 {
		return false
	}

// room for data?
	nd := countSub(br.dataCount(), bw.dataCount()) + len(b.data)

// first record
	want := 2 + int(b.hdrsize) + nstk1
	i := int(bw.dataCount() % uint32(len(b.data)))
	if i+want > len(b.data) {
		// Can't fit in trailing fragment of slice.
		// Skip over that and start over at beginning of slice.
		nd -= len(b.data) - i
		i = 0
	}
	i += want
	nd -= want

// second record
	want = 2 + int(b.hdrsize) + nstk2
	if i+want > len(b.data) {
		// Can't fit in trailing fragment of slice.
		// Skip over that and start over at beginning of slice.
		nd -= len(b.data) - i
		i = 0
	}
	return nd >= want
}

// write writes an entry to the profiling buffer b.
// The entry begins with a fixed hdr, which must have
// length b.hdrsize, followed by a variable-sized stack
// and a single tag pointer *tagPtr (or nil if tagPtr is nil).
// No write barriers allowed because this might be called from a signal handler.
func (b *profBuf) write(tagPtr *unsafe.Pointer, now int64, hdr []uint64, stk []uintptr) {
	if b == nil {
		return
	}
	if len(hdr) > int(b.hdrsize) {
		throw("misuse of profBuf.write")
	}

if hasOverflow := b.hasOverflow(); hasOverflow && b.canWriteTwoRecords(1, len(stk)) {
		// Room for both an overflow record and the one being written.
		// Write the overflow record if the reader hasn't gotten to it yet.
		// Only racing against reader, not other writers.
		count, time := b.takeOverflow()
		if count > 0 {
			var stk [1]uintptr
			stk[0] = uintptr(count)
			b.write(nil, int64(time), nil, stk[:])
		}
	} else if hasOverflow || !b.canWriteRecord(len(stk)) {
		// Pending overflow without room to write overflow and new records
		// or no overflow but also no room for new record.
		b.incrementOverflow(now)
		b.wakeupExtra()
		return
	}

// There's room: write the record.
	br := b.r.load()
	bw := b.w.load()

// Profiling tag
	//
	// The tag is a pointer, but we can't run a write barrier here.
	// We have interrupted the OS-level execution of gp, but the
	// runtime still sees gp as executing. In effect, we are running
	// in place of the real gp. Since gp is the only goroutine that
	// can overwrite gp.labels, the value of gp.labels is stable during
	// this signal handler: it will still be reachable from gp when
	// we finish executing. If a GC is in progress right now, it must
	// keep gp.labels alive, because gp.labels is reachable from gp.
	// If gp were to overwrite gp.labels, the deletion barrier would
	// still shade that pointer, which would preserve it for the
	// in-progress GC, so all is well. Any future GC will see the
	// value we copied when scanning b.tags (heap-allocated).
	// We arrange that the store here is always overwriting a nil,
	// so there is no need for a deletion barrier on b.tags[wt].
	wt := int(bw.tagCount() % uint32(len(b.tags)))
	if tagPtr != nil {
		*(*uintptr)(unsafe.Pointer(&b.tags[wt])) = uintptr(*tagPtr)
	}

// Main record.
	// It has to fit in a contiguous section of the slice, so if it doesn't fit at the end,
	// leave a rewind marker (0) and start over at the beginning of the slice.
	wd := int(bw.dataCount() % uint32(len(b.data)))
	nd := countSub(br.dataCount(), bw.dataCount()) + len(b.data)
	skip := 0
	if wd+2+int(b.hdrsize)+len(stk) > len(b.data) {
		b.data[wd] = 0
		skip = len(b.data) - wd
		nd -= skip
		wd = 0
	}
	data := b.data[wd:]
	data[0] = uint64(2 + b.hdrsize + uintptr(len(stk))) // length
	data[1] = uint64(now)                               // time stamp
	// header, zero-padded
	i := uintptr(copy(data[2:2+b.hdrsize], hdr))
	for ; i < b.hdrsize; i++ {
		data[2+i] = 0
	}
	for i, pc := range stk {
		data[2+b.hdrsize+uintptr(i)] = uint64(pc)
	}

for {
		// Commit write.
		// Racing with reader setting flag bits in b.w, to avoid lost wakeups.
		old := b.w.load()
		new := old.addCountsAndClearFlags(skip+2+len(stk)+int(b.hdrsize), 1)
		if !b.w.cas(old, new) {
			continue
		}
		// If there was a reader, wake it up.
		if old&profReaderSleeping != 0 {
			notewakeup(&b.wait)
		}
		break
	}
}

// close signals that there will be no more writes on the buffer.
// Once all the data has been read from the buffer, reads will return eof=true.
func (b *profBuf) close() {
	if b.eof.Load() > 0 {
		throw("runtime: profBuf already closed")
	}
	b.eof.Store(1)
	b.wakeupExtra()
}

// wakeupExtra must be called after setting one of the "extra"
// atomic fields b.overflow or b.eof.
// It records the change in b.w and wakes up the reader if needed.
func (b *profBuf) wakeupExtra() {
	for {
		old := b.w.load()
		new := old | profWriteExtra
		if !b.w.cas(old, new) {
			continue
		}
		if old&profReaderSleeping != 0 {
			notewakeup(&b.wait)
		}
		break
	}
}

// profBufReadMode specifies whether to block when no data is available to read.
type profBufReadMode int

const (
	profBufBlocking profBufReadMode = iota
	profBufNonBlocking
)

var overflowTag [1]unsafe.Pointer // always nil

func (b *profBuf) read(mode profBufReadMode) (data []uint64, tags []unsafe.Pointer, eof bool) {
	if b == nil {
		return nil, nil, true
	}

br := b.rNext

// Commit previous read, returning that part of the ring to the writer.
	// First clear tags that have now been read, both to avoid holding
	// up the memory they point at for longer than necessary
	// and so that b.write can assume it is always overwriting
	// nil tag entries (see comment in b.write).
	rPrev := b.r.load()
	if rPrev != br {
		ntag := countSub(br.tagCount(), rPrev.tagCount())
		ti := int(rPrev.tagCount() % uint32(len(b.tags)))
		for i := 0; i < ntag; i++ {
			b.tags[ti] = nil
			if ti++; ti == len(b.tags) {
				ti = 0
			}
		}
		b.r.store(br)
	}

Read:
	bw := b.w.load()
	numData := countSub(bw.dataCount(), br.dataCount())
	if numData == 0 {
		if b.hasOverflow() {
			// No data to read, but there is overflow to report.
			// Racing with writer flushing b.overflow into a real record.
			count, time := b.takeOverflow()
			if count == 0 {
				// Lost the race, go around again.
				goto Read
			}
			// Won the race, report overflow.
			dst := b.overflowBuf
			dst[0] = uint64(2 + b.hdrsize + 1)
			dst[1] = time
			for i := uintptr(0); i < b.hdrsize; i++ {
				dst[2+i] = 0
			}
			dst[2+b.hdrsize] = uint64(count)
			return dst[:2+b.hdrsize+1], overflowTag[:1], false
		}
		if b.eof.Load() > 0 {
			// No data, no overflow, EOF set: done.
			return nil, nil, true
		}
		if bw&profWriteExtra != 0 {
			// Writer claims to have published extra information (overflow or eof).
			// Attempt to clear notification and then check again.
			// If we fail to clear the notification it means b.w changed,
			// so we still need to check again.
			b.w.cas(bw, bw&^profWriteExtra)
			goto Read
		}

// Nothing to read right now.
		// Return or sleep according to mode.
		if mode == profBufNonBlocking {
			// Necessary on Darwin, notetsleepg below does not work in signal handler, root cause of #61768.
			return nil, nil, false
		}
		if !b.w.cas(bw, bw|profReaderSleeping) {
			goto Read
		}
		// Committed to sleeping.
		notetsleepg(&b.wait, -1)
		noteclear(&b.wait)
		goto Read
	}
	data = b.data[br.dataCount()%uint32(len(b.data)):]
	if len(data) > numData {
		data = data[:numData]
	} else {
		numData -= len(data) // available in case of wraparound
	}
	skip := 0
	if data[0] == 0 {
		// Wraparound record. Go back to the beginning of the ring.
		skip = len(data)
		data = b.data
		if len(data) > numData {
			data = data[:numData]
		}
	}

ntag := countSub(bw.tagCount(), br.tagCount())
	if ntag == 0 {
		throw("runtime: malformed profBuf buffer - tag and data out of sync")
	}
	tags = b.tags[br.tagCount()%uint32(len(b.tags)):]
	if len(tags) > ntag {
		tags = tags[:ntag]
	}

// Count out whole data records until either data or tags is done.
	// They are always in sync in the buffer, but due to an end-of-slice
	// wraparound we might need to stop early and return the rest
	// in the next call.
	di := 0
	ti := 0
	for di < len(data) && data[di] != 0 && ti < len(tags) {
		if uintptr(di)+uintptr(data[di]) > uintptr(len(data)) {
			throw("runtime: malformed profBuf buffer - invalid size")
		}
		di += int(data[di])
		ti++
	}

// Remember how much we returned, to commit read on next call.
	b.rNext = br.addCountsAndClearFlags(skip+di, ti)

if raceenabled {
		// Match racereleasemerge in runtime_setProfLabel,
		// so that the setting of the labels in runtime_setProfLabel
		// is treated as happening before any use of the labels
		// by our caller. The synchronization on labelSync itself is a fiction
		// for the race detector. The actual synchronization is handled
		// by the fact that the signal handler only reads from the current
		// goroutine and uses atomics to write the updated queue indices,
		// and then the read-out from the signal handler buffer uses
		// atomics to read those queue indices.
		raceacquire(unsafe.Pointer(&labelSync))
	}

return data[:di], tags[:ti], false
}

X7ROOT File Manager

Editing: profbuf.go

Upload File

Create Folder