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

  /external/llvm/lib/Target/Hexagon/
RDFCopy.h 38 DataFlowGraph::DefStackMap DefM;
RDFCopy.cpp 82 auto FS = DefM.find(I.second);
83 if (FS == DefM.end() || FS->second.empty())
109 auto F = DefM.find(R.first);
110 if (F == DefM.end() || F->second.empty())
120 DFG.markBlock(BA.Id, DefM);
131 DFG.pushDefs(IA, DefM);
138 DFG.releaseBlock(BA.Id, DefM);
RDFGraph.cpp 979 // For each stack in the map DefM, push the delimiter for block B on it.
980 void DataFlowGraph::markBlock(NodeId B, DefStackMap &DefM) {
982 for (auto I = DefM.begin(), E = DefM.end(); I != E; ++I)
986 // Remove all definitions coming from block B from each stack in DefM.
987 void DataFlowGraph::releaseBlock(NodeId B, DefStackMap &DefM) {
991 for (auto I = DefM.begin(), E = DefM.end(); I != E; ++I)
995 for (auto I = DefM.begin(), E = DefM.end(), NextI = I; I != E; I = NextI)
    [all...]
HexagonOptAddrMode.cpp 72 DataFlowGraph::DefStackMap DefM;
590 auto F = DefM.find(R.first);
591 if (F == DefM.end() || F->second.empty())
600 DFG->markBlock(BA.Id, DefM);
604 DFG->pushDefs(IA, DefM);
611 DFG->releaseBlock(BA.Id, DefM);
RDFGraph.h 686 void markBlock(NodeId B, DefStackMap &DefM);
687 void releaseBlock(NodeId B, DefStackMap &DefM);
776 void linkStmtRefs(DefStackMap &DefM, NodeAddr<StmtNode*> SA);
777 void linkBlockRefs(DefStackMap &DefM, NodeAddr<BlockNode*> BA);

Completed in 89 milliseconds