//===----- HexagonShuffler.h - Instruction bundle shuffling ---------------===// // // The LLVM Compiler Infrastructure // // This file is distributed under the University of Illinois Open Source // License. See LICENSE.TXT for details. // //===----------------------------------------------------------------------===// // // This implements the shuffling of insns inside a bundle according to the // packet formation rules of the Hexagon ISA. // //===----------------------------------------------------------------------===// #ifndef HEXAGONSHUFFLER_H #define HEXAGONSHUFFLER_H #include "Hexagon.h" #include "MCTargetDesc/HexagonMCInstrInfo.h" #include "llvm/ADT/SmallVector.h" #include "llvm/MC/MCInstrInfo.h" using namespace llvm; namespace llvm { // Insn resources. class HexagonResource { // Mask of the slots or units that may execute the insn and // the weight or priority that the insn requires to be assigned a slot. unsigned Slots, Weight; public: HexagonResource(unsigned s) { setUnits(s); }; void setUnits(unsigned s) { Slots = s & ~(~0U << HEXAGON_PACKET_SIZE); }; unsigned setWeight(unsigned s); unsigned getUnits() const { return (Slots); }; unsigned getWeight() const { return (Weight); }; // Check if the resources are in ascending slot order. static bool lessUnits(const HexagonResource &A, const HexagonResource &B) { return (countPopulation(A.getUnits()) < countPopulation(B.getUnits())); }; // Check if the resources are in ascending weight order. static bool lessWeight(const HexagonResource &A, const HexagonResource &B) { return (A.getWeight() < B.getWeight()); }; }; // Handle to an insn used by the shuffling algorithm. class HexagonInstr { friend class HexagonShuffler; MCInst const *ID; MCInst const *Extender; HexagonResource Core; bool SoloException; public: HexagonInstr(MCInst const *id, MCInst const *Extender, unsigned s, bool x = false) : ID(id), Extender(Extender), Core(s), SoloException(x){}; MCInst const *getDesc() const { return (ID); }; MCInst const *getExtender() const { return Extender; } unsigned isSoloException() const { return (SoloException); }; // Check if the handles are in ascending order for shuffling purposes. bool operator<(const HexagonInstr &B) const { return (HexagonResource::lessWeight(B.Core, Core)); }; // Check if the handles are in ascending order by core slots. static bool lessCore(const HexagonInstr &A, const HexagonInstr &B) { return (HexagonResource::lessUnits(A.Core, B.Core)); }; }; // Bundle shuffler. class HexagonShuffler { typedef SmallVector HexagonPacket; // Insn handles in a bundle. HexagonPacket Packet; // Shuffling error code. unsigned Error; protected: int64_t BundleFlags; MCInstrInfo const &MCII; MCSubtargetInfo const &STI; public: typedef HexagonPacket::iterator iterator; enum { SHUFFLE_SUCCESS = 0, ///< Successful operation. SHUFFLE_ERROR_INVALID, ///< Invalid bundle. SHUFFLE_ERROR_STORES, ///< No free slots for store insns. SHUFFLE_ERROR_LOADS, ///< No free slots for load insns. SHUFFLE_ERROR_BRANCHES, ///< No free slots for branch insns. SHUFFLE_ERROR_NOSLOTS, ///< No free slots for other insns. SHUFFLE_ERROR_SLOTS, ///< Over-subscribed slots. SHUFFLE_ERROR_UNKNOWN ///< Unknown error. }; explicit HexagonShuffler(MCInstrInfo const &MCII, MCSubtargetInfo const &STI); // Reset to initial state. void reset(); // Check if the bundle may be validly shuffled. bool check(); // Reorder the insn handles in the bundle. bool shuffle(); unsigned size() const { return (Packet.size()); }; iterator begin() { return (Packet.begin()); }; iterator end() { return (Packet.end()); }; // Add insn handle to the bundle . void append(MCInst const *ID, MCInst const *Extender, unsigned S, bool X = false); // Return the error code for the last check or shuffling of the bundle. void setError(unsigned Err) { Error = Err; }; unsigned getError() const { return (Error); }; }; } #endif // HEXAGONSHUFFLER_H