[ARM] MVE integer min and max
[llvm-complete.git] / lib / Target / Hexagon / RDFCopy.h
blob1450ab8848492b4a856ceedaee51840b690f5f3c
1 //===- RDFCopy.h ------------------------------------------------*- C++ -*-===//
2 //
3 // Part of the LLVM Project, under the Apache License v2.0 with LLVM Exceptions.
4 // See https://llvm.org/LICENSE.txt for license information.
5 // SPDX-License-Identifier: Apache-2.0 WITH LLVM-exception
6 //
7 //===----------------------------------------------------------------------===//
9 #ifndef LLVM_LIB_TARGET_HEXAGON_RDFCOPY_H
10 #define LLVM_LIB_TARGET_HEXAGON_RDFCOPY_H
12 #include "RDFGraph.h"
13 #include "RDFLiveness.h"
14 #include "RDFRegisters.h"
15 #include "llvm/CodeGen/MachineFunction.h"
16 #include <map>
17 #include <vector>
19 namespace llvm {
21 class MachineBasicBlock;
22 class MachineDominatorTree;
23 class MachineInstr;
25 namespace rdf {
27 struct CopyPropagation {
28 CopyPropagation(DataFlowGraph &dfg) : MDT(dfg.getDT()), DFG(dfg),
29 L(dfg.getMF().getRegInfo(), dfg) {}
31 virtual ~CopyPropagation() = default;
33 bool run();
34 void trace(bool On) { Trace = On; }
35 bool trace() const { return Trace; }
36 DataFlowGraph &getDFG() { return DFG; }
38 using EqualityMap = std::map<RegisterRef, RegisterRef>;
40 virtual bool interpretAsCopy(const MachineInstr *MI, EqualityMap &EM);
42 private:
43 const MachineDominatorTree &MDT;
44 DataFlowGraph &DFG;
45 Liveness L;
46 bool Trace = false;
48 // map: statement -> (map: dst reg -> src reg)
49 std::map<NodeId, EqualityMap> CopyMap;
50 std::vector<NodeId> Copies;
52 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
53 bool scanBlock(MachineBasicBlock *B);
54 NodeId getLocalReachingDef(RegisterRef RefRR, NodeAddr<InstrNode*> IA);
57 } // end namespace rdf
59 } // end namespace llvm
61 #endif // LLVM_LIB_TARGET_HEXAGON_RDFCOPY_H