Home
last modified time | relevance | path

Searched refs:StmtNode (Results 1 – 11 of 11) sorted by relevance

/external/llvm/lib/Target/Hexagon/
DHexagonOptAddrMode.cpp83 bool canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, MachineInstr *MI,
85 void getAllRealUses(NodeAddr<StmtNode *> SN, NodeList &UNodeList);
86 bool allValidCandidates(NodeAddr<StmtNode *> SA, NodeList &UNodeList);
139 bool HexagonOptAddrMode::canRemoveAddasl(NodeAddr<StmtNode *> AddAslSN, in canRemoveAddasl()
165 MachineInstr *UseMI = NodeAddr<StmtNode *>(IA).Addr->getCode(); in canRemoveAddasl()
190 bool HexagonOptAddrMode::allValidCandidates(NodeAddr<StmtNode *> SA, in allValidCandidates()
202 NodeAddr<StmtNode *> TempIA = DA.Addr->getOwner(*DFG); in allValidCandidates()
213 void HexagonOptAddrMode::getAllRealUses(NodeAddr<StmtNode *> SA, in getAllRealUses()
224 NodeAddr<StmtNode *> TempIA = UA.Addr->getOwner(*DFG); in getAllRealUses()
263 NodeAddr<StmtNode *> SN = UN.Addr->getOwner(*DFG); in analyzeUses()
[all …]
DRDFCopy.cpp77 void CopyPropagation::recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM) { in recordCopy()
124 NodeAddr<StmtNode*> SA = IA; in scanBlock()
149 dbgs() << "Instr: " << *DFG.addr<StmtNode*>(I).Addr->getCode(); in run()
214 << *NodeAddr<StmtNode*>(IA).Addr->getCode(); in run()
DHexagonRDFOpt.cpp149 NodeAddr<StmtNode*> SA = TA; in run()
165 auto SA = DFG.addr<StmtNode*>(N); in run()
176 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in removeOperand()
205 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in rewrite()
DRDFDeadCode.cpp75 if (!isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode())) in scanInstr()
152 if (isLiveInstr(NodeAddr<StmtNode*>(IA).Addr->getCode())) in collect()
226 MachineInstr *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in erase()
DRDFCopy.h47 void recordCopy(NodeAddr<StmtNode*> SA, EqualityMap &EM);
DRDFGraph.h574 struct StmtNode : public InstrNode { struct
753 NodeAddr<StmtNode*> newStmt(NodeAddr<BlockNode*> Owner,
776 void linkStmtRefs(DefStackMap &DefM, NodeAddr<StmtNode*> SA);
DRDFGraph.cpp210 const Print<NodeAddr<StmtNode*>> &P) { in operator <<()
225 OS << PrintNode<StmtNode*>(P.Obj, P.G); in operator <<()
907 NodeAddr<StmtNode*> DataFlowGraph::newStmt(NodeAddr<BlockNode*> Owner, in newStmt()
909 NodeAddr<StmtNode*> SA = newNode(NodeAttrs::Code | NodeAttrs::Stmt); in newStmt()
1035 auto *MI = NodeAddr<StmtNode*>(IA).Addr->getCode(); in pushDefs()
1537 void DataFlowGraph::linkStmtRefs(DefStackMap &DefM, NodeAddr<StmtNode*> SA) { in linkStmtRefs()
DRDFLiveness.cpp139 return NodeAddr<StmtNode*>(IA).Addr->getCode()->getParent(); in getAllReachingDefs()
159 auto CA = NodeAddr<StmtNode*>(OA).Addr->getCode(); in getAllReachingDefs()
160 auto CB = NodeAddr<StmtNode*>(OB).Addr->getCode(); in getAllReachingDefs()
/external/clang/lib/ASTMatchers/
DASTMatchFinder.cpp146 bool TraverseStmt(Stmt *StmtNode) { in TraverseStmt() argument
148 const Stmt *StmtToTraverse = StmtNode; in TraverseStmt()
151 const Expr *ExprNode = dyn_cast_or_null<Expr>(StmtNode); in TraverseStmt()
222 bool baseTraverse(const Stmt &StmtNode) { in baseTraverse() argument
223 return VisitorBase::TraverseStmt(const_cast<Stmt*>(&StmtNode)); in baseTraverse()
369 bool TraverseStmt(Stmt *StmtNode);
823 bool MatchASTVisitor::TraverseStmt(Stmt *StmtNode) { in TraverseStmt() argument
824 if (!StmtNode) { in TraverseStmt()
827 match(*StmtNode); in TraverseStmt()
828 return RecursiveASTVisitor<MatchASTVisitor>::TraverseStmt(StmtNode); in TraverseStmt()
/external/clang/lib/Analysis/
DConsumed.cpp75 if (const Stmt *StmtNode = Block->getTerminator()) { in getLastStmtLoc() local
76 return StmtNode->getLocStart(); in getLastStmtLoc()
517 PropagationInfo getInfo(const Expr *StmtNode) const { in getInfo()
518 ConstInfoEntry Entry = findInfo(StmtNode); in getInfo()
/external/clang/lib/AST/
DASTContext.cpp9012 bool TraverseStmt(Stmt *StmtNode) { in TraverseStmt() argument
9013 return TraverseNode(StmtNode, StmtNode, in TraverseStmt()
9014 [&] { return VisitorBase::TraverseStmt(StmtNode); }, in TraverseStmt()