diff options
author | Gabe Black <gblack@eecs.umich.edu> | 2007-09-19 18:25:17 -0700 |
---|---|---|
committer | Gabe Black <gblack@eecs.umich.edu> | 2007-09-19 18:25:17 -0700 |
commit | a54ae9f92b6000e8aaf5e056deaead8725c25a74 (patch) | |
tree | bd8bb93ef344056ab10dd0a7deaf8170a16bc44f /src/arch/x86/isa/insts/arithmetic | |
parent | a1912df3601873c7014c8bc34183b8c3bd168cdc (diff) | |
download | gem5-a54ae9f92b6000e8aaf5e056deaead8725c25a74.tar.xz |
X86: Put in stubs for x87, 64 bit and 128 bit SIMD instruction microcode.
--HG--
rename : src/arch/x86/isa/insts/sse/__init__.py => src/arch/x86/isa/insts/simd128/__init__.py
extra : convert_revision : efb4405aebaa4a04f33572e7d078ceca45872d9c
Diffstat (limited to 'src/arch/x86/isa/insts/arithmetic')
4 files changed, 0 insertions, 1293 deletions
diff --git a/src/arch/x86/isa/insts/arithmetic/__init__.py b/src/arch/x86/isa/insts/arithmetic/__init__.py deleted file mode 100644 index c7e6b8c5f..000000000 --- a/src/arch/x86/isa/insts/arithmetic/__init__.py +++ /dev/null @@ -1,64 +0,0 @@ -# Copyright (c) 2007 The Hewlett-Packard Development Company -# All rights reserved. -# -# Redistribution and use of this software in source and binary forms, -# with or without modification, are permitted provided that the -# following conditions are met: -# -# The software must be used only for Non-Commercial Use which means any -# use which is NOT directed to receiving any direct monetary -# compensation for, or commercial advantage from such use. Illustrative -# examples of non-commercial use are academic research, personal study, -# teaching, education and corporate research & development. -# Illustrative examples of commercial use are distributing products for -# commercial advantage and providing services using the software for -# commercial advantage. -# -# If you wish to use this software or functionality therein that may be -# covered by patents for commercial use, please contact: -# Director of Intellectual Property Licensing -# Office of Strategy and Technology -# Hewlett-Packard Company -# 1501 Page Mill Road -# Palo Alto, California 94304 -# -# Redistributions of source code must retain the above copyright notice, -# this list of conditions and the following disclaimer. Redistributions -# in binary form must reproduce the above copyright notice, this list of -# conditions and the following disclaimer in the documentation and/or -# other materials provided with the distribution. Neither the name of -# the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its -# contributors may be used to endorse or promote products derived from -# this software without specific prior written permission. No right of -# sublicense is granted herewith. Derivatives of the software and -# output created using the software may be prepared, but only for -# Non-Commercial Uses. Derivatives of the software may be shared with -# others provided: (i) the others agree to abide by the list of -# conditions herein which includes the Non-Commercial Use restrictions; -# and (ii) such Derivatives of the software include the above copyright -# notice to acknowledge the contribution from this software where -# applicable, this list of conditions and the disclaimer below. -# -# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -# -# Authors: Gabe Black - -categories = ["add_and_subtract", - "increment_and_decrement", - "multiply_and_divide"] - -microcode = "" -for category in categories: - exec "import %s as cat" % category - microcode += cat.microcode - diff --git a/src/arch/x86/isa/insts/arithmetic/add_and_subtract.py b/src/arch/x86/isa/insts/arithmetic/add_and_subtract.py deleted file mode 100644 index 87fbb796c..000000000 --- a/src/arch/x86/isa/insts/arithmetic/add_and_subtract.py +++ /dev/null @@ -1,300 +0,0 @@ -# Copyright (c) 2007 The Hewlett-Packard Development Company -# All rights reserved. -# -# Redistribution and use of this software in source and binary forms, -# with or without modification, are permitted provided that the -# following conditions are met: -# -# The software must be used only for Non-Commercial Use which means any -# use which is NOT directed to receiving any direct monetary -# compensation for, or commercial advantage from such use. Illustrative -# examples of non-commercial use are academic research, personal study, -# teaching, education and corporate research & development. -# Illustrative examples of commercial use are distributing products for -# commercial advantage and providing services using the software for -# commercial advantage. -# -# If you wish to use this software or functionality therein that may be -# covered by patents for commercial use, please contact: -# Director of Intellectual Property Licensing -# Office of Strategy and Technology -# Hewlett-Packard Company -# 1501 Page Mill Road -# Palo Alto, California 94304 -# -# Redistributions of source code must retain the above copyright notice, -# this list of conditions and the following disclaimer. Redistributions -# in binary form must reproduce the above copyright notice, this list of -# conditions and the following disclaimer in the documentation and/or -# other materials provided with the distribution. Neither the name of -# the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its -# contributors may be used to endorse or promote products derived from -# this software without specific prior written permission. No right of -# sublicense is granted herewith. Derivatives of the software and -# output created using the software may be prepared, but only for -# Non-Commercial Uses. Derivatives of the software may be shared with -# others provided: (i) the others agree to abide by the list of -# conditions herein which includes the Non-Commercial Use restrictions; -# and (ii) such Derivatives of the software include the above copyright -# notice to acknowledge the contribution from this software where -# applicable, this list of conditions and the disclaimer below. -# -# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -# -# Authors: Gabe Black - -microcode = ''' -def macroop ADD_R_R -{ - add reg, reg, regm, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop ADD_R_I -{ - limm t1, imm - add reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop ADD_M_I -{ - limm t2, imm - ld t1, seg, sib, disp - add t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop ADD_P_I -{ - rdip t7 - limm t2, imm - ld t1, seg, riprel, disp - add t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop ADD_M_R -{ - ld t1, seg, sib, disp - add t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop ADD_P_R -{ - rdip t7 - ld t1, seg, riprel, disp - add t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop ADD_R_M -{ - ld t1, seg, sib, disp - add reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop ADD_R_P -{ - rdip t7 - ld t1, seg, riprel, disp - add reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SUB_R_R -{ - sub reg, reg, regm, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SUB_R_I -{ - limm t1, imm - sub reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SUB_R_M -{ - ld t1, seg, sib, disp - sub reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SUB_R_P -{ - rdip t7 - ld t1, seg, riprel, disp - sub reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SUB_M_I -{ - limm t2, imm - ld t1, seg, sib, disp - sub t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop SUB_P_I -{ - rdip t7 - limm t2, imm - ld t1, seg, riprel, disp - sub t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop SUB_M_R -{ - ld t1, seg, sib, disp - sub t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop SUB_P_R -{ - rdip t7 - ld t1, seg, riprel, disp - sub t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop ADC_R_R -{ - adc reg, reg, regm, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop ADC_R_I -{ - limm t1, imm - adc reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop ADC_M_I -{ - limm t2, imm - ld t1, seg, sib, disp - adc t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop ADC_P_I -{ - rdip t7 - limm t2, imm - ld t1, seg, riprel, disp - adc t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop ADC_M_R -{ - ld t1, seg, sib, disp - adc t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop ADC_P_R -{ - rdip t7 - ld t1, seg, riprel, disp - adc t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop ADC_R_M -{ - ld t1, seg, sib, disp - adc reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop ADC_R_P -{ - rdip t7 - ld t1, seg, riprel, disp - adc reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SBB_R_R -{ - sbb reg, reg, regm, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SBB_R_I -{ - limm t1, imm - sbb reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SBB_R_M -{ - ld t1, seg, sib, disp - sbb reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SBB_R_P -{ - rdip t7 - ld t1, seg, riprel, disp - sbb reg, reg, t1, flags=(OF,SF,ZF,AF,PF,CF) -}; - -def macroop SBB_M_I -{ - limm t2, imm - ld t1, seg, sib, disp - sbb t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop SBB_P_I -{ - rdip t7 - limm t2, imm - ld t1, seg, riprel, disp - sbb t1, t1, t2, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop SBB_M_R -{ - ld t1, seg, sib, disp - sbb t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, sib, disp -}; - -def macroop SBB_P_R -{ - rdip t7 - ld t1, seg, riprel, disp - sbb t1, t1, reg, flags=(OF,SF,ZF,AF,PF,CF) - st t1, seg, riprel, disp -}; - -def macroop NEG_R -{ - sub reg, t0, reg, flags=(CF,OF,SF,ZF,AF,PF) -}; - -def macroop NEG_M -{ - ld t1, seg, sib, disp - sub t1, t0, t1, flags=(CF,OF,SF,ZF,AF,PF) - st t1, seg, sib, disp -}; - -def macroop NEG_P -{ - rdip t7 - ld t1, seg, riprel, disp - sub t1, t0, t1, flags=(CF,OF,SF,ZF,AF,PF) - st t1, seg, riprel, disp -}; -''' diff --git a/src/arch/x86/isa/insts/arithmetic/increment_and_decrement.py b/src/arch/x86/isa/insts/arithmetic/increment_and_decrement.py deleted file mode 100644 index 2a8024eee..000000000 --- a/src/arch/x86/isa/insts/arithmetic/increment_and_decrement.py +++ /dev/null @@ -1,96 +0,0 @@ -# Copyright (c) 2007 The Hewlett-Packard Development Company -# All rights reserved. -# -# Redistribution and use of this software in source and binary forms, -# with or without modification, are permitted provided that the -# following conditions are met: -# -# The software must be used only for Non-Commercial Use which means any -# use which is NOT directed to receiving any direct monetary -# compensation for, or commercial advantage from such use. Illustrative -# examples of non-commercial use are academic research, personal study, -# teaching, education and corporate research & development. -# Illustrative examples of commercial use are distributing products for -# commercial advantage and providing services using the software for -# commercial advantage. -# -# If you wish to use this software or functionality therein that may be -# covered by patents for commercial use, please contact: -# Director of Intellectual Property Licensing -# Office of Strategy and Technology -# Hewlett-Packard Company -# 1501 Page Mill Road -# Palo Alto, California 94304 -# -# Redistributions of source code must retain the above copyright notice, -# this list of conditions and the following disclaimer. Redistributions -# in binary form must reproduce the above copyright notice, this list of -# conditions and the following disclaimer in the documentation and/or -# other materials provided with the distribution. Neither the name of -# the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its -# contributors may be used to endorse or promote products derived from -# this software without specific prior written permission. No right of -# sublicense is granted herewith. Derivatives of the software and -# output created using the software may be prepared, but only for -# Non-Commercial Uses. Derivatives of the software may be shared with -# others provided: (i) the others agree to abide by the list of -# conditions herein which includes the Non-Commercial Use restrictions; -# and (ii) such Derivatives of the software include the above copyright -# notice to acknowledge the contribution from this software where -# applicable, this list of conditions and the disclaimer below. -# -# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -# -# Authors: Gabe Black - -microcode = ''' -def macroop INC_R -{ - addi reg, reg, 1, flags=(OF, SF, ZF, AF, PF) -}; - -def macroop INC_M -{ - ld t1, seg, sib, disp - addi t1, t1, 1, flags=(OF, SF, ZF, AF, PF) - st t1, seg, sib, disp -}; - -def macroop INC_P -{ - rdip t7 - ld t1, seg, riprel, disp - addi t1, t1, 1, flags=(OF, SF, ZF, AF, PF) - st t1, seg, riprel, disp -}; - -def macroop DEC_R -{ - subi reg, reg, 1, flags=(OF, SF, ZF, AF, PF) -}; - -def macroop DEC_M -{ - ld t1, seg, sib, disp - subi t1, t1, 1, flags=(OF, SF, ZF, AF, PF) - st t1, seg, sib, disp -}; - -def macroop DEC_P -{ - rdip t7 - ld t1, seg, riprel, disp - subi t1, t1, 1, flags=(OF, SF, ZF, AF, PF) - st t1, seg, riprel, disp -}; -''' diff --git a/src/arch/x86/isa/insts/arithmetic/multiply_and_divide.py b/src/arch/x86/isa/insts/arithmetic/multiply_and_divide.py deleted file mode 100644 index a9b53acac..000000000 --- a/src/arch/x86/isa/insts/arithmetic/multiply_and_divide.py +++ /dev/null @@ -1,833 +0,0 @@ -# Copyright (c) 2007 The Hewlett-Packard Development Company -# All rights reserved. -# -# Redistribution and use of this software in source and binary forms, -# with or without modification, are permitted provided that the -# following conditions are met: -# -# The software must be used only for Non-Commercial Use which means any -# use which is NOT directed to receiving any direct monetary -# compensation for, or commercial advantage from such use. Illustrative -# examples of non-commercial use are academic research, personal study, -# teaching, education and corporate research & development. -# Illustrative examples of commercial use are distributing products for -# commercial advantage and providing services using the software for -# commercial advantage. -# -# If you wish to use this software or functionality therein that may be -# covered by patents for commercial use, please contact: -# Director of Intellectual Property Licensing -# Office of Strategy and Technology -# Hewlett-Packard Company -# 1501 Page Mill Road -# Palo Alto, California 94304 -# -# Redistributions of source code must retain the above copyright notice, -# this list of conditions and the following disclaimer. Redistributions -# in binary form must reproduce the above copyright notice, this list of -# conditions and the following disclaimer in the documentation and/or -# other materials provided with the distribution. Neither the name of -# the COPYRIGHT HOLDER(s), HEWLETT-PACKARD COMPANY, nor the names of its -# contributors may be used to endorse or promote products derived from -# this software without specific prior written permission. No right of -# sublicense is granted herewith. Derivatives of the software and -# output created using the software may be prepared, but only for -# Non-Commercial Uses. Derivatives of the software may be shared with -# others provided: (i) the others agree to abide by the list of -# conditions herein which includes the Non-Commercial Use restrictions; -# and (ii) such Derivatives of the software include the above copyright -# notice to acknowledge the contribution from this software where -# applicable, this list of conditions and the disclaimer below. -# -# THIS SOFTWARE IS PROVIDED BY THE COPYRIGHT HOLDERS AND CONTRIBUTORS -# "AS IS" AND ANY EXPRESS OR IMPLIED WARRANTIES, INCLUDING, BUT NOT -# LIMITED TO, THE IMPLIED WARRANTIES OF MERCHANTABILITY AND FITNESS FOR -# A PARTICULAR PURPOSE ARE DISCLAIMED. IN NO EVENT SHALL THE COPYRIGHT -# OWNER OR CONTRIBUTORS BE LIABLE FOR ANY DIRECT, INDIRECT, INCIDENTAL, -# SPECIAL, EXEMPLARY, OR CONSEQUENTIAL DAMAGES (INCLUDING, BUT NOT -# LIMITED TO, PROCUREMENT OF SUBSTITUTE GOODS OR SERVICES; LOSS OF USE, -# DATA, OR PROFITS; OR BUSINESS INTERRUPTION) HOWEVER CAUSED AND ON ANY -# THEORY OF LIABILITY, WHETHER IN CONTRACT, STRICT LIABILITY, OR TORT -# (INCLUDING NEGLIGENCE OR OTHERWISE) ARISING IN ANY WAY OUT OF THE USE -# OF THIS SOFTWARE, EVEN IF ADVISED OF THE POSSIBILITY OF SUCH DAMAGE. -# -# Authors: Gabe Black - -microcode = ''' - -# -# Byte version of one operand unsigned multiply. -# - -def macroop MUL_B_R -{ - mul1u rax, reg - mulel rax - # Really ah - muleh rsi, flags=(OF,CF) -}; - -def macroop MUL_B_M -{ - ld t1, seg, sib, disp - mul1u rax, t1 - mulel rax - # Really ah - muleh rsi, flags=(OF,CF) -}; - -def macroop MUL_B_P -{ - rdip t7 - ld t1, seg, riprel, disp - mul1u rax, t1 - mulel rax - # Really ah - muleh rsi, flags=(OF,CF) -}; - -# -# One operand unsigned multiply. -# - -def macroop MUL_R -{ - mul1u rax, reg - mulel rax - muleh rdx, flags=(OF,CF) -}; - -def macroop MUL_M -{ - ld t1, seg, sib, disp - mul1u rax, t1 - mulel rax - muleh rdx, flags=(OF,CF) -}; - -def macroop MUL_P -{ - rdip t7 - ld t1, seg, riprel, disp - mul1u rax, t1 - mulel rax - muleh rdx, flags=(OF,CF) -}; - -# -# Byte version of one operand signed multiply. -# - -def macroop IMUL_B_R -{ - mul1s rax, reg - mulel rax - # Really ah - muleh rsi, flags=(OF,CF) -}; - -def macroop IMUL_B_M -{ - ld t1, seg, sib, disp - mul1s rax, t1 - mulel rax - # Really ah - muleh rsi, flags=(OF,CF) -}; - -def macroop IMUL_B_P -{ - rdip t7 - ld t1, seg, riprel, disp - mul1s rax, t1 - mulel rax - # Really ah - muleh rsi, flags=(OF,CF) -}; - -# -# One operand signed multiply. -# - -def macroop IMUL_R -{ - mul1s rax, reg - mulel rax - muleh rdx, flags=(OF,CF) -}; - -def macroop IMUL_M -{ - ld t1, seg, sib, disp - mul1s rax, t1 - mulel rax - muleh rdx, flags=(OF,CF) -}; - -def macroop IMUL_P -{ - rdip t7 - ld t1, seg, riprel, disp - mul1s rax, t1 - mulel rax - muleh rdx, flags=(OF,CF) -}; - -def macroop IMUL_R_R -{ - mul1s reg, regm - mulel reg - muleh t0, flags=(CF,OF) -}; - -def macroop IMUL_R_M -{ - ld t1, seg, sib, disp - mul1s reg, t1 - mulel reg - muleh t0, flags=(CF,OF) -}; - -def macroop IMUL_R_P -{ - rdip t7 - ld t1, seg, riprel, disp - mul1s reg, t1 - mulel reg - muleh t0, flags=(CF,OF) -}; - -# -# Three operand signed multiply. -# - -def macroop IMUL_R_R_I -{ - limm t1, imm - mul1s regm, t1 - mulel reg - muleh t0, flags=(OF,CF) -}; - -def macroop IMUL_R_M_I -{ - limm t1, imm - ld t2, seg, sib, disp - mul1s t2, t1 - mulel reg - muleh t0, flags=(OF,CF) -}; - -def macroop IMUL_R_P_I -{ - rdip t7 - limm t1, imm - ld t2, seg, riprel - mul1s t2, t1 - mulel reg - muleh t0, flags=(OF,CF) -}; - -# -# One byte version of unsigned division -# - -def macroop DIV_B_R -{ - # Do the initial part of the division - div1 rsi, reg, dataSize=1 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t1, rax, 8, dataSize=1 - div2 t1, rax, t1, dataSize=1 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t1, rax, t1, dataSize=1 - div2 t1, rax, t1, flags=(EZF,), dataSize=1 - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq rax, dataSize=1 - divr rsi, dataSize=1 -}; - -def macroop DIV_B_M -{ - ld t2, seg, sib, disp - - # Do the initial part of the division - div1 rsi, t2, dataSize=1 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t1, rax, 8, dataSize=1 - div2 t1, rax, t1, dataSize=1 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t1, rax, t1, dataSize=1 - div2 t1, rax, t1, flags=(EZF,), dataSize=1 - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq rax, dataSize=1 - divr rsi, dataSize=1 -}; - -def macroop DIV_B_P -{ - rdip t7 - ld t2, seg, riprel, disp - - # Do the initial part of the division - div1 rsi, t2, dataSize=1 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t1, rax, 8, dataSize=1 - div2 t1, rax, t1, dataSize=1 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t1, rax, t1, dataSize=1 - div2 t1, rax, t1, flags=(EZF,), dataSize=1 - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq rax, dataSize=1 - divr rsi, dataSize=1 -}; - -# -# Unsigned division -# - -def macroop DIV_R -{ - # Do the initial part of the division - div1 rdx, reg - - #These are split out so we can initialize the number of bits in the - #second register - div2i t1, rax, "env.dataSize * 8" - div2 t1, rax, t1 - - #Loop until we're out of bits to shift in - #The amount of unrolling here could stand some tuning -divLoopTop: - div2 t1, rax, t1 - div2 t1, rax, t1 - div2 t1, rax, t1 - div2 t1, rax, t1, flags=(EZF,) - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq rax - divr rdx -}; - -def macroop DIV_M -{ - ld t2, seg, sib, disp - - # Do the initial part of the division - div1 rdx, t2 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t1, rax, "env.dataSize * 8" - div2 t1, rax, t1 - - #Loop until we're out of bits to shift in - #The amount of unrolling here could stand some tuning -divLoopTop: - div2 t1, rax, t1 - div2 t1, rax, t1 - div2 t1, rax, t1 - div2 t1, rax, t1, flags=(EZF,) - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq rax - divr rdx -}; - -def macroop DIV_P -{ - rdip t7 - ld t2, seg, riprel, disp - - # Do the initial part of the division - div1 rdx, t2 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t1, rax, "env.dataSize * 8" - div2 t1, rax, t1 - - #Loop until we're out of bits to shift in - #The amount of unrolling here could stand some tuning -divLoopTop: - div2 t1, rax, t1 - div2 t1, rax, t1 - div2 t1, rax, t1 - div2 t1, rax, t1, flags=(EZF,) - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq rax - divr rdx -}; - -# -# One byte version of signed division -# - -def macroop IDIV_B_R -{ - # Negate dividend - sub t1, t0, rax, flags=(ECF,), dataSize=1 - ruflag t4, 3 - sub t2, t0, rsi, dataSize=1 - sub t2, t2, t4 - - #Find the sign of the divisor - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, reg, 1, flags=(ECF,), dataSize=1 - - # Negate divisor - sub t3, t0, reg, dataSize=1 - # Put the divisor's absolute value into t3 - mov t3, t3, reg, flags=(nCECF,), dataSize=1 - - #Find the sign of the dividend - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, rsi, 1, flags=(ECF,), dataSize=1 - - # Put the dividend's absolute value into t1 and t2 - mov t1, t1, rax, flags=(nCECF,), dataSize=1 - mov t2, t2, rsi, flags=(nCECF,), dataSize=1 - - # Do the initial part of the division - div1 t2, t3, dataSize=1 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t4, t1, 8, dataSize=1 - div2 t4, t1, t4, dataSize=1 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t4, t1, t4, dataSize=1 - div2 t4, t1, t4, flags=(EZF,), dataSize=1 - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq t5, dataSize=1 - divr t6, dataSize=1 - - # Fix up signs. The sign of the dividend is still lying around in ECF. - # The sign of the remainder, ah, is the same as the dividend. The sign - # of the quotient is negated if the signs of the divisor and dividend - # were different. - - # Negate the remainder - sub t4, t0, t6, dataSize=1 - # If the dividend was negitive, put the negated remainder in rsi. - mov rsi, rsi, t4, (CECF,), dataSize=1 - # Otherwise put the regular remainder in rsi. - mov rsi, rsi, t6, (nCECF,), dataSize=1 - - # Negate the quotient. - sub t4, t0, t5, dataSize=1 - # If the dividend was negative, start using the negated quotient - mov t5, t5, t4, (CECF,), dataSize=1 - - # Check the sign of the divisor - slli t0, t3, 1, flags=(ECF,), dataSize=1 - - # Negate the (possibly already negated) quotient - sub t4, t0, t5, dataSize=1 - # If the divisor was negative, put the negated quotient in rax. - mov rax, rax, t4, (CECF,), dataSize=1 - # Otherwise put the one that wasn't negated (at least here) in rax. - mov rax, rax, t5, (nCECF,), dataSize=1 -}; - -def macroop IDIV_B_M -{ - # Negate dividend - sub t1, t0, rax, flags=(ECF,), dataSize=1 - ruflag t4, 3 - sub t2, t0, rsi, dataSize=1 - sub t2, t2, t4 - - ld t3, seg, sib, disp - - #Find the sign of the divisor - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, t3, 1, flags=(ECF,), dataSize=1 - - # Negate divisor - sub t4, t0, t3, dataSize=1 - # Put the divisor's absolute value into t3 - mov t3, t3, t4, flags=(CECF,), dataSize=1 - - #Find the sign of the dividend - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, rsi, 1, flags=(ECF,), dataSize=1 - - # Put the dividend's absolute value into t1 and t2 - mov t1, t1, rax, flags=(nCECF,), dataSize=1 - mov t2, t2, rsi, flags=(nCECF,), dataSize=1 - - # Do the initial part of the division - div1 t2, t3, dataSize=1 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t4, t1, 8, dataSize=1 - div2 t4, t1, t4, dataSize=1 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t4, t1, t4, dataSize=1 - div2 t4, t1, t4, flags=(EZF,), dataSize=1 - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq t5, dataSize=1 - divr t6, dataSize=1 - - # Fix up signs. The sign of the dividend is still lying around in ECF. - # The sign of the remainder, ah, is the same as the dividend. The sign - # of the quotient is negated if the signs of the divisor and dividend - # were different. - - # Negate the remainder - sub t4, t0, t6, dataSize=1 - # If the dividend was negitive, put the negated remainder in rsi. - mov rsi, rsi, t4, (CECF,), dataSize=1 - # Otherwise put the regular remainder in rsi. - mov rsi, rsi, t6, (nCECF,), dataSize=1 - - # Negate the quotient. - sub t4, t0, t5, dataSize=1 - # If the dividend was negative, start using the negated quotient - mov t5, t5, t4, (CECF,), dataSize=1 - - # Check the sign of the divisor - slli t0, t3, 1, flags=(ECF,), dataSize=1 - - # Negate the (possibly already negated) quotient - sub t4, t0, t5, dataSize=1 - # If the divisor was negative, put the negated quotient in rax. - mov rax, rax, t4, (CECF,), dataSize=1 - # Otherwise put the one that wasn't negated (at least here) in rax. - mov rax, rax, t5, (nCECF,), dataSize=1 -}; - -def macroop IDIV_B_P -{ - # Negate dividend - sub t1, t0, rax, flags=(ECF,), dataSize=1 - ruflag t4, 3 - sub t2, t0, rsi, dataSize=1 - sub t2, t2, t4 - - rdip t7 - ld t3, seg, riprel, disp - - #Find the sign of the divisor - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, t3, 1, flags=(ECF,), dataSize=1 - - # Negate divisor - sub t4, t0, t3, dataSize=1 - # Put the divisor's absolute value into t3 - mov t3, t3, t4, flags=(CECF,), dataSize=1 - - #Find the sign of the dividend - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, rsi, 1, flags=(ECF,), dataSize=1 - - # Put the dividend's absolute value into t1 and t2 - mov t1, t1, rax, flags=(nCECF,), dataSize=1 - mov t2, t2, rsi, flags=(nCECF,), dataSize=1 - - # Do the initial part of the division - div1 t2, t3, dataSize=1 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t4, t1, 8, dataSize=1 - div2 t4, t1, t4, dataSize=1 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t4, t1, t4, dataSize=1 - div2 t4, t1, t4, flags=(EZF,), dataSize=1 - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq t5, dataSize=1 - divr t6, dataSize=1 - - # Fix up signs. The sign of the dividend is still lying around in ECF. - # The sign of the remainder, ah, is the same as the dividend. The sign - # of the quotient is negated if the signs of the divisor and dividend - # were different. - - # Negate the remainder - sub t4, t0, t6, dataSize=1 - # If the dividend was negitive, put the negated remainder in rsi. - mov rsi, rsi, t4, (CECF,), dataSize=1 - # Otherwise put the regular remainder in rsi. - mov rsi, rsi, t6, (nCECF,), dataSize=1 - - # Negate the quotient. - sub t4, t0, t5, dataSize=1 - # If the dividend was negative, start using the negated quotient - mov t5, t5, t4, (CECF,), dataSize=1 - - # Check the sign of the divisor - slli t0, t3, 1, flags=(ECF,), dataSize=1 - - # Negate the (possibly already negated) quotient - sub t4, t0, t5, dataSize=1 - # If the divisor was negative, put the negated quotient in rax. - mov rax, rax, t4, (CECF,), dataSize=1 - # Otherwise put the one that wasn't negated (at least here) in rax. - mov rax, rax, t5, (nCECF,), dataSize=1 -}; - -# -# Signed division -# - -def macroop IDIV_R -{ - # Negate dividend - sub t1, t0, rax, flags=(ECF,) - ruflag t4, 3 - sub t2, t0, rdx - sub t2, t2, t4 - - #Find the sign of the divisor - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, reg, 1, flags=(ECF,) - - # Negate divisor - sub t3, t0, reg - # Put the divisor's absolute value into t3 - mov t3, t3, reg, flags=(nCECF,) - - #Find the sign of the dividend - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, rdx, 1, flags=(ECF,) - - # Put the dividend's absolute value into t1 and t2 - mov t1, t1, rax, flags=(nCECF,) - mov t2, t2, rdx, flags=(nCECF,) - - # Do the initial part of the division - div1 t2, t3 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t4, t1, "env.dataSize * 8" - div2 t4, t1, t4 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t4, t1, t4 - div2 t4, t1, t4 - div2 t4, t1, t4 - div2 t4, t1, t4, flags=(EZF,) - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq t5 - divr t6 - - # Fix up signs. The sign of the dividend is still lying around in ECF. - # The sign of the remainder, ah, is the same as the dividend. The sign - # of the quotient is negated if the signs of the divisor and dividend - # were different. - - # Negate the remainder - sub t4, t0, t6 - # If the dividend was negitive, put the negated remainder in rdx. - mov rdx, rdx, t4, (CECF,) - # Otherwise put the regular remainder in rdx. - mov rdx, rdx, t6, (nCECF,) - - # Negate the quotient. - sub t4, t0, t5 - # If the dividend was negative, start using the negated quotient - mov t5, t5, t4, (CECF,) - - # Check the sign of the divisor - slli t0, t3, 1, flags=(ECF,) - - # Negate the (possibly already negated) quotient - sub t4, t0, t5 - # If the divisor was negative, put the negated quotient in rax. - mov rax, rax, t4, (CECF,) - # Otherwise put the one that wasn't negated (at least here) in rax. - mov rax, rax, t5, (nCECF,) -}; - -def macroop IDIV_M -{ - # Negate dividend - sub t1, t0, rax, flags=(ECF,) - ruflag t4, 3 - sub t2, t0, rdx - sub t2, t2, t4 - - ld t3, seg, sib, disp - - #Find the sign of the divisor - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, t3, 1, flags=(ECF,) - - # Negate divisor - sub t4, t0, t3 - # Put the divisor's absolute value into t3 - mov t3, t3, t4, flags=(CECF,) - - #Find the sign of the dividend - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, rdx, 1, flags=(ECF,) - - # Put the dividend's absolute value into t1 and t2 - mov t1, t1, rax, flags=(nCECF,) - mov t2, t2, rdx, flags=(nCECF,) - - # Do the initial part of the division - div1 t2, t3 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t4, t1, "env.dataSize * 8" - div2 t4, t1, t4 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t4, t1, t4 - div2 t4, t1, t4 - div2 t4, t1, t4 - div2 t4, t1, t4, flags=(EZF,) - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq t5 - divr t6 - - # Fix up signs. The sign of the dividend is still lying around in ECF. - # The sign of the remainder, ah, is the same as the dividend. The sign - # of the quotient is negated if the signs of the divisor and dividend - # were different. - - # Negate the remainder - sub t4, t0, t6 - # If the dividend was negitive, put the negated remainder in rdx. - mov rdx, rdx, t4, (CECF,) - # Otherwise put the regular remainder in rdx. - mov rdx, rdx, t6, (nCECF,) - - # Negate the quotient. - sub t4, t0, t5 - # If the dividend was negative, start using the negated quotient - mov t5, t5, t4, (CECF,) - - # Check the sign of the divisor - slli t0, t3, 1, flags=(ECF,) - - # Negate the (possibly already negated) quotient - sub t4, t0, t5 - # If the divisor was negative, put the negated quotient in rax. - mov rax, rax, t4, (CECF,) - # Otherwise put the one that wasn't negated (at least here) in rax. - mov rax, rax, t5, (nCECF,) -}; - -def macroop IDIV_P -{ - # Negate dividend - sub t1, t0, rax, flags=(ECF,) - ruflag t4, 3 - sub t2, t0, rdx - sub t2, t2, t4 - - rdip t7 - ld t3, seg, riprel, disp - - #Find the sign of the divisor - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, t3, 1, flags=(ECF,) - - # Negate divisor - sub t4, t0, t3 - # Put the divisor's absolute value into t3 - mov t3, t3, t4, flags=(CECF,) - - #Find the sign of the dividend - #FIXME!!! This depends on shifts setting the carry flag correctly. - slli t0, rdx, 1, flags=(ECF,) - - # Put the dividend's absolute value into t1 and t2 - mov t1, t1, rax, flags=(nCECF,) - mov t2, t2, rdx, flags=(nCECF,) - - # Do the initial part of the division - div1 t2, t3 - - #These are split out so we can initialize the number of bits in the - #second register - div2i t4, t1, "env.dataSize * 8" - div2 t4, t1, t4 - - #Loop until we're out of bits to shift in -divLoopTop: - div2 t4, t1, t4 - div2 t4, t1, t4 - div2 t4, t1, t4 - div2 t4, t1, t4, flags=(EZF,) - bri t0, label("divLoopTop"), flags=(nCEZF,) - - #Unload the answer - divq t5 - divr t6 - - # Fix up signs. The sign of the dividend is still lying around in ECF. - # The sign of the remainder, ah, is the same as the dividend. The sign - # of the quotient is negated if the signs of the divisor and dividend - # were different. - - # Negate the remainder - sub t4, t0, t6 - # If the dividend was negitive, put the negated remainder in rdx. - mov rdx, rdx, t4, (CECF,) - # Otherwise put the regular remainder in rdx. - mov rdx, rdx, t6, (nCECF,) - - # Negate the quotient. - sub t4, t0, t5 - # If the dividend was negative, start using the negated quotient - mov t5, t5, t4, (CECF,) - - # Check the sign of the divisor - slli t0, t3, 1, flags=(ECF,) - - # Negate the (possibly already negated) quotient - sub t4, t0, t5 - # If the divisor was negative, put the negated quotient in rax. - mov rax, rax, t4, (CECF,) - # Otherwise put the one that wasn't negated (at least here) in rax. - mov rax, rax, t5, (nCECF,) -}; -''' |