HomeSort by relevance Sort by last modified time
    Searched refs:InstrNode (Results 1 - 10 of 10) sorted by null

  /external/llvm/lib/Target/Hexagon/
RDFDeadCode.cpp 71 void DeadCodeElimination::scanInstr(NodeAddr<InstrNode*> IA,
85 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG);
118 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG))
139 auto IsDead = [this] (NodeAddr<InstrNode*> IA) -> bool {
147 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
157 dbgs() << "Dead instr: " << PrintNode<InstrNode*>(IA, DFG) << "\n";
173 // are included directly, for each InstrNode in Nodes, include the set
189 DINs.push_back(DFG.addr<InstrNode*>(I));
220 for (NodeAddr<InstrNode*> IA : DINs) {
RDFCopy.h 48 void updateMap(NodeAddr<InstrNode*> IA);
RDFDeadCode.h 60 void scanInstr(NodeAddr<InstrNode*> IA, SetQueue<NodeId> &WorkQ);
RDFGraph.h 564 struct InstrNode : public CodeNode {
568 struct PhiNode : public InstrNode {
574 struct StmtNode : public InstrNode {
685 void pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DM);
689 NodeAddr<RefNode*> getNextRelated(NodeAddr<InstrNode*> IA,
691 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
693 NodeAddr<RefNode*> getNextImp(NodeAddr<InstrNode*> IA,
695 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
697 NodeAddr<RefNode*> getNextShadow(NodeAddr<InstrNode*> IA,
700 NodeList getRelatedRefs(NodeAddr<InstrNode*> IA
    [all...]
HexagonRDFOpt.cpp 89 bool rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove);
90 void removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum);
175 void HexagonDCE::removeOperand(NodeAddr<InstrNode*> IA, unsigned OpNum) {
201 bool HexagonDCE::rewrite(NodeAddr<InstrNode*> IA, SetVector<NodeId> &Remove) {
RDFCopy.cpp 92 void CopyPropagation::updateMap(NodeAddr<InstrNode*> IA) {
122 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
176 auto SA = DFG.addr<InstrNode*>(C);
203 NodeAddr<InstrNode*> IA = UA.Addr->getOwner(DFG);
RDFLiveness.cpp 137 auto Block = [this] (NodeAddr<InstrNode*> IA) -> MachineBasicBlock* {
149 auto OA = DFG.addr<InstrNode*>(A), OB = DFG.addr<InstrNode*>(B);
202 auto TA = DFG.addr<InstrNode*>(T);
532 for (NodeAddr<InstrNode*> IA : BA.Addr->members(DFG)) {
732 bool Liveness::isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA,
842 NodeAddr<InstrNode*> IA = DA.Addr->getOwner(DFG);
872 NodeAddr<InstrNode*> IA = TA.Addr->getOwner(DFG);
896 NodeAddr<InstrNode*> IA = I;
    [all...]
RDFLiveness.h 99 bool isRestricted(NodeAddr<InstrNode*> IA, NodeAddr<RefNode*> RA,
HexagonOptAddrMode.cpp 88 void updateMap(NodeAddr<InstrNode *> IA);
160 NodeAddr<InstrNode *> IA = UA.Addr->getOwner(*DFG);
204 << Print<NodeAddr<InstrNode *>>(TempIA, *DFG) << "\n";
226 << Print<NodeAddr<InstrNode *>>(TempIA, *DFG) << "\n";
439 DEBUG(dbgs() << "[InstrNode]: " << Print<NodeAddr<InstrNode *>>(UseIA, *DFG)
520 DEBUG(dbgs() << "\t[InstrNode]: " << Print<NodeAddr<InstrNode *>>(IA, *DFG)
575 void HexagonOptAddrMode::updateMap(NodeAddr<InstrNode *> IA) {
602 for (NodeAddr<InstrNode *> IA : BA.Addr->members(*DFG))
    [all...]
RDFGraph.cpp 219 const Print<NodeAddr<InstrNode*>> &P) {
264 OS << PrintNode<InstrNode*>(I, P.G) << '\n';
503 NodeAddr<NodeBase*> InstrNode::getOwner(const DataFlowGraph &G) {
870 NodeAddr<UseNode*> DataFlowGraph::newUse(NodeAddr<InstrNode*> Owner,
886 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner,
893 NodeAddr<DefNode*> DataFlowGraph::newDef(NodeAddr<InstrNode*> Owner,
1005 void DataFlowGraph::pushDefs(NodeAddr<InstrNode*> IA, DefStackMap &DefM) {
1055 NodeList DataFlowGraph::getRelatedRefs(NodeAddr<InstrNode*> IA,
    [all...]

Completed in 71 milliseconds