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

// Copyright 2014 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

// This file contains the implementation of Go's map type.
//
// A map is just a hash table. The data is arranged
// into an array of buckets. Each bucket contains up to
// 8 key/elem pairs. The low-order bits of the hash are
// used to select a bucket. Each bucket contains a few
// high-order bits of each hash to distinguish the entries
// within a single bucket.
//
// If more than 8 keys hash to a bucket, we chain on
// extra buckets.
//
// When the hashtable grows, we allocate a new array
// of buckets twice as big. Buckets are incrementally
// copied from the old bucket array to the new bucket array.
//
// Map iterators walk through the array of buckets and
// return the keys in walk order (bucket #, then overflow
// chain order, then bucket index).  To maintain iteration
// semantics, we never move keys within their bucket (if
// we did, keys might be returned 0 or 2 times).  When
// growing the table, iterators remain iterating through the
// old table and must check the new table if the bucket
// they are iterating through has been moved ("evacuated")
// to the new table.

// Picking loadFactor: too large and we have lots of overflow
// buckets, too small and we waste a lot of space. I wrote
// a simple program to check some stats for different loads:
// (64-bit, 8 byte keys and elems)
//  loadFactor    %overflow  bytes/entry     hitprobe    missprobe
//        4.00         2.13        20.77         3.00         4.00
//        4.50         4.05        17.30         3.25         4.50
//        5.00         6.85        14.77         3.50         5.00
//        5.50        10.55        12.94         3.75         5.50
//        6.00        15.27        11.67         4.00         6.00
//        6.50        20.90        10.79         4.25         6.50
//        7.00        27.14        10.15         4.50         7.00
//        7.50        34.03         9.73         4.75         7.50
//        8.00        41.10         9.40         5.00         8.00
//
// %overflow   = percentage of buckets which have an overflow bucket
// bytes/entry = overhead bytes used per key/elem pair
// hitprobe    = # of entries to check when looking up a present key
// missprobe   = # of entries to check when looking up an absent key
//
// Keep in mind this data is for maximally loaded tables, i.e. just
// before the table grows. Typical tables will be somewhat less loaded.

import (
	"internal/abi"
	"internal/goarch"
	"runtime/internal/atomic"
	"runtime/internal/math"
	"unsafe"
)

const (
	// Maximum number of key/elem pairs a bucket can hold.
	bucketCntBits = abi.MapBucketCountBits
	bucketCnt     = abi.MapBucketCount

// Maximum average load of a bucket that triggers growth is bucketCnt*13/16 (about 80% full)
	// Because of minimum alignment rules, bucketCnt is known to be at least 8.
	// Represent as loadFactorNum/loadFactorDen, to allow integer math.
	loadFactorDen = 2
	loadFactorNum = loadFactorDen * bucketCnt * 13 / 16

// Maximum key or elem size to keep inline (instead of mallocing per element).
	// Must fit in a uint8.
	// Fast versions cannot handle big elems - the cutoff size for
	// fast versions in cmd/compile/internal/gc/walk.go must be at most this elem.
	maxKeySize  = abi.MapMaxKeyBytes
	maxElemSize = abi.MapMaxElemBytes

// data offset should be the size of the bmap struct, but needs to be
	// aligned correctly. For amd64p32 this means 64-bit alignment
	// even though pointers are 32 bit.
	dataOffset = unsafe.Offsetof(struct {
		b bmap
		v int64
	}{}.v)

// Possible tophash values. We reserve a few possibilities for special marks.
	// Each bucket (including its overflow buckets, if any) will have either all or none of its
	// entries in the evacuated* states (except during the evacuate() method, which only happens
	// during map writes and thus no one else can observe the map during that time).
	emptyRest      = 0 // this cell is empty, and there are no more non-empty cells at higher indexes or overflows.
	emptyOne       = 1 // this cell is empty
	evacuatedX     = 2 // key/elem is valid.  Entry has been evacuated to first half of larger table.
	evacuatedY     = 3 // same as above, but evacuated to second half of larger table.
	evacuatedEmpty = 4 // cell is empty, bucket is evacuated.
	minTopHash     = 5 // minimum tophash for a normal filled cell.

// flags
	iterator     = 1 // there may be an iterator using buckets
	oldIterator  = 2 // there may be an iterator using oldbuckets
	hashWriting  = 4 // a goroutine is writing to the map
	sameSizeGrow = 8 // the current map growth is to a new map of the same size

// sentinel bucket ID for iterator checks
	noCheck = 1<<(8*goarch.PtrSize) - 1
)

// isEmpty reports whether the given tophash array entry represents an empty bucket entry.
func isEmpty(x uint8) bool {
	return x <= emptyOne
}

// A header for a Go map.
type hmap struct {
	// Note: the format of the hmap is also encoded in cmd/compile/internal/reflectdata/reflect.go.
	// Make sure this stays in sync with the compiler's definition.
	count     int // # live cells == size of map.  Must be first (used by len() builtin)
	flags     uint8
	B         uint8  // log_2 of # of buckets (can hold up to loadFactor * 2^B items)
	noverflow uint16 // approximate number of overflow buckets; see incrnoverflow for details
	hash0     uint32 // hash seed

buckets    unsafe.Pointer // array of 2^B Buckets. may be nil if count==0.
	oldbuckets unsafe.Pointer // previous bucket array of half the size, non-nil only when growing
	nevacuate  uintptr        // progress counter for evacuation (buckets less than this have been evacuated)

extra *mapextra // optional fields
}

// mapextra holds fields that are not present on all maps.
type mapextra struct {
	// If both key and elem do not contain pointers and are inline, then we mark bucket
	// type as containing no pointers. This avoids scanning such maps.
	// However, bmap.overflow is a pointer. In order to keep overflow buckets
	// alive, we store pointers to all overflow buckets in hmap.extra.overflow and hmap.extra.oldoverflow.
	// overflow and oldoverflow are only used if key and elem do not contain pointers.
	// overflow contains overflow buckets for hmap.buckets.
	// oldoverflow contains overflow buckets for hmap.oldbuckets.
	// The indirection allows to store a pointer to the slice in hiter.
	overflow    *[]*bmap
	oldoverflow *[]*bmap

// nextOverflow holds a pointer to a free overflow bucket.
	nextOverflow *bmap
}

// A bucket for a Go map.
type bmap struct {
	// tophash generally contains the top byte of the hash value
	// for each key in this bucket. If tophash[0] < minTopHash,
	// tophash[0] is a bucket evacuation state instead.
	tophash [bucketCnt]uint8
	// Followed by bucketCnt keys and then bucketCnt elems.
	// NOTE: packing all the keys together and then all the elems together makes the
	// code a bit more complicated than alternating key/elem/key/elem/... but it allows
	// us to eliminate padding which would be needed for, e.g., map[int64]int8.
	// Followed by an overflow pointer.
}

// A hash iteration structure.
// If you modify hiter, also change cmd/compile/internal/reflectdata/reflect.go
// and reflect/value.go to match the layout of this structure.
type hiter struct {
	key         unsafe.Pointer // Must be in first position.  Write nil to indicate iteration end (see cmd/compile/internal/walk/range.go).
	elem        unsafe.Pointer // Must be in second position (see cmd/compile/internal/walk/range.go).
	t           *maptype
	h           *hmap
	buckets     unsafe.Pointer // bucket ptr at hash_iter initialization time
	bptr        *bmap          // current bucket
	overflow    *[]*bmap       // keeps overflow buckets of hmap.buckets alive
	oldoverflow *[]*bmap       // keeps overflow buckets of hmap.oldbuckets alive
	startBucket uintptr        // bucket iteration started at
	offset      uint8          // intra-bucket offset to start from during iteration (should be big enough to hold bucketCnt-1)
	wrapped     bool           // already wrapped around from end of bucket array to beginning
	B           uint8
	i           uint8
	bucket      uintptr
	checkBucket uintptr
}

// bucketShift returns 1<<b, optimized for code generation.
func bucketShift(b uint8) uintptr {
	// Masking the shift amount allows overflow checks to be elided.
	return uintptr(1) << (b & (goarch.PtrSize*8 - 1))
}

// bucketMask returns 1<<b - 1, optimized for code generation.
func bucketMask(b uint8) uintptr {
	return bucketShift(b) - 1
}

// tophash calculates the tophash value for hash.
func tophash(hash uintptr) uint8 {
	top := uint8(hash >> (goarch.PtrSize*8 - 8))
	if top < minTopHash {
		top += minTopHash
	}
	return top
}

func evacuated(b *bmap) bool {
	h := b.tophash[0]
	return h > emptyOne && h < minTopHash
}

func (b *bmap) overflow(t *maptype) *bmap {
	return *(**bmap)(add(unsafe.Pointer(b), uintptr(t.BucketSize)-goarch.PtrSize))
}

func (b *bmap) setoverflow(t *maptype, ovf *bmap) {
	*(**bmap)(add(unsafe.Pointer(b), uintptr(t.BucketSize)-goarch.PtrSize)) = ovf
}

func (b *bmap) keys() unsafe.Pointer {
	return add(unsafe.Pointer(b), dataOffset)
}

// incrnoverflow increments h.noverflow.
// noverflow counts the number of overflow buckets.
// This is used to trigger same-size map growth.
// See also tooManyOverflowBuckets.
// To keep hmap small, noverflow is a uint16.
// When there are few buckets, noverflow is an exact count.
// When there are many buckets, noverflow is an approximate count.
func (h *hmap) incrnoverflow() {
	// We trigger same-size map growth if there are
	// as many overflow buckets as buckets.
	// We need to be able to count to 1<<h.B.
	if h.B < 16 {
		h.noverflow++
		return
	}
	// Increment with probability 1/(1<<(h.B-15)).
	// When we reach 1<<15 - 1, we will have approximately
	// as many overflow buckets as buckets.
	mask := uint32(1)<<(h.B-15) - 1
	// Example: if h.B == 18, then mask == 7,
	// and rand() & 7 == 0 with probability 1/8.
	if uint32(rand())&mask == 0 {
		h.noverflow++
	}
}

func (h *hmap) newoverflow(t *maptype, b *bmap) *bmap {
	var ovf *bmap
	if h.extra != nil && h.extra.nextOverflow != nil {
		// We have preallocated overflow buckets available.
		// See makeBucketArray for more details.
		ovf = h.extra.nextOverflow
		if ovf.overflow(t) == nil {
			// We're not at the end of the preallocated overflow buckets. Bump the pointer.
			h.extra.nextOverflow = (*bmap)(add(unsafe.Pointer(ovf), uintptr(t.BucketSize)))
		} else {
			// This is the last preallocated overflow bucket.
			// Reset the overflow pointer on this bucket,
			// which was set to a non-nil sentinel value.
			ovf.setoverflow(t, nil)
			h.extra.nextOverflow = nil
		}
	} else {
		ovf = (*bmap)(newobject(t.Bucket))
	}
	h.incrnoverflow()
	if t.Bucket.PtrBytes == 0 {
		h.createOverflow()
		*h.extra.overflow = append(*h.extra.overflow, ovf)
	}
	b.setoverflow(t, ovf)
	return ovf
}

func (h *hmap) createOverflow() {
	if h.extra == nil {
		h.extra = new(mapextra)
	}
	if h.extra.overflow == nil {
		h.extra.overflow = new([]*bmap)
	}
}

func makemap64(t *maptype, hint int64, h *hmap) *hmap {
	if int64(int(hint)) != hint {
		hint = 0
	}
	return makemap(t, int(hint), h)
}

// makemap_small implements Go map creation for make(map[k]v) and
// make(map[k]v, hint) when hint is known to be at most bucketCnt
// at compile time and the map needs to be allocated on the heap.
func makemap_small() *hmap {
	h := new(hmap)
	h.hash0 = uint32(rand())
	return h
}

// makemap implements Go map creation for make(map[k]v, hint).
// If the compiler has determined that the map or the first bucket
// can be created on the stack, h and/or bucket may be non-nil.
// If h != nil, the map can be created directly in h.
// If h.buckets != nil, bucket pointed to can be used as the first bucket.
func makemap(t *maptype, hint int, h *hmap) *hmap {
	mem, overflow := math.MulUintptr(uintptr(hint), t.Bucket.Size_)
	if overflow || mem > maxAlloc {
		hint = 0
	}

// initialize Hmap
	if h == nil {
		h = new(hmap)
	}
	h.hash0 = uint32(rand())

// Find the size parameter B which will hold the requested # of elements.
	// For hint < 0 overLoadFactor returns false since hint < bucketCnt.
	B := uint8(0)
	for overLoadFactor(hint, B) {
		B++
	}
	h.B = B

// allocate initial hash table
	// if B == 0, the buckets field is allocated lazily later (in mapassign)
	// If hint is large zeroing this memory could take a while.
	if h.B != 0 {
		var nextOverflow *bmap
		h.buckets, nextOverflow = makeBucketArray(t, h.B, nil)
		if nextOverflow != nil {
			h.extra = new(mapextra)
			h.extra.nextOverflow = nextOverflow
		}
	}

return h
}

// makeBucketArray initializes a backing array for map buckets.
// 1<<b is the minimum number of buckets to allocate.
// dirtyalloc should either be nil or a bucket array previously
// allocated by makeBucketArray with the same t and b parameters.
// If dirtyalloc is nil a new backing array will be alloced and
// otherwise dirtyalloc will be cleared and reused as backing array.
func makeBucketArray(t *maptype, b uint8, dirtyalloc unsafe.Pointer) (buckets unsafe.Pointer, nextOverflow *bmap) {
	base := bucketShift(b)
	nbuckets := base
	// For small b, overflow buckets are unlikely.
	// Avoid the overhead of the calculation.
	if b >= 4 {
		// Add on the estimated number of overflow buckets
		// required to insert the median number of elements
		// used with this value of b.
		nbuckets += bucketShift(b - 4)
		sz := t.Bucket.Size_ * nbuckets
		up := roundupsize(sz, t.Bucket.PtrBytes == 0)
		if up != sz {
			nbuckets = up / t.Bucket.Size_
		}
	}

if dirtyalloc == nil {
		buckets = newarray(t.Bucket, int(nbuckets))
	} else {
		// dirtyalloc was previously generated by
		// the above newarray(t.Bucket, int(nbuckets))
		// but may not be empty.
		buckets = dirtyalloc
		size := t.Bucket.Size_ * nbuckets
		if t.Bucket.PtrBytes != 0 {
			memclrHasPointers(buckets, size)
		} else {
			memclrNoHeapPointers(buckets, size)
		}
	}

if base != nbuckets {
		// We preallocated some overflow buckets.
		// To keep the overhead of tracking these overflow buckets to a minimum,
		// we use the convention that if a preallocated overflow bucket's overflow
		// pointer is nil, then there are more available by bumping the pointer.
		// We need a safe non-nil pointer for the last overflow bucket; just use buckets.
		nextOverflow = (*bmap)(add(buckets, base*uintptr(t.BucketSize)))
		last := (*bmap)(add(buckets, (nbuckets-1)*uintptr(t.BucketSize)))
		last.setoverflow(t, (*bmap)(buckets))
	}
	return buckets, nextOverflow
}

// mapaccess1 returns a pointer to h[key].  Never returns nil, instead
// it will return a reference to the zero object for the elem type if
// the key is not in the map.
// NOTE: The returned pointer may keep the whole map live, so don't
// hold onto it for very long.
func mapaccess1(t *maptype, h *hmap, key unsafe.Pointer) unsafe.Pointer {
	if raceenabled && h != nil {
		callerpc := getcallerpc()
		pc := abi.FuncPCABIInternal(mapaccess1)
		racereadpc(unsafe.Pointer(h), callerpc, pc)
		raceReadObjectPC(t.Key, key, callerpc, pc)
	}
	if msanenabled && h != nil {
		msanread(key, t.Key.Size_)
	}
	if asanenabled && h != nil {
		asanread(key, t.Key.Size_)
	}
	if h == nil || h.count == 0 {
		if err := mapKeyError(t, key); err != nil {
			panic(err) // see issue 23734
		}
		return unsafe.Pointer(&zeroVal[0])
	}
	if h.flags&hashWriting != 0 {
		fatal("concurrent map read and map write")
	}
	hash := t.Hasher(key, uintptr(h.hash0))
	m := bucketMask(h.B)
	b := (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize)))
	if c := h.oldbuckets; c != nil {
		if !h.sameSizeGrow() {
			// There used to be half as many buckets; mask down one more power of two.
			m >>= 1
		}
		oldb := (*bmap)(add(c, (hash&m)*uintptr(t.BucketSize)))
		if !evacuated(oldb) {
			b = oldb
		}
	}
	top := tophash(hash)
bucketloop:
	for ; b != nil; b = b.overflow(t) {
		for i := uintptr(0); i < bucketCnt; i++ {
			if b.tophash[i] != top {
				if b.tophash[i] == emptyRest {
					break bucketloop
				}
				continue
			}
			k := add(unsafe.Pointer(b), dataOffset+i*uintptr(t.KeySize))
			if t.IndirectKey() {
				k = *((*unsafe.Pointer)(k))
			}
			if t.Key.Equal(key, k) {
				e := add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
				if t.IndirectElem() {
					e = *((*unsafe.Pointer)(e))
				}
				return e
			}
		}
	}
	return unsafe.Pointer(&zeroVal[0])
}

func mapaccess2(t *maptype, h *hmap, key unsafe.Pointer) (unsafe.Pointer, bool) {
	if raceenabled && h != nil {
		callerpc := getcallerpc()
		pc := abi.FuncPCABIInternal(mapaccess2)
		racereadpc(unsafe.Pointer(h), callerpc, pc)
		raceReadObjectPC(t.Key, key, callerpc, pc)
	}
	if msanenabled && h != nil {
		msanread(key, t.Key.Size_)
	}
	if asanenabled && h != nil {
		asanread(key, t.Key.Size_)
	}
	if h == nil || h.count == 0 {
		if err := mapKeyError(t, key); err != nil {
			panic(err) // see issue 23734
		}
		return unsafe.Pointer(&zeroVal[0]), false
	}
	if h.flags&hashWriting != 0 {
		fatal("concurrent map read and map write")
	}
	hash := t.Hasher(key, uintptr(h.hash0))
	m := bucketMask(h.B)
	b := (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize)))
	if c := h.oldbuckets; c != nil {
		if !h.sameSizeGrow() {
			// There used to be half as many buckets; mask down one more power of two.
			m >>= 1
		}
		oldb := (*bmap)(add(c, (hash&m)*uintptr(t.BucketSize)))
		if !evacuated(oldb) {
			b = oldb
		}
	}
	top := tophash(hash)
bucketloop:
	for ; b != nil; b = b.overflow(t) {
		for i := uintptr(0); i < bucketCnt; i++ {
			if b.tophash[i] != top {
				if b.tophash[i] == emptyRest {
					break bucketloop
				}
				continue
			}
			k := add(unsafe.Pointer(b), dataOffset+i*uintptr(t.KeySize))
			if t.IndirectKey() {
				k = *((*unsafe.Pointer)(k))
			}
			if t.Key.Equal(key, k) {
				e := add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
				if t.IndirectElem() {
					e = *((*unsafe.Pointer)(e))
				}
				return e, true
			}
		}
	}
	return unsafe.Pointer(&zeroVal[0]), false
}

// returns both key and elem. Used by map iterator.
func mapaccessK(t *maptype, h *hmap, key unsafe.Pointer) (unsafe.Pointer, unsafe.Pointer) {
	if h == nil || h.count == 0 {
		return nil, nil
	}
	hash := t.Hasher(key, uintptr(h.hash0))
	m := bucketMask(h.B)
	b := (*bmap)(add(h.buckets, (hash&m)*uintptr(t.BucketSize)))
	if c := h.oldbuckets; c != nil {
		if !h.sameSizeGrow() {
			// There used to be half as many buckets; mask down one more power of two.
			m >>= 1
		}
		oldb := (*bmap)(add(c, (hash&m)*uintptr(t.BucketSize)))
		if !evacuated(oldb) {
			b = oldb
		}
	}
	top := tophash(hash)
bucketloop:
	for ; b != nil; b = b.overflow(t) {
		for i := uintptr(0); i < bucketCnt; i++ {
			if b.tophash[i] != top {
				if b.tophash[i] == emptyRest {
					break bucketloop
				}
				continue
			}
			k := add(unsafe.Pointer(b), dataOffset+i*uintptr(t.KeySize))
			if t.IndirectKey() {
				k = *((*unsafe.Pointer)(k))
			}
			if t.Key.Equal(key, k) {
				e := add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
				if t.IndirectElem() {
					e = *((*unsafe.Pointer)(e))
				}
				return k, e
			}
		}
	}
	return nil, nil
}

func mapaccess1_fat(t *maptype, h *hmap, key, zero unsafe.Pointer) unsafe.Pointer {
	e := mapaccess1(t, h, key)
	if e == unsafe.Pointer(&zeroVal[0]) {
		return zero
	}
	return e
}

func mapaccess2_fat(t *maptype, h *hmap, key, zero unsafe.Pointer) (unsafe.Pointer, bool) {
	e := mapaccess1(t, h, key)
	if e == unsafe.Pointer(&zeroVal[0]) {
		return zero, false
	}
	return e, true
}

// Like mapaccess, but allocates a slot for the key if it is not present in the map.
func mapassign(t *maptype, h *hmap, key unsafe.Pointer) unsafe.Pointer {
	if h == nil {
		panic(plainError("assignment to entry in nil map"))
	}
	if raceenabled {
		callerpc := getcallerpc()
		pc := abi.FuncPCABIInternal(mapassign)
		racewritepc(unsafe.Pointer(h), callerpc, pc)
		raceReadObjectPC(t.Key, key, callerpc, pc)
	}
	if msanenabled {
		msanread(key, t.Key.Size_)
	}
	if asanenabled {
		asanread(key, t.Key.Size_)
	}
	if h.flags&hashWriting != 0 {
		fatal("concurrent map writes")
	}
	hash := t.Hasher(key, uintptr(h.hash0))

// Set hashWriting after calling t.hasher, since t.hasher may panic,
	// in which case we have not actually done a write.
	h.flags ^= hashWriting

if h.buckets == nil {
		h.buckets = newobject(t.Bucket) // newarray(t.Bucket, 1)
	}

again:
	bucket := hash & bucketMask(h.B)
	if h.growing() {
		growWork(t, h, bucket)
	}
	b := (*bmap)(add(h.buckets, bucket*uintptr(t.BucketSize)))
	top := tophash(hash)

var inserti *uint8
	var insertk unsafe.Pointer
	var elem unsafe.Pointer
bucketloop:
	for {
		for i := uintptr(0); i < bucketCnt; i++ {
			if b.tophash[i] != top {
				if isEmpty(b.tophash[i]) && inserti == nil {
					inserti = &b.tophash[i]
					insertk = add(unsafe.Pointer(b), dataOffset+i*uintptr(t.KeySize))
					elem = add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
				}
				if b.tophash[i] == emptyRest {
					break bucketloop
				}
				continue
			}
			k := add(unsafe.Pointer(b), dataOffset+i*uintptr(t.KeySize))
			if t.IndirectKey() {
				k = *((*unsafe.Pointer)(k))
			}
			if !t.Key.Equal(key, k) {
				continue
			}
			// already have a mapping for key. Update it.
			if t.NeedKeyUpdate() {
				typedmemmove(t.Key, k, key)
			}
			elem = add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
			goto done
		}
		ovf := b.overflow(t)
		if ovf == nil {
			break
		}
		b = ovf
	}

// Did not find mapping for key. Allocate new cell & add entry.

// If we hit the max load factor or we have too many overflow buckets,
	// and we're not already in the middle of growing, start growing.
	if !h.growing() && (overLoadFactor(h.count+1, h.B) || tooManyOverflowBuckets(h.noverflow, h.B)) {
		hashGrow(t, h)
		goto again // Growing the table invalidates everything, so try again
	}

if inserti == nil {
		// The current bucket and all the overflow buckets connected to it are full, allocate a new one.
		newb := h.newoverflow(t, b)
		inserti = &newb.tophash[0]
		insertk = add(unsafe.Pointer(newb), dataOffset)
		elem = add(insertk, bucketCnt*uintptr(t.KeySize))
	}

// store new key/elem at insert position
	if t.IndirectKey() {
		kmem := newobject(t.Key)
		*(*unsafe.Pointer)(insertk) = kmem
		insertk = kmem
	}
	if t.IndirectElem() {
		vmem := newobject(t.Elem)
		*(*unsafe.Pointer)(elem) = vmem
	}
	typedmemmove(t.Key, insertk, key)
	*inserti = top
	h.count++

done:
	if h.flags&hashWriting == 0 {
		fatal("concurrent map writes")
	}
	h.flags &^= hashWriting
	if t.IndirectElem() {
		elem = *((*unsafe.Pointer)(elem))
	}
	return elem
}

func mapdelete(t *maptype, h *hmap, key unsafe.Pointer) {
	if raceenabled && h != nil {
		callerpc := getcallerpc()
		pc := abi.FuncPCABIInternal(mapdelete)
		racewritepc(unsafe.Pointer(h), callerpc, pc)
		raceReadObjectPC(t.Key, key, callerpc, pc)
	}
	if msanenabled && h != nil {
		msanread(key, t.Key.Size_)
	}
	if asanenabled && h != nil {
		asanread(key, t.Key.Size_)
	}
	if h == nil || h.count == 0 {
		if err := mapKeyError(t, key); err != nil {
			panic(err) // see issue 23734
		}
		return
	}
	if h.flags&hashWriting != 0 {
		fatal("concurrent map writes")
	}

hash := t.Hasher(key, uintptr(h.hash0))

// Set hashWriting after calling t.hasher, since t.hasher may panic,
	// in which case we have not actually done a write (delete).
	h.flags ^= hashWriting

bucket := hash & bucketMask(h.B)
	if h.growing() {
		growWork(t, h, bucket)
	}
	b := (*bmap)(add(h.buckets, bucket*uintptr(t.BucketSize)))
	bOrig := b
	top := tophash(hash)
search:
	for ; b != nil; b = b.overflow(t) {
		for i := uintptr(0); i < bucketCnt; i++ {
			if b.tophash[i] != top {
				if b.tophash[i] == emptyRest {
					break search
				}
				continue
			}
			k := add(unsafe.Pointer(b), dataOffset+i*uintptr(t.KeySize))
			k2 := k
			if t.IndirectKey() {
				k2 = *((*unsafe.Pointer)(k2))
			}
			if !t.Key.Equal(key, k2) {
				continue
			}
			// Only clear key if there are pointers in it.
			if t.IndirectKey() {
				*(*unsafe.Pointer)(k) = nil
			} else if t.Key.PtrBytes != 0 {
				memclrHasPointers(k, t.Key.Size_)
			}
			e := add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
			if t.IndirectElem() {
				*(*unsafe.Pointer)(e) = nil
			} else if t.Elem.PtrBytes != 0 {
				memclrHasPointers(e, t.Elem.Size_)
			} else {
				memclrNoHeapPointers(e, t.Elem.Size_)
			}
			b.tophash[i] = emptyOne
			// If the bucket now ends in a bunch of emptyOne states,
			// change those to emptyRest states.
			// It would be nice to make this a separate function, but
			// for loops are not currently inlineable.
			if i == bucketCnt-1 {
				if b.overflow(t) != nil && b.overflow(t).tophash[0] != emptyRest {
					goto notLast
				}
			} else {
				if b.tophash[i+1] != emptyRest {
					goto notLast
				}
			}
			for {
				b.tophash[i] = emptyRest
				if i == 0 {
					if b == bOrig {
						break // beginning of initial bucket, we're done.
					}
					// Find previous bucket, continue at its last entry.
					c := b
					for b = bOrig; b.overflow(t) != c; b = b.overflow(t) {
					}
					i = bucketCnt - 1
				} else {
					i--
				}
				if b.tophash[i] != emptyOne {
					break
				}
			}
		notLast:
			h.count--
			// Reset the hash seed to make it more difficult for attackers to
			// repeatedly trigger hash collisions. See issue 25237.
			if h.count == 0 {
				h.hash0 = uint32(rand())
			}
			break search
		}
	}

if h.flags&hashWriting == 0 {
		fatal("concurrent map writes")
	}
	h.flags &^= hashWriting
}

// mapiterinit initializes the hiter struct used for ranging over maps.
// The hiter struct pointed to by 'it' is allocated on the stack
// by the compilers order pass or on the heap by reflect_mapiterinit.
// Both need to have zeroed hiter since the struct contains pointers.
func mapiterinit(t *maptype, h *hmap, it *hiter) {
	if raceenabled && h != nil {
		callerpc := getcallerpc()
		racereadpc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(mapiterinit))
	}

it.t = t
	if h == nil || h.count == 0 {
		return
	}

if unsafe.Sizeof(hiter{})/goarch.PtrSize != 12 {
		throw("hash_iter size incorrect") // see cmd/compile/internal/reflectdata/reflect.go
	}
	it.h = h

// grab snapshot of bucket state
	it.B = h.B
	it.buckets = h.buckets
	if t.Bucket.PtrBytes == 0 {
		// Allocate the current slice and remember pointers to both current and old.
		// This preserves all relevant overflow buckets alive even if
		// the table grows and/or overflow buckets are added to the table
		// while we are iterating.
		h.createOverflow()
		it.overflow = h.extra.overflow
		it.oldoverflow = h.extra.oldoverflow
	}

// decide where to start
	r := uintptr(rand())
	it.startBucket = r & bucketMask(h.B)
	it.offset = uint8(r >> h.B & (bucketCnt - 1))

// iterator state
	it.bucket = it.startBucket

// Remember we have an iterator.
	// Can run concurrently with another mapiterinit().
	if old := h.flags; old&(iterator|oldIterator) != iterator|oldIterator {
		atomic.Or8(&h.flags, iterator|oldIterator)
	}

mapiternext(it)
}

func mapiternext(it *hiter) {
	h := it.h
	if raceenabled {
		callerpc := getcallerpc()
		racereadpc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(mapiternext))
	}
	if h.flags&hashWriting != 0 {
		fatal("concurrent map iteration and map write")
	}
	t := it.t
	bucket := it.bucket
	b := it.bptr
	i := it.i
	checkBucket := it.checkBucket

next:
	if b == nil {
		if bucket == it.startBucket && it.wrapped {
			// end of iteration
			it.key = nil
			it.elem = nil
			return
		}
		if h.growing() && it.B == h.B {
			// Iterator was started in the middle of a grow, and the grow isn't done yet.
			// If the bucket we're looking at hasn't been filled in yet (i.e. the old
			// bucket hasn't been evacuated) then we need to iterate through the old
			// bucket and only return the ones that will be migrated to this bucket.
			oldbucket := bucket & it.h.oldbucketmask()
			b = (*bmap)(add(h.oldbuckets, oldbucket*uintptr(t.BucketSize)))
			if !evacuated(b) {
				checkBucket = bucket
			} else {
				b = (*bmap)(add(it.buckets, bucket*uintptr(t.BucketSize)))
				checkBucket = noCheck
			}
		} else {
			b = (*bmap)(add(it.buckets, bucket*uintptr(t.BucketSize)))
			checkBucket = noCheck
		}
		bucket++
		if bucket == bucketShift(it.B) {
			bucket = 0
			it.wrapped = true
		}
		i = 0
	}
	for ; i < bucketCnt; i++ {
		offi := (i + it.offset) & (bucketCnt - 1)
		if isEmpty(b.tophash[offi]) || b.tophash[offi] == evacuatedEmpty {
			// TODO: emptyRest is hard to use here, as we start iterating
			// in the middle of a bucket. It's feasible, just tricky.
			continue
		}
		k := add(unsafe.Pointer(b), dataOffset+uintptr(offi)*uintptr(t.KeySize))
		if t.IndirectKey() {
			k = *((*unsafe.Pointer)(k))
		}
		e := add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+uintptr(offi)*uintptr(t.ValueSize))
		if checkBucket != noCheck && !h.sameSizeGrow() {
			// Special case: iterator was started during a grow to a larger size
			// and the grow is not done yet. We're working on a bucket whose
			// oldbucket has not been evacuated yet. Or at least, it wasn't
			// evacuated when we started the bucket. So we're iterating
			// through the oldbucket, skipping any keys that will go
			// to the other new bucket (each oldbucket expands to two
			// buckets during a grow).
			if t.ReflexiveKey() || t.Key.Equal(k, k) {
				// If the item in the oldbucket is not destined for
				// the current new bucket in the iteration, skip it.
				hash := t.Hasher(k, uintptr(h.hash0))
				if hash&bucketMask(it.B) != checkBucket {
					continue
				}
			} else {
				// Hash isn't repeatable if k != k (NaNs).  We need a
				// repeatable and randomish choice of which direction
				// to send NaNs during evacuation. We'll use the low
				// bit of tophash to decide which way NaNs go.
				// NOTE: this case is why we need two evacuate tophash
				// values, evacuatedX and evacuatedY, that differ in
				// their low bit.
				if checkBucket>>(it.B-1) != uintptr(b.tophash[offi]&1) {
					continue
				}
			}
		}
		if (b.tophash[offi] != evacuatedX && b.tophash[offi] != evacuatedY) ||
			!(t.ReflexiveKey() || t.Key.Equal(k, k)) {
			// This is the golden data, we can return it.
			// OR
			// key!=key, so the entry can't be deleted or updated, so we can just return it.
			// That's lucky for us because when key!=key we can't look it up successfully.
			it.key = k
			if t.IndirectElem() {
				e = *((*unsafe.Pointer)(e))
			}
			it.elem = e
		} else {
			// The hash table has grown since the iterator was started.
			// The golden data for this key is now somewhere else.
			// Check the current hash table for the data.
			// This code handles the case where the key
			// has been deleted, updated, or deleted and reinserted.
			// NOTE: we need to regrab the key as it has potentially been
			// updated to an equal() but not identical key (e.g. +0.0 vs -0.0).
			rk, re := mapaccessK(t, h, k)
			if rk == nil {
				continue // key has been deleted
			}
			it.key = rk
			it.elem = re
		}
		it.bucket = bucket
		if it.bptr != b { // avoid unnecessary write barrier; see issue 14921
			it.bptr = b
		}
		it.i = i + 1
		it.checkBucket = checkBucket
		return
	}
	b = b.overflow(t)
	i = 0
	goto next
}

// mapclear deletes all keys from a map.
func mapclear(t *maptype, h *hmap) {
	if raceenabled && h != nil {
		callerpc := getcallerpc()
		pc := abi.FuncPCABIInternal(mapclear)
		racewritepc(unsafe.Pointer(h), callerpc, pc)
	}

if h == nil || h.count == 0 {
		return
	}

if h.flags&hashWriting != 0 {
		fatal("concurrent map writes")
	}

h.flags ^= hashWriting

// Mark buckets empty, so existing iterators can be terminated, see issue #59411.
	markBucketsEmpty := func(bucket unsafe.Pointer, mask uintptr) {
		for i := uintptr(0); i <= mask; i++ {
			b := (*bmap)(add(bucket, i*uintptr(t.BucketSize)))
			for ; b != nil; b = b.overflow(t) {
				for i := uintptr(0); i < bucketCnt; i++ {
					b.tophash[i] = emptyRest
				}
			}
		}
	}
	markBucketsEmpty(h.buckets, bucketMask(h.B))
	if oldBuckets := h.oldbuckets; oldBuckets != nil {
		markBucketsEmpty(oldBuckets, h.oldbucketmask())
	}

h.flags &^= sameSizeGrow
	h.oldbuckets = nil
	h.nevacuate = 0
	h.noverflow = 0
	h.count = 0

// Reset the hash seed to make it more difficult for attackers to
	// repeatedly trigger hash collisions. See issue 25237.
	h.hash0 = uint32(rand())

// Keep the mapextra allocation but clear any extra information.
	if h.extra != nil {
		*h.extra = mapextra{}
	}

// makeBucketArray clears the memory pointed to by h.buckets
	// and recovers any overflow buckets by generating them
	// as if h.buckets was newly alloced.
	_, nextOverflow := makeBucketArray(t, h.B, h.buckets)
	if nextOverflow != nil {
		// If overflow buckets are created then h.extra
		// will have been allocated during initial bucket creation.
		h.extra.nextOverflow = nextOverflow
	}

if h.flags&hashWriting == 0 {
		fatal("concurrent map writes")
	}
	h.flags &^= hashWriting
}

func hashGrow(t *maptype, h *hmap) {
	// If we've hit the load factor, get bigger.
	// Otherwise, there are too many overflow buckets,
	// so keep the same number of buckets and "grow" laterally.
	bigger := uint8(1)
	if !overLoadFactor(h.count+1, h.B) {
		bigger = 0
		h.flags |= sameSizeGrow
	}
	oldbuckets := h.buckets
	newbuckets, nextOverflow := makeBucketArray(t, h.B+bigger, nil)

flags := h.flags &^ (iterator | oldIterator)
	if h.flags&iterator != 0 {
		flags |= oldIterator
	}
	// commit the grow (atomic wrt gc)
	h.B += bigger
	h.flags = flags
	h.oldbuckets = oldbuckets
	h.buckets = newbuckets
	h.nevacuate = 0
	h.noverflow = 0

if h.extra != nil && h.extra.overflow != nil {
		// Promote current overflow buckets to the old generation.
		if h.extra.oldoverflow != nil {
			throw("oldoverflow is not nil")
		}
		h.extra.oldoverflow = h.extra.overflow
		h.extra.overflow = nil
	}
	if nextOverflow != nil {
		if h.extra == nil {
			h.extra = new(mapextra)
		}
		h.extra.nextOverflow = nextOverflow
	}

// the actual copying of the hash table data is done incrementally
	// by growWork() and evacuate().
}

// overLoadFactor reports whether count items placed in 1<<B buckets is over loadFactor.
func overLoadFactor(count int, B uint8) bool {
	return count > bucketCnt && uintptr(count) > loadFactorNum*(bucketShift(B)/loadFactorDen)
}

// tooManyOverflowBuckets reports whether noverflow buckets is too many for a map with 1<<B buckets.
// Note that most of these overflow buckets must be in sparse use;
// if use was dense, then we'd have already triggered regular map growth.
func tooManyOverflowBuckets(noverflow uint16, B uint8) bool {
	// If the threshold is too low, we do extraneous work.
	// If the threshold is too high, maps that grow and shrink can hold on to lots of unused memory.
	// "too many" means (approximately) as many overflow buckets as regular buckets.
	// See incrnoverflow for more details.
	if B > 15 {
		B = 15
	}
	// The compiler doesn't see here that B < 16; mask B to generate shorter shift code.
	return noverflow >= uint16(1)<<(B&15)
}

// growing reports whether h is growing. The growth may be to the same size or bigger.
func (h *hmap) growing() bool {
	return h.oldbuckets != nil
}

// sameSizeGrow reports whether the current growth is to a map of the same size.
func (h *hmap) sameSizeGrow() bool {
	return h.flags&sameSizeGrow != 0
}

// noldbuckets calculates the number of buckets prior to the current map growth.
func (h *hmap) noldbuckets() uintptr {
	oldB := h.B
	if !h.sameSizeGrow() {
		oldB--
	}
	return bucketShift(oldB)
}

// oldbucketmask provides a mask that can be applied to calculate n % noldbuckets().
func (h *hmap) oldbucketmask() uintptr {
	return h.noldbuckets() - 1
}

func growWork(t *maptype, h *hmap, bucket uintptr) {
	// make sure we evacuate the oldbucket corresponding
	// to the bucket we're about to use
	evacuate(t, h, bucket&h.oldbucketmask())

// evacuate one more oldbucket to make progress on growing
	if h.growing() {
		evacuate(t, h, h.nevacuate)
	}
}

func bucketEvacuated(t *maptype, h *hmap, bucket uintptr) bool {
	b := (*bmap)(add(h.oldbuckets, bucket*uintptr(t.BucketSize)))
	return evacuated(b)
}

// evacDst is an evacuation destination.
type evacDst struct {
	b *bmap          // current destination bucket
	i int            // key/elem index into b
	k unsafe.Pointer // pointer to current key storage
	e unsafe.Pointer // pointer to current elem storage
}

func evacuate(t *maptype, h *hmap, oldbucket uintptr) {
	b := (*bmap)(add(h.oldbuckets, oldbucket*uintptr(t.BucketSize)))
	newbit := h.noldbuckets()
	if !evacuated(b) {
		// TODO: reuse overflow buckets instead of using new ones, if there
		// is no iterator using the old buckets.  (If !oldIterator.)

// xy contains the x and y (low and high) evacuation destinations.
		var xy [2]evacDst
		x := &xy[0]
		x.b = (*bmap)(add(h.buckets, oldbucket*uintptr(t.BucketSize)))
		x.k = add(unsafe.Pointer(x.b), dataOffset)
		x.e = add(x.k, bucketCnt*uintptr(t.KeySize))

if !h.sameSizeGrow() {
			// Only calculate y pointers if we're growing bigger.
			// Otherwise GC can see bad pointers.
			y := &xy[1]
			y.b = (*bmap)(add(h.buckets, (oldbucket+newbit)*uintptr(t.BucketSize)))
			y.k = add(unsafe.Pointer(y.b), dataOffset)
			y.e = add(y.k, bucketCnt*uintptr(t.KeySize))
		}

for ; b != nil; b = b.overflow(t) {
			k := add(unsafe.Pointer(b), dataOffset)
			e := add(k, bucketCnt*uintptr(t.KeySize))
			for i := 0; i < bucketCnt; i, k, e = i+1, add(k, uintptr(t.KeySize)), add(e, uintptr(t.ValueSize)) {
				top := b.tophash[i]
				if isEmpty(top) {
					b.tophash[i] = evacuatedEmpty
					continue
				}
				if top < minTopHash {
					throw("bad map state")
				}
				k2 := k
				if t.IndirectKey() {
					k2 = *((*unsafe.Pointer)(k2))
				}
				var useY uint8
				if !h.sameSizeGrow() {
					// Compute hash to make our evacuation decision (whether we need
					// to send this key/elem to bucket x or bucket y).
					hash := t.Hasher(k2, uintptr(h.hash0))
					if h.flags&iterator != 0 && !t.ReflexiveKey() && !t.Key.Equal(k2, k2) {
						// If key != key (NaNs), then the hash could be (and probably
						// will be) entirely different from the old hash. Moreover,
						// it isn't reproducible. Reproducibility is required in the
						// presence of iterators, as our evacuation decision must
						// match whatever decision the iterator made.
						// Fortunately, we have the freedom to send these keys either
						// way. Also, tophash is meaningless for these kinds of keys.
						// We let the low bit of tophash drive the evacuation decision.
						// We recompute a new random tophash for the next level so
						// these keys will get evenly distributed across all buckets
						// after multiple grows.
						useY = top & 1
						top = tophash(hash)
					} else {
						if hash&newbit != 0 {
							useY = 1
						}
					}
				}

if evacuatedX+1 != evacuatedY || evacuatedX^1 != evacuatedY {
					throw("bad evacuatedN")
				}

b.tophash[i] = evacuatedX + useY // evacuatedX + 1 == evacuatedY
				dst := &xy[useY]                 // evacuation destination

if dst.i == bucketCnt {
					dst.b = h.newoverflow(t, dst.b)
					dst.i = 0
					dst.k = add(unsafe.Pointer(dst.b), dataOffset)
					dst.e = add(dst.k, bucketCnt*uintptr(t.KeySize))
				}
				dst.b.tophash[dst.i&(bucketCnt-1)] = top // mask dst.i as an optimization, to avoid a bounds check
				if t.IndirectKey() {
					*(*unsafe.Pointer)(dst.k) = k2 // copy pointer
				} else {
					typedmemmove(t.Key, dst.k, k) // copy elem
				}
				if t.IndirectElem() {
					*(*unsafe.Pointer)(dst.e) = *(*unsafe.Pointer)(e)
				} else {
					typedmemmove(t.Elem, dst.e, e)
				}
				dst.i++
				// These updates might push these pointers past the end of the
				// key or elem arrays.  That's ok, as we have the overflow pointer
				// at the end of the bucket to protect against pointing past the
				// end of the bucket.
				dst.k = add(dst.k, uintptr(t.KeySize))
				dst.e = add(dst.e, uintptr(t.ValueSize))
			}
		}
		// Unlink the overflow buckets & clear key/elem to help GC.
		if h.flags&oldIterator == 0 && t.Bucket.PtrBytes != 0 {
			b := add(h.oldbuckets, oldbucket*uintptr(t.BucketSize))
			// Preserve b.tophash because the evacuation
			// state is maintained there.
			ptr := add(b, dataOffset)
			n := uintptr(t.BucketSize) - dataOffset
			memclrHasPointers(ptr, n)
		}
	}

if oldbucket == h.nevacuate {
		advanceEvacuationMark(h, t, newbit)
	}
}

func advanceEvacuationMark(h *hmap, t *maptype, newbit uintptr) {
	h.nevacuate++
	// Experiments suggest that 1024 is overkill by at least an order of magnitude.
	// Put it in there as a safeguard anyway, to ensure O(1) behavior.
	stop := h.nevacuate + 1024
	if stop > newbit {
		stop = newbit
	}
	for h.nevacuate != stop && bucketEvacuated(t, h, h.nevacuate) {
		h.nevacuate++
	}
	if h.nevacuate == newbit { // newbit == # of oldbuckets
		// Growing is all done. Free old main bucket array.
		h.oldbuckets = nil
		// Can discard old overflow buckets as well.
		// If they are still referenced by an iterator,
		// then the iterator holds a pointers to the slice.
		if h.extra != nil {
			h.extra.oldoverflow = nil
		}
		h.flags &^= sameSizeGrow
	}
}

// Reflect stubs. Called from ../reflect/asm_*.s

//go:linkname reflect_makemap reflect.makemap
func reflect_makemap(t *maptype, cap int) *hmap {
	// Check invariants and reflects math.
	if t.Key.Equal == nil {
		throw("runtime.reflect_makemap: unsupported map key type")
	}
	if t.Key.Size_ > maxKeySize && (!t.IndirectKey() || t.KeySize != uint8(goarch.PtrSize)) ||
		t.Key.Size_ <= maxKeySize && (t.IndirectKey() || t.KeySize != uint8(t.Key.Size_)) {
		throw("key size wrong")
	}
	if t.Elem.Size_ > maxElemSize && (!t.IndirectElem() || t.ValueSize != uint8(goarch.PtrSize)) ||
		t.Elem.Size_ <= maxElemSize && (t.IndirectElem() || t.ValueSize != uint8(t.Elem.Size_)) {
		throw("elem size wrong")
	}
	if t.Key.Align_ > bucketCnt {
		throw("key align too big")
	}
	if t.Elem.Align_ > bucketCnt {
		throw("elem align too big")
	}
	if t.Key.Size_%uintptr(t.Key.Align_) != 0 {
		throw("key size not a multiple of key align")
	}
	if t.Elem.Size_%uintptr(t.Elem.Align_) != 0 {
		throw("elem size not a multiple of elem align")
	}
	if bucketCnt < 8 {
		throw("bucketsize too small for proper alignment")
	}
	if dataOffset%uintptr(t.Key.Align_) != 0 {
		throw("need padding in bucket (key)")
	}
	if dataOffset%uintptr(t.Elem.Align_) != 0 {
		throw("need padding in bucket (elem)")
	}

return makemap(t, cap, nil)
}

//go:linkname reflect_mapaccess reflect.mapaccess
func reflect_mapaccess(t *maptype, h *hmap, key unsafe.Pointer) unsafe.Pointer {
	elem, ok := mapaccess2(t, h, key)
	if !ok {
		// reflect wants nil for a missing element
		elem = nil
	}
	return elem
}

//go:linkname reflect_mapaccess_faststr reflect.mapaccess_faststr
func reflect_mapaccess_faststr(t *maptype, h *hmap, key string) unsafe.Pointer {
	elem, ok := mapaccess2_faststr(t, h, key)
	if !ok {
		// reflect wants nil for a missing element
		elem = nil
	}
	return elem
}

//go:linkname reflect_mapassign reflect.mapassign0
func reflect_mapassign(t *maptype, h *hmap, key unsafe.Pointer, elem unsafe.Pointer) {
	p := mapassign(t, h, key)
	typedmemmove(t.Elem, p, elem)
}

//go:linkname reflect_mapassign_faststr reflect.mapassign_faststr0
func reflect_mapassign_faststr(t *maptype, h *hmap, key string, elem unsafe.Pointer) {
	p := mapassign_faststr(t, h, key)
	typedmemmove(t.Elem, p, elem)
}

//go:linkname reflect_mapdelete reflect.mapdelete
func reflect_mapdelete(t *maptype, h *hmap, key unsafe.Pointer) {
	mapdelete(t, h, key)
}

//go:linkname reflect_mapdelete_faststr reflect.mapdelete_faststr
func reflect_mapdelete_faststr(t *maptype, h *hmap, key string) {
	mapdelete_faststr(t, h, key)
}

//go:linkname reflect_mapiterinit reflect.mapiterinit
func reflect_mapiterinit(t *maptype, h *hmap, it *hiter) {
	mapiterinit(t, h, it)
}

//go:linkname reflect_mapiternext reflect.mapiternext
func reflect_mapiternext(it *hiter) {
	mapiternext(it)
}

//go:linkname reflect_mapiterkey reflect.mapiterkey
func reflect_mapiterkey(it *hiter) unsafe.Pointer {
	return it.key
}

//go:linkname reflect_mapiterelem reflect.mapiterelem
func reflect_mapiterelem(it *hiter) unsafe.Pointer {
	return it.elem
}

//go:linkname reflect_maplen reflect.maplen
func reflect_maplen(h *hmap) int {
	if h == nil {
		return 0
	}
	if raceenabled {
		callerpc := getcallerpc()
		racereadpc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(reflect_maplen))
	}
	return h.count
}

//go:linkname reflect_mapclear reflect.mapclear
func reflect_mapclear(t *maptype, h *hmap) {
	mapclear(t, h)
}

//go:linkname reflectlite_maplen internal/reflectlite.maplen
func reflectlite_maplen(h *hmap) int {
	if h == nil {
		return 0
	}
	if raceenabled {
		callerpc := getcallerpc()
		racereadpc(unsafe.Pointer(h), callerpc, abi.FuncPCABIInternal(reflect_maplen))
	}
	return h.count
}

var zeroVal [abi.ZeroValSize]byte

// mapinitnoop is a no-op function known the Go linker; if a given global
// map (of the right size) is determined to be dead, the linker will
// rewrite the relocation (from the package init func) from the outlined
// map init function to this symbol. Defined in assembly so as to avoid
// complications with instrumentation (coverage, etc).
func mapinitnoop()

// mapclone for implementing maps.Clone
//
//go:linkname mapclone maps.clone
func mapclone(m any) any {
	e := efaceOf(&m)
	e.data = unsafe.Pointer(mapclone2((*maptype)(unsafe.Pointer(e._type)), (*hmap)(e.data)))
	return m
}

// moveToBmap moves a bucket from src to dst. It returns the destination bucket or new destination bucket if it overflows
// and the pos that the next key/value will be written, if pos == bucketCnt means needs to written in overflow bucket.
func moveToBmap(t *maptype, h *hmap, dst *bmap, pos int, src *bmap) (*bmap, int) {
	for i := 0; i < bucketCnt; i++ {
		if isEmpty(src.tophash[i]) {
			continue
		}

for ; pos < bucketCnt; pos++ {
			if isEmpty(dst.tophash[pos]) {
				break
			}
		}

if pos == bucketCnt {
			dst = h.newoverflow(t, dst)
			pos = 0
		}

srcK := add(unsafe.Pointer(src), dataOffset+uintptr(i)*uintptr(t.KeySize))
		srcEle := add(unsafe.Pointer(src), dataOffset+bucketCnt*uintptr(t.KeySize)+uintptr(i)*uintptr(t.ValueSize))
		dstK := add(unsafe.Pointer(dst), dataOffset+uintptr(pos)*uintptr(t.KeySize))
		dstEle := add(unsafe.Pointer(dst), dataOffset+bucketCnt*uintptr(t.KeySize)+uintptr(pos)*uintptr(t.ValueSize))

dst.tophash[pos] = src.tophash[i]
		if t.IndirectKey() {
			srcK = *(*unsafe.Pointer)(srcK)
			if t.NeedKeyUpdate() {
				kStore := newobject(t.Key)
				typedmemmove(t.Key, kStore, srcK)
				srcK = kStore
			}
			// Note: if NeedKeyUpdate is false, then the memory
			// used to store the key is immutable, so we can share
			// it between the original map and its clone.
			*(*unsafe.Pointer)(dstK) = srcK
		} else {
			typedmemmove(t.Key, dstK, srcK)
		}
		if t.IndirectElem() {
			srcEle = *(*unsafe.Pointer)(srcEle)
			eStore := newobject(t.Elem)
			typedmemmove(t.Elem, eStore, srcEle)
			*(*unsafe.Pointer)(dstEle) = eStore
		} else {
			typedmemmove(t.Elem, dstEle, srcEle)
		}
		pos++
		h.count++
	}
	return dst, pos
}

func mapclone2(t *maptype, src *hmap) *hmap {
	dst := makemap(t, src.count, nil)
	dst.hash0 = src.hash0
	dst.nevacuate = 0
	//flags do not need to be copied here, just like a new map has no flags.

if src.count == 0 {
		return dst
	}

if src.flags&hashWriting != 0 {
		fatal("concurrent map clone and map write")
	}

if src.B == 0 && !(t.IndirectKey() && t.NeedKeyUpdate()) && !t.IndirectElem() {
		// Quick copy for small maps.
		dst.buckets = newobject(t.Bucket)
		dst.count = src.count
		typedmemmove(t.Bucket, dst.buckets, src.buckets)
		return dst
	}

if dst.B == 0 {
		dst.buckets = newobject(t.Bucket)
	}
	dstArraySize := int(bucketShift(dst.B))
	srcArraySize := int(bucketShift(src.B))
	for i := 0; i < dstArraySize; i++ {
		dstBmap := (*bmap)(add(dst.buckets, uintptr(i*int(t.BucketSize))))
		pos := 0
		for j := 0; j < srcArraySize; j += dstArraySize {
			srcBmap := (*bmap)(add(src.buckets, uintptr((i+j)*int(t.BucketSize))))
			for srcBmap != nil {
				dstBmap, pos = moveToBmap(t, dst, dstBmap, pos, srcBmap)
				srcBmap = srcBmap.overflow(t)
			}
		}
	}

if src.oldbuckets == nil {
		return dst
	}

oldB := src.B
	srcOldbuckets := src.oldbuckets
	if !src.sameSizeGrow() {
		oldB--
	}
	oldSrcArraySize := int(bucketShift(oldB))

for i := 0; i < oldSrcArraySize; i++ {
		srcBmap := (*bmap)(add(srcOldbuckets, uintptr(i*int(t.BucketSize))))
		if evacuated(srcBmap) {
			continue
		}

if oldB >= dst.B { // main bucket bits in dst is less than oldB bits in src
			dstBmap := (*bmap)(add(dst.buckets, (uintptr(i)&bucketMask(dst.B))*uintptr(t.BucketSize)))
			for dstBmap.overflow(t) != nil {
				dstBmap = dstBmap.overflow(t)
			}
			pos := 0
			for srcBmap != nil {
				dstBmap, pos = moveToBmap(t, dst, dstBmap, pos, srcBmap)
				srcBmap = srcBmap.overflow(t)
			}
			continue
		}

// oldB < dst.B, so a single source bucket may go to multiple destination buckets.
		// Process entries one at a time.
		for srcBmap != nil {
			// move from oldBlucket to new bucket
			for i := uintptr(0); i < bucketCnt; i++ {
				if isEmpty(srcBmap.tophash[i]) {
					continue
				}

if src.flags&hashWriting != 0 {
					fatal("concurrent map clone and map write")
				}

srcK := add(unsafe.Pointer(srcBmap), dataOffset+i*uintptr(t.KeySize))
				if t.IndirectKey() {
					srcK = *((*unsafe.Pointer)(srcK))
				}

srcEle := add(unsafe.Pointer(srcBmap), dataOffset+bucketCnt*uintptr(t.KeySize)+i*uintptr(t.ValueSize))
				if t.IndirectElem() {
					srcEle = *((*unsafe.Pointer)(srcEle))
				}
				dstEle := mapassign(t, dst, srcK)
				typedmemmove(t.Elem, dstEle, srcEle)
			}
			srcBmap = srcBmap.overflow(t)
		}
	}
	return dst
}

// keys for implementing maps.keys
//
//go:linkname keys maps.keys
func keys(m any, p unsafe.Pointer) {
	e := efaceOf(&m)
	t := (*maptype)(unsafe.Pointer(e._type))
	h := (*hmap)(e.data)

if h == nil || h.count == 0 {
		return
	}
	s := (*slice)(p)
	r := int(rand())
	offset := uint8(r >> h.B & (bucketCnt - 1))
	if h.B == 0 {
		copyKeys(t, h, (*bmap)(h.buckets), s, offset)
		return
	}
	arraySize := int(bucketShift(h.B))
	buckets := h.buckets
	for i := 0; i < arraySize; i++ {
		bucket := (i + r) & (arraySize - 1)
		b := (*bmap)(add(buckets, uintptr(bucket)*uintptr(t.BucketSize)))
		copyKeys(t, h, b, s, offset)
	}

if h.growing() {
		oldArraySize := int(h.noldbuckets())
		for i := 0; i < oldArraySize; i++ {
			bucket := (i + r) & (oldArraySize - 1)
			b := (*bmap)(add(h.oldbuckets, uintptr(bucket)*uintptr(t.BucketSize)))
			if evacuated(b) {
				continue
			}
			copyKeys(t, h, b, s, offset)
		}
	}
	return
}

func copyKeys(t *maptype, h *hmap, b *bmap, s *slice, offset uint8) {
	for b != nil {
		for i := uintptr(0); i < bucketCnt; i++ {
			offi := (i + uintptr(offset)) & (bucketCnt - 1)
			if isEmpty(b.tophash[offi]) {
				continue
			}
			if h.flags&hashWriting != 0 {
				fatal("concurrent map read and map write")
			}
			k := add(unsafe.Pointer(b), dataOffset+offi*uintptr(t.KeySize))
			if t.IndirectKey() {
				k = *((*unsafe.Pointer)(k))
			}
			if s.len >= s.cap {
				fatal("concurrent map read and map write")
			}
			typedmemmove(t.Key, add(s.array, uintptr(s.len)*uintptr(t.Key.Size())), k)
			s.len++
		}
		b = b.overflow(t)
	}
}

// values for implementing maps.values
//
//go:linkname values maps.values
func values(m any, p unsafe.Pointer) {
	e := efaceOf(&m)
	t := (*maptype)(unsafe.Pointer(e._type))
	h := (*hmap)(e.data)
	if h == nil || h.count == 0 {
		return
	}
	s := (*slice)(p)
	r := int(rand())
	offset := uint8(r >> h.B & (bucketCnt - 1))
	if h.B == 0 {
		copyValues(t, h, (*bmap)(h.buckets), s, offset)
		return
	}
	arraySize := int(bucketShift(h.B))
	buckets := h.buckets
	for i := 0; i < arraySize; i++ {
		bucket := (i + r) & (arraySize - 1)
		b := (*bmap)(add(buckets, uintptr(bucket)*uintptr(t.BucketSize)))
		copyValues(t, h, b, s, offset)
	}

func copyValues(t *maptype, h *hmap, b *bmap, s *slice, offset uint8) {
	for b != nil {
		for i := uintptr(0); i < bucketCnt; i++ {
			offi := (i + uintptr(offset)) & (bucketCnt - 1)
			if isEmpty(b.tophash[offi]) {
				continue
			}

if h.flags&hashWriting != 0 {
				fatal("concurrent map read and map write")
			}

ele := add(unsafe.Pointer(b), dataOffset+bucketCnt*uintptr(t.KeySize)+offi*uintptr(t.ValueSize))
			if t.IndirectElem() {
				ele = *((*unsafe.Pointer)(ele))
			}
			if s.len >= s.cap {
				fatal("concurrent map read and map write")
			}
			typedmemmove(t.Elem, add(s.array, uintptr(s.len)*uintptr(t.Elem.Size())), ele)
			s.len++
		}
		b = b.overflow(t)
	}
}

X7ROOT File Manager

Editing: map.go

Upload File

Create Folder