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

// Copyright 2009 The Go Authors. All rights reserved.
// Use of this source code is governed by a BSD-style
// license that can be found in the LICENSE file.

package runtime

import (
	"internal/goarch"
	"runtime/internal/atomic"
	"runtime/internal/sys"
	"unsafe"
)

// addb returns the byte pointer p+n.
//
//go:nowritebarrier
//go:nosplit
func addb(p *byte, n uintptr) *byte {
	// Note: wrote out full expression instead of calling add(p, n)
	// to reduce the number of temporaries generated by the
	// compiler for this trivial expression during inlining.
	return (*byte)(unsafe.Pointer(uintptr(unsafe.Pointer(p)) + n))
}

// subtractb returns the byte pointer p-n.
//
//go:nowritebarrier
//go:nosplit
func subtractb(p *byte, n uintptr) *byte {
	// Note: wrote out full expression instead of calling add(p, -n)
	// to reduce the number of temporaries generated by the
	// compiler for this trivial expression during inlining.
	return (*byte)(unsafe.Pointer(uintptr(unsafe.Pointer(p)) - n))
}

// add1 returns the byte pointer p+1.
//
//go:nowritebarrier
//go:nosplit
func add1(p *byte) *byte {
	// Note: wrote out full expression instead of calling addb(p, 1)
	// to reduce the number of temporaries generated by the
	// compiler for this trivial expression during inlining.
	return (*byte)(unsafe.Pointer(uintptr(unsafe.Pointer(p)) + 1))
}

// subtract1 returns the byte pointer p-1.
//
// nosplit because it is used during write barriers and must not be preempted.
//
//go:nowritebarrier
//go:nosplit
func subtract1(p *byte) *byte {
	// Note: wrote out full expression instead of calling subtractb(p, 1)
	// to reduce the number of temporaries generated by the
	// compiler for this trivial expression during inlining.
	return (*byte)(unsafe.Pointer(uintptr(unsafe.Pointer(p)) - 1))
}

// markBits provides access to the mark bit for an object in the heap.
// bytep points to the byte holding the mark bit.
// mask is a byte with a single bit set that can be &ed with *bytep
// to see if the bit has been set.
// *m.byte&m.mask != 0 indicates the mark bit is set.
// index can be used along with span information to generate
// the address of the object in the heap.
// We maintain one set of mark bits for allocation and one for
// marking purposes.
type markBits struct {
	bytep *uint8
	mask  uint8
	index uintptr
}

//go:nosplit
func (s *mspan) allocBitsForIndex(allocBitIndex uintptr) markBits {
	bytep, mask := s.allocBits.bitp(allocBitIndex)
	return markBits{bytep, mask, allocBitIndex}
}

// refillAllocCache takes 8 bytes s.allocBits starting at whichByte
// and negates them so that ctz (count trailing zeros) instructions
// can be used. It then places these 8 bytes into the cached 64 bit
// s.allocCache.
func (s *mspan) refillAllocCache(whichByte uint16) {
	bytes := (*[8]uint8)(unsafe.Pointer(s.allocBits.bytep(uintptr(whichByte))))
	aCache := uint64(0)
	aCache |= uint64(bytes[0])
	aCache |= uint64(bytes[1]) << (1 * 8)
	aCache |= uint64(bytes[2]) << (2 * 8)
	aCache |= uint64(bytes[3]) << (3 * 8)
	aCache |= uint64(bytes[4]) << (4 * 8)
	aCache |= uint64(bytes[5]) << (5 * 8)
	aCache |= uint64(bytes[6]) << (6 * 8)
	aCache |= uint64(bytes[7]) << (7 * 8)
	s.allocCache = ^aCache
}

// nextFreeIndex returns the index of the next free object in s at
// or after s.freeindex.
// There are hardware instructions that can be used to make this
// faster if profiling warrants it.
func (s *mspan) nextFreeIndex() uint16 {
	sfreeindex := s.freeindex
	snelems := s.nelems
	if sfreeindex == snelems {
		return sfreeindex
	}
	if sfreeindex > snelems {
		throw("s.freeindex > s.nelems")
	}

aCache := s.allocCache

bitIndex := sys.TrailingZeros64(aCache)
	for bitIndex == 64 {
		// Move index to start of next cached bits.
		sfreeindex = (sfreeindex + 64) &^ (64 - 1)
		if sfreeindex >= snelems {
			s.freeindex = snelems
			return snelems
		}
		whichByte := sfreeindex / 8
		// Refill s.allocCache with the next 64 alloc bits.
		s.refillAllocCache(whichByte)
		aCache = s.allocCache
		bitIndex = sys.TrailingZeros64(aCache)
		// nothing available in cached bits
		// grab the next 8 bytes and try again.
	}
	result := sfreeindex + uint16(bitIndex)
	if result >= snelems {
		s.freeindex = snelems
		return snelems
	}

s.allocCache >>= uint(bitIndex + 1)
	sfreeindex = result + 1

if sfreeindex%64 == 0 && sfreeindex != snelems {
		// We just incremented s.freeindex so it isn't 0.
		// As each 1 in s.allocCache was encountered and used for allocation
		// it was shifted away. At this point s.allocCache contains all 0s.
		// Refill s.allocCache so that it corresponds
		// to the bits at s.allocBits starting at s.freeindex.
		whichByte := sfreeindex / 8
		s.refillAllocCache(whichByte)
	}
	s.freeindex = sfreeindex
	return result
}

// isFree reports whether the index'th object in s is unallocated.
//
// The caller must ensure s.state is mSpanInUse, and there must have
// been no preemption points since ensuring this (which could allow a
// GC transition, which would allow the state to change).
func (s *mspan) isFree(index uintptr) bool {
	if index < uintptr(s.freeIndexForScan) {
		return false
	}
	bytep, mask := s.allocBits.bitp(index)
	return *bytep&mask == 0
}

// divideByElemSize returns n/s.elemsize.
// n must be within [0, s.npages*_PageSize),
// or may be exactly s.npages*_PageSize
// if s.elemsize is from sizeclasses.go.
//
// nosplit, because it is called by objIndex, which is nosplit
//
//go:nosplit
func (s *mspan) divideByElemSize(n uintptr) uintptr {
	const doubleCheck = false

// See explanation in mksizeclasses.go's computeDivMagic.
	q := uintptr((uint64(n) * uint64(s.divMul)) >> 32)

if doubleCheck && q != n/s.elemsize {
		println(n, "/", s.elemsize, "should be", n/s.elemsize, "but got", q)
		throw("bad magic division")
	}
	return q
}

// nosplit, because it is called by other nosplit code like findObject
//
//go:nosplit
func (s *mspan) objIndex(p uintptr) uintptr {
	return s.divideByElemSize(p - s.base())
}

func markBitsForAddr(p uintptr) markBits {
	s := spanOf(p)
	objIndex := s.objIndex(p)
	return s.markBitsForIndex(objIndex)
}

func (s *mspan) markBitsForIndex(objIndex uintptr) markBits {
	bytep, mask := s.gcmarkBits.bitp(objIndex)
	return markBits{bytep, mask, objIndex}
}

func (s *mspan) markBitsForBase() markBits {
	return markBits{&s.gcmarkBits.x, uint8(1), 0}
}

// isMarked reports whether mark bit m is set.
func (m markBits) isMarked() bool {
	return *m.bytep&m.mask != 0
}

// setMarked sets the marked bit in the markbits, atomically.
func (m markBits) setMarked() {
	// Might be racing with other updates, so use atomic update always.
	// We used to be clever here and use a non-atomic update in certain
	// cases, but it's not worth the risk.
	atomic.Or8(m.bytep, m.mask)
}

// setMarkedNonAtomic sets the marked bit in the markbits, non-atomically.
func (m markBits) setMarkedNonAtomic() {
	*m.bytep |= m.mask
}

// clearMarked clears the marked bit in the markbits, atomically.
func (m markBits) clearMarked() {
	// Might be racing with other updates, so use atomic update always.
	// We used to be clever here and use a non-atomic update in certain
	// cases, but it's not worth the risk.
	atomic.And8(m.bytep, ^m.mask)
}

// markBitsForSpan returns the markBits for the span base address base.
func markBitsForSpan(base uintptr) (mbits markBits) {
	mbits = markBitsForAddr(base)
	if mbits.mask != 1 {
		throw("markBitsForSpan: unaligned start")
	}
	return mbits
}

// advance advances the markBits to the next object in the span.
func (m *markBits) advance() {
	if m.mask == 1<<7 {
		m.bytep = (*uint8)(unsafe.Pointer(uintptr(unsafe.Pointer(m.bytep)) + 1))
		m.mask = 1
	} else {
		m.mask = m.mask << 1
	}
	m.index++
}

// clobberdeadPtr is a special value that is used by the compiler to
// clobber dead stack slots, when -clobberdead flag is set.
const clobberdeadPtr = uintptr(0xdeaddead | 0xdeaddead<<((^uintptr(0)>>63)*32))

// badPointer throws bad pointer in heap panic.
func badPointer(s *mspan, p, refBase, refOff uintptr) {
	// Typically this indicates an incorrect use
	// of unsafe or cgo to store a bad pointer in
	// the Go heap. It may also indicate a runtime
	// bug.
	//
	// TODO(austin): We could be more aggressive
	// and detect pointers to unallocated objects
	// in allocated spans.
	printlock()
	print("runtime: pointer ", hex(p))
	if s != nil {
		state := s.state.get()
		if state != mSpanInUse {
			print(" to unallocated span")
		} else {
			print(" to unused region of span")
		}
		print(" span.base()=", hex(s.base()), " span.limit=", hex(s.limit), " span.state=", state)
	}
	print("\n")
	if refBase != 0 {
		print("runtime: found in object at *(", hex(refBase), "+", hex(refOff), ")\n")
		gcDumpObject("object", refBase, refOff)
	}
	getg().m.traceback = 2
	throw("found bad pointer in Go heap (incorrect use of unsafe or cgo?)")
}

// findObject returns the base address for the heap object containing
// the address p, the object's span, and the index of the object in s.
// If p does not point into a heap object, it returns base == 0.
//
// If p points is an invalid heap pointer and debug.invalidptr != 0,
// findObject panics.
//
// refBase and refOff optionally give the base address of the object
// in which the pointer p was found and the byte offset at which it
// was found. These are used for error reporting.
//
// It is nosplit so it is safe for p to be a pointer to the current goroutine's stack.
// Since p is a uintptr, it would not be adjusted if the stack were to move.
//
//go:nosplit
func findObject(p, refBase, refOff uintptr) (base uintptr, s *mspan, objIndex uintptr) {
	s = spanOf(p)
	// If s is nil, the virtual address has never been part of the heap.
	// This pointer may be to some mmap'd region, so we allow it.
	if s == nil {
		if (GOARCH == "amd64" || GOARCH == "arm64") && p == clobberdeadPtr && debug.invalidptr != 0 {
			// Crash if clobberdeadPtr is seen. Only on AMD64 and ARM64 for now,
			// as they are the only platform where compiler's clobberdead mode is
			// implemented. On these platforms clobberdeadPtr cannot be a valid address.
			badPointer(s, p, refBase, refOff)
		}
		return
	}
	// If p is a bad pointer, it may not be in s's bounds.
	//
	// Check s.state to synchronize with span initialization
	// before checking other fields. See also spanOfHeap.
	if state := s.state.get(); state != mSpanInUse || p < s.base() || p >= s.limit {
		// Pointers into stacks are also ok, the runtime manages these explicitly.
		if state == mSpanManual {
			return
		}
		// The following ensures that we are rigorous about what data
		// structures hold valid pointers.
		if debug.invalidptr != 0 {
			badPointer(s, p, refBase, refOff)
		}
		return
	}

objIndex = s.objIndex(p)
	base = s.base() + objIndex*s.elemsize
	return
}

// reflect_verifyNotInHeapPtr reports whether converting the not-in-heap pointer into a unsafe.Pointer is ok.
//
//go:linkname reflect_verifyNotInHeapPtr reflect.verifyNotInHeapPtr
func reflect_verifyNotInHeapPtr(p uintptr) bool {
	// Conversion to a pointer is ok as long as findObject above does not call badPointer.
	// Since we're already promised that p doesn't point into the heap, just disallow heap
	// pointers and the special clobbered pointer.
	return spanOf(p) == nil && p != clobberdeadPtr
}

const ptrBits = 8 * goarch.PtrSize

// bulkBarrierBitmap executes write barriers for copying from [src,
// src+size) to [dst, dst+size) using a 1-bit pointer bitmap. src is
// assumed to start maskOffset bytes into the data covered by the
// bitmap in bits (which may not be a multiple of 8).
//
// This is used by bulkBarrierPreWrite for writes to data and BSS.
//
//go:nosplit
func bulkBarrierBitmap(dst, src, size, maskOffset uintptr, bits *uint8) {
	word := maskOffset / goarch.PtrSize
	bits = addb(bits, word/8)
	mask := uint8(1) << (word % 8)

buf := &getg().m.p.ptr().wbBuf
	for i := uintptr(0); i < size; i += goarch.PtrSize {
		if mask == 0 {
			bits = addb(bits, 1)
			if *bits == 0 {
				// Skip 8 words.
				i += 7 * goarch.PtrSize
				continue
			}
			mask = 1
		}
		if *bits&mask != 0 {
			dstx := (*uintptr)(unsafe.Pointer(dst + i))
			if src == 0 {
				p := buf.get1()
				p[0] = *dstx
			} else {
				srcx := (*uintptr)(unsafe.Pointer(src + i))
				p := buf.get2()
				p[0] = *dstx
				p[1] = *srcx
			}
		}
		mask <<= 1
	}
}

// typeBitsBulkBarrier executes a write barrier for every
// pointer that would be copied from [src, src+size) to [dst,
// dst+size) by a memmove using the type bitmap to locate those
// pointer slots.
//
// The type typ must correspond exactly to [src, src+size) and [dst, dst+size).
// dst, src, and size must be pointer-aligned.
// The type typ must have a plain bitmap, not a GC program.
// The only use of this function is in channel sends, and the
// 64 kB channel element limit takes care of this for us.
//
// Must not be preempted because it typically runs right before memmove,
// and the GC must observe them as an atomic action.
//
// Callers must perform cgo checks if goexperiment.CgoCheck2.
//
//go:nosplit
func typeBitsBulkBarrier(typ *_type, dst, src, size uintptr) {
	if typ == nil {
		throw("runtime: typeBitsBulkBarrier without type")
	}
	if typ.Size_ != size {
		println("runtime: typeBitsBulkBarrier with type ", toRType(typ).string(), " of size ", typ.Size_, " but memory size", size)
		throw("runtime: invalid typeBitsBulkBarrier")
	}
	if typ.Kind_&kindGCProg != 0 {
		println("runtime: typeBitsBulkBarrier with type ", toRType(typ).string(), " with GC prog")
		throw("runtime: invalid typeBitsBulkBarrier")
	}
	if !writeBarrier.enabled {
		return
	}
	ptrmask := typ.GCData
	buf := &getg().m.p.ptr().wbBuf
	var bits uint32
	for i := uintptr(0); i < typ.PtrBytes; i += goarch.PtrSize {
		if i&(goarch.PtrSize*8-1) == 0 {
			bits = uint32(*ptrmask)
			ptrmask = addb(ptrmask, 1)
		} else {
			bits = bits >> 1
		}
		if bits&1 != 0 {
			dstx := (*uintptr)(unsafe.Pointer(dst + i))
			srcx := (*uintptr)(unsafe.Pointer(src + i))
			p := buf.get2()
			p[0] = *dstx
			p[1] = *srcx
		}
	}
}

// countAlloc returns the number of objects allocated in span s by
// scanning the mark bitmap.
func (s *mspan) countAlloc() int {
	count := 0
	bytes := divRoundUp(uintptr(s.nelems), 8)
	// Iterate over each 8-byte chunk and count allocations
	// with an intrinsic. Note that newMarkBits guarantees that
	// gcmarkBits will be 8-byte aligned, so we don't have to
	// worry about edge cases, irrelevant bits will simply be zero.
	for i := uintptr(0); i < bytes; i += 8 {
		// Extract 64 bits from the byte pointer and get a OnesCount.
		// Note that the unsafe cast here doesn't preserve endianness,
		// but that's OK. We only care about how many bits are 1, not
		// about the order we discover them in.
		mrkBits := *(*uint64)(unsafe.Pointer(s.gcmarkBits.bytep(i)))
		count += sys.OnesCount64(mrkBits)
	}
	return count
}

// Read the bytes starting at the aligned pointer p into a uintptr.
// Read is little-endian.
func readUintptr(p *byte) uintptr {
	x := *(*uintptr)(unsafe.Pointer(p))
	if goarch.BigEndian {
		if goarch.PtrSize == 8 {
			return uintptr(sys.Bswap64(uint64(x)))
		}
		return uintptr(sys.Bswap32(uint32(x)))
	}
	return x
}

var debugPtrmask struct {
	lock mutex
	data *byte
}

// progToPointerMask returns the 1-bit pointer mask output by the GC program prog.
// size the size of the region described by prog, in bytes.
// The resulting bitvector will have no more than size/goarch.PtrSize bits.
func progToPointerMask(prog *byte, size uintptr) bitvector {
	n := (size/goarch.PtrSize + 7) / 8
	x := (*[1 << 30]byte)(persistentalloc(n+1, 1, &memstats.buckhash_sys))[:n+1]
	x[len(x)-1] = 0xa1 // overflow check sentinel
	n = runGCProg(prog, &x[0])
	if x[len(x)-1] != 0xa1 {
		throw("progToPointerMask: overflow")
	}
	return bitvector{int32(n), &x[0]}
}

// Packed GC pointer bitmaps, aka GC programs.
//
// For large types containing arrays, the type information has a
// natural repetition that can be encoded to save space in the
// binary and in the memory representation of the type information.
//
// The encoding is a simple Lempel-Ziv style bytecode machine
// with the following instructions:
//
//	00000000: stop
//	0nnnnnnn: emit n bits copied from the next (n+7)/8 bytes
//	10000000 n c: repeat the previous n bits c times; n, c are varints
//	1nnnnnnn c: repeat the previous n bits c times; c is a varint

// runGCProg returns the number of 1-bit entries written to memory.
func runGCProg(prog, dst *byte) uintptr {
	dstStart := dst

// Bits waiting to be written to memory.
	var bits uintptr
	var nbits uintptr

p := prog
Run:
	for {
		// Flush accumulated full bytes.
		// The rest of the loop assumes that nbits <= 7.
		for ; nbits >= 8; nbits -= 8 {
			*dst = uint8(bits)
			dst = add1(dst)
			bits >>= 8
		}

// Process one instruction.
		inst := uintptr(*p)
		p = add1(p)
		n := inst & 0x7F
		if inst&0x80 == 0 {
			// Literal bits; n == 0 means end of program.
			if n == 0 {
				// Program is over.
				break Run
			}
			nbyte := n / 8
			for i := uintptr(0); i < nbyte; i++ {
				bits |= uintptr(*p) << nbits
				p = add1(p)
				*dst = uint8(bits)
				dst = add1(dst)
				bits >>= 8
			}
			if n %= 8; n > 0 {
				bits |= uintptr(*p) << nbits
				p = add1(p)
				nbits += n
			}
			continue Run
		}

// Repeat. If n == 0, it is encoded in a varint in the next bytes.
		if n == 0 {
			for off := uint(0); ; off += 7 {
				x := uintptr(*p)
				p = add1(p)
				n |= (x & 0x7F) << off
				if x&0x80 == 0 {
					break
				}
			}
		}

// Count is encoded in a varint in the next bytes.
		c := uintptr(0)
		for off := uint(0); ; off += 7 {
			x := uintptr(*p)
			p = add1(p)
			c |= (x & 0x7F) << off
			if x&0x80 == 0 {
				break
			}
		}
		c *= n // now total number of bits to copy

// If the number of bits being repeated is small, load them
		// into a register and use that register for the entire loop
		// instead of repeatedly reading from memory.
		// Handling fewer than 8 bits here makes the general loop simpler.
		// The cutoff is goarch.PtrSize*8 - 7 to guarantee that when we add
		// the pattern to a bit buffer holding at most 7 bits (a partial byte)
		// it will not overflow.
		src := dst
		const maxBits = goarch.PtrSize*8 - 7
		if n <= maxBits {
			// Start with bits in output buffer.
			pattern := bits
			npattern := nbits

// If we need more bits, fetch them from memory.
			src = subtract1(src)
			for npattern < n {
				pattern <<= 8
				pattern |= uintptr(*src)
				src = subtract1(src)
				npattern += 8
			}

// We started with the whole bit output buffer,
			// and then we loaded bits from whole bytes.
			// Either way, we might now have too many instead of too few.
			// Discard the extra.
			if npattern > n {
				pattern >>= npattern - n
				npattern = n
			}

// Replicate pattern to at most maxBits.
			if npattern == 1 {
				// One bit being repeated.
				// If the bit is 1, make the pattern all 1s.
				// If the bit is 0, the pattern is already all 0s,
				// but we can claim that the number of bits
				// in the word is equal to the number we need (c),
				// because right shift of bits will zero fill.
				if pattern == 1 {
					pattern = 1<<maxBits - 1
					npattern = maxBits
				} else {
					npattern = c
				}
			} else {
				b := pattern
				nb := npattern
				if nb+nb <= maxBits {
					// Double pattern until the whole uintptr is filled.
					for nb <= goarch.PtrSize*8 {
						b |= b << nb
						nb += nb
					}
					// Trim away incomplete copy of original pattern in high bits.
					// TODO(rsc): Replace with table lookup or loop on systems without divide?
					nb = maxBits / npattern * npattern
					b &= 1<<nb - 1
					pattern = b
					npattern = nb
				}
			}

// Add pattern to bit buffer and flush bit buffer, c/npattern times.
			// Since pattern contains >8 bits, there will be full bytes to flush
			// on each iteration.
			for ; c >= npattern; c -= npattern {
				bits |= pattern << nbits
				nbits += npattern
				for nbits >= 8 {
					*dst = uint8(bits)
					dst = add1(dst)
					bits >>= 8
					nbits -= 8
				}
			}

// Add final fragment to bit buffer.
			if c > 0 {
				pattern &= 1<<c - 1
				bits |= pattern << nbits
				nbits += c
			}
			continue Run
		}

// Repeat; n too large to fit in a register.
		// Since nbits <= 7, we know the first few bytes of repeated data
		// are already written to memory.
		off := n - nbits // n > nbits because n > maxBits and nbits <= 7
		// Leading src fragment.
		src = subtractb(src, (off+7)/8)
		if frag := off & 7; frag != 0 {
			bits |= uintptr(*src) >> (8 - frag) << nbits
			src = add1(src)
			nbits += frag
			c -= frag
		}
		// Main loop: load one byte, write another.
		// The bits are rotating through the bit buffer.
		for i := c / 8; i > 0; i-- {
			bits |= uintptr(*src) << nbits
			src = add1(src)
			*dst = uint8(bits)
			dst = add1(dst)
			bits >>= 8
		}
		// Final src fragment.
		if c %= 8; c > 0 {
			bits |= (uintptr(*src) & (1<<c - 1)) << nbits
			nbits += c
		}
	}

// Write any final bits out, using full-byte writes, even for the final byte.
	totalBits := (uintptr(unsafe.Pointer(dst))-uintptr(unsafe.Pointer(dstStart)))*8 + nbits
	nbits += -nbits & 7
	for ; nbits > 0; nbits -= 8 {
		*dst = uint8(bits)
		dst = add1(dst)
		bits >>= 8
	}
	return totalBits
}

// materializeGCProg allocates space for the (1-bit) pointer bitmask
// for an object of size ptrdata.  Then it fills that space with the
// pointer bitmask specified by the program prog.
// The bitmask starts at s.startAddr.
// The result must be deallocated with dematerializeGCProg.
func materializeGCProg(ptrdata uintptr, prog *byte) *mspan {
	// Each word of ptrdata needs one bit in the bitmap.
	bitmapBytes := divRoundUp(ptrdata, 8*goarch.PtrSize)
	// Compute the number of pages needed for bitmapBytes.
	pages := divRoundUp(bitmapBytes, pageSize)
	s := mheap_.allocManual(pages, spanAllocPtrScalarBits)
	runGCProg(addb(prog, 4), (*byte)(unsafe.Pointer(s.startAddr)))
	return s
}
func dematerializeGCProg(s *mspan) {
	mheap_.freeManual(s, spanAllocPtrScalarBits)
}

func dumpGCProg(p *byte) {
	nptr := 0
	for {
		x := *p
		p = add1(p)
		if x == 0 {
			print("\t", nptr, " end\n")
			break
		}
		if x&0x80 == 0 {
			print("\t", nptr, " lit ", x, ":")
			n := int(x+7) / 8
			for i := 0; i < n; i++ {
				print(" ", hex(*p))
				p = add1(p)
			}
			print("\n")
			nptr += int(x)
		} else {
			nbit := int(x &^ 0x80)
			if nbit == 0 {
				for nb := uint(0); ; nb += 7 {
					x := *p
					p = add1(p)
					nbit |= int(x&0x7f) << nb
					if x&0x80 == 0 {
						break
					}
				}
			}
			count := 0
			for nb := uint(0); ; nb += 7 {
				x := *p
				p = add1(p)
				count |= int(x&0x7f) << nb
				if x&0x80 == 0 {
					break
				}
			}
			print("\t", nptr, " repeat ", nbit, " × ", count, "\n")
			nptr += nbit * count
		}
	}
}

// Testing.

// reflect_gcbits returns the GC type info for x, for testing.
// The result is the bitmap entries (0 or 1), one entry per byte.
//
//go:linkname reflect_gcbits reflect.gcbits
func reflect_gcbits(x any) []byte {
	return getgcmask(x)
}

X7ROOT File Manager

Editing: mbitmap.go

Upload File

Create Folder