2007-03-15 20:16:38 +01:00
|
|
|
/*
|
|
|
|
* 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
|
|
|
|
*/
|
|
|
|
|
|
|
|
#include "arch/x86/predecoder.hh"
|
|
|
|
#include "base/misc.hh"
|
|
|
|
#include "base/trace.hh"
|
|
|
|
#include "sim/host.hh"
|
|
|
|
|
|
|
|
namespace X86ISA
|
|
|
|
{
|
2007-05-31 15:50:35 +02:00
|
|
|
void Predecoder::reset()
|
|
|
|
{
|
|
|
|
origPC = basePC + offset;
|
|
|
|
DPRINTF(Predecoder, "Setting origPC to %#x\n", origPC);
|
2007-06-12 18:46:04 +02:00
|
|
|
emi.rex = 0;
|
|
|
|
emi.legacy = 0;
|
2007-05-31 15:50:35 +02:00
|
|
|
emi.opcode.num = 0;
|
|
|
|
|
|
|
|
immediateCollected = 0;
|
|
|
|
emi.immediate = 0;
|
|
|
|
displacementCollected = 0;
|
|
|
|
emi.displacement = 0;
|
|
|
|
|
|
|
|
emi.modRM = 0;
|
|
|
|
emi.sib = 0;
|
2007-06-14 15:50:58 +02:00
|
|
|
emi.mode = 0;
|
2007-05-31 15:50:35 +02:00
|
|
|
}
|
|
|
|
|
2007-03-15 20:16:38 +01:00
|
|
|
void Predecoder::process()
|
|
|
|
{
|
|
|
|
//This function drives the predecoder state machine.
|
|
|
|
|
|
|
|
//Some sanity checks. You shouldn't try to process more bytes if
|
|
|
|
//there aren't any, and you shouldn't overwrite an already
|
|
|
|
//predecoder ExtMachInst.
|
|
|
|
assert(!outOfBytes);
|
|
|
|
assert(!emiIsReady);
|
|
|
|
|
|
|
|
//While there's still something to do...
|
|
|
|
while(!emiIsReady && !outOfBytes)
|
|
|
|
{
|
|
|
|
uint8_t nextByte = getNextByte();
|
|
|
|
switch(state)
|
|
|
|
{
|
2007-05-31 15:50:35 +02:00
|
|
|
case ResetState:
|
|
|
|
reset();
|
|
|
|
state = PrefixState;
|
2007-03-21 20:19:53 +01:00
|
|
|
case PrefixState:
|
2007-03-15 20:16:38 +01:00
|
|
|
state = doPrefixState(nextByte);
|
|
|
|
break;
|
2007-03-21 20:19:53 +01:00
|
|
|
case OpcodeState:
|
2007-03-15 20:16:38 +01:00
|
|
|
state = doOpcodeState(nextByte);
|
|
|
|
break;
|
2007-03-21 20:19:53 +01:00
|
|
|
case ModRMState:
|
2007-03-15 20:16:38 +01:00
|
|
|
state = doModRMState(nextByte);
|
|
|
|
break;
|
2007-03-21 20:19:53 +01:00
|
|
|
case SIBState:
|
2007-03-15 20:16:38 +01:00
|
|
|
state = doSIBState(nextByte);
|
|
|
|
break;
|
2007-03-21 20:19:53 +01:00
|
|
|
case DisplacementState:
|
2007-03-15 20:16:38 +01:00
|
|
|
state = doDisplacementState();
|
|
|
|
break;
|
2007-03-21 20:19:53 +01:00
|
|
|
case ImmediateState:
|
2007-03-15 20:16:38 +01:00
|
|
|
state = doImmediateState();
|
|
|
|
break;
|
|
|
|
case ErrorState:
|
|
|
|
panic("Went to the error state in the predecoder.\n");
|
|
|
|
default:
|
|
|
|
panic("Unrecognized state! %d\n", state);
|
|
|
|
}
|
|
|
|
}
|
|
|
|
}
|
|
|
|
|
|
|
|
//Either get a prefix and record it in the ExtMachInst, or send the
|
|
|
|
//state machine on to get the opcode(s).
|
|
|
|
Predecoder::State Predecoder::doPrefixState(uint8_t nextByte)
|
|
|
|
{
|
|
|
|
uint8_t prefix = Prefixes[nextByte];
|
2007-03-21 20:19:53 +01:00
|
|
|
State nextState = PrefixState;
|
2007-03-15 20:16:38 +01:00
|
|
|
if(prefix)
|
|
|
|
consumeByte();
|
|
|
|
switch(prefix)
|
|
|
|
{
|
|
|
|
//Operand size override prefixes
|
|
|
|
case OperandSizeOverride:
|
|
|
|
DPRINTF(Predecoder, "Found operand size override prefix.\n");
|
2007-04-06 17:19:23 +02:00
|
|
|
emi.legacy.op = true;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
case AddressSizeOverride:
|
|
|
|
DPRINTF(Predecoder, "Found address size override prefix.\n");
|
2007-04-06 17:19:23 +02:00
|
|
|
emi.legacy.addr = true;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
//Segment override prefixes
|
|
|
|
case CSOverride:
|
|
|
|
case DSOverride:
|
|
|
|
case ESOverride:
|
|
|
|
case FSOverride:
|
|
|
|
case GSOverride:
|
|
|
|
case SSOverride:
|
2007-04-06 17:19:23 +02:00
|
|
|
DPRINTF(Predecoder, "Found segment override.\n");
|
|
|
|
emi.legacy.seg = prefix;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
case Lock:
|
|
|
|
DPRINTF(Predecoder, "Found lock prefix.\n");
|
2007-04-06 17:19:23 +02:00
|
|
|
emi.legacy.lock = true;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
case Rep:
|
|
|
|
DPRINTF(Predecoder, "Found rep prefix.\n");
|
2007-04-06 17:19:23 +02:00
|
|
|
emi.legacy.rep = true;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
case Repne:
|
|
|
|
DPRINTF(Predecoder, "Found repne prefix.\n");
|
2007-04-06 17:19:23 +02:00
|
|
|
emi.legacy.repne = true;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
2007-03-21 20:19:53 +01:00
|
|
|
case RexPrefix:
|
2007-03-15 20:16:38 +01:00
|
|
|
DPRINTF(Predecoder, "Found Rex prefix %#x.\n", nextByte);
|
2007-03-21 20:19:53 +01:00
|
|
|
emi.rex = nextByte;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
case 0:
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = OpcodeState;
|
2007-03-15 20:16:38 +01:00
|
|
|
break;
|
|
|
|
default:
|
|
|
|
panic("Unrecognized prefix %#x\n", nextByte);
|
|
|
|
}
|
|
|
|
return nextState;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Load all the opcodes (currently up to 2) and then figure out
|
|
|
|
//what immediate and/or ModRM is needed.
|
|
|
|
Predecoder::State Predecoder::doOpcodeState(uint8_t nextByte)
|
|
|
|
{
|
|
|
|
State nextState = ErrorState;
|
2007-03-21 20:19:53 +01:00
|
|
|
emi.opcode.num++;
|
2007-03-15 20:16:38 +01:00
|
|
|
//We can't handle 3+ byte opcodes right now
|
2007-03-21 20:19:53 +01:00
|
|
|
assert(emi.opcode.num < 3);
|
2007-03-15 20:16:38 +01:00
|
|
|
consumeByte();
|
2007-03-21 20:19:53 +01:00
|
|
|
if(emi.opcode.num == 1 && nextByte == 0x0f)
|
2007-03-15 20:16:38 +01:00
|
|
|
{
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = OpcodeState;
|
2007-03-15 20:16:38 +01:00
|
|
|
DPRINTF(Predecoder, "Found two byte opcode.\n");
|
2007-03-21 20:19:53 +01:00
|
|
|
emi.opcode.prefixA = nextByte;
|
|
|
|
}
|
|
|
|
else if(emi.opcode.num == 2 &&
|
|
|
|
(nextByte == 0x0f ||
|
|
|
|
(nextByte & 0xf8) == 0x38))
|
|
|
|
{
|
|
|
|
panic("Three byte opcodes aren't yet supported!\n");
|
|
|
|
nextState = OpcodeState;
|
|
|
|
DPRINTF(Predecoder, "Found three byte opcode.\n");
|
|
|
|
emi.opcode.prefixB = nextByte;
|
2007-03-15 20:16:38 +01:00
|
|
|
}
|
|
|
|
else
|
|
|
|
{
|
|
|
|
DPRINTF(Predecoder, "Found opcode %#x.\n", nextByte);
|
2007-03-21 20:19:53 +01:00
|
|
|
emi.opcode.op = nextByte;
|
2007-03-15 20:16:38 +01:00
|
|
|
|
2007-04-06 17:19:23 +02:00
|
|
|
//Figure out the effective operand size. This can be overriden to
|
|
|
|
//a fixed value at the decoder level.
|
2007-06-13 22:09:03 +02:00
|
|
|
int logOpSize;
|
2007-04-06 17:19:23 +02:00
|
|
|
if(/*FIXME long mode*/1)
|
|
|
|
{
|
2007-06-13 22:09:03 +02:00
|
|
|
if(emi.rex.w)
|
|
|
|
logOpSize = 3; // 64 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
else if(emi.legacy.op)
|
2007-06-13 22:09:03 +02:00
|
|
|
logOpSize = 1; // 16 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
else
|
2007-06-13 22:09:03 +02:00
|
|
|
logOpSize = 2; // 32 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
}
|
|
|
|
else if(/*FIXME default 32*/1)
|
|
|
|
{
|
|
|
|
if(emi.legacy.op)
|
2007-06-13 22:09:03 +02:00
|
|
|
logOpSize = 1; // 16 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
else
|
2007-06-13 22:09:03 +02:00
|
|
|
logOpSize = 2; // 32 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
}
|
|
|
|
else // 16 bit default operand size
|
|
|
|
{
|
|
|
|
if(emi.legacy.op)
|
2007-06-13 22:09:03 +02:00
|
|
|
logOpSize = 2; // 32 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
else
|
2007-06-13 22:09:03 +02:00
|
|
|
logOpSize = 1; // 16 bit operand size
|
2007-04-06 17:19:23 +02:00
|
|
|
}
|
|
|
|
|
2007-07-18 05:54:55 +02:00
|
|
|
//Set the actual op size
|
|
|
|
emi.opSize = 1 << logOpSize;
|
|
|
|
|
|
|
|
//Figure out the effective address size. This can be overriden to
|
|
|
|
//a fixed value at the decoder level.
|
|
|
|
int logAddrSize;
|
|
|
|
if(/*FIXME 64-bit mode*/1)
|
|
|
|
{
|
|
|
|
if(emi.legacy.addr)
|
|
|
|
logAddrSize = 2; // 32 bit address size
|
|
|
|
else
|
|
|
|
logAddrSize = 3; // 64 bit address size
|
|
|
|
}
|
|
|
|
else if(/*FIXME default 32*/1)
|
|
|
|
{
|
|
|
|
if(emi.legacy.addr)
|
|
|
|
logAddrSize = 1; // 16 bit address size
|
|
|
|
else
|
|
|
|
logAddrSize = 2; // 32 bit address size
|
|
|
|
}
|
|
|
|
else // 16 bit default operand size
|
|
|
|
{
|
|
|
|
if(emi.legacy.addr)
|
|
|
|
logAddrSize = 2; // 32 bit address size
|
|
|
|
else
|
|
|
|
logAddrSize = 1; // 16 bit address size
|
|
|
|
}
|
|
|
|
|
|
|
|
//Set the actual address size
|
|
|
|
emi.addrSize = 1 << logAddrSize;
|
|
|
|
|
2007-03-15 20:16:38 +01:00
|
|
|
//Figure out how big of an immediate we'll retreive based
|
|
|
|
//on the opcode.
|
2007-04-06 17:19:23 +02:00
|
|
|
int immType = ImmediateType[emi.opcode.num - 1][nextByte];
|
2007-06-13 22:09:03 +02:00
|
|
|
immediateSize = SizeTypeToSize[logOpSize - 1][immType];
|
|
|
|
|
2007-03-15 20:16:38 +01:00
|
|
|
//Determine what to expect next
|
2007-03-21 20:19:53 +01:00
|
|
|
if (UsesModRM[emi.opcode.num - 1][nextByte]) {
|
|
|
|
nextState = ModRMState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else {
|
2007-04-03 16:56:24 +02:00
|
|
|
if(immediateSize) {
|
|
|
|
nextState = ImmediateState;
|
|
|
|
} else {
|
|
|
|
emiIsReady = true;
|
2007-05-31 15:50:35 +02:00
|
|
|
nextState = ResetState;
|
2007-04-03 16:56:24 +02:00
|
|
|
}
|
2007-03-15 20:16:38 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
return nextState;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Get the ModRM byte and determine what displacement, if any, there is.
|
|
|
|
//Also determine whether or not to get the SIB byte, displacement, or
|
|
|
|
//immediate next.
|
|
|
|
Predecoder::State Predecoder::doModRMState(uint8_t nextByte)
|
|
|
|
{
|
|
|
|
State nextState = ErrorState;
|
2007-06-20 17:02:50 +02:00
|
|
|
ModRM modRM;
|
|
|
|
modRM = nextByte;
|
2007-03-15 20:16:38 +01:00
|
|
|
DPRINTF(Predecoder, "Found modrm byte %#x.\n", nextByte);
|
|
|
|
if (0) {//FIXME in 16 bit mode
|
|
|
|
//figure out 16 bit displacement size
|
2007-06-20 17:02:50 +02:00
|
|
|
if(modRM.mod == 0 && modRM.rm == 6 || modRM.mod == 2)
|
2007-03-15 20:16:38 +01:00
|
|
|
displacementSize = 2;
|
2007-06-20 17:02:50 +02:00
|
|
|
else if(modRM.mod == 1)
|
2007-03-15 20:16:38 +01:00
|
|
|
displacementSize = 1;
|
|
|
|
else
|
|
|
|
displacementSize = 0;
|
|
|
|
} else {
|
|
|
|
//figure out 32/64 bit displacement size
|
2007-07-20 23:57:34 +02:00
|
|
|
if(modRM.mod == 0 && modRM.rm == 5 || modRM.mod == 2)
|
2007-03-15 20:16:38 +01:00
|
|
|
displacementSize = 4;
|
2007-06-20 17:02:50 +02:00
|
|
|
else if(modRM.mod == 1)
|
2007-04-03 16:56:24 +02:00
|
|
|
displacementSize = 1;
|
2007-03-15 20:16:38 +01:00
|
|
|
else
|
|
|
|
displacementSize = 0;
|
|
|
|
}
|
|
|
|
//If there's an SIB, get that next.
|
|
|
|
//There is no SIB in 16 bit mode.
|
2007-06-20 17:02:50 +02:00
|
|
|
if(modRM.rm == 4 && modRM.mod != 3) {
|
2007-03-15 20:16:38 +01:00
|
|
|
// && in 32/64 bit mode)
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = SIBState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else if(displacementSize) {
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = DisplacementState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else if(immediateSize) {
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = ImmediateState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else {
|
|
|
|
emiIsReady = true;
|
2007-05-31 15:50:35 +02:00
|
|
|
nextState = ResetState;
|
2007-03-15 20:16:38 +01:00
|
|
|
}
|
|
|
|
//The ModRM byte is consumed no matter what
|
|
|
|
consumeByte();
|
2007-06-20 17:02:50 +02:00
|
|
|
emi.modRM = modRM;
|
2007-03-15 20:16:38 +01:00
|
|
|
return nextState;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Get the SIB byte. We don't do anything with it at this point, other
|
|
|
|
//than storing it in the ExtMachInst. Determine if we need to get a
|
|
|
|
//displacement or immediate next.
|
|
|
|
Predecoder::State Predecoder::doSIBState(uint8_t nextByte)
|
|
|
|
{
|
|
|
|
State nextState = ErrorState;
|
2007-03-21 20:19:53 +01:00
|
|
|
emi.sib = nextByte;
|
2007-03-15 20:16:38 +01:00
|
|
|
DPRINTF(Predecoder, "Found SIB byte %#x.\n", nextByte);
|
|
|
|
consumeByte();
|
2007-07-22 04:23:03 +02:00
|
|
|
if(emi.modRM.mod == 0 && emi.sib.base == 5)
|
|
|
|
displacementSize = 4;
|
2007-03-15 20:16:38 +01:00
|
|
|
if(displacementSize) {
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = DisplacementState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else if(immediateSize) {
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = ImmediateState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else {
|
|
|
|
emiIsReady = true;
|
2007-05-31 15:50:35 +02:00
|
|
|
nextState = ResetState;
|
2007-03-15 20:16:38 +01:00
|
|
|
}
|
|
|
|
return nextState;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Gather up the displacement, or at least as much of it
|
|
|
|
//as we can get.
|
|
|
|
Predecoder::State Predecoder::doDisplacementState()
|
|
|
|
{
|
|
|
|
State nextState = ErrorState;
|
|
|
|
|
|
|
|
getImmediate(displacementCollected,
|
|
|
|
emi.displacement,
|
|
|
|
displacementSize);
|
|
|
|
|
|
|
|
DPRINTF(Predecoder, "Collecting %d byte displacement, got %d bytes.\n",
|
|
|
|
displacementSize, displacementCollected);
|
|
|
|
|
|
|
|
if(displacementSize == displacementCollected) {
|
|
|
|
//Sign extend the displacement
|
|
|
|
switch(displacementSize)
|
|
|
|
{
|
|
|
|
case 1:
|
|
|
|
emi.displacement = sext<8>(emi.displacement);
|
|
|
|
break;
|
|
|
|
case 2:
|
|
|
|
emi.displacement = sext<16>(emi.displacement);
|
|
|
|
break;
|
|
|
|
case 4:
|
|
|
|
emi.displacement = sext<32>(emi.displacement);
|
|
|
|
break;
|
|
|
|
default:
|
|
|
|
panic("Undefined displacement size!\n");
|
|
|
|
}
|
|
|
|
DPRINTF(Predecoder, "Collected displacement %#x.\n",
|
|
|
|
emi.displacement);
|
|
|
|
if(immediateSize) {
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = ImmediateState;
|
2007-03-15 20:16:38 +01:00
|
|
|
} else {
|
|
|
|
emiIsReady = true;
|
2007-05-31 15:50:35 +02:00
|
|
|
nextState = ResetState;
|
2007-03-15 20:16:38 +01:00
|
|
|
}
|
|
|
|
}
|
|
|
|
else
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = DisplacementState;
|
2007-03-15 20:16:38 +01:00
|
|
|
return nextState;
|
|
|
|
}
|
|
|
|
|
|
|
|
//Gather up the immediate, or at least as much of it
|
|
|
|
//as we can get
|
|
|
|
Predecoder::State Predecoder::doImmediateState()
|
|
|
|
{
|
|
|
|
State nextState = ErrorState;
|
|
|
|
|
|
|
|
getImmediate(immediateCollected,
|
|
|
|
emi.immediate,
|
|
|
|
immediateSize);
|
|
|
|
|
|
|
|
DPRINTF(Predecoder, "Collecting %d byte immediate, got %d bytes.\n",
|
|
|
|
immediateSize, immediateCollected);
|
|
|
|
|
|
|
|
if(immediateSize == immediateCollected)
|
|
|
|
{
|
2007-04-06 17:19:23 +02:00
|
|
|
//XXX Warning! The following is an observed pattern and might
|
|
|
|
//not always be true!
|
|
|
|
|
|
|
|
//Instructions which use 64 bit operands but 32 bit immediates
|
|
|
|
//need to have the immediate sign extended to 64 bits.
|
|
|
|
//Instructions which use true 64 bit immediates won't be
|
|
|
|
//affected, and instructions that use true 32 bit immediates
|
|
|
|
//won't notice.
|
2007-06-14 22:52:24 +02:00
|
|
|
switch(immediateSize)
|
|
|
|
{
|
|
|
|
case 4:
|
2007-04-06 17:19:23 +02:00
|
|
|
emi.immediate = sext<32>(emi.immediate);
|
2007-06-14 22:52:24 +02:00
|
|
|
break;
|
|
|
|
case 1:
|
|
|
|
emi.immediate = sext<8>(emi.immediate);
|
|
|
|
}
|
|
|
|
|
2007-03-15 20:16:38 +01:00
|
|
|
DPRINTF(Predecoder, "Collected immediate %#x.\n",
|
|
|
|
emi.immediate);
|
|
|
|
emiIsReady = true;
|
2007-05-31 15:50:35 +02:00
|
|
|
nextState = ResetState;
|
2007-03-15 20:16:38 +01:00
|
|
|
}
|
|
|
|
else
|
2007-03-21 20:19:53 +01:00
|
|
|
nextState = ImmediateState;
|
2007-03-15 20:16:38 +01:00
|
|
|
return nextState;
|
|
|
|
}
|
|
|
|
}
|