| // 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 codegen tests related to arithmetic | |
| // simplifications and optimizations on integer types. | |
| // For codegen tests on float types, see floats.go. | |
| // ----------------- // | |
| // Subtraction // | |
| // ----------------- // | |
| func SubMem(arr []int, b int) int { | |
| // 386:`SUBL\s[A-Z]+,\s8\([A-Z]+\)` | |
| arr[2] -= b | |
| // 386:`SUBL\s[A-Z]+,\s12\([A-Z]+\)` | |
| arr[3] -= b | |
| // 386:"SUBL\t4" | |
| // amd64:"SUBQ\t8" | |
| return arr[0] - arr[1] | |
| } | |
| // -------------------- // | |
| // Multiplication // | |
| // -------------------- // | |
| func Pow2Muls(n1, n2 int) (int, int) { | |
| // amd64:"SHLQ\t[$]5",-"IMULQ" | |
| // 386:"SHLL\t[$]5",-"IMULL" | |
| // arm:"SLL\t[$]5",-"MUL" | |
| // arm64:"LSL\t[$]5",-"MUL" | |
| a := n1 * 32 | |
| // amd64:"SHLQ\t[$]6",-"IMULQ" | |
| // 386:"SHLL\t[$]6",-"IMULL" | |
| // arm:"SLL\t[$]6",-"MUL" | |
| // arm64:"LSL\t[$]6",-"MUL" | |
| b := -64 * n2 | |
| return a, b | |
| } | |
| func Mul_96(n int) int { | |
| // amd64:`SHLQ\t[$]5`,`LEAQ\t\(.*\)\(.*\*2\),` | |
| return n * 96 | |
| } | |
| // Multiplications merging tests | |
| func MergeMuls1(n int) int { | |
| // amd64:"IMUL3Q\t[$]46" | |
| // 386:"IMUL3L\t[$]46" | |
| return 15*n + 31*n // 46n | |
| } | |
| func MergeMuls2(n int) int { | |
| // amd64:"IMUL3Q\t[$]23","ADDQ\t[$]29" | |
| // 386:"IMUL3L\t[$]23","ADDL\t[$]29" | |
| return 5*n + 7*(n+1) + 11*(n+2) // 23n + 29 | |
| } | |
| func MergeMuls3(a, n int) int { | |
| // amd64:"ADDQ\t[$]19",-"IMULQ\t[$]19" | |
| // 386:"ADDL\t[$]19",-"IMULL\t[$]19" | |
| return a*n + 19*n // (a+19)n | |
| } | |
| func MergeMuls4(n int) int { | |
| // amd64:"IMUL3Q\t[$]14" | |
| // 386:"IMUL3L\t[$]14" | |
| return 23*n - 9*n // 14n | |
| } | |
| func MergeMuls5(a, n int) int { | |
| // amd64:"ADDQ\t[$]-19",-"IMULQ\t[$]19" | |
| // 386:"ADDL\t[$]-19",-"IMULL\t[$]19" | |
| return a*n - 19*n // (a-19)n | |
| } | |
| // -------------- // | |
| // Division // | |
| // -------------- // | |
| func Pow2Divs(n1 uint, n2 int) (uint, int) { | |
| // 386:"SHRL\t[$]5",-"DIVL" | |
| // amd64:"SHRQ\t[$]5",-"DIVQ" | |
| // arm:"SRL\t[$]5",-".*udiv" | |
| // arm64:"LSR\t[$]5",-"UDIV" | |
| a := n1 / 32 // unsigned | |
| // amd64:"SARQ\t[$]6",-"IDIVQ" | |
| // 386:"SARL\t[$]6",-"IDIVL" | |
| // arm:"SRA\t[$]6",-".*udiv" | |
| // arm64:"ASR\t[$]6",-"SDIV" | |
| b := n2 / 64 // signed | |
| return a, b | |
| } | |
| // Check that constant divisions get turned into MULs | |
| func ConstDivs(n1 uint, n2 int) (uint, int) { | |
| // amd64:"MOVQ\t[$]-1085102592571150095","MULQ",-"DIVQ" | |
| a := n1 / 17 // unsigned | |
| // amd64:"MOVQ\t[$]-1085102592571150095","IMULQ",-"IDIVQ" | |
| b := n2 / 17 // signed | |
| return a, b | |
| } | |
| func Pow2Mods(n1 uint, n2 int) (uint, int) { | |
| // 386:"ANDL\t[$]31",-"DIVL" | |
| // amd64:"ANDQ\t[$]31",-"DIVQ" | |
| // arm:"AND\t[$]31",-".*udiv" | |
| // arm64:"AND\t[$]31",-"UDIV" | |
| a := n1 % 32 // unsigned | |
| // 386:-"IDIVL" | |
| // amd64:-"IDIVQ" | |
| // arm:-".*udiv" | |
| // arm64:-"REM" | |
| b := n2 % 64 // signed | |
| return a, b | |
| } | |
| // Check that constant modulo divs get turned into MULs | |
| func ConstMods(n1 uint, n2 int) (uint, int) { | |
| // amd64:"MOVQ\t[$]-1085102592571150095","MULQ",-"DIVQ" | |
| a := n1 % 17 // unsigned | |
| // amd64:"MOVQ\t[$]-1085102592571150095","IMULQ",-"IDIVQ" | |
| b := n2 % 17 // signed | |
| return a, b | |
| } | |
| // Check that len() and cap() calls divided by powers of two are | |
| // optimized into shifts and ands | |
| func LenDiv1(a []int) int { | |
| // 386:"SHRL\t[$]10" | |
| // amd64:"SHRQ\t[$]10" | |
| return len(a) / 1024 | |
| } | |
| func LenDiv2(s string) int { | |
| // 386:"SHRL\t[$]11" | |
| // amd64:"SHRQ\t[$]11" | |
| return len(s) / (4097 >> 1) | |
| } | |
| func LenMod1(a []int) int { | |
| // 386:"ANDL\t[$]1023" | |
| // amd64:"ANDQ\t[$]1023" | |
| return len(a) % 1024 | |
| } | |
| func LenMod2(s string) int { | |
| // 386:"ANDL\t[$]2047" | |
| // amd64:"ANDQ\t[$]2047" | |
| return len(s) % (4097 >> 1) | |
| } | |
| func CapDiv(a []int) int { | |
| // 386:"SHRL\t[$]12" | |
| // amd64:"SHRQ\t[$]12" | |
| return cap(a) / ((1 << 11) + 2048) | |
| } | |
| func CapMod(a []int) int { | |
| // 386:"ANDL\t[$]4095" | |
| // amd64:"ANDQ\t[$]4095" | |
| return cap(a) % ((1 << 11) + 2048) | |
| } | |
| func AddMul(x int) int { | |
| // amd64:"LEAQ\t1" | |
| return 2*x + 1 | |
| } |