diff options
author | Craig Topper <craig.topper@intel.com> | 2018-07-01 05:47:49 +0000 |
---|---|---|
committer | Craig Topper <craig.topper@intel.com> | 2018-07-01 05:47:49 +0000 |
commit | 4e78213ae4bc4e40e2bd4d4b60e7df8734fa2cc7 (patch) | |
tree | 65ca269b729439d4d476a3534c73c635ae312b4d /llvm/lib/Target/X86/X86InstrFoldTables.h | |
parent | 84199deb173515aac7feaee2b036c8f80925d756 (diff) | |
download | bcm5719-llvm-4e78213ae4bc4e40e2bd4d4b60e7df8734fa2cc7.tar.gz bcm5719-llvm-4e78213ae4bc4e40e2bd4d4b60e7df8734fa2cc7.zip |
[X86] Move the memory unfolding table creation into its own class and make it a ManagedStatic.
Also move the static folding tables, their search functions and the new class into new cpp/h files.
The unfolding table is effectively static data. It's just a different ordering and a subset of the static folding tables.
By putting it in a separate ManagedStatic we ensure we only have one copy instead of one per X86InstrInfo object. This way also makes it only get initialized when really needed.
llvm-svn: 336056
Diffstat (limited to 'llvm/lib/Target/X86/X86InstrFoldTables.h')
-rw-r--r-- | llvm/lib/Target/X86/X86InstrFoldTables.h | 85 |
1 files changed, 85 insertions, 0 deletions
diff --git a/llvm/lib/Target/X86/X86InstrFoldTables.h b/llvm/lib/Target/X86/X86InstrFoldTables.h new file mode 100644 index 00000000000..90016baead9 --- /dev/null +++ b/llvm/lib/Target/X86/X86InstrFoldTables.h @@ -0,0 +1,85 @@ +//===-- X86InstrFoldTables.h - X86 Instruction Folding Tables ---*- C++ -*-===// +// +// The LLVM Compiler Infrastructure +// +// This file is distributed under the University of Illinois Open Source +// License. See LICENSE.TXT for details. +// +//===----------------------------------------------------------------------===// +// +// This file contains the interface to query the X86 memory folding tables. +// +//===----------------------------------------------------------------------===// + +#ifndef LLVM_LIB_TARGET_X86_X86INSTRFOLDTABLES_H +#define LLVM_LIB_TARGET_X86_X86INSTRFOLDTABLES_H + +#include "llvm/Support/DataTypes.h" + +namespace llvm { + +enum { + // Select which memory operand is being unfolded. + // (stored in bits 0 - 3) + TB_INDEX_0 = 0, + TB_INDEX_1 = 1, + TB_INDEX_2 = 2, + TB_INDEX_3 = 3, + TB_INDEX_4 = 4, + TB_INDEX_MASK = 0xf, + + // Do not insert the reverse map (MemOp -> RegOp) into the table. + // This may be needed because there is a many -> one mapping. + TB_NO_REVERSE = 1 << 4, + + // Do not insert the forward map (RegOp -> MemOp) into the table. + // This is needed for Native Client, which prohibits branch + // instructions from using a memory operand. + TB_NO_FORWARD = 1 << 5, + + TB_FOLDED_LOAD = 1 << 6, + TB_FOLDED_STORE = 1 << 7, + + // Minimum alignment required for load/store. + // Used for RegOp->MemOp conversion. + // (stored in bits 8 - 15) + TB_ALIGN_SHIFT = 8, + TB_ALIGN_NONE = 0 << TB_ALIGN_SHIFT, + TB_ALIGN_16 = 16 << TB_ALIGN_SHIFT, + TB_ALIGN_32 = 32 << TB_ALIGN_SHIFT, + TB_ALIGN_64 = 64 << TB_ALIGN_SHIFT, + TB_ALIGN_MASK = 0xff << TB_ALIGN_SHIFT +}; + +// This struct is used for both the folding and unfold tables. They KeyOp +// is used to determine the sorting order. +struct X86MemoryFoldTableEntry { + uint16_t KeyOp; + uint16_t DstOp; + uint16_t Flags; + + bool operator<(const X86MemoryFoldTableEntry &RHS) const { + return KeyOp < RHS.KeyOp; + } + bool operator==(const X86MemoryFoldTableEntry &RHS) const { + return KeyOp == RHS.KeyOp; + } + friend bool operator<(const X86MemoryFoldTableEntry &TE, unsigned Opcode) { + return TE.KeyOp < Opcode; + } +}; + +// Look up the memory folding table entry for folding a load and a store into +// operand 0. +const X86MemoryFoldTableEntry *lookupTwoAddrFoldTable(unsigned RegOp); + +// Look up the memory folding table entry for folding a load or store with +// operand OpNum. +const X86MemoryFoldTableEntry *lookupFoldTable(unsigned RegOp, unsigned OpNum); + +// Look up the memory unfolding table entry for this instruction. +const X86MemoryFoldTableEntry *lookupUnfoldTable(unsigned MemOp); + +} // namespace llvm + +#endif |