You can not select more than 25 topics
Topics must start with a letter or number, can include dashes ('-') and can be up to 35 characters long.
125 lines
2.8 KiB
125 lines
2.8 KiB
4 months ago
|
// 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:"MOVQ\t[$]5"
|
||
|
return m[5]
|
||
|
}
|
||
|
|
||
|
func AccessInt2(m map[int]int) bool {
|
||
|
// amd64:"MOVQ\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
|
||
|
}
|