X7ROOT File Manager
Current Path:
/opt/golang/1.19.4/test/codegen
opt
/
golang
/
1.19.4
/
test
/
codegen
/
📁
..
📄
README
(5.21 KB)
📄
addrcalc.go
(324 B)
📄
alloc.go
(902 B)
📄
arithmetic.go
(14.63 KB)
📄
bitfield.go
(9.64 KB)
📄
bits.go
(5.95 KB)
📄
bmi.go
(2.19 KB)
📄
bool.go
(705 B)
📄
clobberdead.go
(1.31 KB)
📄
clobberdeadreg.go
(1.29 KB)
📄
compare_and_branch.go
(3.79 KB)
📄
comparisons.go
(11.79 KB)
📄
condmove.go
(5.3 KB)
📄
copy.go
(3.36 KB)
📄
floats.go
(3.21 KB)
📄
fuse.go
(4.79 KB)
📄
issue22703.go
(5.43 KB)
📄
issue25378.go
(445 B)
📄
issue31618.go
(504 B)
📄
issue33580.go
(459 B)
📄
issue38554.go
(355 B)
📄
issue42610.go
(673 B)
📄
issue48054.go
(464 B)
📄
issue52635.go
(655 B)
📄
logic.go
(815 B)
📄
mapaccess.go
(9.21 KB)
📄
maps.go
(3.1 KB)
📄
math.go
(6.12 KB)
📄
mathbits.go
(18.06 KB)
📄
memcombine.go
(24 KB)
📄
memops.go
(11.65 KB)
📄
noextend.go
(4.8 KB)
📄
race.go
(651 B)
📄
regabi_regalloc.go
(494 B)
📄
retpoline.go
(224 B)
📄
rotate.go
(5.43 KB)
📄
select.go
(373 B)
📄
shift.go
(9.15 KB)
📄
shortcircuit.go
(368 B)
📄
slices.go
(8.09 KB)
📄
smallintiface.go
(500 B)
📄
spectre.go
(722 B)
📄
stack.go
(2.96 KB)
📄
strings.go
(2.08 KB)
📄
structs.go
(887 B)
📄
switch.go
(1.13 KB)
📄
zerosize.go
(650 B)
Editing: maps.go
// asmcheck // Copyright 2018 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 codegen // This file contains code generation tests related to the handling of // map types. // ------------------- // // Access Const // // ------------------- // // Direct use of constants in fast map access calls (Issue #19015). func AccessInt1(m map[int]int) int { // amd64:"MOV[LQ]\t[$]5" return m[5] } func AccessInt2(m map[int]int) bool { // amd64:"MOV[LQ]\t[$]5" _, ok := m[5] return ok } func AccessString1(m map[string]int) int { // amd64:`.*"abc"` return m["abc"] } func AccessString2(m map[string]int) bool { // amd64:`.*"abc"` _, ok := m["abc"] return ok } // ------------------- // // String Conversion // // ------------------- // func LookupStringConversionSimple(m map[string]int, bytes []byte) int { // amd64:-`.*runtime\.slicebytetostring\(` return m[string(bytes)] } func LookupStringConversionStructLit(m map[struct{ string }]int, bytes []byte) int { // amd64:-`.*runtime\.slicebytetostring\(` return m[struct{ string }{string(bytes)}] } func LookupStringConversionArrayLit(m map[[2]string]int, bytes []byte) int { // amd64:-`.*runtime\.slicebytetostring\(` return m[[2]string{string(bytes), string(bytes)}] } func LookupStringConversionNestedLit(m map[[1]struct{ s [1]string }]int, bytes []byte) int { // amd64:-`.*runtime\.slicebytetostring\(` return m[[1]struct{ s [1]string }{struct{ s [1]string }{s: [1]string{string(bytes)}}}] } func LookupStringConversionKeyedArrayLit(m map[[2]string]int, bytes []byte) int { // amd64:-`.*runtime\.slicebytetostring\(` return m[[2]string{0: string(bytes)}] } // ------------------- // // Map Clear // // ------------------- // // Optimization of map clear idiom (Issue #20138). func MapClearReflexive(m map[int]int) { // amd64:`.*runtime\.mapclear` // amd64:-`.*runtime\.mapiterinit` for k := range m { delete(m, k) } } func MapClearIndirect(m map[int]int) { s := struct{ m map[int]int }{m: m} // amd64:`.*runtime\.mapclear` // amd64:-`.*runtime\.mapiterinit` for k := range s.m { delete(s.m, k) } } func MapClearPointer(m map[*byte]int) { // amd64:`.*runtime\.mapclear` // amd64:-`.*runtime\.mapiterinit` for k := range m { delete(m, k) } } func MapClearNotReflexive(m map[float64]int) { // amd64:`.*runtime\.mapiterinit` // amd64:-`.*runtime\.mapclear` for k := range m { delete(m, k) } } func MapClearInterface(m map[interface{}]int) { // amd64:`.*runtime\.mapiterinit` // amd64:-`.*runtime\.mapclear` for k := range m { delete(m, k) } } func MapClearSideEffect(m map[int]int) int { k := 0 // amd64:`.*runtime\.mapiterinit` // amd64:-`.*runtime\.mapclear` for k = range m { delete(m, k) } return k } func MapLiteralSizing(x int) (map[int]int, map[int]int) { // amd64:"MOVL\t[$]10," m := map[int]int{ 0: 0, 1: 1, 2: 2, 3: 3, 4: 4, 5: 5, 6: 6, 7: 7, 8: 8, 9: 9, } // amd64:"MOVL\t[$]10," n := map[int]int{ 0: x, 1: x, 2: x, 3: x, 4: x, 5: x, 6: x, 7: x, 8: x, 9: x, } return m, n }
Upload File
Create Folder