2014-02-12 09:19:30 +00:00
|
|
|
// Copyright 2013 the V8 project authors. All rights reserved.
|
2014-04-29 06:42:26 +00:00
|
|
|
// Use of this source code is governed by a BSD-style license that can be
|
|
|
|
// found in the LICENSE file.
|
2014-02-12 09:19:30 +00:00
|
|
|
|
2014-03-21 09:28:26 +00:00
|
|
|
#ifndef V8_ARM64_DECODER_ARM64_H_
|
|
|
|
#define V8_ARM64_DECODER_ARM64_H_
|
2014-02-12 09:19:30 +00:00
|
|
|
|
|
|
|
#include <list>
|
|
|
|
|
2014-06-03 08:12:43 +00:00
|
|
|
#include "src/arm64/instructions-arm64.h"
|
2014-06-20 08:40:11 +00:00
|
|
|
#include "src/globals.h"
|
2014-02-12 09:19:30 +00:00
|
|
|
|
|
|
|
namespace v8 {
|
|
|
|
namespace internal {
|
|
|
|
|
|
|
|
|
|
|
|
// List macro containing all visitors needed by the decoder class.
|
|
|
|
|
|
|
|
#define VISITOR_LIST(V) \
|
|
|
|
V(PCRelAddressing) \
|
|
|
|
V(AddSubImmediate) \
|
|
|
|
V(LogicalImmediate) \
|
|
|
|
V(MoveWideImmediate) \
|
|
|
|
V(Bitfield) \
|
|
|
|
V(Extract) \
|
|
|
|
V(UnconditionalBranch) \
|
|
|
|
V(UnconditionalBranchToRegister) \
|
|
|
|
V(CompareBranch) \
|
|
|
|
V(TestBranch) \
|
|
|
|
V(ConditionalBranch) \
|
|
|
|
V(System) \
|
|
|
|
V(Exception) \
|
|
|
|
V(LoadStorePairPostIndex) \
|
|
|
|
V(LoadStorePairOffset) \
|
|
|
|
V(LoadStorePairPreIndex) \
|
|
|
|
V(LoadLiteral) \
|
|
|
|
V(LoadStoreUnscaledOffset) \
|
|
|
|
V(LoadStorePostIndex) \
|
|
|
|
V(LoadStorePreIndex) \
|
|
|
|
V(LoadStoreRegisterOffset) \
|
|
|
|
V(LoadStoreUnsignedOffset) \
|
|
|
|
V(LogicalShifted) \
|
|
|
|
V(AddSubShifted) \
|
|
|
|
V(AddSubExtended) \
|
|
|
|
V(AddSubWithCarry) \
|
|
|
|
V(ConditionalCompareRegister) \
|
|
|
|
V(ConditionalCompareImmediate) \
|
|
|
|
V(ConditionalSelect) \
|
|
|
|
V(DataProcessing1Source) \
|
|
|
|
V(DataProcessing2Source) \
|
|
|
|
V(DataProcessing3Source) \
|
|
|
|
V(FPCompare) \
|
|
|
|
V(FPConditionalCompare) \
|
|
|
|
V(FPConditionalSelect) \
|
|
|
|
V(FPImmediate) \
|
|
|
|
V(FPDataProcessing1Source) \
|
|
|
|
V(FPDataProcessing2Source) \
|
|
|
|
V(FPDataProcessing3Source) \
|
|
|
|
V(FPIntegerConvert) \
|
|
|
|
V(FPFixedPointConvert) \
|
|
|
|
V(Unallocated) \
|
|
|
|
V(Unimplemented)
|
|
|
|
|
|
|
|
// The Visitor interface. Disassembler and simulator (and other tools)
|
|
|
|
// must provide implementations for all of these functions.
|
|
|
|
class DecoderVisitor {
|
|
|
|
public:
|
2014-02-26 11:54:55 +00:00
|
|
|
virtual ~DecoderVisitor() {}
|
|
|
|
|
2014-02-12 09:19:30 +00:00
|
|
|
#define DECLARE(A) virtual void Visit##A(Instruction* instr) = 0;
|
|
|
|
VISITOR_LIST(DECLARE)
|
|
|
|
#undef DECLARE
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2014-02-26 11:59:17 +00:00
|
|
|
// A visitor that dispatches to a list of visitors.
|
|
|
|
class DispatchingDecoderVisitor : public DecoderVisitor {
|
2014-02-12 09:19:30 +00:00
|
|
|
public:
|
2014-02-26 11:59:17 +00:00
|
|
|
DispatchingDecoderVisitor() {}
|
|
|
|
virtual ~DispatchingDecoderVisitor() {}
|
2014-02-12 09:19:30 +00:00
|
|
|
|
|
|
|
// Register a new visitor class with the decoder.
|
|
|
|
// Decode() will call the corresponding visitor method from all registered
|
|
|
|
// visitor classes when decoding reaches the leaf node of the instruction
|
|
|
|
// decode tree.
|
|
|
|
// Visitors are called in the order.
|
|
|
|
// A visitor can only be registered once.
|
|
|
|
// Registering an already registered visitor will update its position.
|
|
|
|
//
|
|
|
|
// d.AppendVisitor(V1);
|
|
|
|
// d.AppendVisitor(V2);
|
|
|
|
// d.PrependVisitor(V2); // Move V2 at the start of the list.
|
|
|
|
// d.InsertVisitorBefore(V3, V2);
|
|
|
|
// d.AppendVisitor(V4);
|
|
|
|
// d.AppendVisitor(V4); // No effect.
|
|
|
|
//
|
|
|
|
// d.Decode(i);
|
|
|
|
//
|
|
|
|
// will call in order visitor methods in V3, V2, V1, V4.
|
|
|
|
void AppendVisitor(DecoderVisitor* visitor);
|
|
|
|
void PrependVisitor(DecoderVisitor* visitor);
|
|
|
|
void InsertVisitorBefore(DecoderVisitor* new_visitor,
|
|
|
|
DecoderVisitor* registered_visitor);
|
|
|
|
void InsertVisitorAfter(DecoderVisitor* new_visitor,
|
|
|
|
DecoderVisitor* registered_visitor);
|
|
|
|
|
|
|
|
// Remove a previously registered visitor class from the list of visitors
|
|
|
|
// stored by the decoder.
|
|
|
|
void RemoveVisitor(DecoderVisitor* visitor);
|
|
|
|
|
|
|
|
#define DECLARE(A) void Visit##A(Instruction* instr);
|
|
|
|
VISITOR_LIST(DECLARE)
|
|
|
|
#undef DECLARE
|
|
|
|
|
2014-02-26 11:59:17 +00:00
|
|
|
private:
|
|
|
|
// Visitors are registered in a list.
|
|
|
|
std::list<DecoderVisitor*> visitors_;
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2014-02-26 12:01:05 +00:00
|
|
|
template<typename V>
|
|
|
|
class Decoder : public V {
|
2014-02-26 11:59:17 +00:00
|
|
|
public:
|
|
|
|
Decoder() {}
|
2014-02-26 14:50:58 +00:00
|
|
|
virtual ~Decoder() {}
|
2014-02-26 11:59:17 +00:00
|
|
|
|
|
|
|
// Top-level instruction decoder function. Decodes an instruction and calls
|
|
|
|
// the visitor functions registered with the Decoder class.
|
2014-02-26 14:50:58 +00:00
|
|
|
virtual void Decode(Instruction *instr);
|
2014-02-26 11:59:17 +00:00
|
|
|
|
2014-02-12 09:19:30 +00:00
|
|
|
private:
|
|
|
|
// Decode the PC relative addressing instruction, and call the corresponding
|
|
|
|
// visitors.
|
|
|
|
// On entry, instruction bits 27:24 = 0x0.
|
|
|
|
void DecodePCRelAddressing(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the add/subtract immediate instruction, and call the corresponding
|
|
|
|
// visitors.
|
|
|
|
// On entry, instruction bits 27:24 = 0x1.
|
|
|
|
void DecodeAddSubImmediate(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the branch, system command, and exception generation parts of
|
|
|
|
// the instruction tree, and call the corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:24 = {0x4, 0x5, 0x6, 0x7}.
|
|
|
|
void DecodeBranchSystemException(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the load and store parts of the instruction tree, and call
|
|
|
|
// the corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:24 = {0x8, 0x9, 0xC, 0xD}.
|
|
|
|
void DecodeLoadStore(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the logical immediate and move wide immediate parts of the
|
|
|
|
// instruction tree, and call the corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:24 = 0x2.
|
|
|
|
void DecodeLogical(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the bitfield and extraction parts of the instruction tree,
|
|
|
|
// and call the corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:24 = 0x3.
|
|
|
|
void DecodeBitfieldExtract(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the data processing parts of the instruction tree, and call the
|
|
|
|
// corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:24 = {0x1, 0xA, 0xB}.
|
|
|
|
void DecodeDataProcessing(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the floating point parts of the instruction tree, and call the
|
|
|
|
// corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:24 = {0xE, 0xF}.
|
|
|
|
void DecodeFP(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the Advanced SIMD (NEON) load/store part of the instruction tree,
|
|
|
|
// and call the corresponding visitors.
|
|
|
|
// On entry, instruction bits 29:25 = 0x6.
|
|
|
|
void DecodeAdvSIMDLoadStore(Instruction* instr);
|
|
|
|
|
|
|
|
// Decode the Advanced SIMD (NEON) data processing part of the instruction
|
|
|
|
// tree, and call the corresponding visitors.
|
|
|
|
// On entry, instruction bits 27:25 = 0x7.
|
|
|
|
void DecodeAdvSIMDDataProcessing(Instruction* instr);
|
|
|
|
};
|
|
|
|
|
|
|
|
|
2015-09-30 13:46:56 +00:00
|
|
|
} // namespace internal
|
|
|
|
} // namespace v8
|
2014-02-12 09:19:30 +00:00
|
|
|
|
2014-03-21 09:28:26 +00:00
|
|
|
#endif // V8_ARM64_DECODER_ARM64_H_
|